Difference between revisions of "1967 IMO Problems/Problem 4"
m |
m |
||
(5 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | ==Problem== | ||
+ | |||
Let <math>A_0B_0C_0</math> and <math>A_1B_1C_1</math> be any two acute-angled triangles. Consider all triangles <math>ABC</math> that are similar to <math>\triangle A_1B_1C_1</math> (so that vertices <math>A_1</math>, <math>B_1</math>, <math>C_1</math> correspond to vertices <math>A</math>, <math>B</math>, <math>C</math>, respectively) and circumscribed about triangle <math>A_0B_0C_0</math> (where <math>A_0</math> lies on <math>BC</math>, <math>B_0</math> on <math>CA</math>, and <math>AC_0</math> on <math>AB</math>). Of all such possible triangles, determine the one with maximum area, and construct it. | Let <math>A_0B_0C_0</math> and <math>A_1B_1C_1</math> be any two acute-angled triangles. Consider all triangles <math>ABC</math> that are similar to <math>\triangle A_1B_1C_1</math> (so that vertices <math>A_1</math>, <math>B_1</math>, <math>C_1</math> correspond to vertices <math>A</math>, <math>B</math>, <math>C</math>, respectively) and circumscribed about triangle <math>A_0B_0C_0</math> (where <math>A_0</math> lies on <math>BC</math>, <math>B_0</math> on <math>CA</math>, and <math>AC_0</math> on <math>AB</math>). Of all such possible triangles, determine the one with maximum area, and construct it. | ||
==Solution== | ==Solution== | ||
+ | |||
We construct a point <math>P</math> inside <math>A_0B_0C_0</math> s.t. <math>\angle X_0PY_0=\pi-\angle X_1Z_1Y_1</math>, where <math>X,Y,Z</math> are a permutation of <math>A,B,C</math>. Now construct the three circles <math>\mathcal C_A=(B_0PC_0),\mathcal C_B=(C_0PA_0),\mathcal C_C=(A_0PB_0)</math>. We obtain any of the triangles <math>ABC</math> circumscribed to <math>A_0B_0C_0</math> and similar to <math>A_1B_1C_1</math> by selecting <math>A</math> on <math>\mathcal C_A</math>, then taking <math>B= AB_0\cap \mathcal C_C</math>, and then <math>B=CA_0\cap\mathcal C_B</math> (a quick angle chase shows that <math>B,C_0,A</math> are also colinear). | We construct a point <math>P</math> inside <math>A_0B_0C_0</math> s.t. <math>\angle X_0PY_0=\pi-\angle X_1Z_1Y_1</math>, where <math>X,Y,Z</math> are a permutation of <math>A,B,C</math>. Now construct the three circles <math>\mathcal C_A=(B_0PC_0),\mathcal C_B=(C_0PA_0),\mathcal C_C=(A_0PB_0)</math>. We obtain any of the triangles <math>ABC</math> circumscribed to <math>A_0B_0C_0</math> and similar to <math>A_1B_1C_1</math> by selecting <math>A</math> on <math>\mathcal C_A</math>, then taking <math>B= AB_0\cap \mathcal C_C</math>, and then <math>B=CA_0\cap\mathcal C_B</math> (a quick angle chase shows that <math>B,C_0,A</math> are also colinear). | ||
Line 13: | Line 16: | ||
Since all the triangles <math>\triangle ABC</math> circumscribed to <math>\triangle A_0B_0C_0</math> | Since all the triangles <math>\triangle ABC</math> circumscribed to <math>\triangle A_0B_0C_0</math> | ||
− | are similar, the one with maximum area will be the one with maximum sides, or | + | we will construct are are similar (by the requirement of the problem), the one |
− | equivalently, the one with maximum side <math>BC</math>. So we will try to maximize <math>BC</math>. | + | with maximum area will be the one with maximum sides, or equivalently, the one |
+ | with maximum side <math>BC</math>. So we will try to maximize <math>BC</math> (while keeping the | ||
+ | angles of <math>\triangle ABC</math> equal to the angles of <math>\triangle A_1B_1C_1</math>). | ||
− | The plan is to find the value of <math>\alpha</math> which maximizes <math>BC</math>. | + | The plan is to find the value of <math>\alpha = \angle (BA_0C_0)</math> which maximizes <math>BC</math>. |
[[File:Prob_1967_4_fig1.png|600px]] | [[File:Prob_1967_4_fig1.png|600px]] | ||
Line 22: | Line 27: | ||
Note that for any <math>\alpha</math> we can construct the line through <math>A_0</math> which | Note that for any <math>\alpha</math> we can construct the line through <math>A_0</math> which | ||
forms the angle <math>\alpha</math> with <math>A_0C_0</math>. We can construct points <math>B, C</math> | forms the angle <math>\alpha</math> with <math>A_0C_0</math>. We can construct points <math>B, C</math> | ||
− | on this line, and lines through these points which form angles | + | on this line, and lines through these points which form the given angles |
− | <math>\angle B, \angle C</math> with the line, and which pass through <math>C_0, B_0</math> | + | <math>\angle B = \angle B_1, \angle C = \angle C_1</math> with the line, and which |
− | respectively. Since <math>\triangle A_0B_0C_0, \triangle A_1B_1C_1</math> are acute, | + | pass through <math>C_0, B_0</math> respectively. Since |
− | <math>A_0</math> is between <math>B, C</math> and these lines will meet at a point <math>A</math> such that | + | <math>\triangle A_0B_0C_0, \triangle A_1B_1C_1</math> are acute, <math>A_0</math> is between |
− | <math>B_0</math> is between <math>A, C</math> and <math>C_0</math> is between <math>A, B</math>. | + | <math>B, C</math> and these lines will meet at a point <math>A</math> such that <math>B_0</math> is |
+ | between <math>A, C</math> and <math>C_0</math> is between <math>A, B</math>. | ||
(More about this later.) | (More about this later.) | ||
The quantities <math>a_0, b_0, c_0, \angle B, \angle C</math> are given. From | The quantities <math>a_0, b_0, c_0, \angle B, \angle C</math> are given. From | ||
− | this data, <math>\angle A_0, \angle B_0, \angle C_0, \angle A</math> are known and | + | this data, <math>\angle A_0, \angle B_0, \angle C_0, \angle A</math> are known |
− | constructible. We will compute <math>BC</math> in terms of <math> | + | and constructible. We will compute <math>BC</math> in terms of <math>\alpha</math> and |
these quantities. This will be a function in the variable <math>\alpha</math>, | these quantities. This will be a function in the variable <math>\alpha</math>, | ||
and we will find the value of <math>\alpha</math> for which this function attains | and we will find the value of <math>\alpha</math> for which this function attains | ||
Line 71: | Line 77: | ||
{b_0 \sin B \sin C + c_0 \sin B \sin (A_0 - C)}</math> | {b_0 \sin B \sin C + c_0 \sin B \sin (A_0 - C)}</math> | ||
+ | It is easy to verify that this value is valid (i.e. it can be an angle | ||
+ | in a triangle), and it is indeed a point of maximum for <math>f(\alpha)</math> | ||
+ | (i.e. <math>f''(\alpha) < 0</math>; a geometric argument would work as well). | ||
+ | |||
+ | Now to answer the "and construct it" at the end of the statement of the | ||
+ | problem, we will show that everything we did is constructible, rather | ||
+ | than describe a lengthy, boring step by step construction. Recall that | ||
+ | we already discussed that we can construct <math>\triangle ABC</math> if we know | ||
+ | <math>\alpha</math>. We just need to show that we can construct <math>\alpha</math>. We can | ||
+ | construct differences of angles, and given an angle we can construct | ||
+ | two segments whose ratio is the <math>\sin</math> (or the <math>\cos</math>, or the <math>\tan</math>) | ||
+ | of the given angle, and vice-versa. Given three segments <math>x, y, z</math> we | ||
+ | can construct the segment <math>x \cdot \frac{y}{z}</math>. Thus, the expression | ||
+ | giving <math>\alpha</math> is constructible. | ||
+ | |||
+ | [Solution by pf02, September 2024] | ||
+ | |||
+ | |||
+ | ==Remarks (added by pf02, September 2024)== | ||
+ | |||
+ | 1. In solution 2, I show where I use the condition that the triangles | ||
+ | are assumed to be acute. The first solution does not make this clear. | ||
+ | It seems intuitively true that the condition is not necessary. In | ||
+ | other words, a circumscribed triangle <math>\triangle ABC</math> exists, and it | ||
+ | can be constructed even when one or both of the given triangles | ||
+ | <math>\triangle A_0B_0C_0, \triangle A_1B_1C_1</math> are right or obtuse. The | ||
+ | condition seems to be necessary only for simplifying the proof. In | ||
+ | the general case, we may need to rearrange the labeling of the vertices. | ||
+ | |||
+ | 2. Solution 1 is elegant, even though its presentation would have benefited | ||
+ | a lot from some editing. It gives a nice geometric insight into the problem. | ||
+ | Solution 2 does not give much geometric insight, but it is computationally | ||
+ | very explicit. The two solutions are so different that it is worth taking | ||
+ | a little time to show that they are equivalent. I will outline the steps | ||
+ | of the computation. | ||
+ | |||
+ | To show that they are equivalent, put the pictures together: | ||
+ | |||
+ | [[File:Prob_1967_4_fig2.png|600px]] | ||
+ | |||
+ | The idea from Solution 1 is to construct the circles circumscribed to | ||
+ | <math>\triangle A_0C_0B</math> and <math>\triangle A_0B_0C</math>. They intersect at <math>P</math>. | ||
+ | Consider the angles <math>\beta, \gamma</math> shown on the picture. We have | ||
+ | |||
+ | <math>\frac{A_0P}{\sin \beta} = \frac{A_0B}{sin (\angle A_0PB)} = | ||
+ | \frac{A_0B}{\sin (\angle A_0C_0B)} = \frac{b_0}{\sin B}</math> | ||
+ | |||
+ | The first equality follows from the law of sines in <math>\triangle A_0PB</math>, | ||
+ | the second follows from the equality of angles in a circle spanning the | ||
+ | same arc, the third follows from the law of sines in <math>\triangle A_0C_0B</math>. | ||
+ | We gat <math>A_0P = \frac{b_0 \sin \beta}{\sin B}</math>. Similarly, we get | ||
+ | <math>A_0P = \frac{c_0 \sin \gamma}{\sin C}</math> from the other side of <math>A_0P</math>. | ||
+ | |||
+ | On the other hand, we have | ||
+ | <math>\beta + \gamma = \pi - \angle (CPB) = | ||
+ | \pi - [2\pi - \angle (CPB_0) - \angle (B_0PC_0) - \angle (C_0PB)] =</math> | ||
+ | <math>-\pi + \angle (CA_0B_0) + (\pi - \angle A) + \angle (C_0A_0B) = | ||
+ | -\pi + (\pi - \angle A) + (\pi - \angle A_0) = | ||
+ | \pi - \angle A - \angle A_0</math> | ||
+ | Solve for <math>\gamma</math> and substitute in | ||
+ | <math>\frac{b_0 \sin \beta}{\sin B} = \frac{c_0 \sin \gamma}{\sin C}</math> | ||
+ | to obtain one equation in <math>\beta</math>. | ||
+ | Now use the fact that <math>PB</math> is a diameter to write an equation between | ||
+ | <math>\alpha</math> and <math>\beta</math>: | ||
− | ( | + | <math>\alpha = \pi - \angle B - \angle (BC_0A_0) = |
+ | \pi - \angle B - \angle (BPA_0) = | ||
+ | \pi - \angle B - (\frac{\pi}{2} - \beta) = | ||
+ | \frac{\pi}{2} - \angle B + \beta</math> | ||
− | + | Solve for <math>\beta</math> in terms of <math>\alpha</math> and substitute in the equation | |
+ | in <math>\beta</math> obtained before. After some straightforward computations | ||
+ | we get exactly the equation in <math>\alpha</math> we had in Solution 2. The | ||
+ | interested reader can easily work out the details, they are just | ||
+ | straightforward algebraic computations. | ||
== See Also == | == See Also == |
Latest revision as of 19:22, 10 November 2024
Contents
[hide]Problem
Let and be any two acute-angled triangles. Consider all triangles that are similar to (so that vertices , , correspond to vertices , , , respectively) and circumscribed about triangle (where lies on , on , and on ). Of all such possible triangles, determine the one with maximum area, and construct it.
Solution
We construct a point inside s.t. , where are a permutation of . Now construct the three circles . We obtain any of the triangles circumscribed to and similar to by selecting on , then taking , and then (a quick angle chase shows that are also colinear).
We now want to maximize . Clearly, always has the same shape (i.e. all triangles are similar), so we actually want to maximize . This happens when is the diameter of . Then , so will also be the diameter of . In the same way we show that is the diameter of , so everything is maximized, as we wanted.
This solution was posted and copyrighted by grobber. The thread can be found here: [1]
Solution 2
Since all the triangles circumscribed to we will construct are are similar (by the requirement of the problem), the one with maximum area will be the one with maximum sides, or equivalently, the one with maximum side . So we will try to maximize (while keeping the angles of equal to the angles of ).
The plan is to find the value of which maximizes .
Note that for any we can construct the line through which forms the angle with . We can construct points on this line, and lines through these points which form the given angles with the line, and which pass through respectively. Since are acute, is between and these lines will meet at a point such that is between and is between .
(More about this later.)
The quantities are given. From this data, are known and constructible. We will compute in terms of and these quantities. This will be a function in the variable , and we will find the value of for which this function attains its maximum.
We will start by computing . We will use the law of sines in . We get , and a similar equality from (for ). We obtain
We can now proceed in two ways. We could use the formula for linear combination of sine functions with same period but different phase shifts (see https://en.wikipedia.org/wiki/List_of_trigonometric_identities#Linear_combinations or https://mathworld.wolfram.com/HarmonicAdditionTheorem.html , (13)-(23)) or use calculus to find for which has its maximum value.
With the first method, we would obtain that for certain and , and we would choose such that . But we will use calculus, as a more mainstream approach. Compute the derivative and consider the equation . Use the formula for of sum of angles, and rearrange terms.
We have
Finally,
It is easy to verify that this value is valid (i.e. it can be an angle in a triangle), and it is indeed a point of maximum for (i.e. ; a geometric argument would work as well).
Now to answer the "and construct it" at the end of the statement of the problem, we will show that everything we did is constructible, rather than describe a lengthy, boring step by step construction. Recall that we already discussed that we can construct if we know . We just need to show that we can construct . We can construct differences of angles, and given an angle we can construct two segments whose ratio is the (or the , or the ) of the given angle, and vice-versa. Given three segments we can construct the segment . Thus, the expression giving is constructible.
[Solution by pf02, September 2024]
Remarks (added by pf02, September 2024)
1. In solution 2, I show where I use the condition that the triangles are assumed to be acute. The first solution does not make this clear. It seems intuitively true that the condition is not necessary. In other words, a circumscribed triangle exists, and it can be constructed even when one or both of the given triangles are right or obtuse. The condition seems to be necessary only for simplifying the proof. In the general case, we may need to rearrange the labeling of the vertices.
2. Solution 1 is elegant, even though its presentation would have benefited a lot from some editing. It gives a nice geometric insight into the problem. Solution 2 does not give much geometric insight, but it is computationally very explicit. The two solutions are so different that it is worth taking a little time to show that they are equivalent. I will outline the steps of the computation.
To show that they are equivalent, put the pictures together:
The idea from Solution 1 is to construct the circles circumscribed to and . They intersect at . Consider the angles shown on the picture. We have
The first equality follows from the law of sines in , the second follows from the equality of angles in a circle spanning the same arc, the third follows from the law of sines in . We gat . Similarly, we get from the other side of .
On the other hand, we have
Solve for and substitute in to obtain one equation in .
Now use the fact that is a diameter to write an equation between and :
Solve for in terms of and substitute in the equation in obtained before. After some straightforward computations we get exactly the equation in we had in Solution 2. The interested reader can easily work out the details, they are just straightforward algebraic computations.
See Also
1967 IMO (Problems) • Resources | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
All IMO Problems and Solutions |