This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let S n = k = 0 ∑ n cot − 1 ( k 2 + k + 1 ) . The first few S n appears to claim that S n = cot − 1 ( n + 1 1 ) . Let us prove by induction that the claim is true for all n ≥ 0 .
Proof: For n = 0 , S 0 = cot − 1 1 = cot − 1 ( 0 + 1 1 ) . The claim is true for n = 0 . Assuming the claim is true for n , then:
S n + 1 = S n + cot − 1 ( ( n + 1 ) 2 + ( n + 1 ) + 1 ) = cot − 1 ( n + 1 1 ) + cot − 1 ( n 2 + 3 n + 3 ) = cot − 1 ( n + 1 1 + n 2 + 3 n + 3 n + 1 n 2 + 3 n + 3 − 1 ) = cot − 1 ( n 3 + 4 n 2 + 6 n + 4 n 2 + 2 n + 2 ) = cot − 1 ( ( n + 2 ) ( n 2 + 2 n + 2 ) n 2 + 2 n + 2 ) = cot − 1 ( n + 2 1 )
Therefore, the claim is true for n + 1 and true for all n ≥ 0 .
Then n → ∞ lim S n = n → ∞ lim cot − 1 ( n + 1 1 ) = cot − 1 ( 0 ) = 2 π ≈ 1 . 5 7 0 8 .