# Cover-up

Two squares have been removed from this 8Ã—7 rectangle. Can the remaining 54 squares be tiled orthogonally with 18 3Ã—1 tiles? Check in for the answer tomorrow!

### 3 thoughts on “Cover-up”

1. Charon l'Cypher

Nope.

Let us mark diagonals by 1, 2, 3, 1, 2, 3,… So, the original table is
12312312
31231231
23123123
12312312
31231231
23123123
12312312
Not that, however you put a 3×1 tile, it will cover exactly one “1”, one “2”, and one “3”, which means that a necessary condition to be able to do such tiling is to have exactly the same number of all of the three. Also, we have 19 “1”s, 19 “2”s, and 18 “3”s.

But, when we remove the two tiles, we remove two “2”s, so we end up with uneven number of these tiles, so the tiling is not possible.

Had we removed two opposite corners, the tiling would be, quite obviously, possible.

2. Charon beat me to it, but yes. This is a classic introductory combinatorics problem. I hadn’t done it with 3×1’s yet, but the proof is the same as in the 2×1 case. What gets more exciting is as you go away from dominos, trinimos, etc., to more interesting tetris-like pieces.