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. /A tiler lays a triangle-shaped panel on a wall, one row at a time…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A tiler lays a triangle-shaped panel on a wall, one row at a time…

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.

A tiler lays a triangle-shaped panel on a wall, one row at a time. Row 111 has 222 tiles, row 222 has 666 tiles, row 333 has 101010 tiles, and in general row rrr has 4r−24r - 24r−2 tiles. The tiler claims that a panel of nnn rows always uses exactly 2n22n^22n2 tiles.

  1. Prove the claim by induction on nnn, for every n≥1n \ge 1n≥1.
  1. How many tiles does a panel of 252525 rows use?
  1. A box holds 800800800 tiles. How many rows use the whole box with nothing left over?

Write the base case, the inductive hypothesis, the step and the conclusion as separate lines.

Check your answer

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

Need a reminder? The key ideaShowHide

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.

Given. Row rrr has 4r−24r - 24r−2 tiles. Claim P(n)P(n)P(n): 2+6+⋯+(4n−2)=2n22 + 6 + \dots + (4n - 2) = 2n^22+6+⋯+(4n−2)=2n2.

Step 1. Base case. For n=1n = 1n=1 the panel has 222 tiles and 2×12=22 \times 1^2 = 22×12=2. So P(1)P(1)P(1) is true.

Step 2. Hypothesis. Assume P(k)P(k)P(k) for some k≥1k \ge 1k≥1: the first kkk rows use 2k22k^22k2 tiles.

Step 3. The step. Row k+1k + 1k+1 has 4k+24k + 24k+2 tiles. So k+1k + 1k+1 rows use 2k2+4k+2=2(k2+2k+1)=2(k+1)22k^2 + 4k + 2 = 2(k^2 + 2k + 1) = 2(k + 1)^22k2+4k+2=2(k2+2k+1)=2(k+1)2 tiles. This is P(k+1)P(k + 1)P(k+1).

Step 4. Conclusion. P(1)P(1)P(1) is true and P(k)P(k)P(k) implies P(k+1)P(k + 1)P(k+1) for every k≥1k \ge 1k≥1, so by induction P(n)P(n)P(n) is true for every n≥1n \ge 1n≥1.

Step 5. Part (b). 2×252=12502 \times 25^2 = 12502×252=1250 tiles.

Step 6. Part (c). 2n2=8002n^2 = 8002n2=800 gives n2=400n^2 = 400n2=400, so n=20n = 20n=20 rows.

Check. The first three rows use 2+6+10=18=2×322 + 6 + 10 = 18 = 2 \times 3^22+6+10=18=2×32 tiles, as the formula says.

Answer: (b) 125012501250 tiles; (c) 202020 rows.

Log in to save this for later
← All Problems
← Solve for 0° ≤ x ≤ 360°, giving angles to 1 decimal place…A surveyor measures the corner angles of plots of land shaped as convex polygons… →
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 →

To prove P(n)P(n)P(n) for every n≥n0n \ge n_0n≥n0​: check the base case P(n0)P(n_0)P(n0​); assume P(k)P(k)P(k) for some k≥n0k \ge n_0k≥n0​; show P(k+1)P(k + 1)P(k+1). Then write the conclusion: by induction, P(n)P(n)P(n) holds for every n≥n0n \ge n_0n≥n0​.