Fibonacci Formula Explained With Examples

A formula is just a short way of writing a rule. When your maths teacher writes F(n) = F(n-1) + F(n-2) on the board, it can look scary, but it says something very simple: to get a number in the list, add the two numbers before it. In this article we explain the Fibonacci formulas one at a time, show where each is useful, and work through examples that use rupees and Indian settings. You do not need any advanced maths. If you can add, multiply and use a basic calculator, you can follow every step.

The Recursive Formula

The first and most common formula is the recursive one. The word recursive means that the rule refers back to itself, or more simply, that each answer depends on earlier answers. Written in full, it looks like this:

F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1.

Let us read the symbols in plain words. F(n) is the number at position n. F(n-1) is the number one place before it, and F(n-2) is the number two places before it. The two starting values, F(0) and F(1), are needed because the rule cannot work until two numbers already exist. Once you have them, you can go as far as you like: F(2) = F(1) + F(0) = 1 + 0 = 1, F(3) = F(2) + F(1) = 1 + 1 = 2, and F(4) = F(3) + F(2) = 2 + 1 = 3.

This formula is easy to understand, and it is the one used in most school books. Its weakness is that you cannot skip steps. To find F(40), you must first find F(39) and F(38), and those need F(37), F(36) and so on, all the way back. For small positions that is fine. For large ones, it takes a long time by hand.

Binet’s Formula: Jumping Straight to Any Term

Mathematicians found a way to skip the long list. It is called Binet’s formula, and it uses two special numbers. The first is the golden ratio, written with the Greek letter phi, which is about 1.6180339. The second is a related number, psi, which is about -0.618034. Binet’s formula says:

F(n) = (phi^n – psi^n) / square root of 5

The square root of 5 is about 2.236068. Here is the surprise: even though phi and the square root of 5 are not whole numbers, the answer always comes out as a whole number. For larger values of n, the part with psi becomes so tiny that you can ignore it. This gives a simpler version: F(n) is the whole number nearest to phi^n divided by 2.236068.

Why does this work? Think of it as a growth rate. Each Fibonacci number is about 1.618 times the one before it, so the sequence grows like a steady multiplication by 1.618. The formula captures that growth and then adjusts it so that the answer lands on exactly the right whole number.

Worked Example 1: Finding F(10) Without the Full List

Let us check Binet’s formula on a number we already know. We want F(10), which we know is 55 from the table in our guide on how to calculate Fibonacci numbers step by step.

Step 1: Find phi^10. Multiply 1.618034 by itself ten times. Using a scientific calculator, phi^10 is about 122.9919.

Step 2: Divide by the square root of 5. 122.9919 / 2.236068 = 55.0036.

Step 3: Round to the nearest whole number. 55.0036 rounds to 55.

The answer is 55, which matches the table. For a student preparing for an exam in Hyderabad or Lucknow, this means you can find a far-off term with only a scientific calculator, as long as you round carefully. The small leftover, 0.0036, is exactly the psi part we ignored.

The Sum Formula

A third useful formula tells you the total of the first n terms, without adding them all. It is:

F(1) + F(2) + … + F(n) = F(n+2) – 1

In words, add up the first n Fibonacci numbers and you get the number two places further along, minus one. Check it with n = 5. The first five terms are 1, 1, 2, 3, 5, and their sum is 12. The number two places further along is F(7) = 13, and 13 – 1 = 12. It works.

Worked Example 2: A School Donation Drive in Jaipur

A school in Jaipur runs a donation drive for flood relief. Class 1 gives Rs. 10, Class 2 gives Rs. 10, Class 3 gives Rs. 20, Class 4 gives Rs. 30, and so on, with each class giving the sum of the two classes before it. There are 8 classes taking part. What is the total collected?

The amounts in tens of rupees are 1, 1, 2, 3, 5, 8, 13, 21. By the sum formula, the total of the first 8 terms is F(10) – 1 = 55 – 1 = 54. Since each unit is Rs. 10, the total is 54 x 10 = Rs. 540. We can check by plain addition: 10 + 10 + 20 + 30 + 50 + 80 + 130 + 210 = 540. Both methods agree. Class 8 alone gives Rs. 210, which is nearly 40 percent of the whole amount, a good example of how the later terms dominate the total.

The Golden Ratio Link

If you divide each Fibonacci number by the one before it, the answers move closer and closer to 1.618. This is the golden ratio. Look at the values in the table below.

Ratio	Calculation	Result
F(5) / F(4)	5 / 3	1.6667
F(6) / F(5)	8 / 5	1.6000
F(7) / F(6)	13 / 8	1.6250
F(10) / F(9)	55 / 34	1.6176
F(12) / F(11)	144 / 89	1.6180
F(13) / F(12)	233 / 144	1.6181

The ratios swing a little above and a little below 1.618 and then settle. This is the reason Binet’s formula works: the sequence behaves like a steady multiplication by the golden ratio.

Worked Example 3: A Chennai Bakery Target

A small bakery in Chennai wants to try a trial plan for 15 days. On day 1 it bakes 1 loaf, on day 2 it bakes 1 loaf, and from day 3 it bakes as many loaves as the two previous days added together. Each loaf sells for Rs. 40. How many loaves are baked on day 15, and how much money comes in over the whole period if every loaf is sold?

