X = cot ( n = 1 ∑ 1 9 cot − 1 ( 1 + p = 1 ∑ n 2 p ) )
Find X .
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.
So @Niraj Sawant , I sort of cheated.
Well cheated :) Hope I could do this in my exam. Got stuck in this question and ticked option 2 and that way I messed up:(
Did you randomly try k k + 2 or did you know it already?
Not really cheated. Of course not randomly try. It may take almost forever. By observations X 1 = 3 = 1 3 , X 2 = 2 = 2 4 , X 3 = 3 5 , X 4 = 2 3 = 4 6 , ...
Log in to reply
Well nice one :)
Sir, I need your help in a problem I am working on related to this problem
I just need to know a variation for ( 0 , 0 ) , ( 0 , n ) and ( m , 0 ) vertices. Please help:)
cot inv(n^2+n+1) = tan inv(1/(n^2+n+1)) = tan inv(n+1) - tan inv(n) ..can also solves this problem easily
Problem Loading...
Note Loading...
Set Loading...
Let X k = cot ( n = 1 ∑ k cot − 1 ( 1 + p = 1 ∑ n 2 p ) ) = cot ( n = 1 ∑ k cot − 1 ( n 2 + n + 1 ) ) . From the first few k 's, X 1 = 3 = 1 3 , X 2 = 2 = 2 4 , X 3 = 3 5 , X 4 = 2 3 = 4 6 ..., we note that X k = k k + 2 . Let us prove by induction that this claim is true for all k ≥ 1 .
For k = 1 , X 1 = cot ( cot − 1 ( 1 2 + 1 + 1 ) ) = 3 = 1 1 + 2 . Therefore the claim is true for k = 1 .
Assuming the claim is true for k , then
X k + 1 = cot ( n = 1 ∑ k + 1 cot − 1 ( n 2 + n + 1 ) ) = cot ( n = 1 ∑ k cot − 1 ( n 2 + n + 1 ) + cot − 1 ( ( k + 1 ) 2 + ( k + 1 ) + 1 ) ) = cot ( cot − 1 ( k k + 2 ) + cot − 1 ( k 2 + 3 k + 3 ) ) = k k + 2 + k 2 + 3 k + 3 ( k k + 2 ) ( k 2 + 3 k + 3 ) − 1 = k 3 + 3 k 2 + 4 k + 2 k 3 + 5 k 2 + 8 k + 6 = ( k + 1 ) ( k 2 + 2 k + 2 ) ( k + 3 ) ( k 2 + 2 k + 2 ) = k + 1 ( k + 1 ) + 2
Therefore the claim is also true for k + 1 and hence true for all k ≥ 1 . And X = X 1 9 = 1 9 1 9 + 2 = 1 9 2 1 .