Suppose there are distinct points in a plane and the distances between pairs of them attain different values. Prove that is at least .
Solution
Suppose is less than . Choose a point on the boundary of the convex hull of this set of points.
By the pigeonhole principle, since , there is a circle centered at on which at least of the other points lie. Moreover, these points all lie on the same semicircle since is on the boundary of the convex hull. Let these points be in that order. Then the distances
are distinct, which contradicts the assumption that there are less than distances. Thus, .
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.