n → ∞ lim k = 1 ∑ 2 n [ ( − 1 ) k ϕ k F k ] Find the limit above, where F k is the k -th Fibonacci number, ϕ is the Golden Ratio, and 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.
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.
Yes exactly, very nice!
We have the geometric series ∑ k = 1 ∞ ϕ 2 k 1 = ϕ 1 so the limit is − 5 ϕ 1 ≈ − 0 . 2 7 6 It's always good to explore what happens at the radius of convergence.
Greetings from Harvard Square!
Log in to reply
Here ∞ = sup Z , yes? I think that should probably be specified.
Log in to reply
Yes, that's a good point, Jake. When dealing with sequences and series, the meaning of 2 n , 2 n + 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 ;)
Yes, the geometric series converges as ϕ 2 > 1 . Thanks from Kendall Square :)
Problem Loading...
Note Loading...
Set Loading...
We have F k = 5 1 ( ϕ k − ϕ k ( − 1 ) k ) Hence the k th term in the given series simplifies to 5 1 ( ( − 1 ) k − ϕ 2 k 1 ) In the first 2 n partial sum, the sum of ( − 1 ) k vanishes. Hence the result follows by the infinite sum of the latter geometric term.