Difference between revisions of "1967 IMO Problems/Problem 4"
m |
m |
||
Line 70: | Line 70: | ||
<math>\alpha = \arctan \frac{b_0 \cos B \sin C + c_0 \sin B \cos (A_0 - C)} | <math>\alpha = \arctan \frac{b_0 \cos B \sin C + c_0 \sin B \cos (A_0 - C)} | ||
{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, and it is indeed | ||
+ | a point of maximum for <math>f(\alpha)</math>. | ||
+ | |||
+ | Now to answer the "and construct it" part of the problem, we | ||
+ | will show that everything we did is constructible, rather than | ||
+ | give 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)== | ||
+ | |||
Line 76: | Line 97: | ||
− | |||
TO BE CONTINUED. I AM SAVING MID WAY SO AS NOT TO LOSE WORK DONE SO FAR. | TO BE CONTINUED. I AM SAVING MID WAY SO AS NOT TO LOSE WORK DONE SO FAR. |
Revision as of 20:00, 3 September 2024
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 are similar, 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 .
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 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, and it is indeed a point of maximum for .
Now to answer the "and construct it" part of the problem, we will show that everything we did is constructible, rather than give 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)
TO BE CONTINUED. I AM SAVING MID WAY SO AS NOT TO LOSE WORK DONE SO FAR.
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 |