Maths Olympiad Prep

Library / /16 of 24

, 2023

Geometry Difficulty 7.0 National Olympiad Prove it Canada

Problem:

An acute triangle is a triangle that has all angles less than 9090^{\circ} (9090^{\circ} is a Right Angle). Let ABCABC be an acute triangle with altitudes ADAD, BEBE, and CFCF meeting at HH. The circle passing through points DD, EE, and FF meets ADAD, BEBE, and CFCF again at XX, YY, and ZZ respectively. Prove the following inequality:
AHDX+BHEY+CHFZ3 \frac{AH}{DX} + \frac{BH}{EY} + \frac{CH}{FZ} \geq 3

Solution

Solution:

Let the circumcircle of ABCABC meet the altitudes ADAD, BEBE, and CFCF again at II, JJ, and KK respectively.

Figure 1

Lemma (9-point circle). II, JJ, KK are the reflections of HH across BCBC, CACA, ABAB. Moreover, DD, EE, FF, XX, YY, ZZ are the midpoints of HIHI, HJHJ, HKHK, HAHA, HBHB, HCHC.

Proof. Since ABDEABDE and ABICABIC are cyclic, we see that
EBD=EAD=CAI=CBI. \angle EBD = \angle EAD = \angle CAI = \angle CBI.
Hence the lines BIBI and BHBH are reflections across BCBC. Similarly, CHCH and CICI are reflections across BCBC, so II is the reflection of HH across BCBC. The analogous claims for JJ and KK follow. A ×2\times 2 dilation from HH now establishes the result.

From this lemma, we get AI=2XDAI = 2XD, BJ=2EYBJ = 2EY, and CK=2FZCK = 2FZ. Hence it is equivalent to showing that
AH2DX+BH2EY+CH2FZ32 \frac{AH}{2DX} + \frac{BH}{2EY} + \frac{CH}{2FZ} \geq \frac{3}{2}
which is in turn equivalent to
AHAI+BHBJ+CHCK32. \frac{AH}{AI} + \frac{BH}{BJ} + \frac{CH}{CK} \geq \frac{3}{2}.
Let a=JKa = JK, b=KIb = KI and c=IJc = IJ. Again by the lemma we find AH=AK=AJAH = AK = AJ, so by Ptolemy's theorem on AKIJAKIJ,
AJKI+AKIJ=AIJK AJ \cdot KI + AK \cdot IJ = AI \cdot JK
Substituting and rearranging,
AHb+AHc=AIaAH(b+c)=AIaAHAI=ab+c. \begin{aligned} AH \cdot b + AH \cdot c & = AI \cdot a \\ AH \cdot (b + c) & = AI \cdot a \\ \frac{AH}{AI} & = \frac{a}{b + c}. \end{aligned}
Similarly,
BHBJ=bc+aandCHCK=ca+b \frac{BH}{BJ} = \frac{b}{c + a} \quad \text{and} \quad \frac{CH}{CK} = \frac{c}{a + b}
Plugging these back into ()\left(^*\right), the desired inequality is now
ab+c+ba+c+ca+b32. \frac{a}{b + c} + \frac{b}{a + c} + \frac{c}{a + b} \geq \frac{3}{2}.
This is known as Nesbitt's Inequality, which has many proofs. Below is one such proof.

Add 3 to both sides and rearrange:
(ab+c+1)+(bc+a+1)+(ca+b+1)32+3a+b+cb+c+a+b+cc+a+a+b+ca+b92(a+b+c)(1b+c+1c+a+1a+b)92(b+c)+(c+a)+(a+b)3 \begin{aligned} \left(\frac{a}{b + c} + 1\right) + \left(\frac{b}{c + a} + 1\right) + \left(\frac{c}{a + b} + 1\right) & \geq \frac{3}{2} + 3 \\ \Longleftrightarrow \quad \frac{a + b + c}{b + c} + \frac{a + b + c}{c + a} + \frac{a + b + c}{a + b} & \geq \frac{9}{2} \\ \Longleftrightarrow \quad (a + b + c)\left(\frac{1}{b + c} + \frac{1}{c + a} + \frac{1}{a + b}\right) & \geq \frac{9}{2} \\ \Longleftrightarrow \quad & \frac{(b + c) + (c + a) + (a + b)}{3} \end{aligned}
which is true by the AM-HM inequality.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.