Fibonacci is Golden

Algebra Level 4

lim n k = 1 2 n [ ( 1 ) k F k ϕ k ] \large \lim_{n\to\infty}\sum_{k=1}^{2n} \left [ (-1)^k\frac{F_k}{\phi^k} \right ] Find the limit above, where F k F_k is the k k -th Fibonacci number, ϕ \phi is the Golden Ratio, and n n is a positive integer.

Answers in decimal form are accepted. If you find that the limit fails to exist, enter 0.666 as your answer.

Inspiration .


The answer is -0.276.

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

Abhishek Sinha
May 29, 2015

We have F k = 1 5 ( ϕ k ( 1 ) k ϕ k ) F_k=\frac{1}{\sqrt{5}} \big(\phi^k-\frac{(-1)^k}{\phi^k}\big) Hence the k k th term in the given series simplifies to 1 5 ( ( 1 ) k 1 ϕ 2 k ) \frac{1}{\sqrt{5}} \big((-1)^k-\frac{1}{\phi^{2k}}\big) In the first 2 n 2n partial sum, the sum of ( 1 ) k (-1)^k vanishes. Hence the result follows by the infinite sum of the latter geometric term.

Yes exactly, very nice!

We have the geometric series k = 1 1 ϕ 2 k = 1 ϕ \sum_{k=1}^{\infty}\frac{1}{\phi^{2k}}=\frac{1}{\phi} so the limit is 1 5 ϕ 0.276 -\frac{1}{\sqrt{5}\phi}\approx\boxed{-0.276} It's always good to explore what happens at the radius of convergence.

Greetings from Harvard Square!

Otto Bretscher - 6 years ago

Log in to reply

Here = sup Z \infty = \sup \mathbb{Z} , yes? I think that should probably be specified.

Jake Lai - 6 years ago

Log in to reply

Yes, that's a good point, Jake. When dealing with sequences and series, the meaning of 2 n 2n , 2 n + 1 2n+1 etc. is usually implied (just look at a table of Taylor polynomials!), but one can never be too explicit when posting a problem on Brilliant ;)

Otto Bretscher - 6 years ago

Yes, the geometric series converges as ϕ 2 > 1 \phi^2>1 . Thanks from Kendall Square :)

Abhishek Sinha - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...