Fibonacci Numbers — Golden Ratio and Binet's Formula

What Are the Fibonacci Numbers?

The Fibonacci numbers are a sequence in which each number is the sum of the two numbers immediately before it, starting from $0$ and $1$. The sequence runs:

$$0,; 1,; 1,; 2,; 3,; 5,; 8,; 13,; 21,; 34,; 55,; 89,; 144,; \ldots$$

The defining relationship is a recurrence — a rule that defines each term using earlier terms:

$$F_n = F_{n-1} + F_{n-2}, \qquad F_0 = 0,; F_1 = 1.$$

So $F_2 = F_1 + F_0 = 1$, $F_3 = F_2 + F_1 = 2$, and so on. This makes Fibonacci a special kind of sequence in algebra: not arithmetic (no constant difference) and not geometric (no constant ratio), but recursive — each step depends on the two steps before.

What Is the Fibonacci Numbers List?

Here are the first fifteen Fibonacci numbers, indexed from $F_0$. Knowing the start of the list by sight makes most problems faster.

Does the sequence start at 0 or 1? The modern convention starts at $F_0 = 0$. Some older texts start the list at $1, 1, 2, 3, \ldots$ and call the first $1$ either $F_1$ or $F_0$. The numbers are the same; only the index label shifts. This article uses $F_0 = 0$ throughout.

How Are the Fibonacci Numbers Related to the Golden Ratio?

Divide any Fibonacci number by the one before it, and the answer creeps toward a single fixed value. As $n$ grows, $\dfrac{F_{n+1}}{F_n}$ approaches the golden ratio:

$$\varphi = \frac{1 + \sqrt{5}}{2} \approx 1.6180339887.$$

Watch it converge: $\tfrac{8}{5} = 1.6$, $\tfrac{13}{8} = 1.625$, $\tfrac{21}{13} \approx 1.615$, $\tfrac{34}{21} \approx 1.619$. Each ratio lands closer to $\varphi$. The golden ratio is the only positive number satisfying $\varphi^2 = \varphi + 1$ — which is just the Fibonacci rule ("add the previous two") written for a single number instead of a list. That shared equation is why the ratios converge; it isn't a coincidence of the spiral diagram.

What Is Binet's Formula?

Binet's formula computes the $n$th Fibonacci number directly — no need to build up every earlier term:

$$F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}, \qquad \varphi = \frac{1+\sqrt{5}}{2},; \psi = \frac{1-\sqrt{5}}{2}.$$

Here $\psi \approx -0.618$ is the "conjugate" of $\varphi$. Because $|\psi| < 1$, the $\psi^n$ term shrinks fast, so for any reasonable $n$ you can compute $\dfrac{\varphi^n}{\sqrt{5}}$ and round to the nearest whole number. Two surprises live in this formula: an integer sequence comes out of irrational numbers, and a "closed form" — like the explicit formula for a sequence — exists at all for something defined recursively. Example 4 below runs the calculation.

What Are the Properties of the Fibonacci Numbers?

A short list of patterns that show up constantly in problems.

• Sum of the first $n$ terms: $F_0 + F_1 + \cdots + F_n = F_{n+2} - 1$. The running total is always one less than a later Fibonacci number.

• Every third number is even: $0, 2, 8, 34, 144, \ldots$ — the even terms sit at $F_0, F_3, F_6, \ldots$.

• Cassini's identity: $F_{n+1}F_{n-1} - F_n^2 = (-1)^n$. The product of the neighbours of $F_n$ differs from $F_n^2$ by exactly $\pm 1$.

• Consecutive terms are coprime: $\gcd(F_n, F_{n+1}) = 1$ always — neighbouring Fibonacci numbers share no common factor.

Examples of Fibonacci Numbers

The examples build from extending the list, through a sum, the most common starting-value slip, Binet's formula, the golden-ratio shortcut, and a sum property.

Example 1

Find the next three Fibonacci numbers after $\ldots, 21, 34, 55$.

