GeometryDifficulty 6.8National OlympiadProve itUnited States
Problem:
Let S be a set of 2017 distinct points in the plane. Let R be the radius of the smallest circle containing all points in S on either the interior or boundary. Also, let D be the longest distance between two of the points in S. Let a,b be real numbers such that a≤RD≤b for all possible sets S, where a is as large as possible and b is as small as possible. Find the pair (a,b).
Solution
Solution:
It is easy to verify that the smallest circle enclosing all the points will either have some 2 points in S as its diameter, or will be the circumcircle of some 3 points in S who form an acute triangle.
Now, clearly RD≤2. Indeed consider the two farthest pair of points S1,S2. Then D=∣S1S2∣≤2R, as both points S1,S2 are inside a circle of radius R. We can achieve this upper bound by taking S to have essentially only 2 points, and the remaining 2015 points in S are at the same place as these 2 points.
For the other direction, I claim RD≥3. Recall that the smallest circle is either the circumcircle of 3 points, or has some 2 points as the diameter. In the latter case, say the diameter is S1S2. Then D≥∣S1S2∣=2R, so RD≥2 in that case. Now say the points S1,S2,S3 are the circumcircle. WLOG, say that S1S2 is the longest side of the triangle. As remarked above, we can assume this triangle is acute. Therefore, 3π≤∠S1S3S2≤2π. By the Law of Sines we have that D≥∣S1S2∣=2Rsin∠S1S3S2≥2Rsin3π=R3 This completes the proof. To achieve equality, we can take S to have 3 points in the shape of an equilateral triangle.
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.