Maths Olympiad Prep

Library / Ukrainian National Mathematical Olympiad, 4th Round /16 of 20

Ukrainian National Mathematical Olympiad, 4th Round

Geometry Difficulty 5.9 AIME, harder Prove it Ukraine

One corner cell is removed from a 2011×20112011 \times 2011 square. Is it possible to cut the obtained figure along the lines of the grid into less than 121121 squares?

Solution

We will write a→xa \to x, if an a×aa \times a square without one corner cell can be cut along the lines of the grid into xx squares.

Evidently, 2→32 \to 3. Also note that 7→87 \to 8 and 9→99 \to 9 (fig. 24 and 25). We will show that if a→xa \to x and b→yb \to y, then ab→x+yab \to x+y. Indeed, a square with the side length abab without a corner cell can be cut into two parts: a square with the side length bb without a corner cell, and a square with the side length abab, with a b×bb \times b square removed from its corner. The first part can be cut into yy squares, and the second part can be cut into xx squares, since it is a square with the side length aa without a corner, magnified by a factor of bb. So,
a→x⇒2a→x+3.(∗) a \to x \Rightarrow 2a \to x+3. \quad (*)
We will also show that
a→x⇒2a−1→2x+2.(∗∗) a \to x \Rightarrow 2a-1 \to 2x+2. \quad (**)
Indeed, an "incomplete" square can be partitioned into 2 squares with the side length a−1a-1 and 2 "incomplete" squares with the side length aa (fig. 26).
So: 7→87 \to 8, 9→99 \to 9, 63→1763 \to 17, 126→20126 \to 20, 252→23252 \to 23, 503→48503 \to 48, 1006→511006 \to 51, 2011→1042011 \to 104, i.e., we have shown that our original figure can be cut into 104<121104 < 121 squares.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.