Math Question: For each integer n ? 1, define f(n) to be equal to an infinite sum: f(n) = [n/(1^2+1)]+ [2n/(2^2+1) ]+[3n/(3^2+1)]+ [4n/(4^2+1)]+ [5/(5^2+1)]+.... [.] is the greatest integer function Suppose f(t + 1) ? f(t) = 2 for some odd positive integer t. Prove that t is a prime number.