MathDB
Angle sums are equal

Source: IMO Shortlist 2019 C6

September 22, 2020
IMO ShortlistcombinatoricsIMO Shortlist 2019anglescombinatorial geometry

Problem Statement

Let n>1n>1 be an integer. Suppose we are given 2n2n points in the plane such that no three of them are collinear. The points are to be labelled A1,A2,,A2nA_1, A_2, \dots , A_{2n} in some order. We then consider the 2n2n angles A1A2A3,A2A3A4,,A2n2A2n1A2n,A2n1A2nA1,A2nA1A2\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2. We measure each angle in the way that gives the smallest positive value (i.e. between 00^{\circ} and 180180^{\circ}). Prove that there exists an ordering of the given points such that the resulting 2n2n angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.