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"
Line 20: Line 20:
 
==Remarks (added by pf02, December 2024)==
 
==Remarks (added by pf02, December 2024)==
  
−
<math>\mathbf{Remark 1.}</math> The problem is incorrect.  More precisely,
+
<math>\mathbf{Remark\ 1.}</math> The problem is incorrect.  More precisely,
 
question (a) is correct, but both statements of question (b) are
 
question (a) is correct, but both statements of question (b) are
 
incorrect.  The equality
 
incorrect.  The equality
Line 30: Line 30:
  
 
We will give a counterexample to the problem, making it clear that
 
We will give a counterexample to the problem, making it clear that
−
it is wrong. Below, we will give a solution which proves statement
+
(b) is wrong. Below, we will give a solution which proves statement
−
(a), and which answers the following questions
+
(a), and which answers the following questions:
  
 
(b.1) Give conditions in terms of angles and sides of the tetrahedron
 
(b.1) Give conditions in terms of angles and sides of the tetrahedron
−
when exactly one shortest polygonal path exists.
+
when shortest polygonal paths exist, and show that in this case
 +
infinitely may such paths exist.
  
−
(b.2) Give conditions in terms of angles and sides of the tetrahedron
+
(b.2) Give a formula (in terms of angles and sides of the tetrahedron)
−
when infinitely many shortest polygonal paths exist.
 
−
 
 
−
(b.3) Show that (b.1) and (b.2) cover all possible cases.
 
−
 
 
−
(b.4) Give a formula (in terms of angles and sides of the tetrahedron)
 
 
for the length of the shortest polygonal path, when it exists.
 
for the length of the shortest polygonal path, when it exists.
  
−
<math>\mathbf{Remark 2.}</math> The "solution" above is incorrect.  The first part
+
<math>\mathbf{Remark\ 2.}</math> The "solution" above is incorrect.  The first part
 
(which claims to prove part (a) of the problem) is incomplete at best,
 
(which claims to prove part (a) of the problem) is incomplete at best,
 
since it is not clear how it leads to the result.  Very likely it is
 
since it is not clear how it leads to the result.  Very likely it is
Line 52: Line 48:
 
sense.
 
sense.
  
−
<math>\mathbf{Remark 3.}</math> Below I will give the basic idea of the solution
+
<math>\mathbf{Remark\ 3.}</math> Below I will give the basic idea for solutions
−
from above, and a counterexample to part (b) of the problem.
+
to this problem, and a counterexample to part (b) of the problem.
  
−
<math>\mathbf{Remark 4.}</math> Then, I will give a correct solution, proving part
+
<math>\mathbf{Remark\ 4.}</math> Then, I will give a correct solution, proving part
−
(a) and the modified parts (b.1) - (b.4) of the problem.  During the
+
(a) and the modified parts (b.1) and (b.2) of the problem.  During the
 
proof, I will take a break to highlight the likely error made by the
 
proof, I will take a break to highlight the likely error made by the
 
author of the problem.
 
author of the problem.

Revision as of 16:05, 27 December 2024

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.


Remarks (added by pf02, December 2024)

$\mathbf{Remark\ 1.}$ The problem is incorrect. More precisely, question (a) is correct, but both statements of question (b) are incorrect. The equality $\angle DAB + \angle BCD = \angle CDA + \angle ABC$ does not imply that there are any shortest polygonal paths, and when such shortest polygonal paths exist, their common length $\neq 2AC \sin(\alpha / 2)$ (where $\alpha = \angle BAC + \angle CAD + \angle DAB$).

We will give a counterexample to the problem, making it clear that (b) is wrong. Below, we will give a solution which proves statement (a), and which answers the following questions:

(b.1) Give conditions in terms of angles and sides of the tetrahedron when shortest polygonal paths exist, and show that in this case infinitely may such paths exist.

(b.2) Give a formula (in terms of angles and sides of the tetrahedron) for the length of the shortest polygonal path, when it exists.

$\mathbf{Remark\ 2.}$ The "solution" above is incorrect. The first part (which claims to prove part (a) of the problem) is incomplete at best, since it is not clear how it leads to the result. Very likely it is incorrect. The second part, which claims to prove part (b) of the problem is clearly incorrect, since it claims to prove something which is not true. But it is incomplete/incorrect even where it should make sense.

$\mathbf{Remark\ 3.}$ Below I will give the basic idea for solutions to this problem, and a counterexample to part (b) of the problem.

$\mathbf{Remark\ 4.}$ Then, I will give a correct solution, proving part (a) and the modified parts (b.1) and (b.2) of the problem. During the proof, I will take a break to highlight the likely error made by the author of the problem.


Basic idea of a solution, and counterexample

[TO BE CONTINUED. SAVING MID WAY SO I DON"T LOSE WORK DONE SO FAR.]


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=238029"