For each positive integer m we define the function P ( m ) : = k = 1 ∏ ∞ ( 1 − ( 2 k − 1 ) 2 ( 2 m ) 2 ) . If m = 1 ∑ ∞ P ( m ) m 2 − 2 m 3 m 2 + 2 m − 1 = b a π + d c π 2 for some positive integers a , b , c and d such that g cd ( a , b ) = g cd ( c , d ) = 1 , find a + b + c + d .
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.
Well done! If one does not recall the product representation of the cosine function, a way is to define the sequence a n : = k = 1 ∏ n ( 1 − ( 2 k − 1 ) 2 ( 2 m ) 2 ) and deduce that a n = Γ ( 2 1 + n ) 2 ( − 1 ) m Γ ( 2 1 + m + n ) Γ ( 2 1 − m + n ) . Thus, using Stirling approximation it follows that a n → ( − 1 ) m .
Problem Loading...
Note Loading...
Set Loading...
Define the infinite cosine product by : cos ( π x ) = k = 1 ∏ ∞ ( 1 − ( 2 k − 1 ) 2 4 x 2 ) and in that sense, P ( m ) = cos ( π m ) = ( − 1 ) m
Since, m 2 − 2 m 3 m 2 + 2 m − 1 = − m 2 1 − 2 m − 1 1
Our sum S = m ≥ 1 ∑ P ( m ) m 2 − 2 m 3 m 2 + 2 m − 1 = m ≥ 1 ∑ ( − 1 ) m − 1 ( m 2 1 + 2 m − 1 1 )
So, S = m = 1 ∑ ∞ m 2 ( − 1 ) m − 1 + 2 m − 1 ( − 1 ) m − 1 = 1 2 π 2 + 4 π and thus making the answer 1 + 4 + 1 + 1 2 = 1 8