1965 IMO Problems/Problem 6
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 .
Image of problem Solution. Credits to user awe-sum.
|1965 IMO (Problems) • Resources|
|1 • 2 • 3 • 4 • 5 • 6||Followed by|
|All IMO Problems and Solutions|