φ and ψ
(1 ± √5)/2
1.6180 and −0.6180.
Binet's formula gives the Fibonacci numbers in closed form: , where and .
This page is easier if you are comfortable with:
The Fibonacci recurrence has characteristic equation , whose roots are and (the characteristic equation of a linear recurrence, the quadratic formula). The starting values , fix the constants , . For : , , difference , divided by gives . Similarly and .
Since , the term quickly becomes negligible, so is the integer nearest to : for , . The ratio tends to , the golden ratio, with . Identities follow from the formula, such as Cassini's identity, the sum of Fibonacci numbers and the gcd property.
The growth rate explains why Fibonacci numbers grow exponentially, and the formula can be derived from generating functions (generating functions) or from matrix powers (eigenvalues of a 2 × 2 matrix). Related sequences of the same type are in Fibonacci-type sequences.
Binet's formula gives any Fibonacci number directly from the golden ratio.
The points sit almost exactly on the exponential curve.
These examples are worked by hand, step by step, so you can compare your own working.
Find from Binet's formula.
Find by rounding .
Find by rounding .
A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.
(1 ± √5)/2
1.6180 and −0.6180.
(φ¹⁰ − ψ¹⁰)/√5
55.
nearest integer is F₁₀
55.0036.
6765
Rounded from φ²⁰/√5.
Fₙ = (φⁿ − ψⁿ)/√5 with φ = (1 + √5)/2 and ψ = (1 − √5)/2. Since |ψ| < 1, Fₙ is the nearest integer to φⁿ/√5.
Find φ.
Evaluate (φ¹⁰ − ψ¹⁰)/√5.
Evaluate φ¹⁰/√5.
Find F₂₀ by Binet.
exact ✗
rounding is needed ✓
Small error.
sign ✗
φⁿ − ψⁿ ✓
Order matters.
÷5 ✗
÷√5 ✓
Check.
F₀ = 1 ✗
F₀ = 0 ✓
Standard indexing.
Try each one on paper, then open the answer. Use the solver above to see the full working.
2.618
2.618
4.9597
5
144
-0.618
Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.
Solve: …
Fₙ = (φⁿ − ψⁿ)/√5.
|ψⁿ/√5| < 1/2.
(1 + √5)/2 ≈ 1.618.
55.
linear recurrences.
generating functions.
More in Discrete maths and number theory and the formula sheets.