Maths Olympiad Prep

Library / IMO Shortlist /150 of 365

IMO Shortlist, 2016

Geometry Difficulty 8.5 Shortlist Prove it IMO

Let n⩾2n \geqslant 2 be an integer. In the plane, there are nn segments given in such a way that any two segments have an intersection point in the interior, and no three segments intersect at a single point. Jeff places a snail at one of the endpoints of each of the segments and claps his hands n−1n-1 times. Each time when he claps his hands, all the snails move along their own segments and stay at the next intersection points until the next clap. Since there are n−1n-1 intersection points on each segment, all snails will reach the furthest intersection points from their starting points after n−1n-1 claps.

a) Prove that if nn is odd then Jeff can always place the snails so that no two of them ever occupy the same intersection point.

b) Prove that if nn is even then there must be a moment when some two snails occupy the same intersection point no matter how Jeff places the snails.

Solution

(a) For odd nn, we travel along the circumference of the disk and mark each of the points AiA_{i} or BiB_{i} 'in' and 'out' alternately. Since every pair of lines intersect in the disk, there are exactly n−1n-1 points between AiA_{i} and BiB_{i} for any fixed 1⩽i⩽n1 \leqslant i \leqslant n. As nn is odd, this means one of AiA_{i} and BiB_{i} is marked 'in' and the other is marked 'out'. Then Jeff can put a snail on the endpoint of each segment which is closer to the 'in' side of the corresponding line. We claim that the snails on lil_{i} and ljl_{j} do not meet for any pairs i,ji, j, hence proving part (a).

Figure 1
Figure 2

Without loss of generality, we may assume the snails start at AiA_{i} and AjA_{j} respectively. Let lil_{i} intersect ljl_{j} at PP. Note that there is an odd number of points between arc⁡AiAj\operatorname{arc} A_{i} A_{j}. Each of these points belongs to a line lkl_{k}. Such a line lkl_{k} must intersect exactly one of the segments AiPA_{i} P and AjPA_{j} P, making an odd number of intersections. For the other lines, they may intersect both segments AiPA_{i} P and AjPA_{j} P, or meet none of them. Therefore, the total number of intersection points on segments AiPA_{i} P and AjPA_{j} P (not counting PP) is odd. However, if the snails arrive at PP at the same time, then there should be the same number of intersections on AiPA_{i} P and AjPA_{j} P, which gives an even number of intersections. This is a contradiction so the snails do not meet each other.

(b) For even nn, we consider any way that Jeff places the snails and mark each of the points AiA_{i} or BiB_{i} 'in' and 'out' according to the directions travelled by the snails. In this case there must be two neighbouring points AiA_{i} and AjA_{j} both of which are marked 'in'. Let PP be the intersection of the segments AiBiA_{i} B_{i} and AjBjA_{j} B_{j}. Then any other segment meeting one of the segments AiPA_{i} P and AjPA_{j} P must also meet the other one, and so the number of intersections on AiPA_{i} P and AjPA_{j} P are the same. This shows the snails starting from AiA_{i} and AjA_{j} will meet at PP.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.