1973 IMO Problems/Problem 4

Problem

A soldier needs to check on the presence of mines in a region having the shape of an equilateral triangle. The radius of action of his detector is equal to half the altitude of the triangle. The soldier leaves from one vertex of the triangle. What path shouid he follow in order to travel the least possible distance and still accomplish his mission?

Solution

Let our triangle be $\triangle ABC$ , let the midpoint of $AB$ be $D$ , and let the midpoint of $CD$ be $E$ . Let the height of the triangle be $h$ . Draw circles around points $B$ and $C$ with radius $\frac{h}{2}$ , and label them $c_1$ and $c_2$ . Let the intersection of $BE$ and $c_1$ be $F$ .

The path that is the solution to this problem must go from $A$ to a point on $c_2$ to a point on $c_1$ . Let us first find the shortest possible path. We will then prove that this path fits the requirements.

The shortest path is in fact the path from $A$ to $E$ to $F$ . We will prove this as follows:

Suppose that a different point on $c_2$ is the optimal point to go to. Let this point be $P$ . Then, the optimal point on $c_1$ would be the intersection of $BP$ and $c_1$ . Let the line through $E$ parallel to $AB$ be $l$ , and the intersection of $AP$ and $l$ be $Q$ . Then, we have

$AE + BE \leq AQ + BQ \leq AQ + QP + BP = AP + BP.\label{(1)}$

The second inequality is true due to the triangle inequality, and we can prove the first to be true as follows:

Suppose we have a point on $l$ , $X$ . Reflect $B$ across $l$ to get $B'$ . Then, $AX + BX = AX + B'X$ , which is obviously minimized at the intersection of the two lines, $E$ .

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

Page

Toolbox

Search

1973 IMO Problems/Problem 4

Problem

Solution

See Also