X powers

Algebra Level 2

If x 2 3 x + 1 = 0 x^2-3x+1=0 , then what is the value of x 5 + x 5 x^5+x^{-5} ?

119 119 123 123 125 125 122 122

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.

2 solutions

Given that

x 2 3 x + 1 = 0 Divide both sides by x x 3 + 1 x = 0 x + 1 x = 3 ( x + 1 x ) 3 = 3 3 x 3 + 3 x + 3 x + 1 x 3 = 27 x 3 + 3 3 + 1 x 3 = 27 x 3 + 1 x 3 = 18 ( x + 1 x ) 5 = 3 5 x 5 + 5 x 3 + 10 x + 10 x + 5 x 3 + 1 x 5 = 243 x 5 + 1 x 5 = 243 5 ( x 3 + 1 x 3 ) 10 ( x + 1 x ) = 243 5 18 10 3 = 123 \begin{aligned} x^2 - 3x + 1 & = 0 & \small \blue{\text{Divide both sides by }x} \\ x - 3 + \frac 1x & = 0 \\ \implies x + \frac 1x & = 3 \\ \left(x + \frac 1x \right)^3 & = 3^3 \\ x^3 + \blue{3x + \frac 3x} + \frac 1{x^3} & = 27 \\ x^3 + \blue{3\cdot 3} + \frac 1{x^3} & = 27 \\ \implies x^3 + \frac 1{x^3} & = 18 \\ \left(x + \frac 1x \right)^5 & = 3^5 \\ x^5 + 5x^3 + 10x + \frac {10}x + \frac 5{x^3} + \frac 1{x^5} & = 243 \\ \implies x^5 + \frac 1{x^5} & = 243 - 5 \left(x^3 + \frac 1{x^3} \right) - 10 \left(x + \frac 1x \right) \\ & = 243 - 5 \cdot 18 - 10 \cdot 3 = \boxed {123} \end{aligned}

Nice solution! But it should be 1 x 3 \dfrac{1}{x^3} in lines 5, 6 and 7

Aditya Mittal - 2 months ago

Log in to reply

Thanks. I copied and pasted without checking.

Chew-Seong Cheong - 2 months ago
Chris Lewis
Apr 9, 2021

This can be solved using binomial expansions of ( x + x 1 ) n \left(x+x^{-1}\right)^n , but here's an alternative idea.

First note that if x x is one root of the given equation, the other is x 1 x^{-1} . Also, dividing the equation through by x x (we can, it's clearly non-zero) and rearranging gives x + x 1 = 3 x+x^{-1}=3

Now, let a n = x n + x n 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 a_{n+2}-3a_{n+1}+a_n=0

We have a 0 = 1 + 1 = 2 a_0=1+1=2 and a 1 = 3 a_1=3 (from above); so we can just use the recurrence to calculate

n n a n a_n
0 0 2 2
1 1 3 3
2 2 7 7
3 3 18 18
4 4 47 47
5 5 123 123

so the answer we need is 123 \boxed{123} .

Bonus fact: that if F n F_n is the n th n^\text{th} Fibonacci number (starting with F 0 = F 1 = 1 F_0=F_1=1 ), then a n = F 2 n 2 + F 2 n a_n=F_{2n-2}+F_{2n} for n > 0 n>0 ; for example, a 5 = 34 + 89 = F 8 + F 10 a_5=34+89=F_8+F_{10} . Why does this work?

Chris Lewis - 2 months ago

I'm not sure I understand.

Aditya Mittal - 1 month, 4 weeks ago

Log in to reply

Which part?

Chris Lewis - 1 month, 4 weeks ago

Log in to reply

a n = x n + x n a_n = x^n + x^{-n} and everything after that.

Aditya Mittal - 1 month, 4 weeks ago

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 a_0=2 and the relation a n + 1 = 3 a n a_{n+1}=3a_{n} , and you could work out that the sequence is 2 , 6 , 18 , 54 , 2,6,18,54,\cdots . Not only that, but you can see that a general formula for this sequence is a n = 2 3 n a_n=2\cdot 3^n .

Another recurrence relation you've probably already seen is the Fibonacci sequence, given by F 1 = F 0 = 1 F_1=F_0=1 and F n + 2 = F n + 1 + F n 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 a_n=C t^n where C C and t t are numbers to be found. As an example, let's try a 0 = 0 a_0=0 , a 1 = 1 a_1=1 and a n + 2 = 5 a n + 1 6 a n a_{n+2}=5a_{n+1}-6a_n .

The first few terms are 0 , 1 , 5 , 19 , 65 0,1,5,19,65 . Let's try the substitution: C t n + 2 = 5 C t n + 1 + C t n Ct^{n+2}=5Ct^{n+1}+Ct^n

Now we can divide through by C t n Ct^n to get t 2 = 5 t + 6 t^2=5t+6

which is just a quadratic with solutions t = 2 t=2 and t = 3 t=3 . To combine solutions, we just add them up to get a n = C 1 2 n + C 2 3 n a_n=C_1 2^n + C_2 3^n

To find the C 1 , C 2 C_1,C_2 values, use the given terms: a 0 = 0 = C 1 + C 2 a_0=0=C_1+C_2 and a 1 = 1 = 2 C 1 + 3 C 2 a_1=1=2C_1+3C_2

Solving these we get C 1 = 1 C_1=-1 , C 2 = 1 C_2=1 so the solution is a n = 3 n 2 n 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!

Chris Lewis - 1 month, 4 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...