Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1965 IMO Problems/Problem 6

Revision as of 19:14, 17 May 2020 by Olivera (talk | contribs) (After user awe-sum solved the problem, I linked their image of the problem solution because I couldn't do the asymptote for it.)

Problem

In a plane a set of $n$ points ($n\geq 3$) is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.

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.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1965_IMO_Problems/Problem_6&oldid=122559"