IMC 2014, Day 1, Problem 5
Let be a closed broken line consisting of line segments in the Euclidean plane. Suppose that no three of its vertices are collinear, and for each index , the triangle has counterclockwise orientation and , using the notation and . Prove that the number of self-intersections of the broken line is at most .
The statement has a figure; the original:

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Martin Langer)
Solution. Place the broken line inside an equilateral triangle such that their sides are parallel to the segments of the broken line. For every , denote by the distance between the segment and that side of which is parallel to . We will use indices modulo everywhere.
It is easy to see that if then the polylines and intersect at most once, and this is possible only if either and or and . Moreover, such cases cover all self-intersections. So, the number of self-intersections cannot exceed number of pairs with the property
[Figure in the original PDF.]
Grouping the indices , by remainders modulo 3, we have indices in each residue class. Altogether there are index pairs with . We will show that for every integer with , there is some index such that the pair does not satisfy . This is already pair; this will prove that there are at most
Without loss of generality we may assume that is the smallest among . Suppose that all of the pairs
Remark. The bound is sharp.
Transcribed from the official solutions, pages 3–4. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.