Understanding convergence to the golden ratio
The ratio of consecutive Fibonacci numbers approaches the golden ratio quickly, as shown below for the first several terms.
| n | Fₙ | Fₙ ÷ Fₙ₋₁ |
|---|---|---|
| 1 | 1 | — (no previous term) |
| 2 | 1 | 1.000000 |
| 5 | 5 | 1.666667 |
| 10 | 55 | 1.617647 |
| 15 | 610 | 1.618026 |
| 20 | 6765 | 1.618034 |
- The ratio Fₙ ÷ Fₙ₋₁ oscillates above and below φ as n increases, getting closer with each additional term, rather than approaching it from only one direction.
- This calculator supports n up to 78, since F₇₉ would exceed JavaScript's safe-integer range (2⁵³ − 1); beyond that point, results would lose exact-integer precision.
- The sequence used here starts at F₁ = 1, F₂ = 1 (the most common indexing convention). Some references instead start the sequence at F₀ = 0, F₁ = 1, which shifts every index by one position — always check which convention a source is using before comparing term numbers.
What is the Fibonacci sequence?
The Fibonacci sequence is defined by the recurrence relation Fₙ = Fₙ₋₁ + Fₙ₋₂, with starting values F₁ = 1 and F₂ = 1 (some sources also include a leading F₀ = 0). Each term after the first two is generated by adding the two terms immediately before it: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, and so on. The sequence is named after the Italian mathematician Leonardo of Pisa, known as Fibonacci, who introduced it to Western mathematics in his 1202 book Liber Abaci, though the sequence itself was described earlier in Indian mathematics in the context of Sanskrit prosody.
As n grows large, the ratio of consecutive Fibonacci numbers Fₙ ÷ Fₙ₋₁ converges toward the golden ratio, φ = (1 + √5) ÷ 2 ≈ 1.6180339887. This convergence is a well-established mathematical result, not a mystical property; the golden ratio itself is the positive root of the equation x² = x + 1, and it also appears as the limiting ratio of many other second-order linear recurrence sequences with similar structure.
The Fibonacci sequence appears throughout mathematics and computer science: it is a standard example in the study of recursive algorithms and dynamic programming, it is the basis of Fibonacci search and Fibonacci heaps in computer science, and Fibonacci-like spiral and branching patterns are documented in some plant structures (phyllotaxis), such as pinecone scale and sunflower seed-head arrangements, in botanical research.
How to use this Fibonacci calculator
- Enter n — the position in the sequence you want to find (n = 1 gives the first term).
- The calculator generates the sequence from F₁ = 1, F₂ = 1 up through the nth term using the recurrence Fₙ = Fₙ₋₁ + Fₙ₋₂.
- Read the nth Fibonacci number, the sum of all terms from F₁ through Fₙ, and the ratio of the nth term to the (n−1)th term.
- Compare the ratio to the golden ratio (φ ≈ 1.618034) to see how quickly the sequence converges — the ratio is already accurate to 3 decimal places by around the 15th term.
The Fibonacci recurrence and the golden ratio
The defining recurrence is Fₙ = Fₙ₋₁ + Fₙ₋₂ for n ≥ 3, with F₁ = 1 and F₂ = 1. Worked example: F₃ = F₂ + F₁ = 1 + 1 = 2; F₄ = F₃ + F₂ = 2 + 1 = 3; F₅ = F₄ + F₃ = 3 + 2 = 5; continuing this pattern to F₁₀ = 55.
The sum of the first n Fibonacci numbers has a closed-form identity: F₁ + F₂ + ... + Fₙ = Fₙ₊₂ − 1. Worked example for n = 10: the sum of 1+1+2+3+5+8+13+21+34+55 = 143, and indeed F₁₂ − 1 = 144 − 1 = 143, confirming the identity.
The ratio of consecutive terms Fₙ ÷ Fₙ₋₁ converges to the golden ratio φ = (1 + √5) ÷ 2 ≈ 1.618034. Worked example: F₁₀ ÷ F₉ = 55 ÷ 34 ≈ 1.617647, already within 0.0004 of φ. This convergence follows from Binet's formula, a closed-form expression for the nth Fibonacci number in terms of φ and its conjugate.
Common mistakes
- Assuming the sequence starts with F₁ = 0 — this calculator uses the F₁ = 1, F₂ = 1 convention; sources using the F₀ = 0, F₁ = 1 convention will show the same numeric sequence shifted by one index position.
- Confusing the Fibonacci sequence with the golden ratio itself — the golden ratio is the limiting value that the ratio of consecutive Fibonacci terms approaches, not a term in the sequence.
- Expecting the ratio of consecutive terms to equal φ exactly at small n — the ratio only converges toward φ as n grows large; at small n (e.g. F₂/F₁ = 1) it can be noticeably different from 1.618034.
- Attributing mystical or universal significance to Fibonacci numbers in art, architecture or the body — while Fibonacci-like patterns are documented in some plant growth structures, many popular claims about the golden ratio's presence in human anatomy or historical artworks are not well supported by rigorous measurement and should be treated with skepticism.
Domande frequenti
How do you find the nth Fibonacci number?
Starting from F₁ = 1 and F₂ = 1, repeatedly apply Fₙ = Fₙ₋₁ + Fₙ₋₂ until reaching the desired term. For example, to find F₁₀: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 — the 10th term is 55.
What is the relationship between Fibonacci numbers and the golden ratio?
As the position n increases, the ratio of consecutive Fibonacci numbers Fₙ ÷ Fₙ₋₁ converges toward the golden ratio, φ = (1 + √5) ÷ 2 ≈ 1.618034. For example, F₁₀ ÷ F₉ = 55 ÷ 34 ≈ 1.617647, already close to φ, and the approximation improves further at higher n.
What is the sum of the first n Fibonacci numbers?
The sum of the first n Fibonacci numbers equals Fₙ₊₂ − 1. For n = 10, the sum of 1+1+2+3+5+8+13+21+34+55 = 143, which matches F₁₂ − 1 = 144 − 1 = 143.
Who discovered the Fibonacci sequence?
The sequence is named after Leonardo of Pisa (known as Fibonacci), who introduced it to Western European mathematics in his 1202 book Liber Abaci, in a problem about the growth of a rabbit population. The same sequence had already been described earlier in Indian mathematics, in connection with the counting of rhythmic patterns in Sanskrit poetry.
Does the Fibonacci sequence start at 0 or 1?
Both conventions are used. Many mathematics references index the sequence starting F₀ = 0, F₁ = 1, F₂ = 1, F₃ = 2, while others (including this calculator) start at F₁ = 1, F₂ = 1, F₃ = 2. The underlying sequence of values is identical either way — only the index labeling differs by one position — so it is important to check which convention a particular source uses.
What is Binet's formula?
Binet's formula is a closed-form expression that computes the nth Fibonacci number directly, without needing to compute all preceding terms: Fₙ = (φⁿ − ψⁿ) ÷ √5, where φ = (1+√5)/2 is the golden ratio and ψ = (1−√5)/2 is its conjugate. Because |ψ| < 1, the ψⁿ term shrinks toward zero as n grows, which is the underlying reason the ratio of consecutive Fibonacci terms converges to φ.
Fonti
- Sigler LE (translator). Fibonacci's Liber Abaci: A Translation into Modern English of Leonardo Pisano's Book of Calculation. Springer, 2002.
- Koshy T. Fibonacci and Lucas Numbers with Applications. 2nd ed. Wiley, 2018.
- OEIS Foundation. The On-Line Encyclopedia of Integer Sequences, A000045 (Fibonacci numbers). oeis.org/A000045.