Define the sequence { L n } n = 0 ∞ by L 0 = 2 , L 1 = 1 , and L n + 2 = L n + 1 + L n . If
n = 0 ∑ ∞ 4 n L n 2
can be expressed in the form b a for positive coprime integers a and b , find a + b .
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.
Yep! Exactly the same! But you should give a recurrence-type of proof of what Lucas numbers 'turns out to be'(Though it is just a simple result out of generating functions).
Log in to reply
And yeah is it C.C.(aka C2) in your profile pic?
Beautiful solution Jake ! Never thought you'd have to use Binet's formula .
(Btw I had used Java :P)
I had forgot to upvote your solution earlier . lol!
Problem Loading...
Note Loading...
Set Loading...
The Binet formula F n = 5 ϕ n − ( − ϕ ) − n where ϕ = 2 1 + 5 is well-known, but not so much the analogous formula for the Lucas numbers, which is key to this problem. It turns out that
L n ≡ ϕ n + ( − ϕ ) − n
for all n ≥ 0 . So we rewrite the sum as
n = 0 ∑ ∞ 4 n L n 2 = n = 0 ∑ ∞ 4 n ( ϕ n + ( − ϕ ) − n ) 2
= n = 0 ∑ ∞ ( 4 ϕ 2 ) n + 2 ( − 4 1 ) n + ( 4 − ϕ − 2 ) n
We split this up into three sums, each a convergent geometric series. We then get, after a bit of simplification with the help of the difference of two squares,
1 − ϕ 2 / 4 1 + 1 − ( − 1 / 4 ) 2 + 1 − ( − ϕ − 2 / 4 ) 1 = 5 − 5 8 + 5 8 + 5 + 5 8
= 5 2 − 5 8 ( 5 + 5 + 5 − 5 ) + 5 8 = 5 2 8