Fibonacci Sequence

Download as PDF

Discover the secrets of the Fibonacci sequence, a simple yet profound pattern where each number is the sum of the two before it. From blooming flowers to swirling galaxies, this sequence reveals a hidden mathematical blueprint in the world around us.

Fibonacci Sequence — an original Algebra911 reference diagram defining fibonacci sequence with its key formula and a worked example.
Fibonacci Sequence: A Complete Guide

What Is the Fibonacci Sequence?

The Fibonacci sequence is an ordered list of numbers where each number is the sum of the two preceding ones. This simple rule generates a pattern that appears unexpectedly throughout the natural world. The sequence most commonly starts with the numbers 0 and 1, though sometimes it is shown starting with 1 and 1. For our purposes, we will use the standard mathematical definition that begins with 0.

Let's build the sequence step-by-step:

  1. Start with 0 and 1.
  2. Add them together to get the next number: 0+1=1. The sequence is now 0,1,1.
  3. Add the last two numbers together: 1+1=2. The sequence is now 0,1,1,2.
  4. Continue the process: 1+2=3. The sequence is 0,1,1,2,3.
  5. And again: 2+3=5. The sequence becomes 0,1,1,2,3,5.

If we keep going, we get the familiar list of Fibonacci numbers:

0,1,1,2,3,5,8,13,21,34,55,89,144,...

In mathematical notation, we can represent any term in the sequence as Fn, where n is the position of the term in the sequence (its index). So, F0=0, F1=1, F2=1, F3=2, and so on. The rule that defines the sequence is a recursive formula because each term depends on the ones before it.

Fn=Fn1+Fn2

This formula holds true for any term where n is 2 or greater. It's a simple idea with surprisingly complex and beautiful consequences.

Where Did the Fibonacci Sequence Come From?

While the sequence is named after Leonardo of Pisa, also known as Fibonacci, he did not invent it. Fibonacci was an Italian mathematician who lived in the 13th century. He introduced the sequence to the Western world in his 1202 book, Liber Abaci (Book of Calculation). In it, he posed a famous thought experiment about the population growth of rabbits.

The problem goes like this:

  • You start with one pair of newborn rabbits (one male, one female).
  • After one month, they mature.
  • After a second month, a mature pair produces another pair of rabbits.
  • Rabbits never die and continue to produce one new pair every month from their second month onwards.

If you track the number of rabbit pairs each month, the total follows the Fibonacci sequence! You start with 1 pair. After a month, you still have 1 mature pair. After the second month, the original pair produces a new pair, so you have 2 pairs. In the third month, the original pair produces again, giving you 3 pairs. This pattern of 1,1,2,3,5,8,... perfectly matches the sequence.

However, the roots of this sequence go back even further. Historians have found that this pattern was described by Indian mathematicians as early as the 6th century. They studied Sanskrit poetry and the different rhythmic patterns that could be formed from short and long syllables, and in doing so, they stumbled upon the same numerical sequence centuries before Fibonacci.

How Do You Calculate Fibonacci Numbers?

Calculating Fibonacci numbers is straightforward as long as you follow the main rule: add the two previous numbers. The most common method is to build the sequence from the beginning until you reach the desired term. Let's work through a couple of examples.

Example 1

Find the 12th Fibonacci number, F12, assuming the sequence starts with F0=0 and F1=1.

Solution: We need to list the sequence until we get to the 12th term (remembering that the first term is term 0).

  1. F0=0
  2. F1=1
  3. F2=F1+F0=1+0=1
  4. F3=F2+F1=1+1=2
  5. F4=F3+F2=2+1=3
  6. F5=F4+F3=3+2=5
  7. F6=F5+F4=5+3=8
  8. F7=F6+F5=8+5=13
  9. F8=F7+F6=13+8=21
  10. F9=F8+F7=21+13=34
  11. F10=F9+F8=34+21=55
  12. F11=F10+F9=55+34=89
  13. F12=F11+F10=89+55=144

So, the 12th Fibonacci number is 144.

Example 2

If you know that the 20th Fibonacci number, F20, is 6765 and the 21st Fibonacci number, F21, is 10946, what is the 22nd Fibonacci number, F22?

Solution: This example is much simpler because we don't need to start from the beginning. We can use the definition of the sequence directly.

The formula is Fn=Fn1+Fn2.

In our case, n=22. So, we need to find F22=F21+F20.

We are given the values:

  • F21=10946
  • F20=6765

Now, we just add them:

F22=10946+6765=17711

The 22nd Fibonacci number is 17711.

