This question is a follow up from Joel's problem regarding something very interesting I found.
For every positive integer n , cos ( n x ) can be written as a polynomial in cos ( x ) with integral coefficients. We would call it P n ( y ) , where y = cos ( x ) . For example, we have P 1 ( y ) = y , P 2 ( y ) = 2 y 2 − 1
Denote s ( n ) to be the sum of values of the coefficients of P n ( y ) . For example, s ( 1 ) = 1 , s ( 2 ) = 1
Find the smallest positive integer value of A such that for all integers n > 0 , s ( n ) and s ( n + A ) are congruent modulo 1 2 3 4 . Input A × 3 as your answer.
To avoid ambiguity, assume k > 0 if k is a positive integer.
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.
Pardon me, but the only plausible way I found was pattern recognition using a few identities I had committed to memory. I'm still looking for a reason as to why this happens.
cos ( x ) = cos ( x ) ⇒ s ( 1 ) = 1 .
cos ( 2 x ) = 2 cos 2 x − 1 ⇒ s ( 2 ) = 1 .
cos ( 3 x ) = 4 cos 3 x − 3 cos ( x ) ⇒ s ( 3 ) = 1 .
cos ( 4 x ) = 8 cos 4 x − 8 cos 4 x + 1 ⇒ s ( 4 ) = 1 .
I jumped to the conclusion that s ( n ) = 1 for all integral values of n . So we can simply say that A can take any integral value, but since we restrict it to positive integers, A m i n = 1 ⇒ 3 A = 3 .
Update: This document also confirms my suspicion.
Problem Loading...
Note Loading...
Set Loading...
Essentially this just boils down to stating cos ( n x ) in terms of a polynomial of cos ( x )
Let x = 0 , 1 = cos ( 0 ) = Sum of coefficients ⇒ A = 1