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. /An L-shaped piece covers three squares: two side by side and one more next to one of them…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

An L-shaped piece covers three squares: two side by side and one more next to one of them…

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.

An L-shaped piece covers three squares: two side by side and one more next to one of them. A 2n×2n2^n \times 2^n2n×2n board has one square removed, anywhere on the board.

  1. Prove by induction on nnn that the rest of the board can always be covered by L-shaped pieces with no overlaps and no gaps. In the step, cut the board into four quarters and explain where to place one piece.
  1. How many pieces are needed for a 16×1616 \times 1616×16 board with one square removed?
  1. Show that 4n−14^n - 14n−1 is always divisible by 333. Use induction or a factorisation.
  1. Can a 6×66 \times 66×6 board with one square removed be covered in this way? Use (c) or count squares.

Draw the four quarters in words: which quarter holds the removed square, and which squares the middle piece covers.

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. Base case. For n=1n = 1n=1, a 2×22 \times 22×2 board with one square removed is exactly one L-shaped piece.

Step 2. Hypothesis. Assume every 2k×2k2^k \times 2^k2k×2k board with one square removed can be covered.

Step 3. The step. Take a 2k+1×2k+12^{k + 1} \times 2^{k + 1}2k+1×2k+1 board with one square removed and cut it into four 2k×2k2^k \times 2^k2k×2k quarters. One quarter holds the removed square. The four squares at the centre of the board belong one to each quarter. Place one L-shaped piece on the three centre squares that lie in the other three quarters.

Step 4. Use the hypothesis. Each quarter now has exactly one square that is taken: the removed square, or a square of the middle piece. By the hypothesis each quarter can be covered. Together with the middle piece, the whole board is covered.

Step 5. Part (b). 256−13=85\dfrac{256 - 1}{3} = 853256−1​=85 pieces.

Step 6. Part (c). 4n−1=(4−1)(4n−1+⋯+1)4^n - 1 = (4 - 1)(4^{n - 1} + \dots + 1)4n−1=(4−1)(4n−1+⋯+1), a multiple of 333. By induction: 4k+1−1=4(4k−1)+34^{k + 1} - 1 = 4(4^k - 1) + 34k+1−1=4(4k−1)+3.

Step 7. Part (d). 36−1=3536 - 1 = 3536−1=35 squares, and 353535 is not a multiple of 333. So no covering exists.

Answer: 858585 pieces for the 16×1616 \times 1616×16 board.

Log in to save this for later
← All Problems
← A student puts n points on a circle and joins every pair by a straight chord, choosing the points…A designer draws n straight lines across a large sheet, no two parallel and no three through one… →
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. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  4. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
  5. A student claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.…Hard
All problems on this topic →
Hide

Split the problem so that a smaller copy appears: four quarter boards, one line fewer, one disc fewer. Count what one more piece adds. If the step fails, prove a stronger statement or induct on a different quantity.