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. /Squares with sides 1, 1, 2, 3, 5, 8, … (the Fibonacci numbers F₁, F₂, …) are placed one after…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

Squares with sides 1, 1, 2, 3, 5, 8, … (the Fibonacci numbers F₁, F₂, …) are placed one after…

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.

Squares with sides 1,1,2,3,5,8,…1, 1, 2, 3, 5, 8, \dots1,1,2,3,5,8,… (the Fibonacci numbers F1,F2,…F_1, F_2, \dotsF1​,F2​,…) are placed one after another, each new square along the longer side of the rectangle built so far. After nnn squares the shape is a rectangle of FnF_nFn​ by Fn+1F_{n + 1}Fn+1​.

  1. Use the areas to explain why F12+F22+⋯+Fn2=FnFn+1F_1^2 + F_2^2 + \dots + F_n^2 = F_n F_{n + 1}F12​+F22​+⋯+Fn2​=Fn​Fn+1​.
  1. Prove this identity by induction, without the picture.
  1. Find F12+F22+⋯+F122F_1^2 + F_2^2 + \dots + F_{12}^2F12​+F22​+⋯+F122​.
  1. Use the identity twice to find F82+F92+F102F_8^2 + F_9^2 + F_{10}^2F82​+F92​+F102​, without adding the three squares directly.

Recall that F1=F2=1F_1 = F_2 = 1F1​=F2​=1 and Fn+1=Fn+Fn−1F_{n + 1} = F_n + F_{n - 1}Fn+1​=Fn​+Fn−1​.

Check your answer

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

Need a reminder? The key ideaShow

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. Part (a). The squares fill the rectangle with no gaps and no overlaps. The total area of the squares is F12+⋯+Fn2F_1^2 + \dots + F_n^2F12​+⋯+Fn2​, and the area of the rectangle is FnFn+1F_n F_{n + 1}Fn​Fn+1​.

Step 2. Base case. For n=1n = 1n=1: F12=1=F1F2F_1^2 = 1 = F_1F_2F12​=1=F1​F2​.

Step 3. The step. Assume the sum up to kkk is FkFk+1F_kF_{k + 1}Fk​Fk+1​. Add Fk+12F_{k + 1}^2Fk+12​:

FkFk+1+Fk+12=Fk+1(Fk+Fk+1)=Fk+1Fk+2.\displaystyle F_kF_{k + 1} + F_{k + 1}^2 = F_{k + 1}(F_k + F_{k + 1}) = F_{k + 1}F_{k + 2}.Fk​Fk+1​+Fk+12​=Fk+1​(Fk​+Fk+1​)=Fk+1​Fk+2​.

By induction the identity holds for every n≥1n \ge 1n≥1.

Step 4. Part (c). F12F13=144×233=33552F_{12}F_{13} = 144 \times 233 = 33552F12​F13​=144×233=33552.

Step 5. Part (d). The sum up to 101010 is F10F11=55×89=4895F_{10}F_{11} = 55 \times 89 = 4895F10​F11​=55×89=4895. The sum up to 777 is F7F8=13×21=273F_7F_8 = 13 \times 21 = 273F7​F8​=13×21=273. Subtracting leaves the squares from F82F_8^2F82​ to F102F_{10}^2F102​: 4895−273=46224895 - 273 = 46224895−273=4622.

Check. 212+342+552=441+1156+3025=462221^2 + 34^2 + 55^2 = 441 + 1156 + 3025 = 4622212+342+552=441+1156+3025=4622.

Answer: (c) 335523355233552; (d) 462246224622.

Log in to save this for later
← All Problems
← A bacteria count in a culture follows a simple model…A sequence is defined by a₁ = 1 and a_(n + 1) = √(6 + an)… →
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 →
Hide

For a recursion, list terms, guess a closed formula and prove it by induction. A rule that uses two earlier terms needs two base cases. To show a sequence is increasing and bounded, prove each fact by induction.