olymmath

ISL 2016 C7

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.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2016 Shortlist booklet, page 9.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Locator isl/2016/c7 · Tag M6EWQZACJ6 · Edit this page on GitHub · Keys: j next, k previous