IMC 2026, Day 2, Problem 10
An infinite chessboard of size is obtained by colouring the interiors of the squares of an infinite square grid of side length alternately white and black following the usual chessboard pattern. The points belonging to the grid lines have neither colour and the grid may be translated and rotated arbitrarily in the plane.
Is it true that for any finite set of points in the plane, there exist and an infinite chessboard of size such that all the points lie in white squares?
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(proposed by David Hruška, Czech Academy of Sciences, Prague)
Solution. We prove that the statement is true.
The standard one-dimensional Dirichlet approximation theorem says that, for every real and positive integer , there are integers with and . We need its simultaneous form, sometimes called multidimensional Dirichlet approximation. Its role here is to approximate all coordinates at once using the same multiplier :
Lemma. For real numbers and a positive integer , there exists an integer with such that
Proof. Consider the points
Let the points be and apply the lemma with and . We obtain an integer and integers such that
Take an axes-aligned checkerboard of size
Write with . The choice makes the main term even, while the translation by keeps the small error inside the same square. Indeed,
Transcribed from the official solutions, pages 7–8. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.