Fibonacci Calculator
Test cases replayed : 4 of 4 match · Methodology · No outside source listed
Enter a position n to get the Fibonacci number F(n), the numbers just before and after it, and the ratio of consecutive terms.
Result
F(n)
F(n − 1)
- F(n + 1) = F(n) + F(n − 1)
- F(n + 1) ÷ F(n)
Estimate for planning only, not tax, legal, financial or medical advice. This calculator uses the method explained on this page.
This browser did not allow copying. The sentence is in the box below, already selected: copy it with your keyboard or the menu.
How to use this calculator
Fill in the fields in this order; each step takes you to its field.
- Position n (whole number from 0 to 70): enter a number from 0 to 70.
- Read the result: F(n); the panel also shows F(n − 1), F(n + 1) = F(n) + F(n − 1) and F(n + 1) ÷ F(n).
How this calculator works
The Fibonacci sequence starts F(0) = 0, F(1) = 1, and each term is the sum of the two before it: F(n) = F(n − 1) + F(n − 2).
Binet's formula gives any term directly: F(n) = (φⁿ − ψⁿ)/√5, with φ = (1 + √5)/2 and ψ = (1 − √5)/2. Because |ψⁿ/√5| < 1/2, F(n) is φⁿ/√5 rounded to the nearest whole number. The calculator stops at n = 70 so that every digit stays exact in double-precision arithmetic.
The ratio F(n + 1)/F(n) tends to the golden ratio φ ≈ 1.618 as n grows.
The formula
| Symbol | Meaning |
|---|---|
| Position n (whole number from 0 to 70) | |
| F(n) | |
round(x, d) | x rounded to d decimal places, or to a whole number without d. |
Worked example
| Position n (whole number from 0 to 70) | 10 |
|---|
| F(n − 1) | 34 |
|---|---|
| F(n + 1) = F(n) + F(n − 1) | 89 |
| F(n + 1) ÷ F(n) | 1.6182 |
F(n) 55
Each step uses the unrounded value of the step before it; figures on this page are rounded for display.
Frequently asked questions
What is the 10th Fibonacci number?
Counting from F(0) = 0, F(10) = 55. The terms are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55.
What is F(50)?
F(50) = 12,586,269,025.