Skip to main content
OlympiadHQ

Browse · MathNet

Print

NMO Selection Tests for the Balkan and International Mathematical Olympiads

Romania geometry

Problem

Let be an integer number greater than or equal to , and let be a closed convex set of area greater than or equal to , contained in the open square . Prove that contains some point of the integral lattice .
Solution
Transform by a suitable two-step Steiner-Edler symmetrization. First, perform a horizontal translation of each slice to place it symmetrically about the vertical line . It is readily checked that the image of under this transformation is a closed convex subset of the open square , symmetrical about the vertical line , and . (Also, the transformation does not increase perimeters, a fact which will not be used in the sequel.) In addition, if contains no lattice point, so does . Indeed, if contained one such, say , then the line would intersect in a closed line segment of length at least , so it would also intersect in a closed line segment of the same length; the latter, in turn, would contain at least one lattice point – a contradiction.

Next, apply the pattern vertically to further symmetrize about the horizontal line . The resulting image is a closed convex subset of the open square , symmetrical about both lines and – whence centrally symmetric about the point – and of course . Then if contains no lattice point, so does .

Now let and and notice that and – both inequalities are strict, for is closed. Let further be the upper right quarter of . Clearly, is a closed convex set, and . Suppose, if possible, that contains no lattice point. Then so does , so by convexity it must lie below some line through the lattice point with a non-positive slope; that is, where and are non-negative real numbers such that . Notice that , so , for otherwise which is a contradiction – the strict inequality above is due to the fact that is closed. Without loss of generality, assume that , so and as before, the inequality is strict because is closed. Finally, recall that and to derive a contradiction.

Techniques

Minkowski's theorem