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 shop builds a display of cans in layers…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A shop builds a display of cans in layers…

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 shop builds a display of cans in layers. The top layer is a rectangle of 111 by 222 cans. The next layer down is 222 by 333 cans, then 333 by 444, and in general layer rrr (counted from the top) is a rectangle of rrr by r+1r + 1r+1 cans.

  1. Prove by induction that a display of nnn layers holds
1×2+2×3+⋯+n(n+1)=n(n+1)(n+2)3\displaystyle 1 \times 2 + 2 \times 3 + \dots + n(n + 1) = \dfrac{n(n + 1)(n + 2)}{3}1×2+2×3+⋯+n(n+1)=3n(n+1)(n+2)​

cans, for every n≥1n \ge 1n≥1.

  1. How many cans are in a display of 121212 layers?
  1. The shop has 150015001500 cans. What is the largest number of complete layers it can build?

In the step, take out the common factor before you expand anything. Give the final algebra line that matches the formula with n=k+1n = k + 1n=k+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.

Given. Layer rrr holds r(r+1)r(r + 1)r(r+1) cans.

Step 1. Base case. For n=1n = 1n=1: 1×2=21 \times 2 = 21×2=2 and 1×2×33=2\dfrac{1 \times 2 \times 3}{3} = 231×2×3​=2. True.

Step 2. Hypothesis. Assume the first kkk layers hold k(k+1)(k+2)3\dfrac{k(k + 1)(k + 2)}{3}3k(k+1)(k+2)​ cans.

Step 3. The step. Add layer k+1k + 1k+1, which holds (k+1)(k+2)(k + 1)(k + 2)(k+1)(k+2) cans:

k(k+1)(k+2)3+(k+1)(k+2)=(k+1)(k+2)(k+3)3.\displaystyle \dfrac{k(k + 1)(k + 2)}{3} + (k + 1)(k + 2) = \dfrac{(k + 1)(k + 2)(k + 3)}{3}.3k(k+1)(k+2)​+(k+1)(k+2)=3(k+1)(k+2)(k+3)​.

This is the formula with n=k+1n = k + 1n=k+1.

Step 4. Conclusion. By induction the formula holds for every n≥1n \ge 1n≥1.

Step 5. Part (b). 12×13×143=728\dfrac{12 \times 13 \times 14}{3} = 728312×13×14​=728 cans.

Step 6. Part (c). The total grows with nnn. For n=15n = 15n=15 it is 15×16×173=1360\dfrac{15 \times 16 \times 17}{3} = 1360315×16×17​=1360, and for n=16n = 16n=16 it is 16×17×183=1632\dfrac{16 \times 17 \times 18}{3} = 1632316×17×18​=1632, which is more than 150015001500. So 151515 complete layers.

Check. The program prints the sum and the formula side by side for n=1n = 1n=1 to 151515.

Answer: (b) 728728728 cans; (c) 151515 layers.

Log in to save this for later
← All Problems
← A surveyor measures the corner angles of plots of land shaped as convex polygons…A student builds towers of small cubes. Tower r is a solid cube with edge r cubes, so it uses r³… →
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

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​.