Difference between revisions of "1965 IMO Problems/Problem 6"

Latest revision as of 18:06, 10 November 2024

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.

Remarks (added by pf02, October 2024)

1. As a public service, I will upload the "Image of problem Solution" mentioned above to this web page. That way, a reader can see the "Solution" immediately, without having to go to another web site, and we are not subjected to the possibility of the imgur.com website being taken down, or Imgur's parent company deciding to delete this particular image. Credits for the image are due to user awe-sum, as pointed out above.

2. This "Solution" is presented very badly, and edited very badly. Indeed, some terms are undefined, left to the reader to make sense of (e.g. "incident", "degree"). But let us be forgiving, and let us do our best to make sense of the "Solution".

3. The "Solution" is incomplete, to the point of not being a solution at all. There are some serious gaps, which raise questions which are not addressed, and a reader can not be expected to fill in the details. These are:

a. The author says "... at least one point is incident to at least three diagonals". But, it could also happen that two points are "incident" to two "diagonals" (i.e. diameters) each. The author does not address this possibility at all.

b. The author says "consider all points at distance exactly d from point Q (the green circle). We see that all of them are outside the locus, the exception being P." This is far from obvious. It assumes that all the other k-4 points (those points of the k given points which are not highlighted in the picture) are inside the "locus (the blue shaded region)". In fact, it seems to this reader that this is not necessarily true.

c. Another issue with this "Solution" is that it assumes $n \ge 4$ , while the statement of the problem has $n \ge 3$ . This shortcoming is easy to fix, unlike the previous two I mentioned.

4. I will give a solution below, in the section "Solution 2".

Solution (by user awe-sum)

Solution 2

$\mathbf{Definition:}$ For the purpose of this proof, let us define an $equilateral\ arc\ triangle$ as the shape we obtain when we take a triangle $\triangle ABC$ in which we replace the side $AB$ by the $\pi/6$ arc of the circle centered at $C$ with radius $CA = CB$ , going from $A$ to $B$ , and similarly for the other two sides $BC$ and $AC$ .

See the picture below.

Note that if the sides of the original equilateral triangle were of length $d$ , then the distance from a vertex to any point on the opposite arc is $d$ . Also, the distance between any two points on the arcs, such that none of them are vertices is $< d$ . And finally, the distance from a vertex to any point on the arcs adjacent to it (which is not another vertex) is $< d$ .

$\mathbf{Lemma:}$ A configuration of $n$ points has exactly $n$ diameters if an only if $3$ of the points are the vertices of an equilateral arc triangle, and the other $n - 3$ are on the boundary of the triangle.

In the configuration shown above, we have $9$ points with $9$ diameters.

$\mathbf{Proof\ of\ the\ Lemma:}$ It is clear that if we have a configuration as described in the lemma then there are $n$ diameters. We will prove the converse by induction. We want to prove that if we have a configuration of $n$ points with $n$ diameters, then the points are in a configuration as described above.

If $n = 3$ it is clear that the $3$ points have to be the vertices of an equilateral triangle since the sides are equal (to $d$ ). Assume we know the statement to be true for $n$ , and prove it for $n + 1$ . Assume that we have $n + 1$ points with $n + 1$ diameters $d$ . Consider $n$ of the points, and let $Q$ be the remaining point. It follows from the induction hypothesis that $3$ of the $n$ are the vertices of an equilateral arc triangle, and the other $n - 3$ are on the boundary.

Now let us examine where $Q$ may be. It can not be outside of the equilateral arc triangle because then the distance to at least one of the vertices would be $d' > d$ , and the diameter of the set would be $d'$ rather than $d$ . It can not be inside the triangle because then all the distances from $Q$ to the $n$ points considered are $< d$ , and we would not have $n + 1$ diameters, as assumed. So $Q$ must be on the boundary of the equilateral arc triangle, which proves the induction step, and the lemma.

Now the solution to the problem is easy to finish. Assume we have $n$ points given, and the configuration has $m$ diameters. I claim that we can not have $m > n$ . We prove this by contradiction. If we did, let us consider a set $S$ consisting of only $n$ of the diameters. Because of the lemma, this implies that the $n$ points form a configuration as described in the lemma, i.e. $3$ of them are the vertices of an equilateral arc triangle, and the other $n - 3$ are on the boundary. Now consider a diameter $D$ which is not in $S$ . It is the distance of a segment between two of the points $P_1, P_2$ in the configuration. If one of $P_1, P_2$ is a vertex, then this diameter $D$ is in $S$ , which is a contradiction. If none of $P_1, P_2$ are vertices, then the length of $P_1P_2 < d$ , so $D = P_1P_2$ is not a diameter, which is again a contradiction.

It follows that $m \le n$ which proves the problem.

[Solution by pf02, October 2024]

1965 IMO (Problems) • Resources
Preceded by Problem 5	1 • 2 • 3 • 4 • 5 • 6	Followed by Last Question
All IMO Problems and Solutions

Page

Toolbox

Search