Maths Olympiad Prep

Library / /22 of 32

, 2010

Combinatorics Difficulty 5.9 AIME, harder Prove it Estonia

A unit L-shape consists of three unit squares as shown in the picture. Prove that for any positive integer kk it is possible to cut a similar L-shape with kk times larger side lengths into unit L-shapes.

Figure 1

Solution

Let the L-shape be placed so that the two longer sides meet at the top left corner. Starting from the top left we place on it kk unit L-shapes diagonally with the same orientation as the large L-shape (Fig. 12). The rest consists of two equal staircase-like parts; it is enough to show that one of them, e.g. the lower part, can be covered. The staircase has kk stairs, the lowest one at the height k1k-1 and the highest at the height 2k22k-2.

In case k=1k=1 the staircase is empty, in case k=2k=2 it can be covered with one unit L-shape. Assume that the claim holds for the staircase with kk stairs and consider the staircase with k+2k+2 stairs. Separate a strip of width 2 from the left and bottom. The rest can be covered by the induction assumption. The topmost part of the strip is covered with one unit L-shape. Now we have

Figure 2
Fig. 12
Figure 3
Fig. 13
Figure 4
Fig. 14
Figure 5
Fig. 15

to cover the rest of the strip whose lower and left sides have correspondingly the lengths k+2k+2 and 2k2k.

* If kk is divisible by 3, then cut the figure into two strips of sizes 2×2k2 \times 2k and k×2k \times 2 and cover both of them with 2×32 \times 3 rectangles consisting of two unit L-shapes (Fig. 13) and we are done.
* If k1(mod3)k \equiv 1 \pmod{3}, then cut the figure into two strips of sizes 2×(2k2)2 \times (2k-2) and (k+2)×2(k+2) \times 2 and cover both of them with 2×32 \times 3 rectangles (Fig. 14). This is possible because 2k22k-2 and k+2k+2 are divisible by 3.
* If k2(mod3)k \equiv 2 \pmod{3}, then cut the figure into two strips of sizes 2×(2k4)2 \times (2k-4) and (k2)×2(k-2) \times 2, and a corner part, which is a L-shape with k=2k=2. Both strips can be covered by 2×32 \times 3 rectangles since 2k42k-4 and k2k-2 are divisible by 3; the corner part can be covered by induction basis (Fig. 15).

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.