Add the last two each time:

$$34 + 55 = 89, \quad 55 + 89 = 144, \quad 89 + 144 = 233.$$

Final answer: $89, 144, 233$. The rule never changes — add the previous two.

Example 2

Find the 8th Fibonacci number, $F_8$.

Build up from the start using $F_0 = 0$, $F_1 = 1$: the list runs $0, 1, 1, 2, 3, 5, 8, 13, 21$. Counting from $F_0$:

$$F_8 = 21.$$

Final answer: $F_8 = 21$. Index carefully — $F_8$ is the ninth entry because the list starts at $F_0$.

Example 3

A common slip — find $F_6$.

Wrong attempt. A student starts the count at $1$ instead of $0$, writing the sequence as $1, 2, 3, 5, 8, 13$ and calling $F_6 = 13$. The slip is the starting pair: they skipped $F_0 = 0$ and the first $1$. Check against the standard list $0, 1, 1, 2, 3, 5, 8$ — the sixth-indexed term (counting $F_0$ as the start) is $8$, not $13$.

Correct. Anchor to $F_0 = 0$, $F_1 = 1$ and count indices honestly:

$$F_0=0,; F_1=1,; F_2=1,; F_3=2,; F_4=3,; F_5=5,; F_6=8.$$

Final answer: $F_6 = 8$. The value $13$ is $F_7$ — off by one because of the dropped starting zero.

Example 4

Use Binet's formula to find $F_7$.

With $\varphi \approx 1.618$, compute $\varphi^7 \approx 29.03$. Since the $\psi^7$ term is tiny ($\psi^7 \approx -0.034$):

$$F_7 = \frac{\varphi^7 - \psi^7}{\sqrt{5}} \approx \frac{29.03 - (-0.034)}{2.236} \approx \frac{29.07}{2.236} \approx 13.0.$$

Final answer: $F_7 = 13$. Rounding to the nearest integer is safe because the $\psi^n$ term is always less than $\tfrac{1}{2}$ in size.

Example 5

Given $F_{14} = 377$, estimate $F_{15}$ using the golden ratio.

Multiply by $\varphi$, since consecutive terms grow by roughly that factor:

$$F_{15} \approx 377 \times 1.618 \approx 610.0.$$

Final answer: $F_{15} = 610$. The estimate is reliable from about the fifth term onward, where the ratio has settled close to $\varphi$.

Example 6

Verify the sum property: add $F_0$ through $F_6$ and check it equals $F_8 - 1$.

Sum the terms $0 + 1 + 1 + 2 + 3 + 5 + 8 = 20$. The property says this should equal $F_{6+2} - 1 = F_8 - 1$:

$$F_8 - 1 = 21 - 1 = 20.$$

Final answer: both sides equal $20$ — the sum property holds. Running totals of Fibonacci numbers are always one short of a later term.

The Mathematician Behind the Fibonacci Numbers

Leonardo of Pisa (c. 1170–1250, Italy), known as Fibonacci, introduced the sequence to Europe in his 1202 book Liber Abaci through a puzzle about breeding rabbits. The same numbers had already appeared centuries earlier in the work of the Indian scholar Pingala (c. 3rd–2nd century BCE), who used them to count rhythmic patterns in Sanskrit poetry.

Why the Fibonacci Numbers Matter

"One simple rule, written into living things."

The reason Fibonacci numbers fascinate isn't the arithmetic — it's that nature appears to use them. A simple local rule ("each new part relates to the previous two") produces global patterns that recur across wildly different systems.

Where they turn up:

• Plant growth. Sunflower seeds, pinecone scales, and pineapple segments spiral in counts that are almost always consecutive Fibonacci numbers, because packing seeds at the golden angle leaves no gaps and no overlaps.

• Computer science. The Fibonacci search technique, Fibonacci heaps, and the classic recursion-versus-memoisation lesson all hang on this sequence — it's the standard teaching example for how naive recursion can blow up in cost.

