Maths Olympiad Prep

Library / /74 of 136

Geometry Difficulty 8.0 National Olympiad, round 2 Prove it Hong Kong

A rectangle with sides of integral lengths can be divided into two or more squares with sides of integral lengths and such that there is exactly one square with smallest side length. Determine the smallest possible area of the rectangle.

Solution

The smallest possible area is 3535.

Let aa be the length of the smallest square AA. If AA touches a side but not a corner, then it is surrounded by two larger squares BB and CC. Then there is a gap between BB and CC with length aa. It is not possible to place some larger squares in this gap, contradiction. Similarly, the smallest square cannot be placed at a corner.
Figure 1

The distance from AA to a side is at least a+1a+1. Therefore, each side has length at least
(a+1)×2+a=3a+25. (a+1) \times 2 + a = 3a + 2 \ge 5.

If both side lengths are at least 66, then the area is at least 3636. Thus, we may assume there is a side with length 55, and a=1a=1.
Since there is no square of side length 11 touching this side, either there is a 5×55 \times 5 square, or a 3×33 \times 3 and a 2×22 \times 2 squares touching this side. The former case can be ignored since we can remove such a 5×55 \times 5 square. Now, suppose there is a 3×33 \times 3 square BB and a 2×22 \times 2 square CC as shown. Then AA cannot be placed in the first 33 columns (or there is a gap of length 11). The same holds for the opposite side. Therefore, the other side length of the rectangle is at least 3+1+3=73+1+3=7. This shows the area is at least 5×7=355 \times 7 = 35.

An example of a 5×75 \times 7 rectangle is given below.
Figure 2

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.