MathDB
Squares on lattice points

Source: RMO 2018 P4

October 7, 2018
combinatorics

Problem Statement

Let EE denote the set of 2525 points (m,n)(m,n) in the xy\text{xy}-plane, where m,nm,n are natural numbers, 1m5,1n51\leq m\leq5,1\leq n\leq5. Suppose the points of EE are arbitrarily coloured using two colours, red and blue. SHow that there always exist four points in the set EE of the form (a,b),(a+k,b),(a+k,b+k),(a,b+k)(a,b),(a+k,b),(a+k,b+k),(a,b+k) for some positive integer kk such that at least three of these four points have the same colour. (That is, there always exist four points in the set EE which form the vertices of a square with sides parallel to the axes and having at least three points of the same colour.)