• Finance. Traders mark "Fibonacci retracement" levels on price charts, using ratios derived from the sequence to flag possible support and resistance.

• Art and architecture. The golden ratio that the sequence approaches has been linked to proportions in the Parthenon and Renaissance painting — though how deliberate that was is genuinely debated.

A Bhanzu Grade 10 student who first meets Fibonacci as "the reason a sunflower's seeds spiral" rarely forgets the recurrence afterward. That's the Blitzkrieg move — show the sunflower, then teach the addition rule. The sequence also opens the door to recursion, a concept that runs straight into progressions and series later on.

Where Students Trip Up on the Fibonacci Numbers

Mistake 1: Miscounting the index because of the starting zero

Where it slips in: Asked for $F_6$, a student starts the count at $1$ and lands on $13$ instead of $8$.

Don't do this: Skip $F_0 = 0$ or start the index at the first $1$ without checking the convention.

The correct way: Anchor to $F_0 = 0$, $F_1 = 1$, and count indices from there. $F_6 = 8$. When a problem uses a different convention, restate the first two terms before you start.

In Bhanzu's Grade 10 sequences cohort at the McKinney, TX center, this off-by-one is the most frequent error on the first Fibonacci worksheet — it shows up in roughly half of first attempts, almost always from the rusher who starts adding before pinning down which index the question wants. The trainer's fix is to write $F_0, F_1, F_2, \ldots$ as labels above the numbers before computing anything. Indexed once, the off-by-one disappears.

Mistake 2: Treating Fibonacci as arithmetic or geometric

Where it slips in: A student tries to find a common difference or common ratio to "solve" the sequence, the way they would for an arithmetic sequence.

Don't do this: Look for a single number to add (or multiply) repeatedly. The differences $1, 0, 1, 1, 2, 3, \ldots$ aren't constant, and neither are the ratios.

The correct way: Use the recurrence — add the previous two terms — or Binet's formula for a direct value. Fibonacci is recursive, not arithmetic or geometric. The memorizer who only knows the $a + (n-1)d$ formula freezes here until they see it's a different kind of sequence.

Mistake 3: Expecting Binet's formula to give an exact decimal

Where it slips in: Computing Binet's formula on a calculator, getting $12.9999$, and reporting that as the answer.

Don't do this: Leave the result as a long decimal. Fibonacci numbers are whole numbers.

The correct way: Round to the nearest integer. The tiny $\psi^n$ term is what nudges the value off a clean integer; rounding restores it. $F_7$ computes to about $13.0$, so the answer is $13$.

Key Takeaways

• The Fibonacci numbers are $0, 1, 1, 2, 3, 5, 8, 13, \ldots$, with $F_n = F_{n-1} + F_{n-2}$ and $F_0 = 0$, $F_1 = 1$.

• The ratio of consecutive terms converges to the golden ratio $\varphi = \tfrac{1+\sqrt5}{2} \approx 1.618$.

• Binet's formula $F_n = \tfrac{\varphi^n - \psi^n}{\sqrt5}$ gives any term directly — round to the nearest integer.

• Index carefully: counting from $F_0 = 0$ avoids the most common off-by-one error.

• Fibonacci is recursive, not arithmetic or geometric — there's no constant difference or ratio.

• The sequence appears in plant spirals, search algorithms, and the golden-ratio proportions of art.

Practice These Before Moving On

1. Write the first eight Fibonacci numbers, starting from $F_0$.

2. Find $F_{10}$ by building the list.

3. Estimate $F_{12}$ given $F_{11} = 89$, using the golden ratio.

Answer to Question 1: $0, 1, 1, 2, 3, 5, 8, 13$. Answer to Question 2: $F_{10} = 55$. Answer to Question 3: $89 \times 1.618 \approx 144$, and indeed $F_{12} = 144$. If Question 2 landed on $89$, recheck your index against Mistake 1.

Want a live Bhanzu trainer to walk through more fibonacci numbers problems? Book a free demo class — online globally.