Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2014 / Problems / Day 1, P5

IMC 2014 · Day 1 · P5

very hard

Let A1A2A3nA_1 A_2 \dots A_{3n} be a closed broken line consisting of 3n3n line segments in the Euclidean plane. Suppose that no three of its vertices are collinear, and for each index i=1,2,,3ni = 1, 2, \dots, 3n, the triangle AiAi+1Ai+2A_i A_{i+1} A_{i+2} has counterclockwise orientation and AiAi+1Ai+2=60\angle A_i A_{i+1} A_{i+2} = 60^\circ, using the notation A3n+1=A1A_{3n+1} = A_1 and A3n+2=A2A_{3n+2} = A_2. Prove that the number of self-intersections of the broken line is at most 32n22n+1\frac{3}{2} n^2 - 2n + 1.

(Proposed by Martin Langer)

Solution (official)

Place the broken line inside an equilateral triangle TT such that their sides are parallel to the segments of the broken line. For every i=1,2,,3ni = 1, 2, \dots, 3n, denote by xix_i the distance between the segment AiAi+1A_i A_{i+1} and that side of TT which is parallel to AiAi+1A_i A_{i+1}. We will use indices modulo 3n3n everywhere.

It is easy to see that if ij(mod3)i \equiv j \pmod 3 then the polylines AiAi+1Ai+2A_i A_{i+1} A_{i+2} and AjAj+1Aj+2A_j A_{j+1} A_{j+2} intersect at most once, and this is possible only if either xi<xi+1x_i < x_{i+1} and xj>xj+1x_j > x_{j+1}, or xi>xi+1x_i > x_{i+1} and xj<xj+1x_j < x_{j+1}. Moreover, such cases cover all self-intersections. So, the number of self-intersections cannot exceed number of pairs (i,j)(i, j) with the property ()ij(mod3), and (xi<xi+1 and xj>xj+1) or (xi>xi+1 and xj<xj+1).(*) \qquad i \equiv j \pmod 3, \text{ and } (x_i < x_{i+1} \text{ and } x_j > x_{j+1}) \text{ or } (x_i > x_{i+1} \text{ and } x_j < x_{j+1}).

Grouping the indices 1,2,,3n1, 2, \dots, 3n by remainders modulo 3, we have nn indices in each residue class. Altogether there are 3(n2)3 \binom{n}{2} index pairs (i,j)(i, j) with ij(mod3)i \equiv j \pmod 3. We will show that for every integer kk with 1k<n21 \le k < \frac{n}{2}, there is some index ii such that the pair (i,i+6k)(i, i + 6k) does not satisfy ()(*). This is already [n12]\left[ \frac{n-1}{2} \right] pair; this will prove that there are at most 3(n2)[n12]32n22n+13 \binom{n}{2} - \left[ \frac{n-1}{2} \right] \ge \frac{3}{2} n^2 - 2n + 1 self-intersections.

Without loss of generality we may assume that x3n=x0x_{3n} = x_0 is the smallest among x1,,x3nx_1, \dots, x_{3n}. Suppose that all of the pairs ()(6k,0), (6k+1,1), (6k+2,2), , (1,6k1), (0,6k)(**) \qquad (-6k, 0), \ (-6k+1, 1), \ (-6k+2, 2), \ \dots, \ (-1, 6k-1), \ (0, 6k) satisfy ()(*). Since x0x_0 is minimal, we have x6k>x0x_{-6k} > x_0. The pair (6k,0)(-6k, 0) satisfies ()(*), so x6k+1<x1x_{-6k+1} < x_1. Then we can see that x6k+2>x2x_{-6k+2} > x_2, and so on; finally we get x0>x6kx_0 > x_{6k}. But this contradicts the minimality of x0x_0. Therefore, there is a pair in ()(**) that does not satisfy ()(*).

Remark. The bound 3(n2)[n12]=[3n222n+1]3 \binom{n}{2} - \left[ \frac{n-1}{2} \right] = \left[ \frac{3n^2}{2} - 2n + 1 \right] is sharp.

How the field did

contestants scored
320
average (of 10)
1.03
solved (≥ 80%)
5.0%
near-0 (≤ 10%)
77.5%
discrimination
0.49

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2014 · Day 2 · P9killeravg 0.6/10 · solved 4% · near-0 89% · disc 0.40
IMC 2020 · Day 1 · P3killeravg 0.1/10 · solved 1% · near-0 98% · disc 0.22
IMC 2001 · Day 2 · P9hardavg 2.3/10 · solved 16% · near-0 66% · disc 0.48
IMC 2004 · Day 1 · P4mediumavg 4.0/10 · solved 35% · near-0 52% · disc 0.52