In the Fibonacci sequence each term is the sum of the two before it. Start with two values, keep adding the previous two, and the whole sequence unfolds:
The formula and what the symbols mean
Using the common convention and , the rule is the recurrence
Here is the -th term, and each new term is built from the two earlier terms and , not from a single direct rule applied once. The sequence depends on the starting convention. Many textbooks use and ; others use and . The number pattern is the same, but the labels shift, so check the indexing before comparing answers.
Why consecutive ratios approach the golden ratio
For positive Fibonacci terms, the ratio of consecutive terms moves toward 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 grows.
There is also a closed form, often called Binet's formula. Under the convention and ,
where
For most students the recurrence is the better starting point. Binet's formula is valuable because it connects Fibonacci numbers to powers and to the golden ratio, but you do not need it to generate terms.
Worked example: find F_8 and check a ratio
Start with
then build forward one step at a time:
So
Now compare a consecutive-term ratio:
which is already close to . The Fibonacci numbers are integers, yet ratios of consecutive terms drift toward the golden ratio. (As a smaller- contrast, is further off, exactly as expected.)
Practice it yourself, then check
Write the sequence through , then compute and compare with .
Check: continuing the build gives and , so . The ratio settles toward remarkably fast.
Calculation traps
Mixing up the starting index. If one source starts with and another with , the same label can name different numbers. Check the convention first.
Thinking the ratio is always exactly . Early ratios such as are only approximations; the ratio approaches for large .
Using the recurrence without two starting values. The rule needs two initial terms, or 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.
Where the Fibonacci sequence is used
It appears in counting problems where each case is built from the two earlier cases, and it is 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 shows up so often in math courses.
Frequently Asked Questions
- What is the rule for the Fibonacci sequence?
- Each term is the sum of the two terms before it. Using the common convention that F0 is 0 and F1 is 1, the recurrence is Fn equals Fn minus 1 plus Fn minus 2, so the sequence begins 0, 1, 1, 2, 3, 5, 8, 13, 21 and continues forever. You start with two values and keep adding the previous two to get the next one.
- How is the Fibonacci sequence related to the golden ratio?
- For positive Fibonacci terms, the ratio of consecutive terms gets closer and closer to the golden ratio phi, about 1.618. For example, 21 divided by 13 is about 1.615, already close. Not every ratio equals phi; the ratios converge toward it as n grows. Binet's closed-form formula makes the connection explicit by expressing Fibonacci numbers using powers of phi.
- What is Binet's formula for Fibonacci numbers?
- Under the convention F0 equals 0 and F1 equals 1, Binet's formula gives Fn as phi to the n minus psi to the n, all divided by the square root of 5, where phi is (1 plus root 5) over 2 and psi is (1 minus root 5) over 2. It is a closed form, but for most students the recurrence is the better starting point for generating terms.
- Why do Fibonacci answers differ between textbooks?
- The number pattern depends on the starting convention. Many textbooks use F0 equals 0 and F1 equals 1, while others start with F1 equals 1 and F2 equals 1. The sequence itself is the same, but the labels shift by one position, so always check the indexing convention before comparing answers from different sources.
- What is the 8th Fibonacci number?
- Under the convention starting with F0 equals 0 and F1 equals 1, building forward gives F2 = 1, F3 = 2, F4 = 3, F5 = 5, F6 = 8, F7 = 13, and F8 = 21. So F8 is 21. Checking a nearby ratio, 21 divided by 13 is about 1.615, which is close to the golden ratio of about 1.618.
Need help with a problem?
Upload your question and get a verified, step-by-step solution in seconds.
Open GPAI Solver →