What Is the Connection to the Golden Ratio?

One of the most fascinating properties of the Fibonacci sequence is its relationship with a special irrational number called the Golden Ratio. The Golden Ratio is often denoted by the Greek letter phi (ϕ). Its approximate value is 1.6180339887....

The connection is revealed when you divide a Fibonacci number by the number that comes just before it. As you move further along the sequence, this ratio gets closer and closer to the value of ϕ.

Let's see this in action with a table:

Term (Fn)ValuePrevious Term (Fn1)Ratio (Fn/Fn1)
F2111/1=1.0
F3212/1=2.0
F4323/2=1.5
F5535/31.666...
F6858/5=1.6
F713813/8=1.625
F8211321/131.61538...
F15610377610/3771.61803...
F20676541816765/41811.61803...

As you can see, the ratio quickly converges on the value of the Golden Ratio. This isn't a coincidence; it's a fundamental mathematical property linking the additive nature of the Fibonacci sequence to the multiplicative properties of the Golden Ratio. The Golden Ratio itself is defined as the unique number where ϕ=1+1/ϕ, which leads to the quadratic equation ϕ2ϕ1=0. Its exact value is:

ϕ=1+52

This deep connection is why spirals based on Fibonacci numbers, often seen in nature, are also related to the Golden Spiral.

Where Can You Find the Fibonacci Sequence in Real Life?

The Fibonacci sequence is not just a mathematical curiosity; it is a coding pattern that nature uses frequently. This is because these numbers represent an optimal way for things to grow and pack together. Keep an eye out, and you'll start to see Fibonacci numbers everywhere.

  • Flower Petals: Many flowers have a number of petals that is a Fibonacci number. For example, lilies and irises have 3 petals, buttercups have 5 petals, delphiniums have 8, and some daisies have 21, 34, or even 55 petals.
  • Seed Heads: The head of a sunflower is a stunning example. The seeds are arranged in two sets of spirals curling in opposite directions. The number of spirals in each direction is almost always a pair of consecutive Fibonacci numbers, like 34 and 55, or 55 and 89. This arrangement allows the maximum number of seeds to be packed into the flower head.
  • Pinecones: Look closely at a pinecone. You'll see two sets of spirals of scales originating from the base. The number of spirals in each direction are typically consecutive Fibonacci numbers, such as 5 and 8 or 8 and 13.
  • Fruits and Vegetables: The bumps on a pineapple are also arranged in spirals, often 8 in one direction and 13 in the other. A head of cauliflower or broccoli also exhibits these spiraling patterns based on the sequence.
  • Tree Branches: The way trees grow branches can also follow a Fibonacci pattern. A main trunk grows, then produces a branch. The trunk continues to grow, and the first branch produces its own branch. This pattern of branching can result in a Fibonacci number of branches at any given height.
  • Nautilus Shells: The classic spiral of a nautilus shell grows in a way that is related to the Golden Ratio, which is intrinsically linked to the Fibonacci sequence. Each chamber of the shell is roughly a scaled version of the previous one, creating a logarithmic spiral.

These examples show that the sequence is more than just numbers—it's a fundamental principle of growth and efficiency in the biological world.

Key formulas for fibonacci sequence by Algebra911.
Key formulas for fibonacci sequence by Algebra911.

Is There a Faster Way to Find a Specific Fibonacci Number?

Calculating F100 by adding up all the previous terms would be incredibly tedious. Fortunately, there is a direct formula, known as Binet's Formula, that allows you to calculate any Fibonacci number, Fn, without knowing the terms before it. It uses the Golden Ratio (ϕ) and its conjugate.

The formula looks complicated, but it's very powerful:

Fn=ϕnψn5

Where:

  • ϕ=1+521.618034... (the Golden Ratio)
  • ψ=1520.618034...

It seems amazing that a formula with irrational numbers like 5 can produce the perfect integers of the Fibonacci sequence, but it works every time. The ψn part becomes very small as n increases, so for large numbers, you can even approximate Fn by simply calculating ϕn5 and rounding to the nearest whole number.

Example 3

Use Binet's Formula to find the 8th Fibonacci number, F8.

Solution: We know from our earlier list that F8=21. Let's see if the formula gives us the same result. Here, n=8.

The formula is F8=ϕ8ψ85.

  1. Calculate ϕ8:
    Using ϕ1.618034, we get ϕ8(1.618034)846.9787...
  2. Calculate ψ8:
    Using ψ0.618034, we get ψ8(0.618034)80.0212... (Note: a negative number to an even power becomes positive).
  3. Subtract the values:
    ϕ8ψ846.97870.0212=46.9575
  4. Divide by 5:
    The square root of 5 is approximately 2.236068.
    F846.95752.23606821.000...

