Maths Olympiad Prep

Library / /15 of 18

Combinatorics Difficulty 8.4 Shortlist Prove it Romania

Each point of the plane is coloured in one of two colours. Given an odd integer number n3n \ge 3, prove that there exist (at least) two similar triangles whose similitude ratio is nn, each of which has a monochromatic vertex-set.

Solution

We first show that there exists a rectangle with monochromatic vertices, then subdivide it into n2n^2 rectangles by subdividing each side into nn congruent segments, and show that (at least) one of these smaller rectangles has (at least) three monochromatic vertices – here is where the assumption that nn be odd comes in.
To find a rectangle with monochromatic vertices, consider a line aa in the plane and a five-element monochromatic subset AA of aa. Project AA orthogonally on another line bb which is parallel to aa, and consider a three-element monochromatic subset BB of the image of AA under projection. If the colours of AA and BB agree, we are done. Otherwise, project BB on a third line cc which is parallel to both aa and bb, and consider a two-element monochromatic subset CC of the image of BB under projection. Clearly, the two points of CC together with their orthogonal projections on either AA or BB are monochromatic.
Without loss of generality, we may (and will) assume that the vertices of the square [0,n]×[0,n][0, n] \times [0, n] are monochromatic. Since nn is odd, and the points 0×00 \times 0 and n×0n \times 0 (respectively, 0×n0 \times n) are monochromatic, there exists pp (respectively, qq) in {0,1,,n1}\{0, 1, \dots, n-1\} such that the points p×0p \times 0 and (p+1)×0(p+1) \times 0 (respectively, 0×q0 \times q and 0×(q+1)0 \times (q+1)) be monochromatic. We now show that (at least) one of the unit squares
[i,i+1]×[q,q+1],i=0,1,,p, [i, i+1] \times [q, q+1], \quad i = 0, 1, \dots, p,
[p,p+1]×[j,j+1],j=0,1,,q, [p, p+1] \times [j, j+1], \quad j = 0, 1, \dots, q,
has (at least) three monochromatic vertices. Suppose that each of the first pp (respectively, qq) horizontal (respectively, vertical) unit squares above has two vertices of each colour. Then the colours of the lattice points alternate in the same way along both horizontal segments [0,p]×q[0, p] \times q and [0,p]×(q+1)[0, p] \times (q+1), according to the parity of the abscissae, and in the same way along both vertical segments p×[0,q]p \times [0, q] and (p+1)×[0,q](p+1) \times [0, q], according to the parity of the ordinates. Consequently, the vertical pair (p×q,p×(q+1))(p \times q, p \times (q+1)) and the horizontal pair (p×q,(p+1)×q)(p \times q, (p+1) \times q) are both monochromatic; that is, the unit square [p,p+1]×[q,q+1][p, p+1] \times [q, q+1] has (at least) three monochromatic vertices.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.