IMC / 2014 / Problems / Day 1, P5
IMC 2014 · Day 1 · P5
very hardLet 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 .
(Proposed by Martin Langer)
Solution (official)
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
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 self-intersections.
Without loss of generality we may assume that is the smallest among . Suppose that all of the pairs satisfy . Since is minimal, we have . The pair satisfies , so . Then we can see that , and so on; finally we get . But this contradicts the minimality of . Therefore, there is a pair in that does not satisfy .
Remark. The bound is sharp.
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.