Maths Olympiad Prep

Library / /33 of 69

, 2011

Geometry Difficulty 5.2 AIME, harder Prove it South Africa

Suppose that nn points are given on a circle and nk+1nk + 1 of the chords between these points are drawn, where 2k+1<n2k + 1 < n. Prove that it is possible to select k+1k+1 of the chords such that no two of them intersect.

Solution

Without loss of generality, we may assume that the nn points form a regular nn-gon. We will partition all the possible chords of the nn-gon into nn different sets such that all the chords in each set are parallel. We distinguish two cases:

If nn is odd, then each chord is parallel to exactly one of the sides of the nn-gon, so define AiA_i to be the set of chords parallel to side ii.

If n=2kn = 2k is even, let the nn-gon be P1P2P2kP_1P_2\dots P_{2k}. Then each chord is parallel to a pair of sides, or parallel to a chord of the form PiPi+2P_iP_{i+2} for some ii. For 1ik1 \le i \le k, let AiA_i be the set of chords parallel to side PiPi+1P_iP_{i+1}, and for k<i2kk < i \le 2k, let AiA_i be the set of chords parallel to Pi2PiP_{i-2}P_i.

Since we have nk+1nk + 1 chords, at least k+1k + 1 of these chords must lie in one of the nn sets AiA_i. Since the chords in each set AiA_i are parallel, no two of them intersect.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.