The Fibonacci sequence is a number pattern in which each term is the sum of the two before it. Using the common convention and , the rule is
so the sequence begins
If you only need the main idea, it is this: start with two values, then keep adding the previous two to get the next one.
What the Fibonacci sequence is
The Fibonacci sequence is defined by a recurrence relation. That means each new term is built from earlier terms, not from a single direct rule you apply once.
This sequence depends on the starting convention. Many textbooks use and . Others use and . The number pattern is the same, but the labels shift, so always check the indexing before comparing answers.
Fibonacci sequence formula
The main formula is the recurrence:
It says each term comes from the previous two. For example,
There is also a closed form, often called Binet's formula. Under the convention and ,
where
For most students, the recurrence is the better place to start. Binet's formula is useful because it connects Fibonacci numbers to powers and to the golden ratio, but you do not need it to generate terms.
Why Fibonacci ratios approach the golden ratio
For positive Fibonacci terms, the ratio of consecutive terms gets closer to the golden ratio:
More precisely, if you look at
for larger and larger with , the ratio approaches . That does not mean every ratio equals . It means the ratios converge to as gets larger.
Worked example: find
Use the recurrence to find and then check a nearby ratio.
Start with
Then build forward one step at a time:
So
Now compare a consecutive-term ratio:
This is close to
That is the key connection: the Fibonacci numbers are integers, but ratios of consecutive terms move toward the golden ratio.
Common mistakes with the Fibonacci sequence
Mixing up the starting index
If one source starts with and another starts with , the same term label can refer to different numbers. Always check the convention first.
Thinking the ratio is always exactly the golden ratio
The ratio approaches for large , but early ratios are only approximations. For example, , which is not equal to .
Using the recurrence without two starting values
The rule needs two initial terms. Without them, the sequence is not fully determined.
Treating every "growing pattern" as Fibonacci
A pattern is Fibonacci only if each term really is the sum of the previous two, under a stated starting convention. Similar-looking lists are not enough.
When the Fibonacci sequence is used
The Fibonacci sequence appears in counting problems where each case can be built from the two earlier cases. It is also a standard example in algebra, discrete math, algorithms, and proofs by induction.
It matters beyond this one topic because it teaches three ideas at once: recursive definition, closed form, and limiting behavior. That combination is why it appears so often in math courses.
Try your own version
Write the sequence through , then compute . Compare your result with .
If you want one more case after that, try your own version with a different index target and see how quickly the ratio settles down.
Need help with a problem?
Upload your question and get a verified, step-by-step solution in seconds.
Open GPAI Solver →