Difference between revisions of "1965 IMO Problems/Problem 6"
(Created page with '== Problem == In a plane a set of <math>n</math> points (<math>n\geq 3</math>) is given. Each pair of points is connected by a segment. Let <math>d</math> be the length of the lo…') |
(After user awe-sum solved the problem, I linked their image of the problem solution because I couldn't do the asymptote for it.) |
||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| + | |||
| + | [https://i.imgur.com/hjGyVyg.png Image of problem Solution]. Credits to user awe-sum. | ||
| + | |||
| + | |||
{{solution}} | {{solution}} | ||
Revision as of 18:14, 17 May 2020
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.
This problem needs a solution. If you have a solution for it, please help us out by adding it.
