Maths Olympiad Prep

Library / /16 of 16

Combinatorics Difficulty 7.2 National Olympiad, round 2 Prove it Italy

Problem:

On a huge grid sheet, Marco considers a rectangle 20202020 squares long and 22 squares high. At this point he wants to join with 202022020^{2} segments each of the 20202020 centers of the squares in the bottom row of the rectangle to each of the centers of the squares in the top row. Moreover, he wants that if two of these segments intersect (possibly even just at an endpoint) they be drawn with pens of different color.

a. Prove that it is impossible to satisfy Marco's requirements if only pens of 40384038 different colors are available.

b. Prove that it is instead possible to draw the segments according to Marco's requirements using 40394039 colors.

Solution

Solution:

We denote the centers using the coordinates of the squares, so that the centers of the bottom row are the points (0,0),,(2019,0)(0,0), \ldots, (2019,0) and those of the top row are (0,1),,(2019,1)(0,1), \ldots, (2019,1).

a.
Consider the set of segments SS that connect the following pairs of points:
(i) (0,0)(k,1)(0,0)-(k, 1) for k=1,,2019k=1, \ldots, 2019;
(ii) (0,0)(0,1)(0,0)-(0,1);
(iii) (k,0)(0,1)(k, 0)-(0,1) for k=1,,2019k=1, \ldots, 2019.
In the previous list no pair appears twice, hence the corresponding segments are also distinct. Since in the first point we have indicated 20192019 pairs, in the second 11 pair, and in the third 20192019 pairs, in total those listed are 40394039 distinct pairs.
Let us choose any two segments s1,s2Ss_{1}, s_{2} \in S. If neither is of type (iii), then s1s2=(0,0)s_{1} \cap s_{2} = (0,0); similarly, if neither is of type (i), then s1s2=(0,1)s_{1} \cap s_{2} = (0,1). If instead s1s_{1} is of type (i) and s2s_{2} is of type (iii), or vice versa, then s1s_{1} and s2s_{2} are the (internal) diagonals of the convex, non-crossed quadrilateral whose vertices are (0,0),(xs2,0),(xs1,1),(0,1)(0,0), (x_{s_{2}}, 0), (x_{s_{1}}, 1), (0,1), so they intersect.
Summing up, we have the following two facts:
- S=4039|S| = 4039
- every pair of segments in SS intersects.
If we had at most 40384038 colors available, by the pigeonhole principle at least two segments in SS would have the same color, but this is incompatible with the requirement that non-disjoint segments have different colors.

b.
Let us enumerate the 40394039 colors in this way: 2019,,1,0,1,,2019-2019, \ldots, -1, 0, 1, \ldots, 2019.
A valid coloring of the segments is the following: the segment between (x1,0)(x_{1}, 0) and (x2,1)(x_{2}, 1) is colored with color x2x1x_{2} - x_{1}.
Let us show that any two segments s1,s2s_{1}, s_{2} of the same color cc do not intersect. Let (x1,0)(x_{1}, 0) be the first vertex of s1s_{1}: then the second must be (x1+c,1)(x_{1} + c, 1); similarly let (x2,0)(x_{2}, 0) be the first vertex of s2s_{2}, and consequently (x2+c,1)(x_{2} + c, 1) the second. Then s1s_{1} and s2s_{2} are two opposite sides of the quadrilateral having as vertices (x1,0),(x2,0),(x2+c,1),(x1+c,1)(x_{1}, 0), (x_{2}, 0), (x_{2} + c, 1), (x_{1} + c, 1). This quadrilateral is a (non-crossed) parallelogram because the other two sides are parallel and have length cc. Hence s1s_{1} and s2s_{2} do not intersect.

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 translated into English from it; metadata (topic, difficulty) added by this project.