Let α , β be the roots of the equation x 2 − x − 1 = 0 .
Let a 2 n = α 2 n + β 2 n where n ≥ 1 and n is a natural number.
What is the value of a 2 0 + a 2 2 ?
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.
Good eye for spotting Lucas Numbers!
Excellent You have a good knowledge
The equation is x 2 − x − 1 = 0
Since β is a root,
β 2 − β − 1 = 0 .
Multiplying both sides by β 2 n + 2
⇒ β 2 n + 4 − β 2 n + 3 − β 2 n + 2 = 0 ................................. ( i )
and multiplying both sides by β 2 n + 1
⇒ β 2 n + 3 − β 2 n + 2 − β 2 n + 1 = 0 ................................. ( i i )
and multiplying both sides by β 2 n
⇒ β 2 n + 2 − β 2 n + 1 − β 2 n = 0 ................................. ( i i i )
Now ( i ) + ( i i ) − ( i i i ) we get;
β 2 n + 4 − 3 β 2 n + 2 + β 2 n = 0 ............................. ( i v )
Similarly;
α 2 n + 4 − 3 α 2 n + 2 + α 2 n = 0 ......................... ( v )
Now ( i v ) + ( v )
( β 2 n + 4 + α 2 n + 4 ) − 3 ( β 2 n + 2 + α 2 n + 2 ) + ( β 2 n + α 2 n ) = 0 .
⇒ a 2 n + 4 − 3 a 2 n + 2 + a 2 n = 0 .
a 2 = α 2 + β 2 = ( α + β ) 2 − 2 α β = 1 + 2 = 3
a 4 = α 4 + β 4 = ( α 2 + β 2 ) 2 − 2 α 2 β 2 = 9 − 2 = 7 .
Now using the recurrence relation derived we can easily calculate
a 2 0 = 1 5 1 2 7 a 2 2 = 3 9 6 0 3
⇒ a 2 0 + a 2 2 = 5 4 7 3 0
(there is another way of deriving the recurrence relation that is by forming a quadratic equation with roots as α 2 , β 2 ) .
to find the equation with α 2 , β 2 as roots put x in place of x
The equation becomes
x − x − 1 = 0
x − 1 = x
Squaring
x 2 − 3 x + 1 = 0
now α 2 satisfies this equation
⇒ α 4 − 3 α 2 + 1 = 0
Multiplying by α 2 n
α 2 n + 4 − 3 α 2 n + 2 + α 2 n = 0
Now similar as above)
Can you show the other method too @shubham garg ? ? ? ?
Log in to reply
i have edited my solution have a look
good problem!
Just thought I'd point out that Phi - the Golden Ratio - is one of the roots of this formula.
Problem Loading...
Note Loading...
Set Loading...
By Vieta's formulas a 1 = 1 , by Newton's sums a 2 − a 1 − 2 = 0 , i.e. a 2 = 3 .
By Newton's sums : a k = a k − 1 + a k − 2 for k ≥ 3 .
With this recurrence relation find a 2 0 , a 2 2 .
In fact, since a 0 = 2 , we have a k = L k for all k ≥ 0 , where ( L n ) n ≥ 0 is the sequence of Lucas numbers . So you can just see a list of those numbers, e.g. here .
Alternatively (more elementary):
By Vieta's formulas a 1 = 1 , α β = − 1 .
a 2 = a 1 2 − 2 α β = 3 .
a k = a k − 1 a 1 − α β a k − 2 , i.e.
a k = a k − 1 + a k − 2 .
Another way:
a 4 = a 2 2 − 2 α 2 β 2
a 8 = a 4 2 − 2 α 4 β 4
a 1 6 = a 8 2 − 2 α 8 β 8
a 2 0 = a 1 6 a 4 − α 4 β 4 ( a 8 a 4 − α 4 β 4 a 4 )
a 2 2 = a 2 0 a 2 − α 2 β 2 ( a 1 6 a 2 − α 2 β 2 ( a 8 ( a 4 a 2 − α 2 β 2 a 2 ) − α 6 β 6 a 2 ) )
Or a 2 2 = a 1 6 ( a 4 a 2 − α 2 β 2 a 2 ) − α 6 β 6 ( a 8 a 2 − α 2 β 2 ( a 4 a 2 − α 2 β 2 a 2 ) )