Skip to main content
OlympiadHQ

Browse · MathNet

Print

BMO 2017

2017 counting and probability

Problem

Let , , , be natural numbers. Every point on the coordinate plane with integer coordinates is colored in one of colors. Prove there exists triangles whose vertices are colored in the same color, which are pairwise congruent, and which have a side whose length is divisible by and a side whose length is divisible by .
Solution
Let the colors be , , , , . Look at the coordinates for integers and . By the pigeonhole principle there are two points of the same color. For every pair we say the color is -good if at least two coordinates are colored by color . Fixing and taking get that some color, say , was -good for at least .

Among the pairs there exists two which share the same coordinate. We call such quadruple -great. In every -great quadruple there are two triangles whose vertices are all the same color and whose two sides are divisible by . Taking we get that there is one color which is in a -great quadruple for at least different values of . Let this color be . Since there are less than possible triangles in any -great quadruple (among -great quadruples with the color ) we get that there are triangles which are the same and the same color and with two sides divisible by . This concludes the problem.

Techniques

Pigeonhole principleColoring schemes, extremal arguments