Problem:
Let be a set of points in the plane such that any two points of are at least unit apart. Prove there is a subset of with at least points such that any two points of are at least units apart.
, 2003
Solution
Solution:
We will construct the set in the following way: Assume the points of are in the -plane and let be a point in with maximum -coordinate. This point will be a member of the set and now, from , we will remove and all points in which are less than units from . From the remaining points we choose one with maximum -coordinate to be a member of and remove from all points at distance less than units from this new point. We continue in this way, until all the points of are exhausted. Clearly any two points in are at least units apart. To show that has at least points, we must prove that at each stage no more than other points are removed along with .
At a typical stage in this process, we've selected a point with maximum -coordinate, so any points at distance less than from must lie inside the semicircular region of radius centred at shown in the first diagram below. Since points of are at least unit apart, these points must lie outside (or on) the semicircle of radius . (So they lie in the shaded region of the first diagram.) Now divide this shaded region into congruent regions as shown in this diagram.
We will show that each of these regions contains at most one point of . Since all regions are congruent, consider one of them as depicted in the second diagram below. The distance between any two points in this shaded region must be less than the length of the line segment . The lengths of and are and , respectively, and angle . If we construct a perpendicular from to at , then the length of is . Thus is a perpendicular bisector of and therefore . So the distance between any two points in this region is less than . Therefore each of can contain at most one point of , which completes the proof.
