HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /The Fibonacci numbers are 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … (here we list each value once…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

The Fibonacci numbers are 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … (here we list each value once…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

The Fibonacci numbers are 1,2,3,5,8,13,21,34,55,89,…1, 2, 3, 5, 8, 13, 21, 34, 55, 89, \dots1,2,3,5,8,13,21,34,55,89,… (here we list each value once, starting at 1,21, 21,2). A theorem says: every whole number n≥1n \ge 1n≥1 is a sum of distinct Fibonacci numbers, no two of them next to each other in the list. For example 20=13+5+220 = 13 + 5 + 220=13+5+2.

  1. Prove the theorem by strong induction. Let FFF be the largest Fibonacci number that is at most nnn, and let F′F'F′ be the one before it. Show that n−F<F′n - F < F'n−F<F′. Explain why this means the representation of n−Fn - Fn−F cannot use F′F'F′.
  1. Find such a representation of 100100100, by always taking the largest Fibonacci number that fits. How many terms does it have?
  1. Do the same for 202620262026. What is its largest term, and how many terms does it have?

State the base case and say where the hypothesis about smaller numbers is used.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key idea

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Base case. n=1n = 1n=1 is itself a Fibonacci number.

Step 2. Hypothesis. Assume every number from 111 to n−1n - 1n−1 has such a representation.

Step 3. The largest piece. If nnn is a Fibonacci number, we are done. If not, let FFF be the largest Fibonacci number below nnn, and F′F'F′ the one before it. The next one after FFF is F+F′F + F'F+F′, and it is bigger than nnn. So n−F<F′n - F < F'n−F<F′.

Step 4. Use the hypothesis. n−Fn - Fn−F is between 111 and n−1n - 1n−1, so it has a representation. Every term of it is at most n−F<F′n - F < F'n−F<F′, so it uses neither F′F'F′ nor FFF. Adding FFF gives distinct terms, none next to each other. By strong induction, every n≥1n \ge 1n≥1 has a representation.

Step 5. Part (b). 100=89+11=89+8+3100 = 89 + 11 = 89 + 8 + 3100=89+11=89+8+3. That is 333 terms.

Step 6. Part (c). The largest Fibonacci number up to 202620262026 is 159715971597. Then 429=377+52429 = 377 + 52429=377+52, 52=34+1852 = 34 + 1852=34+18, 18=13+518 = 13 + 518=13+5. So 2026=1597+377+34+13+52026 = 1597 + 377 + 34 + 13 + 52026=1597+377+34+13+5, with 555 terms.

Answer: 100100100 needs 333 terms; 202620262026 has largest term 159715971597 and 555 terms.

Log in to save this for later
← All Problems
← A games arcade sells tokens worth 4 points and 7 points…A pile of n stones sits on a table. A player splits any pile with more than one stone into two… →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…Advanced
  2. A designer draws n straight lines across a large sheet, no two parallel and no three through one…Advanced
  3. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  4. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  5. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
All problems on this topic →
Show
Hide

Strong induction: assume P(n0),…,P(k)P(n_0), \dots, P(k)P(n0​),…,P(k) and prove P(k+1)P(k + 1)P(k+1). A step that goes back rrr places needs rrr base cases. Well-ordering: every non-empty set of positive integers has a least element.