Difference between revisions of "1965 IMO Problems/Problem 6"
(After user awe-sum solved the problem, I linked their image of the problem solution because I couldn't do the asymptote for it.) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
| − | [https://i.imgur.com/hjGyVyg.png Image of problem Solution]. Credits to user awe-sum. | + | [https://i.imgur.com/hjGyVyg.png Image of problem Solution]. Credits to user '''awe-sum'''. |
| − | {{ | + | == See Also == |
| + | {{IMO box|year=1965|num-b=5|after=Last Question}} | ||
Latest revision as of 12:52, 29 January 2021
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 | ||
