Tiling a 2x7 Grid with 1x1 and 1x2 Tiles: Finding the Number of Tilings

In summary: You should get a1 = 1, b1 = 1, and c1 = 0. Using the recurrence relation, we can find the number of tilings for a 2 x 7 grid by finding a7 + b7 + c7. This can be done by starting with n = 1 and using the recurrence relations to find the values for a2, b2, and c2. Then, we can continue this process until we reach n = 7. In summary, there are a total of 53 tilings for a 2 x 7 grid using 1 x 1 and 1 x 2 tiles, where the two rightmost squares are occupied by singletons.
  • #1
BrownianMan
134
0
[tex]\textup{A 2 x 7 rectangle has tiling with 1 x 1 and 1 x 2 tiles (singletons and doubletons).}[/tex]
[tex]\textup{How many such tilings of a 2 x 7 grid are there?}[/tex]

[tex]\textup{Let }a_{n}\textup{ be the number of tilings of a 2 x n grid using 1 x 1 and 1 x 2 tiles so that the}[/tex]
[tex]\textup{two rightmost squares are occupied by singletons, let }b_{n}\textup{ be the number of tilings}[/tex]
[tex]\textup{ with one singleton and one doubleton in the rightmost squares, and let }c_{n}\textup{ be the}[/tex]
[tex]\textup{ number of other tilings (two horizontal doubletons or one vertical doubleton). The}[/tex]
[tex]\textup{problem asks for }a_{7}+b_{7}+c_{7}. \textup{ When one appends another column to the right side,}[/tex]
[tex]\textup{forming a 2 x (n + 1) grid, either one can add 2 singletons or a vertical doubleton, or}[/tex]
[tex]\textup{one can change any singletons in the nth column to doubletons. This yields:}[/tex]

[tex]a_{n+1}=a_{n}+b_{n}+c_{n}[/tex]
[tex]b_{n+1}=2a_{n}+b_{n}[/tex]
[tex]c_{n+1}=2a_{n}+b_{n}+c_{n}[/tex]

***doubletons may be placed vertically or horizontally.

Use the recurrence relations to obtain a numerical answer to the problem.

Not sure how do start this. Any help?
 
Physics news on Phys.org
  • #2
Consider the case where n=1. Just count the different ways you can tile the grid to figure out a1, b1, and c1.
 

1. How many different ways can a 2x7 grid be tiled with 1x1 and 1x2 tiles?

The number of ways a 2x7 grid can be tiled with 1x1 and 1x2 tiles is 21.

2. Can a 2x7 grid be tiled with only 1x1 tiles?

No, a 2x7 grid cannot be tiled with only 1x1 tiles because the grid has 14 squares, which is an even number and cannot be divided evenly by the size of the 1x1 tile.

3. How many 1x2 tiles are needed to tile a 2x7 grid?

Seven 1x2 tiles are needed to tile a 2x7 grid.

4. Is there a mathematical formula for determining the number of tilings in a 2x7 grid?

Yes, the number of tilings in a 2x7 grid can be calculated using the Fibonacci sequence. The formula is F(n+1), where n is the length of the grid. In this case, F(8) = 21.

5. Can a 2x7 grid be tiled with only 1x2 tiles?

Yes, a 2x7 grid can be tiled with only 1x2 tiles. In fact, this is the only way to fully tile the grid without any empty spaces. However, the number of possible tilings will be less than if 1x1 tiles are also used.

Similar threads

  • Calculus and Beyond Homework Help
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
Replies
1
Views
1K
  • Programming and Computer Science
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
32
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
813
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
2K
Back
Top