The Limit of Fibonacci Ratios

The Question

In the algebra chapter, the students of Snore Planet discovered that the coefficients in the expansion of φn\varphi^n are the Fibonacci numbers. They became deeply interested in this sequence.

Teacher, what is the Fibonacci sequence? What exactly is its relation to the golden ratio?

I wrote the Fibonacci sequence on the blackboard:

1,1,2,3,5,8,13,21,34,55,89,…1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, \ldots

Starting from the third term, each term equals the sum of the two terms before it. Compute the ratios of consecutive terms and see what happens.

The students began calculating:

  • 1/1=11/1 = 1
  • 2/1=22/1 = 2
  • 3/2=1.53/2 = 1.5
  • 5/3≈1.6675/3 \approx 1.667
  • 8/5=1.68/5 = 1.6
  • 13/8=1.62513/8 = 1.625
  • 21/13≈1.61521/13 \approx 1.615
  • 34/21≈1.61934/21 \approx 1.619
  • 55/34≈1.617655/34 \approx 1.6176
  • 89/55≈1.618289/55 \approx 1.6182

The students cried out:

The ratios oscillate around 1.618, and they keep getting closer! Isn’t this the golden ratio φ\varphi!

Observation and Conjecture

The Fibonacci sequence is defined by:

F1=1,F2=1,Fn+1=Fn+Fn−1(n≥2)F_1 = 1, \quad F_2 = 1, \quad F_{n+1} = F_n + F_{n-1} \quad (n \geq 2)

Consider the ratio of consecutive terms rn=Fn+1Fnr_n = \frac{F_{n+1}}{F_n}.

Numerically, rnr_n oscillates above and below φ\varphi, and the amplitude of the oscillation keeps shrinking. The students conjectured:

lim⁡n→∞Fn+1Fn=φ=1+52\lim_{n \to \infty} \frac{F_{n+1}}{F_n} = \varphi = \frac{1+\sqrt{5}}{2}

They also noticed the pattern of the oscillation: r1=1<φr_1=1 < \varphi, r2=2>φr_2=2 > \varphi, r3=1.5<φr_3=1.5 < \varphi, r4≈1.667>φr_4 \approx 1.667 > \varphi… the odd-indexed terms are smaller than φ\varphi, the even-indexed ones are larger, and the two alternate in their approach to φ\varphi.

Rigorous Proof

Method 1: Taking the Limit in the Recurrence

Assume that lim⁡n→∞rn=L\lim_{n \to \infty} r_n = L exists.

From Fn+1=Fn+Fn−1F_{n+1} = F_n + F_{n-1}, divide both sides by FnF_n:

Fn+1Fn=1+Fn−1Fn=1+1Fn/Fn−1=1+1rn−1\frac{F_{n+1}}{F_n} = 1 + \frac{F_{n-1}}{F_n} = 1 + \frac{1}{F_n/F_{n-1}} = 1 + \frac{1}{r_{n-1}}

That is:

rn=1+1rn−1r_n = 1 + \frac{1}{r_{n-1}}

Taking the limit on both sides as n→∞n \to \infty:

L=1+1LL = 1 + \frac{1}{L}

Multiplying both sides by LL:

L2=L+1  ⟹  L2−L−1=0L^2 = L + 1 \implies L^2 - L - 1 = 0

Taking the positive root:

L=1+52=φL = \frac{1+\sqrt{5}}{2} = \varphi

Method 2: Binet’s Formula

The Fibonacci sequence has an explicit expression:

Fn=φn−ψn5F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}

where φ=1+52\varphi = \frac{1+\sqrt{5}}{2} and ψ=1−52\psi = \frac{1-\sqrt{5}}{2}.

Proof of Binet’s formula:

The characteristic equation of the recurrence Fn+1=Fn+Fn−1F_{n+1} = F_n + F_{n-1} is r2=r+1r^2 = r + 1, that is, r2−r−1=0r^2 - r - 1 = 0, whose roots are φ\varphi and ψ\psi.

So the general solution is Fn=Aφn+BψnF_n = A\varphi^n + B\psi^n.

From the initial conditions F1=1,F2=1F_1 = 1, F_2 = 1:

  • Aφ+Bψ=1A\varphi + B\psi = 1
  • Aφ2+Bψ2=1A\varphi^2 + B\psi^2 = 1

