SE-SKOLORNAS 2010 Problem 6
An infinite number of squares on an infinitely square grid paper are painted red. Show that you can draw a number of squares on the paper, with sides along the grid lines, such that:
(1) no square in the grid belongs to more than one square (an edge, on the other hand, may belong to more than one square)
(2) each red square is located in one of the squares and the number of red squares in such square is at least and at most of the number of squares in the square.
PS. I always post the original wording when I doubt about my (using Google) translation.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.