The loaves on day 15 are F(15). Using the table method, the terms run 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610. So day 15 has 610 loaves. For the total, use the sum formula: F(17) – 1. The terms after 610 are 987 and 1597, so F(17) = 1597 and the total is 1597 – 1 = 1596 loaves. Money earned = 1596 x Rs. 40 = Rs. 63,840.

Of course, no small bakery could bake 610 loaves in a day on day 15 starting from one loaf, but the example shows how quickly the sequence grows, and why a plan built on Fibonacci growth cannot continue for long.

Key takeaway: Use the recursive formula to understand the pattern, Binet’s formula to jump to a far term, and the sum formula to find totals. Always round Binet’s answer to the nearest whole number.

If you want to avoid the arithmetic, an online fibonacci calculator will give you the term and the running total in one go, which is a handy way to confirm your own answer.

Benefits of Knowing the Formulas

• You save time. Binet’s formula and the sum formula let you skip long lists.
• You can check your work. Using two different methods on the same question is the best way to catch a slip.
• You understand the pattern, not just the list. The golden ratio link explains why the sequence grows the way it does.
• You are ready for higher classes. Recursion and sequences appear again in algebra, computer science and data structures.
• You get a taste of real mathematics. The idea that a whole-number list is described by irrational numbers is a classic and exciting result.

Challenges and Limitations

Each formula has a limit. The recursive formula is slow for large positions, because every earlier term must be found first. Binet’s formula needs very exact decimal values of phi and the square root of 5. If you round those numbers too early, say to 1.6 or 2.2, the answer drifts. For the 30th term, using phi as 1.6 instead of 1.618 gives a result that is wrong by more than a hundred thousand. Basic phone calculators also struggle with powers of long decimals, and a scientific calculator is needed.

The sum formula only works for the sum starting from the first term. If you need the sum of terms 5 to 10, you must subtract two sums: the sum up to F(10) minus the sum up to F(4). Finally, all these formulas apply to the standard sequence. If a question changes the starting values, for example 2 and 1 instead of 0 and 1, the rule is still addition, but the numbers and formulas change. For a gentler start, see our simple guide on Fibonacci examples for beginners.

Common Mistakes to Avoid

• Rounding phi too early. Keep at least six decimal places, 1.618034, when using Binet’s formula.
• Forgetting to round the final answer. Binet’s formula gives something like 55.0036, and the answer you write must be 55.
• Using the wrong index. F(10) means the term at position 10 when counting from F(0) = 0. A shifted count gives a neighbouring term.
• Dropping the minus one in the sum formula. The sum is F(n+2) – 1, not F(n+2).
• Mixing up F(n-1) and F(n-2). Since you add them, the order does not change the sum, but you must pick the correct two terms.
• Using the formula for negative or zero positions without care. Stick to whole positions starting from 0 unless your teacher says otherwise.

Best Practices When Using the Formulas

• Pick the right tool for the size. Use the recursive formula up to about F(20), and Binet’s formula beyond that.
• Verify with a second method. If Binet’s answer is 6765, check it against the last two terms in your table.
• Write each formula in words first. Saying add the two before it helps you avoid mistakes with the symbols.
• Keep a list of the early terms. The first fifteen terms, up to 610, cover most exam questions.
• Use full-precision constants. Store phi as 1.6180339887 on your scientific calculator, if it allows memory storage.
• Check the ratio. The ratio of two neighbouring terms should be close to 1.618 beyond the eighth term.

A Short Note on Indian History

The idea behind these formulas is old in India. Scholars who studied Sanskrit poetry, such as Pingala and later Hemachandra, wrote about the number of ways to arrange short and long syllables in a line, and the counts follow the same add-the-last-two rule. This is why many Indian teachers like to say that the sequence has Indian roots as well as European ones. It is a nice fact to include in a school project.

Conclusion

The Fibonacci formulas are three short ideas. The recursive formula adds the two previous terms. Binet’s formula uses the golden ratio to jump straight to a term. The sum formula gives a total as F(n+2) minus 1. Once you try them on examples, such as a donation drive in Jaipur or a bakery plan in Chennai, the symbols stop looking scary and start feeling like handy shortcuts. Practise with small positions first, check each answer with a second method, and use a tool for the big numbers.

FAQs

What is the formula for the Fibonacci sequence?
The formula is F(n) = F(n-1) + F(n-2), with F(0) = 0 and F(1) = 1. It means each term is the sum of the two terms before it. This is called the recursive formula.

What is Binet’s formula?
Binet’s formula is F(n) = (phi^n – psi^n) / square root of 5, where phi is about 1.618 and psi is about -0.618. It lets you find any Fibonacci number directly. You must round the final answer to the nearest whole number.

How is the Fibonacci sequence related to the golden ratio?
When you divide a Fibonacci number by the one before it, the answer gets closer to 1.618 as the numbers grow. That value is the golden ratio. It is also the main number inside Binet’s formula.

What is the sum of the first 10 Fibonacci numbers?
The sum of the first 10 terms, starting from F(1) = 1, is 143. You can find it with the formula F(12) – 1 = 144 – 1 = 143. You can also add them one by one to confirm it.

Why do we need two starting numbers?
The rule adds two earlier terms, so there must be two terms to begin with. Without F(0) and F(1), the formula has nothing to add. Changing the starting numbers gives a different sequence.