Let r 1 , r 2 , r 3 , . . . , r 1 0 0 be the roots of the polynomial
k = 0 ∑ 1 0 0 ( − 1 ) k F k + 1 x 1 0 0 − k = x 1 0 0 − x 9 9 + 2 x 9 8 − . . . + F 1 0 1
Where F n is the n t h number of the Fibonacci sequence.
Find the value of 1 ≤ i ≤ j ≤ 1 0 0 ∑ r i r j .
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.
My gosh I didn't notice the ≤ signs as opposed to the simple < signs. This problem is very nice.
What an overrated problem !
Log in to reply
Agreed! I initially rated it level 4, and then thought it was too high. Then it became level 5...
Log in to reply
literally, that's not more than level 4! btw nyc format.
1 ≤ i ≤ j ≤ 1 0 0 ∑ r i r j = k = 1 ∑ 1 0 0 r k 2 + 1 ≤ i < j ≤ 1 0 0 ∑ r i r j = ( k = 1 ∑ 1 0 0 r k ) 2 − 1 ≤ i < j ≤ 1 0 0 ∑ r i r j
from vieta formula we know the answer is ( − ( − 1 ) ) 2 − 2 = − 1
Problem Loading...
Note Loading...
Set Loading...
First, observe the sum 1 ≤ i ≤ j ≤ 1 0 0 ∑ r i r j has the condition i ≤ j . Thus, we can split it into
1 ≤ i < j ≤ 1 0 0 ∑ r i r j + k = 1 ∑ 1 0 0 r k 2
Let the coefficients be a k = ( − 1 ) k F k + 1 . We deal with the first sum using Vieta's formulas:
1 ≤ i < j ≤ 1 0 0 ∑ r i r j = a 0 a 2 = 2
The second sum we resolve using Newton's identities:
k = 1 ∑ 1 0 0 r k 2 = a 1 ( k = 1 ∑ 1 0 0 r i ) − 2 a 2
= 1 ( 1 ) − 2 ( 2 ) = − 3
Summing the two, we get that
1 ≤ i ≤ j ≤ 1 0 0 ∑ r i r j = 1 ≤ i < j ≤ 1 0 0 ∑ r i r j + k = 1 ∑ 1 0 0 r k 2 = 2 − 3 = − 1