When we round this to the nearest integer, we get exactly 21. The reason it's not a perfect integer when using calculator approximations is due to rounding decimals. If you were to use the exact values of ϕ and ψ with all their radicals, the math would work out perfectly to be the integer 21.

What Are Common Mistakes When Working with Fibonacci Numbers?

The Fibonacci sequence is simple, but a few common pitfalls can trip students up. Being aware of them can help you avoid errors in your work.

  1. Incorrect Starting Point: The most common confusion is whether the sequence starts 0,1,... or 1,1,.... The formal mathematical definition starts with F0=0. However, many applications (like the original rabbit problem) start with F1=1 and F2=1. Always check which convention is being used in a given problem. If a problem asks for the '6th term', it matters whether you start counting from 0 or 1.
  2. Adding the Wrong Terms: The rule is Fn=Fn1+Fn2, meaning you add the two previous terms. A frequent mistake is to add the current term to the previous term (e.g., to find the next term after 8, you might accidentally calculate 8+8 or 8+13 instead of the correct 5+8).
  3. Simple Arithmetic Errors: As the numbers get larger, it's easy to make a mistake in addition. When calculating a long sequence by hand, double-check your work. For example, after 89+144, the numbers get into the hundreds (233), and it's easy to miscalculate under pressure.
  4. Misusing Binet's Formula: Binet's formula is precise but requires careful calculation. Forgetting to raise the negative number ψ to the power n (and paying attention to the sign), or making a calculator error with the order of operations, can lead to a wrong answer. Remember that (0.618)3 is negative, while (0.618)4 is positive.

Fibonacci Sequence: A Quick Reference

Here is a quick summary of the most important concepts related to the Fibonacci sequence.

  • Definition: A sequence where every number after the first two is the sum of the two preceding ones.
  • First Few Terms (starting with F0): 0,1,1,2,3,5,8,13,21,34,...
  • Recursive Formula:
    Fn=Fn1+Fn2
  • Golden Ratio (ϕ): An irrational number approximately equal to 1.618. The ratio of consecutive Fibonacci numbers (Fn/Fn1) gets closer and closer to ϕ as n increases.
  • Binet's Formula (Direct Formula):
    Fn=ϕnψn5
  • Key Appearances: Found throughout nature in flower petals, pinecones, sunflowers, and shells, often related to optimal growth and packing strategies.

Frequently Asked Questions

What is the 0th Fibonacci number?

The 0th Fibonacci number, denoted as F0, is 0. The standard mathematical sequence begins F0=0 and F1=1, which then generates the rest of the sequence. Some simplified explanations start at F1=1, but the F0=0 definition is more common in higher mathematics.

Can the Fibonacci sequence have negative numbers?

Yes, the sequence can be extended backwards. To find the term before 0 and 1, you'd need a number that, when added to 1, gives 0. That number is 1. Continuing this pattern, the sequence extended to negative indices is ...,5,3,2,1,1,0,1,1,2,....

Is the Fibonacci sequence arithmetic or geometric?

Neither. An arithmetic sequence has a common difference between terms (like 2,4,6,8,...), and a geometric sequence has a common ratio (like 2,4,8,16,...). The Fibonacci sequence is defined by addition of previous terms, not a common difference or ratio, so it's a recursive sequence.

Why is the Fibonacci sequence so important?

The Fibonacci sequence is important because it appears in a vast range of fields, from biology and nature to art, architecture, and computer science. Its connection to the Golden Ratio makes it fundamental to understanding patterns of growth and aesthetics. In computer science, it's a classic example used to teach recursion and dynamic programming.

Who actually discovered the Fibonacci sequence?

While named after Fibonacci (Leonardo of Pisa), who introduced it to Europe in 1202, the sequence was known much earlier. It was described by Indian mathematicians, including Pingala and Virahanka, as early as the 6th century in their study of poetic meters in Sanskrit.

How is the Fibonacci sequence used in computers?

In computer science, the Fibonacci sequence is a fundamental tool for teaching algorithms, especially recursion. It's also used in search algorithms (Fibonacci search), data structures (Fibonacci heaps), and for generating random numbers or patterns in computer graphics.

What comes after the Fibonacci sequence?

There are many generalizations and related sequences. One of the most famous is the Lucas sequence, which follows the same rule (add the two previous numbers) but starts with 2 and 1. This gives the sequence 2,1,3,4,7,11,....