Maths Olympiad Prep

Library / /527 of 860

Combinatorics Difficulty 5.2 AIME, harder Find the answer

Compute the number of ways to tile a 3×53 \times 5 rectangle with one 1×11 \times 1 tile, one 1×21 \times 2 tile, one 1×31 \times 3 tile, one 1×41 \times 4 tile, and one 1×51 \times 5 tile. (The tiles can be rotated, and tilings that differ by rotation or reflection are considered distinct.)

A number or a short expression. Spacing and $ signs are ignored.

Solution

Our strategy is to first place the 1×51 \times 5 and the 1×41 \times 4 tiles since their size restricts their location. We have three cases: - Case 1: first row. There are 4 ways to place the 1×41 \times 4 tile. There is an empty cell next to the 1×41 \times 4 tile, which can either be occupied by the 1×11 \times 1 tile or the 1×21 \times 2 tile (see diagram). In both cases, there are 2 ways to place the remaining two tiles, so this gives 422=164 \cdot 2 \cdot 2=16 ways. - Case 2: middle row. There are 4 ways to place the 1×41 \times 4 tile, and the 1×11 \times 1 tile must go next to it. There are 2 ways to place the remaining two tiles, so this gives 42=84 \cdot 2=8 ways. - Case 3: bottom row. This is the same as Case 1 up to rotation, so there are also 16 ways to place the tiles here. In total, we have 16+8+16=4016+8+16=40 ways to place the tiles.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.