## Round 4: Problem 5 Solution

This is a nice tiling problem in disguise. Let’s ignore the letters and symbols for now and just work with a blank 5×8 board. The 3×1 rectangular pieces are like straight triominoes that we will use to try to tile the board.

Essentially, our problem now is the following: with 13 triomino(e)s, how many different places can we place a monomino on a 5×8 board.

Tricolor the board as shown. Note that we now have 13 red squares, 13 yellow squares, but 14 black squares. Therefore, the monomino must be placed on one of the black squares. However, the monomino cannot be placed on just any black square. A monomino can only be placed on a black square if there is no way to flip our coloring so that the square in our original coloring is no longer black. Flipping the coloring disqualifies every black square besides those 2 on the third row.

We can verify that in fact we may place a monomino on either of these two squares by showing a tiling (try it, it’s trivial). Therefore we conclude that a monomino can only appear on one of these 2 squares. Plugging in these 2 black squares into the original board / cake, we see that on these two squares are the **‘2’** and the **‘9’** of ‘2009.’ These are the only two possible remaining pieces.

But you still need to show the configuration where the 2 or the 9 is the monomino

mathguyApril 27, 2009 at 00:19

True, though

“We can verify that in fact we may place a monomino on either of these two squares by showing a tiling (try it, itâ€™s trivial).”

was me saying that yes you need to find the configuration but as long as you don’t do anything terribly unintelligent you’ll see its very easy to do.

AdministratorMay 2, 2009 at 22:25