Difference between revisions of "1973 IMO Problems/Problem 4"
Line 44: | Line 44: | ||
Below I will first point out the shortcomings of the solution. | Below I will first point out the shortcomings of the solution. | ||
− | Then I will | + | Then I will give a complete solution. |
− | |||
− | |||
− | |||
− | |||
− | |||
1. The author states: "The path that is the solution to this | 1. The author states: "The path that is the solution to this | ||
Line 66: | Line 61: | ||
the midpoint of the parallel <math>D_aD_b</math> to <math>AB</math>, going through | the midpoint of the parallel <math>D_aD_b</math> to <math>AB</math>, going through | ||
the midpoints <math>D_a, D_b</math> of <math>BC, AC</math>). (Denote by <math>F</math> the | the midpoints <math>D_a, D_b</math> of <math>BC, AC</math>). (Denote by <math>F</math> the | ||
− | point <math>R</math> when <math>P = E</math>.) | + | point corresponding to <math>R</math> when <math>P = E</math>.) |
Then, the author argues that the union of circles of radius | Then, the author argues that the union of circles of radius | ||
Line 99: | Line 94: | ||
− | ==Solution ( | + | ==Solution== |
+ | |||
+ | Let us say that a curve has the property <math>\mathcal{P}</math> if one end | ||
+ | of it is at <math>A</math>, it is inside the triangle, and the union of circles | ||
+ | of radius <math>\frac{h}{2}</math> centered at all the points along the curve | ||
+ | covers the triangle. Let <math>\mathcal{S}</math> be the set of curves having | ||
+ | property <math>\mathcal{P}</math>. The problem asks us to find the shortest | ||
+ | curve in <math>\mathcal{S}</math>. | ||
+ | |||
+ | In this solution when we say that a point is in a region, we mean | ||
+ | that the point is in the interior, or on the boundary of the region. | ||
+ | Also, note that we will use the words curve and path interchangeably. | ||
+ | |||
+ | Let <math>\mathcal{C}_1</math> and <math>\mathcal{C}_2</math> be the circles of radius | ||
+ | <math>\frac{h}{2}</math> centered at <math>B, C</math>. Let us say that a curve has the | ||
+ | property <math>\mathcal{P}'</math> if one end of it is at <math>A</math>, it is inside | ||
+ | the triangle, it has a point in the sector of <math>\mathcal{C}_2</math> | ||
+ | inside the triangle, and it has a point in the sector of <math>\mathcal{C}_1</math> | ||
+ | inside the triangle. Let <math>\mathcal{S}'</math> be the set of curves having | ||
+ | property <math>\mathcal{P}'</math>. | ||
+ | |||
+ | We have <math>\mathcal{S} \subset \mathcal{S}'</math>, in other words, if a path | ||
+ | has property <math>\mathcal{P}</math>, then it has property <math>\mathcal{P}'</math>. Indeed, | ||
+ | if the union of circles of radius <math>\frac{h}{2}</math> centered at all the | ||
+ | points along the path covers the triangle, then this set must cover | ||
+ | <math>B</math> and <math>C</math>, so there must be points on the path at distance | ||
+ | <math>\le \frac{h}{2}</math> from <math>B</math> and <math>C.</math> These points will be inside the | ||
+ | sectors delimited by the triangle and <math>\mathcal{C}_1, \mathcal{C}_2</math>. | ||
+ | |||
+ | The plan of this solution is the following: We will find the shortest | ||
+ | path in <math>\mathcal{S}'</math>. (There are two of them, symmetric to each | ||
+ | other.) If we show that this path is in <math>\mathcal{S}</math>, then it | ||
+ | follows that it is the shortest path in <math>\mathcal{S}</math>. We will | ||
+ | verify that the path we found does indeed have property <math>\mathcal{P}</math>. | ||
+ | |||
+ | Let us proceed by taking a path <math>p \in \mathcal{S}'</math>. Let one end | ||
+ | (the "beginning") be at <math>A</math>, and denote <math>T</math> the other end of the | ||
+ | path. Let <math>P</math> and <math>Q</math> be points on the curve inside the sectors | ||
+ | of <math>\mathcal{C}_2, \mathcal{C}_1</math>. We can assume that <math>P \in p</math> | ||
+ | comes "before" the intersection of <math>p</math> with <math>\mathcal{C}_1</math>. | ||
+ | |||
+ | (Note: if it is the other way, we can just change the notation, or | ||
+ | adjust the proof which follows below. This is where we build one | ||
+ | of the two solutions, the second solution being a symmetrical | ||
+ | transformation of the first.) | ||
+ | |||
+ | Let <math>Q \in p \cap \mathcal{C}_1</math> be the "first" point of <math>p</math> where | ||
+ | it meets <math>\mathcal{C}_1</math>. Define the path <math>p_1</math> to be identical | ||
+ | with <math>p</math> up to the point <math>Q</math>, but then we cut off the rest of the | ||
+ | path <math>p</math> (from <math>Q</math> to the end <math>T</math>). In other words, the new end | ||
+ | point <math>T</math> of <math>p_1</math> is <math>T = Q</math>. | ||
+ | |||
+ | Now let <math>P \in p_1 \cap \mathcal{C}_2</math> be the "first" point of <math>p_1</math> | ||
+ | where it meets <math>\mathcal{C}_2</math>. The points in <math>p_1</math> are now the | ||
+ | starting point <math>A</math>, followed by a set of points inside the triangle, | ||
+ | outside of <math>\mathcal{C}_2, \mathcal{C}_1</math>, then <math>P</math> on <math>\mathcal{C}_2</math>, | ||
+ | then a set of points which could be inside or outside of <math>\mathcal{C}_2</math>, | ||
+ | and finally <math>Q = T</math> on the circle <math>\mathcal{C}_1</math>. | ||
+ | |||
+ | Let <math>p_2</math> be the curve in which we replace the portion of <math>p_1</math> from | ||
+ | <math>A</math> to <math>P</math> by a segment on a straight line. Clearly <math>p_2</math> is shorter | ||
+ | than <math>p_1</math>. | ||
+ | |||
+ | Let <math>p_3</math> be the curve in which we replace the portion of <math>p_2</math> from | ||
+ | <math>P</math> to <math>Q</math> by a segment on a straight line. Clearly <math>p_3</math> is shorter | ||
+ | than <math>p_2</math>. Note that <math>p_3</math> consists of the two segments <math>AP</math>, <math>PQ</math>. | ||
+ | |||
+ | Let <math>p_4</math> be the curve identical to <math>p_3</math> from <math>A</math> to <math>P</math>, but which | ||
+ | replaces the segment <math>PQ</math> by a segment <math>PQ'</math> along the normal from | ||
+ | <math>P</math> to <math>\mathcal{C}_2</math>, where <math>Q' \in \mathcal{C}_2</math> is the | ||
+ | intersection of the normal with the circle. Clearly <math>p_4</math> is shorter | ||
+ | than <math>p_3</math>. | ||
+ | |||
+ | For the sake of ease of notation let us re-label <math>Q'</math> to be <math>Q</math>. | ||
+ | Now we are looking at curves which consist of the segment <math>AP</math> (<math>P</math> | ||
+ | being a point on <math>\mathcal{C}_2</math>) followed by the segment <math>PQ</math>, where | ||
+ | <math>Q \in \mathcal{C}_1</math> is the foot of the normal from <math>P</math> to | ||
+ | <math>\mathcal{C}_1</math> (the normal is in fact the line <math>PB</math>.) See the | ||
+ | figure below. | ||
+ | |||
+ | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
Line 119: | Line 185: | ||
− | |||
− | + | TO BE CONTINUED. | |
== See Also == {{IMO box|year=1973|num-b=3|num-a=5}} | == See Also == {{IMO box|year=1973|num-b=3|num-a=5}} |
Revision as of 17:30, 30 June 2025
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 , let the midpoint of
be
, and let the midpoint of
be
. Let the height of the triangle be
. Draw circles around points
and
with radius
, and label them
and
. Let the intersection of
and
be
.
The path that is the solution to this problem must go from to a point on
to a point on
. 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 to
to
. We will prove this as follows:
Suppose that a different point on is the optimal point to go to. Let this point be
. Then, the optimal point on
would be the intersection of
and
(let this point be
). Let the line through
parallel to
be
, and the intersection of
and
be
. Then, we have
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 ,
. Reflect
across
to get
. Then,
, which is obviously minimized at the intersection of the two lines,
.
By , we have
and we have proved the claim.
This path easily covers the whole triangle. This is because if you draw a line perpendicular to from any point in the triangle, this line will hit the path in a distance less than or equal to
. We can compute the length of the path to be
~mathboy100
Remarks (added by pf02, June 2025)
The solution given above is so incomplete (and incorrect in a few details) that it can not be called a solution.
Below I will first point out the shortcomings of the solution. Then I will give a complete solution.
1. The author states: "The path that is the solution to this
problem must go from to a point on
to a
point on
." This needs a proof. I believe
this to be true (up to a symmetry), but it is the hardest
part of the solution.
2. In the solution above, the author makes the following
construction: take on the arc of
inside
the triangle, and take the point
where
intersects
(
is the normal from
to
).
He shows that the length of the curve
is minimal when
, where
is the midpoint of the arch (also, the
intersection of the arc with the height from
, and also,
the midpoint of the parallel
to
, going through
the midpoints
of
). (Denote by
the
point corresponding to
when
.)
Then, the author argues that the union of circles of radius
centered at all the points along
covers
the triangle. (In fact, the argument is incorrect, but the
fact is true.)
This is all good, but the two statements above do not prove
that is the shortest curve such that the union of
circles of radius
centered at all the points
along the curve covers the triangle. In fact, they don't
even prove the much easier problem we obtain if we accept
that "the path that is the solution to this problem must
go from
to a point on
to a point on
."
3. The author says
"This path [] easily covers the whole triangle. This
is because if you draw a line perpendicular to
from
any point in the triangle, this line will hit the path in
a distance less than or equal to
."
In fact it is not true that "if you draw a line perpendicular
to from any point in the triangle, this line will hit
the path in a distance less than or equal to
."
Clearly, there are points
such that a perpendicular from
to
will not hit the path
at all. Besides,
this is not what we need in order to conclude that the union
of circles of radius
centered at all the points
along
covers the triangle.
Solution
Let us say that a curve has the property if one end
of it is at
, it is inside the triangle, and the union of circles
of radius
centered at all the points along the curve
covers the triangle. Let
be the set of curves having
property
. The problem asks us to find the shortest
curve in
.
In this solution when we say that a point is in a region, we mean that the point is in the interior, or on the boundary of the region. Also, note that we will use the words curve and path interchangeably.
Let and
be the circles of radius
centered at
. Let us say that a curve has the
property
if one end of it is at
, it is inside
the triangle, it has a point in the sector of
inside the triangle, and it has a point in the sector of
inside the triangle. Let
be the set of curves having
property
.
We have , in other words, if a path
has property
, then it has property
. Indeed,
if the union of circles of radius
centered at all the
points along the path covers the triangle, then this set must cover
and
, so there must be points on the path at distance
from
and
These points will be inside the
sectors delimited by the triangle and
.
The plan of this solution is the following: We will find the shortest
path in . (There are two of them, symmetric to each
other.) If we show that this path is in
, then it
follows that it is the shortest path in
. We will
verify that the path we found does indeed have property
.
Let us proceed by taking a path . Let one end
(the "beginning") be at
, and denote
the other end of the
path. Let
and
be points on the curve inside the sectors
of
. We can assume that
comes "before" the intersection of
with
.
(Note: if it is the other way, we can just change the notation, or adjust the proof which follows below. This is where we build one of the two solutions, the second solution being a symmetrical transformation of the first.)
Let be the "first" point of
where
it meets
. Define the path
to be identical
with
up to the point
, but then we cut off the rest of the
path
(from
to the end
). In other words, the new end
point
of
is
.
Now let be the "first" point of
where it meets
. The points in
are now the
starting point
, followed by a set of points inside the triangle,
outside of
, then
on
,
then a set of points which could be inside or outside of
,
and finally
on the circle
.
Let be the curve in which we replace the portion of
from
to
by a segment on a straight line. Clearly
is shorter
than
.
Let be the curve in which we replace the portion of
from
to
by a segment on a straight line. Clearly
is shorter
than
. Note that
consists of the two segments
,
.
Let be the curve identical to
from
to
, but which
replaces the segment
by a segment
along the normal from
to
, where
is the
intersection of the normal with the circle. Clearly
is shorter
than
.
For the sake of ease of notation let us re-label to be
.
Now we are looking at curves which consist of the segment
(
being a point on
) followed by the segment
, where
is the foot of the normal from
to
(the normal is in fact the line
.) See the
figure below.
TO BE CONTINUED.
See Also
1973 IMO (Problems) • Resources | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
All IMO Problems and Solutions |