Quick answer
The recursive formula F(n)=F(n-1)+F(n-2) with F(0)=0 and F(1)=1 is exact. Binet's formula uses φ and ψ for closed-form analysis.
Formula
- F(n) = F(n - 1) + F(n - 2)
- F(n) = (φⁿ - ψⁿ) / √5
- φ = (1 + √5) / 2
Introduction
The Fibonacci formula is the mathematical sentence that tells you how each term relates to earlier terms. Without that sentence, the sequence would be just a string of numbers with no rule for prediction.
Most students first meet the recursive version because it mirrors the definition directly. Advanced courses add Binet's formula, which writes F(n) using powers of the golden ratio and its conjugate.
If you already understand the list itself, you may still want the definition of the Fibonacci sequence as a refresher on indexing before you substitute large values of n.
This article explains both forms, interprets them in plain language, and points to calculation methods that stay exact on a computer.
When performance becomes the question, read the comparison of formula-first versus recursive coding to see why iteration wins in production.
Recursive formula as the source of truth
For all n ≥ 2, F(n) equals F(n-1) plus F(n-2). The statement is short, but it encodes the entire sequence once F(0) and F(1) are fixed.
Recursive here means each term is defined in terms of smaller indices, not that you must use recursive functions in code. Iterative loops still satisfy the same formula.
The formula is linear in structure but produces exponential-sized numbers as n grows. That distinction matters when you analyze algorithms, not when you add two integers by hand.
Memorize the recurrence before you memorize any table. Tables are useful, but the formula is what proves general facts about divisibility and parity.
Binet's formula and mathematical interpretation
- φ = (1 + √5) / 2
- ψ = (1 - √5) / 2
- F(n) = (φⁿ - ψⁿ) / √5
Binet's formula is surprising the first time you see it: an integer equals a difference of irrational powers divided by an irrational root.
The interpretation is that φⁿ dominates for large n because the magnitude of ψ is less than 1. The ψⁿ term shrinks toward zero, so F(n) approaches φⁿ/√5 in ratio.
Floating-point calculators can drift away from integers when n is large. That is why homework tools and our home page use integer recurrence instead of exponentials.
For step-by-step arithmetic without floating error, add terms from F(0) and F(1) until you reach the requested index, then verify with the home calculator.
Using the formulas in practice
- State bases Confirm F(0)=0 and F(1)=1 for this site.
- Choose representation Use recursion on paper, iteration in software, Binet in proofs.
- Track n Keep the index visible; off-by-one errors are common.
- Check parity Even indices have patterns; odd indices have others. The formula explains why.
- Validate output Plug n into the home calculator when you need certainty.
Example: prove F(5)=5 two ways
Recursive walk: F(2)=1, F(3)=2, F(4)=3, F(5)=5 by adding pairs.
Binet with n=5 is messy on a handheld calculator but still lands on 5 when you use exact arithmetic software.
The agreement between methods is a good sanity check that you copied the formula correctly.