Read the equation
For the standard Fibonacci sequence with F₀=0 and F₁=1, the ratio Fₙ/Fₙ₋₁ approaches the golden ratio as n grows. The contribution from the smaller-magnitude root of the recurrence vanishes relative to φⁿ. This theorem applies to the integer sequence; it does not directly prove convergence of a separately forced ODE that happens to use the ratio.
Terms & definitions
| Term | Meaning in this source |
|---|---|
| F_n | nth Fibonacci integer |
| golden | Golden ratio φ |
| n | Sequence index |
How it works
Read the definition from its right-hand expression to the quantity on the left. Its surrounding source records the intended input, state, or parameter context. Where the source leaves an operation unspecified, this page preserves that gap.
Assumptions & limits
The ratio requires a nonzero denominator; with the stated seeds use n≥2.
Original context
Read the surrounding source passage
\end{definition}
The ratio of consecutive Fibonacci numbers converges to $\golden$:
\begin{equation}
\lim_{n \to \infty} \frac{\fib{n}}{\fib{n-1}} = \golden
\end{equation}
We also employ the golden angle:
\begin{equation}
\theta_g = \frac{2\pi}{\golden^2} \approx 137.508°
\end{equation}Exact original notation
\lim_{n \to \infty} \frac{\fib{n}}{\fib{n-1}} = \golden