1965 IMO Problems/Problem 6
Revision as of 11:52, 29 January 2021 by Hamstpan38825 (talk | contribs)
Problem
In a plane a set of 
points (
) is given. Each pair of points is connected by a segment. Let 
be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length . Prove that the number of diameters of the given set is at most .
Solution
Image of problem Solution. Credits to user awe-sum.
See Also
| 1965 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
| All IMO Problems and Solutions | ||
