Maths Olympiad Prep

Library / /39 of 136

Combinatorics Difficulty 7.7 National Olympiad, round 2 Prove it Hong Kong

Suppose there are 20192019 distinct points in a plane and the distances between pairs of them attain kk different values. Prove that kk is at least 4444.

Solution

Suppose kk is less than 4444. Choose a point PP on the boundary of the convex hull of this set of 20192019 points.
By the pigeonhole principle, since 201843>45\left\lfloor \frac{2018}{43} \right\rfloor > 45, there is a circle centered at PP on which at least 4545 of the other points lie. Moreover, these 4545 points all lie on the same semicircle since PP is on the boundary of the convex hull. Let these points be A1,A2,,A45A_1, A_2, \dots, A_{45} in that order. Then the distances
A1A2<A1A3<<A1A45 A_1A_2 < A_1A_3 < \dots < A_1A_{45}
are distinct, which contradicts the assumption that there are less than 4444 distances. Thus, k44k \ge 44.

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.