Find the value of
n → ∞ lim k = 1 ∑ n − 1 F k 2 k = 1 ∑ n F k 2
where F n are the Fibonacci numbers ( 1 , 1 , 2 , 3 , 5 , 8 , 1 3 , 2 1 , 3 4 , … ).
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.
@Gabriel Chacón , we generally use capital letter F n to denotes Fibonacci numbers. Check out this wiki for Fibonacci sequence in Brilliant.org.
@Chew-Seong Cheong, it is true. Fixed!
Very nice proof by Gabriel. Here is a not really nice approach though (note it is very rough approximation).
We may use the closed form of Fibonacci numbers,
F n = 5 ϕ n − ψ n
while ϕ ≈ 1 . 6 and ψ ≈ − 0 . 6 . The trick is to neglect ψ as n → ∞ , as ∣ ψ ∣ < 1 .
l i m n → ∞ ∑ k = 1 n − 1 F k 2 ∑ k = 1 n F k 2 = 1 + ∑ k = 1 n − 1 F k 2 F n 2
1 + ∑ k = 1 n − 1 F k 2 F n 2 = 1 + 5 1 ∑ k = 1 n − 1 ϕ 2 k 5 ϕ 2 n ≈ ϕ 2 − 1 ϕ 2 n − ϕ 2 1 ϕ 2 n ≈ ϕ 2 − 1
Therefore, the final solution is
1 + ( ϕ 2 − 1 ) = ϕ 2 ≈ 1 . 6 2
Problem Loading...
Note Loading...
Set Loading...
Note that
1 2 + 1 2 1 2 + 1 2 + 2 2 1 2 + 1 2 + 2 2 + 3 2 1 2 + 1 2 + 2 2 + 3 2 + 5 2 ⋮ k = 1 ∑ n F k 2 = 1 ⋅ 2 = 2 ⋅ 3 = 3 ⋅ 5 = 5 ⋅ 8 = ⋮ = F n ⋅ F n + 1
(There is a nice graphical proof of this identity.)
It is commonly known that n → ∞ lim F n F n + 1 = φ , the golden ratio ( φ = 2 1 + 5 ) .
Therefore, n → ∞ lim k = 1 ∑ n − 1 F k 2 k = 1 ∑ n F k 2 = n → ∞ lim F n − 1 ⋅ F n F n ⋅ F n + 1 = φ 2 ≈ 2 . 6 1 8 0 3 3 9 8 8 . . .