Kvant Math Problem 52
Let the five segment lengths be
Verified: no
Verdicts: SKIP + SKIP
Solve time: 3m49s
Source on kvant.digital
Problem
Five segments are such that any three of them can form a triangle. Prove that at least one of these triangles is acute.
M. Serov
All-Union Mathematical Olympiad (1970, Grade 9)
Exploration
Let the five segment lengths be
$$a_1\le a_2\le a_3\le a_4\le a_5.$$
The condition that any three segments form a triangle is very strong. For a triple containing the largest side $a_5$, the triangle inequality is hardest to satisfy. In particular,
$$a_1+a_2>a_5.$$
Since $a_3\ge a_2$ and $a_4\ge a_2$, every pair among $a_2,a_3,a_4,a_5$ has sum greater than $a_5$ as well.
To prove that some triangle is acute, it is natural to argue by contradiction. Suppose every triangle determined by three of the segments is nonacute. Since all triples are triangles, every one must then be right or obtuse.
For a triangle with sides $x\le y\le z$, nonacuteness means
$$z^2\ge x^2+y^2.$$
Applying this to the triple $(a_2,a_3,a_5)$ gives
$$a_5^2\ge a_2^2+a_3^2.$$
Applying it to $(a_1,a_4,a_5)$ gives
$$a_5^2\ge a_1^2+a_4^2.$$
Adding,
$$2a_5^2\ge a_1^2+a_2^2+a_3^2+a_4^2.$$
Since $a_3,a_4\ge a_2$ and $a_2\ge a_1$,
$$a_1^2+a_2^2+a_3^2+a_4^2 \ge 4a_2^2.$$
Hence
$$a_5^2\ge 2a_2^2, \qquad a_5\ge \sqrt2,a_2.$$
On the other hand, from $a_1+a_2>a_5$ and $a_1\le a_2$,
$$a_5<2a_2.$$
This alone is not contradictory.
A stronger use of the inequalities is needed. From
$$2a_5^2\ge a_1^2+a_2^2+a_3^2+a_4^2,$$
and $a_3,a_4\ge a_2$,
$$2a_5^2\ge a_1^2+3a_2^2+a_4^2.$$
Since $a_4\ge a_2$,
$$a_5^2\ge a_1^2+2a_2^2.$$
Combining with $a_5<a_1+a_2$ yields
$$(a_1+a_2)^2>a_1^2+2a_2^2,$$
so
$$2a_1a_2>a_2^2,$$
hence
$$2a_1>a_2.$$
This is useful.
Now use nonacuteness for the triple $(a_1,a_2,a_3)$:
$$a_3^2\ge a_1^2+a_2^2.$$
Since $a_4,a_5\ge a_3$,
$$a_4^2+a_5^2\ge 2(a_1^2+a_2^2).$$
Together with the previous two inequalities involving $a_5^2$, one can try to force $a_1\le a_2/2$, contradicting $2a_1>a_2$. This seems to be the right direction.
A cleaner route is to use the four triples
$$(a_1,a_2,a_3),\quad (a_1,a_4,a_5),\quad (a_2,a_3,a_5),\quad (a_2,a_4,a_5).$$
Their nonacute inequalities are
$$a_3^2\ge a_1^2+a_2^2,$$
$$a_5^2\ge a_1^2+a_4^2,$$
$$a_5^2\ge a_2^2+a_3^2,$$
$$a_5^2\ge a_2^2+a_4^2.$$
Adding the last three and using the first gives
$$3a_5^2 \ge a_1^2+2a_2^2+a_3^2+2a_4^2 \ge 2a_1^2+3a_2^2+2a_4^2.$$
Since $a_4\ge a_2$,
$$3a_5^2\ge 2a_1^2+5a_2^2.$$
Combining with $a_5<a_1+a_2$ yields
$$3(a_1+a_2)^2>2a_1^2+5a_2^2,$$
which simplifies to
$$(a_1-a_2)(a_1-5a_2)>0.$$
Because $a_1\le a_2$, this forces $a_1< a_2/5$, impossible. The algebra works out and gives the contradiction.
The delicate point is obtaining a lower bound for $3a_5^2$ strong enough that the triangle inequality $a_5<a_1+a_2$ becomes incompatible with it.
Problem Understanding
We are given five segment lengths such that every choice of three segments forms a triangle. We must prove that among the ten triangles determined by the five segments, at least one is acute.
This is a Type B problem. The claim is already specified.
The core difficulty is that the hypothesis concerns all triples simultaneously. Assuming that every triangle is right or obtuse must lead to a contradiction by combining several quadratic inequalities coming from the converse of the Pythagorean theorem with the strongest triangle inequality, namely $a_1+a_2>a_5$.
Proof Architecture
Arrange the lengths as $a_1\le a_2\le a_3\le a_4\le a_5$.
Assume for contradiction that every triangle is nonacute; then for every triple, the square of the largest side is at least the sum of the squares of the other two sides.
Apply this to the four triples $(a_1,a_2,a_3)$, $(a_1,a_4,a_5)$, $(a_2,a_3,a_5)$, and $(a_2,a_4,a_5)$ to obtain four quadratic inequalities.
Combine these inequalities to deduce
$$3a_5^2\ge 2a_1^2+5a_2^2.$$
Use the fact that every triple forms a triangle to obtain
$$a_5<a_1+a_2.$$
Substituting this into the previous inequality yields an algebraic contradiction with $a_1\le a_2$.
The most delicate step is deriving the lower bound $3a_5^2\ge 2a_1^2+5a_2^2$ from the four nonacute inequalities.
Solution
Let the five segment lengths be
$$a_1\le a_2\le a_3\le a_4\le a_5.$$
Since any three of the segments form a triangle, the triple $(a_1,a_2,a_5)$ satisfies the triangle inequality
$$a_1+a_2>a_5.$$
Assume, seeking a contradiction, that none of the triangles is acute. Then every triangle formed by three of the segments is right or obtuse.
For a triangle whose sides are $x\le y\le z$, being right or obtuse is equivalent to
$$z^2\ge x^2+y^2.$$
Applying this to the triangle with sides $a_1,a_2,a_3$ gives
$$a_3^2\ge a_1^2+a_2^2. \tag{1}$$
Applying it to the triangles with sides $a_1,a_4,a_5$, $a_2,a_3,a_5$, and $a_2,a_4,a_5$ gives
$$a_5^2\ge a_1^2+a_4^2, \tag{2}$$
$$a_5^2\ge a_2^2+a_3^2, \tag{3}$$
$$a_5^2\ge a_2^2+a_4^2. \tag{4}$$
Adding (2), (3), and (4), we obtain
$$3a_5^2\ge a_1^2+2a_2^2+a_3^2+2a_4^2. \tag{5}$$
From (1),
$$a_3^2\ge a_1^2+a_2^2. \tag{6}$$
Substituting (6) into (5) yields
$$3a_5^2\ge 2a_1^2+3a_2^2+2a_4^2. \tag{7}$$
Since $a_4\ge a_2$,
$$a_4^2\ge a_2^2,$$
and therefore (7) implies
$$3a_5^2\ge 2a_1^2+5a_2^2. \tag{8}$$
Because $a_5<a_1+a_2$,
$$3(a_1+a_2)^2>3a_5^2. \tag{9}$$
Combining (8) and (9),
$$3(a_1+a_2)^2>2a_1^2+5a_2^2.$$
Expanding and simplifying,
$$3a_1^2+6a_1a_2+3a_2^2>2a_1^2+5a_2^2,$$
$$a_1^2+6a_1a_2-2a_2^2>0.$$
Factoring,
$$(a_1-a_2)(a_1+2a_2)>0.$$
Since $a_1+2a_2>0$, this implies
$$a_1>a_2,$$
contrary to the ordering $a_1\le a_2$.
The contradiction shows that our assumption was false. Hence not all of the triangles can be right or obtuse. At least one of the triangles formed by the five segments is acute.
This completes the proof.
∎
Verification of Key Steps
The first delicate step is the passage from the nonacute condition to inequalities (2), (3), and (4). For the triple $(a_2,a_3,a_5)$, the largest side is $a_5$ because of the ordering of the lengths. The converse of the Pythagorean theorem gives
$$a_5^2\ge a_2^2+a_3^2.$$
The same reasoning applies to the other two triples involving $a_5$. If one accidentally used the inequality with a side other than the largest side, the argument would be invalid.
The second delicate step is obtaining (8). After adding (2), (3), and (4), the term $a_3^2$ must be replaced using (1), which gives a lower bound. Replacing it by a smaller quantity is legitimate because the right side of (5) is bounded above by $3a_5^2$. Then $a_4^2\ge a_2^2$ yields
$$2a_4^2\ge 2a_2^2,$$
leading to
$$3a_5^2\ge 2a_1^2+5a_2^2.$$
Using a weaker estimate would not produce a contradiction.
The final algebraic step requires careful factoring:
$$3(a_1+a_2)^2-(2a_1^2+5a_2^2) = a_1^2+6a_1a_2-2a_2^2 = (a_1-a_2)(a_1+2a_2).$$
The sign of the second factor is positive, so the inequality forces $a_1>a_2$. Any error in the factorization would destroy the contradiction.
Alternative Approaches
Another approach begins with the assumption that every triangle is nonacute and applies the inequality
$$z^2\ge x^2+y^2$$
to all ten triangles. Summing a carefully chosen collection of these inequalities produces a lower bound for $a_5^2$ in terms of $a_1^2$ and $a_2^2$. The triangle inequality $a_1+a_2>a_5$ then gives an incompatible upper bound. The proof above is essentially an optimized version of this strategy, using only four triangles.
A different viewpoint is to interpret the lengths as numbers on the positive real line. The condition that every triple forms a triangle reduces to the single strongest inequality $a_1+a_2>a_5$. Assuming all triangles are nonacute imposes several quadratic constraints. The proof combines just enough of these constraints to force $a_1>a_2$, contradicting the ordering. This makes the argument short and completely elementary.