Maths Olympiad Prep

Track / Stage 7 / 273 of 300 #1673 of 1964

Problem 1673

National Olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.5 Prove it Auswahlklausur · Germany

A rectangle R\mathcal{R} with odd integer side lengths is divided into rectangles that all have integer side lengths. Prove that for at least one of these rectangles, the distances to each of the four sides of R\mathcal{R} are all even or all odd.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

We subdivide R\mathcal{R} into unit squares and color some of these unit squares red or blue, according to the following illustration.

Figure 1

Since R\mathcal{R} has odd side lengths by assumption, all four corner squares of R\mathcal{R} are colored blue, and there are in total more colored than uncolored squares. Thus at least one of the rectangles R1,,Rk\mathcal{R}_{1}, \ldots, \mathcal{R}_{k} into which R\mathcal{R} was divided also contains more colored than uncolored squares; let Ri\mathcal{R}_{i} be such a rectangle. Then Ri\mathcal{R}_{i} has odd side lengths and all four corner squares of Ri\mathcal{R}_{i} are colored. It follows that all four corner squares of Ri\mathcal{R}_{i} must carry the same color. If they are blue, then Ri\mathcal{R}_{i} has even distances to all four sides of R\mathcal{R}; if they are red, then Ri\mathcal{R}_{i} has odd distances to all four sides of R\mathcal{R}. In either case, Ri\mathcal{R}_{i} satisfies the required condition.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from de; metadata (topic, difficulty, ordering) added by this project.