Solving gives A=15A = \frac{1}{\sqrt{5}} and B=−15B = -\frac{1}{\sqrt{5}}.

Therefore:

Fn=φn−ψn5F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}

Using Binet’s formula to find the limit of the ratios:

Fn+1Fn=φn+1−ψn+1φn−ψn=φ−ψ(ψ/φ)n1−(ψ/φ)n\frac{F_{n+1}}{F_n} = \frac{\varphi^{n+1} - \psi^{n+1}}{\varphi^n - \psi^n} = \frac{\varphi - \psi(\psi/\varphi)^n}{1 - (\psi/\varphi)^n}

Because ∣ψ∣=5−12≈0.618<1|\psi| = \frac{\sqrt{5}-1}{2} \approx 0.618 < 1 and ∣ψ/φ∣<1|\psi/\varphi| < 1, when n→∞n \to \infty we have (ψ/φ)n→0(\psi/\varphi)^n \to 0.

Therefore:

lim⁡n→∞Fn+1Fn=φ−01−0=φ\lim_{n \to \infty} \frac{F_{n+1}}{F_n} = \frac{\varphi - 0}{1 - 0} = \varphi

Method 3: Proving the Limit Exists (Monotone and Bounded)

Method 1 above assumed that the limit exists. Now let us prove it rigorously.

Consider the odd-indexed subsequence r2k−1r_{2k-1} and the even-indexed subsequence r2kr_{2k}.

From rn=1+1rn−1r_n = 1 + \frac{1}{r_{n-1}}, one can prove that:

  • The odd-indexed subsequence is increasing and bounded above by φ\varphi
  • The even-indexed subsequence is decreasing and bounded below by φ\varphi

Both subsequences converge, and their limits are equal (both satisfy L=1+1/LL = 1 + 1/L); moreover both subsequences consist of positive terms bounded above by φ\varphi, and the two roots of L=1+1/LL = 1 + 1/L are φ\varphi and ψ=1−φ<0\psi = 1 - \varphi \lt 0, so the limit can only be φ\varphi. Hence the original sequence converges to φ\varphi.

Rate of Convergence

By Binet’s formula, the error is:

∣Fn+1Fn−φ∣=∣φψn−ψn+1φn−ψn∣=∣ψ∣n ∣φ−ψ∣φn−ψn=5 ∣ψ∣nφn−ψn≈5∣ψφ∣n≈5×0.382n\left|\frac{F_{n+1}}{F_n} - \varphi\right| = \left|\frac{\varphi\psi^n - \psi^{n+1}}{\varphi^n - \psi^n}\right| = \frac{|\psi|^n\,|\varphi - \psi|}{\varphi^n - \psi^n} = \frac{\sqrt{5}\,|\psi|^n}{\varphi^n - \psi^n} \approx \sqrt{5}\left|\frac{\psi}{\varphi}\right|^n \approx \sqrt{5} \times 0.382^n

The rate of convergence is exponential, with a common ratio of about 0.382 (the error is of order 5×0.382n\sqrt{5} \times 0.382^n).

Conclusion and Applications

Let us collect the results of this chapter:

  • Core conclusion: lim⁡n→∞Fn+1Fn=φ\lim_{n \to \infty} \frac{F_{n+1}}{F_n} = \varphi
  • Binet’s formula: Fn=φn−ψn5F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}, which ties the Fibonacci sequence exactly to the golden ratio
  • Oscillating approach: the ratios alternate above and below φ\varphi, converging exponentially
  • Applications: the Fibonacci search method, growth patterns in nature, proportional design in art

The students of Snore Planet were deeply impressed by Binet’s formula. One of them said:

Every term of the Fibonacci sequence is an integer, yet its general term contains 5\sqrt{5} and the golden ratio! Integers and irrational numbers can combine so perfectly.

I told them:

The connection between the Fibonacci sequence and the golden ratio is one of the most beautiful discoveries in mathematics. This connection exists not only in formulas but also in the growth patterns of nature — in the next chapter we will see why the arrangement of florets on a plant follows the golden angle.

Found an issue with this content?

Tell us what could be improved.