A sequence of polynomials is defined recursively by the equations where is any integer greater than or equal to 1. We can represent the real roots of as a finite sequence such that where is the total number of distinct real roots or this polynomial. If enter as your answer. Otherwise, enter
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.
The key to solving this problem is to realize that we can represent the n t h polynomial of the sequence by the formula P n ( x ) = cos ( 2 n arccos x ) , for all x ∈ [ − 1 , 1 ] . This is easy to prove by Mathematical Induction.
We can use the previous representation to find the real roots of P n ( x ) . Indeed, we would need to solve the equation cos ( 2 n arccos x ) = 0 . Then we obtain that 2 n arccos x = 2 π + k π . ( ∗ )
Since 0 ≤ arccos x ≤ π , then in the previous equation k is any integer number satisfying 0 ≤ k ≤ 2 n − 1 . Solving the equation ( ∗ ) for x , we obtain 2 n distinct real solutions given by the formula x k = cos ( 2 n + 1 π + k 2 n π ) where k is any integer number satisfying 0 ≤ k ≤ 2 n − 1 .
It is easy to see that the x k ′ s introduced before are the 2 n distinct real roots of P n . Notice that the degree of P n is 2 n . Besides that, we can also see that x 0 > x 1 > x 2 > . . . > x 2 n − 1 .
Now , assume that n = 1 1 . Then P 1 1 has 2 1 1 distinct real roots given by x k = cos ( 2 1 2 π + k 2 1 1 π ) , where 0 ≤ k ≤ m = 2 1 1 − 1 = 2 0 4 7 . Therefore m ≥ 2 0 2 1 and x 2 0 2 1 = cos ( 2 1 2 π + 2 1 1 2 0 2 1 π ) = − 0 . 9 9 9 1 7 3 . . . . So, the answer for this problem is 9 9 9 1 7 3 .