Olympiad Maths Prep

Track / Stage 7 / 86 of 300 #1486 of 2000

Problem 1486

National olympiad second round; IMO P1/P4
Geometry Difficulty 7.1 Prove it

A rectangle R\mathcal{R} with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of R\mathcal{R} are either all odd or all even.

[i]Proposed by Jeck Lim, Singapore[/i]

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Let the dimensions of the rectangle R\mathcal{R} be m×nm \times n, where both mm and nn are odd integers.
2. Consider a coordinate system where the bottom-left corner of R\mathcal{R} is at (0,0)(0,0), the bottom-right corner is at (m,0)(m,0), the top-left corner is at (0,n)(0,n), and the top-right corner is at (m,n)(m,n).
3. We will use a chessboard coloring argument. Color the rectangle R\mathcal{R} like a chessboard, where the bottom-left corner (0,0)(0,0) is colored black.
4. Since mm and nn are odd, the coloring will ensure that the four corners of R\mathcal{R} are all black.
5. Now, consider any small rectangle within R\mathcal{R} with integer side lengths. Let the coordinates of the bottom-left corner of this small rectangle be (x1,y1)(x_1, y_1) and the top-right corner be (x2,y2)(x_2, y_2).
6. The distances from the four sides of R\mathcal{R} to this small rectangle are:
- Distance to the left side: x1x_1
- Distance to the right side: mx2m - x_2
- Distance to the bottom side: y1y_1
- Distance to the top side: ny2n - y_2
7. We need to show that at least one of these small rectangles has all four distances either all odd or all even.
8. Observe that the coloring of the chessboard ensures that any small rectangle with integer side lengths will have its corners either all on black squares or all on white squares.
9. If the small rectangle has its corners on black squares, then both x1x_1 and y1y_1 are even, and both x2x_2 and y2y_2 are odd (since mm and nn are odd).
10. Therefore, the distances:
- x1x_1 (even)
- mx2m - x_2 (even, since mm is odd and x2x_2 is odd)
- y1y_1 (even)
- ny2n - y_2 (even, since nn is odd and y2y_2 is odd)
11. If the small rectangle has its corners on white squares, then both x1x_1 and y1y_1 are odd, and both x2x_2 and y2y_2 are even.
12. Therefore, the distances:
- x1x_1 (odd)
- mx2m - x_2 (odd, since mm is odd and x2x_2 is even)
- y1y_1 (odd)
- ny2n - y_2 (odd, since nn is odd and y2y_2 is even)
13. In both cases, we have shown that there exists at least one small rectangle within R\mathcal{R} whose distances from the four sides of R\mathcal{R} are either all odd or all even.

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.