A Lucas Sum II

Calculus Level 4

Define the sequence { L n } n = 0 \lbrace L_{n} \rbrace_{n=0}^{\infty} by L 0 = 2 L_{0} = 2 , L 1 = 1 L_{1} = 1 , and L n + 2 = L n + 1 + L n L_{n+2} = L_{n+1}+L_{n} . If

n = 0 L n 2 4 n \sum_{n=0}^{\infty} \frac{L_{n}^{2}}{4^{n}}

can be expressed in the form a b \frac{a}{b} for positive coprime integers a a and b b , find a + b a+b .


The answer is 33.

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.

1 solution

Jake Lai
May 5, 2015

The Binet formula F n = ϕ n ( ϕ ) n 5 F_{n} = \frac{\phi^{n}-(-\phi)^{-n}}{\sqrt{5}} where ϕ = 1 + 5 2 \phi = \frac{1+\sqrt{5}}{2} 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 L_{n} \equiv \phi^{n}+(-\phi)^{-n}

for all n 0 n \geq 0 . So we rewrite the sum as

n = 0 L n 2 4 n = n = 0 ( ϕ n + ( ϕ ) n ) 2 4 n \sum_{n=0}^{\infty} \frac{L_{n}^{2}}{4^{n}} = \sum_{n=0}^{\infty} \frac{(\phi^{n}+(-\phi)^{-n})^{2}}{4^{n}}

= n = 0 ( ϕ 2 4 ) n + 2 ( 1 4 ) n + ( ϕ 2 4 ) n = \sum_{n=0}^{\infty} \left( \frac{\phi^{2}}{4} \right)^{n}+2 \left( -\frac{1}{4} \right)^{n}+\left( \frac{-\phi^{-2}}{4} \right)^{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 1 ϕ 2 / 4 + 2 1 ( 1 / 4 ) + 1 1 ( ϕ 2 / 4 ) = 8 5 5 + 8 5 + 8 5 + 5 \frac{1}{1-\phi^{2}/4}+\frac{2}{1-(-1/4)}+\frac{1}{1-(-\phi^{-2}/4)} = \frac{8}{5-\sqrt{5}}+\frac{8}{5}+\frac{8}{5+\sqrt{5}}

= 8 ( 5 + 5 + 5 5 ) 5 2 5 + 8 5 = 28 5 = \frac{8(5+\sqrt{5}+5-\sqrt{5})}{5^{2}-5}+\frac{8}{5} = \boxed{\frac{28}{5}}

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).

Kartik Sharma - 6 years, 1 month ago

Log in to reply

And yeah is it C.C.(aka C2) in your profile pic?

Kartik Sharma - 6 years, 1 month ago

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!

A Former Brilliant Member - 6 years, 1 month ago

Log in to reply

How naughty!

Jake Lai - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...