Skip to main content
OlympiadHQ

Browse · MathNet

Print

Local Mathematical Competitions

Romania counting and probability

Problem

Consider the plane partitioned in unit squares. The interior of each square is coloured in either red or black (the sides of the squares are not considered to be coloured). Prove that given any positive integer there exists an equilateral triangle of integer area , having monochromatic vertices. Radu Gologan
Solution
Like usually in such situations, there is some doubt on the colouring of the separating lines. One idea would be for a unit square to be considered to be made of its interior, together with its left and lower sides, but less its north-west and south-east corners. This establishes a partition of the plane, given by

Another idea would be not to colour at all the sides of the unit squares – this has been chosen for the problem at hand. Moreover, this introduces the slight extra difficulty in avoiding the uncoloured points of the plane.

The key to the proof is the well-known configuration that warrants the existence of an equilateral monochromatic triangle in the bichromatic plane. Choose a value for the side of an equilateral triangle of integer area , hence . Let be the circle of radius and center some point coloured , and the circle of same center and radius . The meeting points of circles and with the sides of the unit squares in the plane are obviously finitely many, and these points must be avoided since being uncoloured.

If all points of (except at most a finite number of them) are coloured , then there will exist an equilateral triangle whose vertices bear this colour, and of area . Otherwise, let be coloured , and consider the regular hexagon inscribed in . Its vertices must bear colours , , , , , otherwise an equilateral monochromatic triangle of area or is made. Let now ; clearly . If is coloured , then is monochromatic and has area ; if is coloured , then is monochromatic and has area .

Techniques

Coloring schemes, extremal argumentsConstructions and loci