On this page
Most students know the Fibonacci sequence from posters of sunflowers and seashells. Far fewer know that it is a small exercise in a big book whose real purpose was to teach Europe to calculate with the numerals you use every day, numerals that came from India. This post covers who Fibonacci was, what the Liber Abaci did, how the rabbit problem works, and how to use the sequence in exam-style problems.
Who was Fibonacci?
According to the MacTutor biography of Fibonacci from the University of St Andrews, Leonardo of Pisa was probably born in 1170 and possibly died in 1250. "Fibonacci" was a nickname; he was a member of the Bonacci family. His father represented the merchants of Pisa at Bugia, now Bejaia in Algeria, and brought his son there to study accounting.
MacTutor quotes Fibonacci's own account from the Liber Abaci. He writes that there he "had been introduced to the art of the Indians' nine symbols through remarkable teaching", and that knowledge of the art "very soon pleased me above all else". He travelled widely, comparing methods across the Mediterranean, and returned to Pisa around 1200. In 1240 the Republic of Pisa awarded him a salary for advising on accounting and teaching its citizens.
What did the Liber Abaci do?
The Liber Abaci, or Book of the Abacus, appeared in 1202, with a second edition in 1228. MacTutor says it "introduced the Hindu-Arabic place-valued decimal system and the use of Arabic numerals into Europe". A large part is practical: prices, profit, currency conversion, and problems that had come from Arab and Chinese sources. A full English translation by Laurence Sigler, Fibonacci's Liber Abaci (Springer, 2002), lets you read it today.
Why did place value matter so much? Try adding MDCCLXXXIX and CDXLIV in Roman numerals without converting. In place value, 1,789 + 444 = 2,233 is routine column addition, because each position carries ten times the value of the one to its right, and zero holds empty places.
How does the rabbit problem work?
MacTutor gives the problem as it appears in the third section of the book: a pair of rabbits is placed in a walled area. Every month each pair produces a new pair, which becomes productive from its second month. How many pairs are there after a year?
Worked example. Count the pairs at the start of each month. Adult pairs breed; new pairs wait a month.
Month 1: 1 pair (newborn).
Month 2: 1 pair (now adult).
Month 3: 2 pairs (the adult pair has produced one).
Month 4: 3 pairs (the original pair breeds again; the first young pair grows up).
Month 5: 5 pairs.
Each month's total = last month's total + the number of adult pairs, and the adults are exactly the pairs that existed two months earlier. So the rule is Fₙ = Fₙ₋₁ + Fₙ₋₂, giving 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377. MacTutor notes that Fibonacci himself began his list without the first 1. So the answer to "how many after a year" depends on whether the first pair starts as newborns or as adults, which is exactly the indexing trap described below.
Did Fibonacci discover the sequence?
No. Historians have traced the same numbers in Indian work. The paper by Parmanand Singh (1985) in Historia Mathematica90021-7) is titled "The so-called Fibonacci numbers in ancient and medieval India", and the title makes the point: the name is a European label for numbers already known in India.
One counting problem that produces them: in how many ways can you fill n beats with short sounds worth 1 beat and long sounds worth 2? For 4 beats the patterns are 1111, 112, 121, 211 and 22, which is 5 ways. For 5 beats, any pattern starts with a 1 (leaving 4 beats, 5 ways) or a 2 (leaving 3 beats, 3 ways), so 5 + 3 = 8. Our post on Pingala and binary patterns explores this Indian tradition of counting.
How do Fibonacci numbers show up in JEE-style problems?
They are a gentle way into recurrence relations and sequences. Three results worth proving yourself:
Sum of the first n terms is Fₙ₊₂ − 1. Check: 1 + 1 + 2 + 3 + 5 + 8 = 20, and F₈ − 1 = 21 − 1 = 20.
The ratio approaches the golden ratio. 377 ÷ 233 ≈ 1.61803. Put Fₙ₊₁ ÷ Fₙ → x in the recurrence and you get x = 1 + 1/x, so x² − x − 1 = 0 and x = (1 + √5) ÷ 2 ≈ 1.618.
Consecutive terms share no common factor. If d divided both Fₙ and Fₙ₊₁, it would divide their difference Fₙ₋₁, and so on down to F₁ = 1.
Common mistakes:
Indexing errors. Decide whether F₁ = 1 or F₀ = 0 and stick to it. Many wrong answers to "find F₁₀" come from mixing conventions.
Claiming every spiral is Fibonacci. Seed heads often fit, but plenty of natural patterns do not. Count before you claim.
Our guide to sequences and series for JEE covers the arithmetic and geometric progressions that sit alongside recurrences.
What can a student take from Fibonacci?
Learn good methods wherever they come from. Fibonacci learned Indian numerals in North Africa and carried them to Europe.
Write for use. His book succeeded because merchants could apply it.
Credit sources accurately. The sequence carries his name, but the history is wider.
A practice routine for the week: prove the sum formula by induction, find F₂₀ by hand, and solve the beats problem for 7 beats. If you get stuck setting up a recurrence, the Fermi Problem Library has a step-by-step solver that explains the reasoning rather than printing an answer.
Next step: write the first fifteen Fibonacci numbers and divide each by the one before it, and watch the ratio settle near 1.618.
