If x 2 − 3 x + 1 = 0 , then what is the value of x 5 + x − 5 ?
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.
Nice solution! But it should be x 3 1 in lines 5, 6 and 7
This can be solved using binomial expansions of ( x + x − 1 ) n , but here's an alternative idea.
First note that if x is one root of the given equation, the other is x − 1 . Also, dividing the equation through by x (we can, it's clearly non-zero) and rearranging gives x + x − 1 = 3
Now, let a n = x n + x − n , and note that this is the form of a solution to a recurrence relation; in fact, it's a solution to a n + 2 − 3 a n + 1 + a n = 0
We have a 0 = 1 + 1 = 2 and a 1 = 3 (from above); so we can just use the recurrence to calculate
n | a n |
0 | 2 |
1 | 3 |
2 | 7 |
3 | 1 8 |
4 | 4 7 |
5 | 1 2 3 |
so the answer we need is 1 2 3 .
Bonus fact: that if F n is the n th Fibonacci number (starting with F 0 = F 1 = 1 ), then a n = F 2 n − 2 + F 2 n for n > 0 ; for example, a 5 = 3 4 + 8 9 = F 8 + F 1 0 . Why does this work?
I'm not sure I understand.
Log in to reply
Which part?
Log in to reply
a n = x n + x − n and everything after that.
Log in to reply
@Aditya Mittal – Ah, OK. A recurrence relation is a way of defining a sequence; for example you might be given a 0 = 2 and the relation a n + 1 = 3 a n , and you could work out that the sequence is 2 , 6 , 1 8 , 5 4 , ⋯ . Not only that, but you can see that a general formula for this sequence is a n = 2 ⋅ 3 n .
Another recurrence relation you've probably already seen is the Fibonacci sequence, given by F 1 = F 0 = 1 and F n + 2 = F n + 1 + F n .
With recurrence relations of this type, where the only terms are multiples of terms of the sequence, the solution comes from substituting a n = C t n where C and t are numbers to be found. As an example, let's try a 0 = 0 , a 1 = 1 and a n + 2 = 5 a n + 1 − 6 a n .
The first few terms are 0 , 1 , 5 , 1 9 , 6 5 . Let's try the substitution: C t n + 2 = 5 C t n + 1 + C t n
Now we can divide through by C t n to get t 2 = 5 t + 6
which is just a quadratic with solutions t = 2 and t = 3 . To combine solutions, we just add them up to get a n = C 1 2 n + C 2 3 n
To find the C 1 , C 2 values, use the given terms: a 0 = 0 = C 1 + C 2 and a 1 = 1 = 2 C 1 + 3 C 2
Solving these we get C 1 = − 1 , C 2 = 1 so the solution is a n = 3 n − 2 n (and you can check this works).
If you look up recurrence relations, you'll find loads of examples like this. When you've seen a few, you'll recognise the pattern that shows why they're useful in this problem.
Hope that helps!
Problem Loading...
Note Loading...
Set Loading...
Given that
x 2 − 3 x + 1 x − 3 + x 1 ⟹ x + x 1 ( x + x 1 ) 3 x 3 + 3 x + x 3 + x 3 1 x 3 + 3 ⋅ 3 + x 3 1 ⟹ x 3 + x 3 1 ( x + x 1 ) 5 x 5 + 5 x 3 + 1 0 x + x 1 0 + x 3 5 + x 5 1 ⟹ x 5 + x 5 1 = 0 = 0 = 3 = 3 3 = 2 7 = 2 7 = 1 8 = 3 5 = 2 4 3 = 2 4 3 − 5 ( x 3 + x 3 1 ) − 1 0 ( x + x 1 ) = 2 4 3 − 5 ⋅ 1 8 − 1 0 ⋅ 3 = 1 2 3 Divide both sides by x