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

Difference between revisions of "1971 IMO Problems/Problem 4"

(Created page with "All the faces of tetrahedron ABCD are acute-angled triangles. We consider all closed polygonal paths of the form XY ZTX defined as follows: X is a point on edge AB distinct from ...")
 
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
−
All the faces of tetrahedron ABCD are acute-angled triangles. We consider
+
==Problem==
−
all closed polygonal paths of the form XY ZTX defined as follows: X is a
+
All the faces of tetrahedron <math>ABCD</math> are acute-angled triangles. We consider all closed polygonal paths of the form <math>XYZTX</math> defined as follows: <math>X</math> is a point on edge <math>AB</math> distinct from <math>A</math> and <math>B</math>; similarly, <math>Y, Z, T</math> are interior points of edges <math>BC, CD, DA</math>, respectively. Prove:
−
point on edge AB distinct from A and B; similarly, Y;Z; T are interior points
+
 
−
of edges BCCD;DA; respectively. Prove:
+
(a) If <math>\angle DAB + \angle BCD \neq \angle CDA + \angle ABC</math>, then among the polygonal paths, there is none of minimal length.
−
(a) If DAB + BCD is not equal to  CDA + ABC; then among the polygonal paths,
+
 
−
there is none of minimal length.
+
(b) If <math>\angle DAB + \angle BCD = \angle CDA + \angle ABC</math>, then there are infinitely many shortest polygonal paths, their common length being <math>2AC \sin(\alpha / 2)</math>, where <math>\alpha = \angle BAC + \angle CAD + \angle DAB</math>.
−
(b) If DAB + BCD = CDA + ABC; then there are infinitely many
+
 
−
shortest polygonal paths, their common length being 2AC sin(®=2); where
+
==Solution==
−
® = BAC + CAD + DAB.
+
Rotate the triangle <math>BCD</math> around the edge <math>BC</math> until <math>ABCD</math> are in one plane. It is clear that in a shortest path, the point Y lies on the line connecting <math>X</math> and <math>Z</math>. Therefore, <math>XYB=ZYC</math>.
−
(triads of three letters represent angles, except ZTX)
+
Summing the four equations like this, we get exactly <math>\angle ABC+\angle ADC=\angle BCD+\angle BAD</math>.
 +
 
 +
Now, draw all four faces in the plane, so that <math>BCD</math> is constructed on the exterior of the edge <math>BC</math> of <math>ABC</math> and so on with edges <math>CD</math> and <math>AD</math>.
 +
 
 +
The final new edge <math>AB</math> (or rather <math>A'B'</math>) is parallel to the original one (because of the angle equation). Call the direction on <math>AB</math> towards <math>B</math> "right" and towards <math>A</math> "left". If we choose a vertex <math>X</math> on <math>AB</math> and connect it to the corresponding vertex <math>X'</math> on A'B'. This works for a whole interval of vertices <math>X</math> if <math>C</math> lies to the left of <math>B</math> and <math>D</math> and <math>D</math> lies to the right of <math>A</math>. It is not hard to see that these conditions correspond to the fact that various angles are acute by assumption.
 +
 
 +
Finally, regard the sine in half the isosceles triangle <math>ACA'</math> which gives the result with the angles around <math>C</math> instead of <math>A</math>, but the role of the vertices is symmetric.
 +
 
 +
== See Also == {{IMO box|year=1971|num-b=3|num-a=5}}
 +
[[Category:Olympiad Geometry Problems]]
 +
[[Category:3D Geometry Problems]]

Latest revision as of 13:02, 29 January 2021

Problem

All the faces of tetrahedron $ABCD$ are acute-angled triangles. We consider all closed polygonal paths of the form $XYZTX$ defined as follows: $X$ is a point on edge $AB$ distinct from $A$ and $B$; similarly, $Y, Z, T$ are interior points of edges $BC, CD, DA$, respectively. Prove:

(a) If $\angle DAB + \angle BCD \neq \angle CDA + \angle ABC$, then among the polygonal paths, there is none of minimal length.

(b) If $\angle DAB + \angle BCD = \angle CDA + \angle ABC$, then there are infinitely many shortest polygonal paths, their common length being $2AC \sin(\alpha / 2)$, where $\alpha = \angle BAC + \angle CAD + \angle DAB$.

Solution

Rotate the triangle $BCD$ around the edge $BC$ until $ABCD$ are in one plane. It is clear that in a shortest path, the point Y lies on the line connecting $X$ and $Z$. Therefore, $XYB=ZYC$. Summing the four equations like this, we get exactly $\angle ABC+\angle ADC=\angle BCD+\angle BAD$.

Now, draw all four faces in the plane, so that $BCD$ is constructed on the exterior of the edge $BC$ of $ABC$ and so on with edges $CD$ and $AD$.

The final new edge $AB$ (or rather $A'B'$) is parallel to the original one (because of the angle equation). Call the direction on $AB$ towards $B$ "right" and towards $A$ "left". If we choose a vertex $X$ on $AB$ and connect it to the corresponding vertex $X'$ on A'B'. This works for a whole interval of vertices $X$ if $C$ lies to the left of $B$ and $D$ and $D$ lies to the right of $A$. It is not hard to see that these conditions correspond to the fact that various angles are acute by assumption.

Finally, regard the sine in half the isosceles triangle $ACA'$ which gives the result with the angles around $C$ instead of $A$, but the role of the vertices is symmetric.

See Also

1971 IMO (Problems) • Resources
Preceded by
Problem 3 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Problem 5
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1971_IMO_Problems/Problem_4&oldid=143813"