MathDB
APMO 2023 P5

Source:

July 5, 2023
combinatoricsAPMOAPMO 2023

Problem Statement

There are nn line segments on the plane, no three intersecting at a point, and each pair intersecting once in their respective interiors. Tony and his 2n12n - 1 friends each stand at a distinct endpoint of a line segment. Tony wishes to send Christmas presents to each of his friends as follows: First, he chooses an endpoint of each segment as a “sink”. Then he places the present at the endpoint of the segment he is at. The present moves as follows : \bullet If it is on a line segment, it moves towards the sink. \bullet When it reaches an intersection of two segments, it changes the line segment it travels on and starts moving towards the new sink. If the present reaches an endpoint, the friend on that endpoint can receive their present. Prove that Tony can send presents to exactly nn of his 2n12n - 1 friends.