x = … 1 − 1 1 − 1 1 − 1 1 − 1 1 − 1
Given the above, determine the value of x 1 0 + x 1 0 1 .
Hint and inspiration: Perhaps you call it Newton's sum .
Bonus: Can you generalise the value of x n + x n 1 in terms of Fibonacci numbers?
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.
Since this is a recurrent relation we can rewrite it:
x = x 1 − 1 x − x 1 = − 1
Let's look at a series of even degree binoms:
( x − x 1 ) 2 = x 2 + x 2 1 − 2 = ( − 1 ) 2 = 1 ( x − x 1 ) 4 = x 4 + x 4 1 − 4 x 2 − x 2 4 + 6 = ( − 1 ) 4 = 1 ( x − x 1 ) 6 = x 6 + x 6 1 − 6 x 4 − x 4 6 + 1 5 x 2 + x 2 1 5 − 2 0 = ( − 1 ) 6 = 1 ( x − x 1 ) 8 = x 8 + x 8 1 − 8 x 6 − x 6 8 + 2 8 x 4 + x 4 2 8 − 5 6 x 2 − x 2 5 6 + 7 0 = ( − 1 ) 8 = 1 ( x − x 1 ) 1 0 = x 1 0 + x 1 0 1 − 1 0 x 8 − x 8 1 0 + 4 5 x 6 + x 6 4 5 − 1 2 0 x 4 − x 4 1 2 0 + 2 1 0 x 2 + x 2 2 1 0 − 2 5 2 = ( − 1 ) 1 0 = 1
Now we can derive the sums:
x 2 + x 2 1 = 1 + 2 x 4 + x 4 1 = 1 − 6 + 4 ( x 2 + x 2 1 ) x 6 + x 6 1 = 1 + 2 0 − 1 5 ( x 2 + x 2 1 ) + 6 ( x 4 + x 4 1 ) x 8 + x 8 1 = 1 − 7 0 + 5 6 ( x 2 + x 2 1 ) − 2 8 ( x 4 + x 4 1 ) + 8 ( x 6 + x 6 1 ) x 1 0 + x 1 0 1 = 1 + 2 5 2 − 2 1 0 ( x 2 + x 2 1 ) + 1 2 0 ( x 4 + x 4 1 ) − 4 5 ( x 6 + x 6 1 ) + 1 0 ( x 8 + x 8 1 )
x 2 + x 2 1 = 3 x 4 + x 4 1 = − 5 + 4 ⋅ 3 = 7 x 6 + x 6 1 = 2 1 − 1 5 ⋅ 3 + 6 ⋅ 7 = 1 8 x 8 + x 8 1 = − 6 9 + 5 6 ⋅ 3 − 2 8 ⋅ 7 + 8 ⋅ 1 8 = 4 7 x 1 0 + x 1 0 1 = 2 5 3 − 2 1 0 ⋅ 3 + 1 2 0 ⋅ 7 − 4 5 ⋅ 1 8 + 1 0 ⋅ 4 7 = 1 2 3
im not sure if this is the right way to solve it buut i just wrote 1/x-1=x as x²+x-1=0 and solved it, both roots give the same answer
From the definition of x , we can see that x − x 1 = − 1 , or alternatively x 2 + x − 1 = 0 . We could just solve and calculate here, but this would get messy.
Let a n = x n + ( − x 1 ) n . Note that this has the form of a solution to a recurrence relation - and this is what we'll use.
The quadratic equation for x translates to the following recurrence for a n :
a n + 2 + a n + 1 − a n = 0
We want to find a 1 0 . We started with a 1 = − 1 . Trivially, a 0 = 1 + 1 = 2 . Together with the recurrence, these two values are enough to calculate the remaining a n values we need; a 2 = a 0 − a 1 = 3 , a 3 = a 1 − a 0 = − 4 , etc., up to a 1 0 = 1 2 3 .
Problem Loading...
Note Loading...
Set Loading...
It is given that:
x ⟹ x x − x 1 ( x − x 1 ) 2 x 2 − 2 + x 2 1 x 2 + x 2 1 ( x + x 1 ) 2 = c d o t s 1 − 1 1 − 1 1 − 1 1 − 1 1 − 1 = x 1 − 1 = − 1 = ( − 1 ) 2 = 1 = 1 = 3 = x 2 + 2 + x 2 1 = 5
Let P n = x n + x n 1 ; then P 2 = 3 and P 1 2 = 5 .
Let us prove by induction the claim that P n = x n + x n 1 = ⎩ ⎨ ⎧ F n ( x + x 1 ) F n + 1 + F n − 1 when n is odd when n is even , where F n is the n th Fibonacci number .
When n = 1 , then P 1 = x + x 1 = F 1 ( x + x 1 ) and P 2 = 3 = F 3 + F 1 , therefore the claim is true for n = 1 and n = 2 .
Assuming the claim is true for n and n + 1 , where n is odd. By Newton's sum , we have:
P n + 2 P n + 3 = P 1 P n + 1 − P n = ( F n + 2 + F n ) P 1 − F n P 1 = F n + 2 ( x + x 1 ) = P 1 P n + 2 − P n + 1 = F n + 2 P 1 2 − ( F n + 2 + F n ) = 5 F n + 2 − F n + 2 − F n = F n + 4 − F n + 3 + F n + 3 − F n + 1 + F n + 2 + F n + 1 + F n − F n = F n + 4 + F n + 2
Therefore the claim is also true for n + 2 and n + 3 , hence true for all n ≥ 1 . And P 1 0 = F 1 1 + F 9 = 8 9 + 3 4 = 1 2 3 .