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
  • Earth and Environmental Science
  • 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 strip of 2 rows and n columns is covered with tiles, with no gaps and no overlaps…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalproofOlympiad

A strip of 2 rows and n columns is covered with tiles, with no gaps and no overlaps…

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 strip of 222 rows and nnn columns is covered with tiles, with no gaps and no overlaps. Two kinds of tile are allowed: a domino of 1×21 \times 21×2 cells, which may lie flat or stand upright, and a square of 2×22 \times 22×2 cells.

Let ana_nan​ be the number of coverings. Set up a recurrence by looking at the left end of the strip, and find a1a_1a1​ and a2a_2a2​. Then solve the recurrence with its characteristic equation, and find a10a_{10}a10​. Check your formula against the recurrence for small nnn.

Check your answer

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

Need a reminder? The key ideaShowHide

Name the count ana_nan​. Split on the first or the last step so that each case is a smaller copy of the same question. Check that the cases do not overlap and cover everything, then find the starting values by hand.

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.

Plan. Split on the tiles at the left end, then solve.

Step 1. The left end. An upright domino leaves a 2×(n−1)2 \times (n - 1)2×(n−1) strip. Two flat dominoes, one above the other, leave a 2×(n−2)2 \times (n - 2)2×(n−2) strip, and so does a square. So an=an−1+2an−2a_n = a_{n-1} + 2a_{n-2}an​=an−1​+2an−2​.

Step 2. Starting values. a1=1a_1 = 1a1​=1 (one upright domino). a2=3a_2 = 3a2​=3 (two upright, two flat, or a square). It helps to put a0=1a_0 = 1a0​=1, which fits a2=a1+2a0a_2 = a_1 + 2a_0a2​=a1​+2a0​.

Step 3. Solve. x2=x+2x^2 = x + 2x2=x+2 gives the roots 222 and −1-1−1, so an=A⋅2n+B(−1)na_n = A \cdot 2^n + B(-1)^nan​=A⋅2n+B(−1)n. From a0=1a_0 = 1a0​=1 and a1=1a_1 = 1a1​=1: A+B=1A + B = 1A+B=1 and 2A−B=12A - B = 12A−B=1, so A=23A = \dfrac{2}{3}A=32​ and B=13B = \dfrac{1}{3}B=31​. Hence an=2n+1+(−1)n3a_n = \dfrac{2^{n+1} + (-1)^n}{3}an​=32n+1+(−1)n​.

Step 4. Check. The formula gives a2=8+13=3a_2 = \dfrac{8 + 1}{3} = 3a2​=38+1​=3 and a3=16−13=5a_3 = \dfrac{16 - 1}{3} = 5a3​=316−1​=5, and the recurrence gives 3+2=53 + 2 = 53+2=5.

Step 5. The answer. a10=211+13=20493=683a_{10} = \dfrac{2^{11} + 1}{3} = \dfrac{2049}{3} = 683a10​=3211+1​=32049​=683.

Answer: 683683683 coverings.

Log in to save this for later
← All Problems
← A sensor sends signals as strings of the digits 0 and 1…A sequence starts with a₀ = 2 and a₁ = 5, and every later term follows the rule an = 5a_(n-1)… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Setting up a recurrenceRecurrences and Counting by Recursion

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →