Maths Olympiad Prep

Library / /17 of 20

Combinatorics Difficulty 5.4 AIME, harder Prove it United States

Problem:

Define an nn-staircase to be the union of all squares of an n×nn \times n grid lying on or below its main diagonal. How many ways are there to divide a 10-staircase into 10 rectangles, each having a side of length 1? (Reflections are not included.)

Solution

Solution:

A 10-staircase has 10 "upper right corners" PP, each of which must be the upper right corner of some rectangle, and no two of which can belong to the same rectangle. It also has a single lower left corner QQ which must belong to the same rectangle as one of the ten points PP. Since this rectangle has one side of length 1, it must be a 10×110 \times 1 rectangle placed either vertically or horizontally along the long side of the staircase. The remainder of the figure is then a 9-staircase to be filled with 9 rectangles.

We can then repeat the argument to find that one of the long sides of the 9-staircase must be filled by a 9×19 \times 1 rectangle, leaving an 8-staircase. This continues until we reach the 1-staircase, a single square, which can be filled in only one way.

Figure 1

The placement of the 10×110 \times 1 rectangle is irrelevant because of the symmetry of the shape. But the 9×19 \times 1 through 2×12 \times 1 rectangles each involve a choice between two alternatives, so the number of tilings is 28=2562^{8} = 256.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.