Maths Olympiad Prep

Library / /19 of 19

Geometry Difficulty 7.2 National olympiad, round 2 Prove it Romania

The incircle of triangle ABCABC touches the sides BCBC, CACA, and ABAB at DD, EE, and FF respectively. On the line segments EFEF, FDFD, and DEDE, consider the points MM, NN, and PP respectively such that the sums BM+MCBM + MC, CN+NACN + NA, and AP+PBAP + PB are minimum.

a) Prove that the lines AMAM, BNBN, and CPCP are concurrent.

b) Prove that DMDM, ENEN and FPFP are the altitudes of triangle DEFDEF.

Figure 1

Solution

a) Let SS be the reflection of CC across the line EFEF. As AE=AFAE = AF, it follows that AFE=AEF\angle AFE = \angle AEF, hence BFE=FEC=FES\angle BFE = \angle FEC = \angle FES, therefore FBFB and ESES are parallel. FBESFBES is a trapezoid (or a parallelogram); let MM be the intersection point of its diagonals. According to the billiards problem, MM is the point of the line EFEF for which the sum BM+MCBM + MC is minimum. Triangles BFMBFM and SEMSEM are similar, therefore FMEM=FBES=FBEC=sbsc\frac{FM}{EM} = \frac{FB}{ES} = \frac{FB}{EC} = \frac{s-b}{s-c}. It follows that sin(FAM)sin(EAM)=[FAM][EAM]=FMEM=sbsc\frac{\sin(FAM)}{\sin(EAM)} = \frac{[FAM]}{[EAM]} = \frac{FM}{EM} = \frac{s-b}{s-c}. Multiplying this with the two analogous relations we get
sin(FAM)sin(EAM)sin(ECP)sin(DCP)sin(DBN)sin(NBF)=1. \frac{\sin(FAM)}{\sin(EAM)} \cdot \frac{\sin(ECP)}{\sin(DCP)} \cdot \frac{\sin(DBN)}{\sin(NBF)} = 1.
By the converse of the trigonometric form of Ceva's theorem, it follows that the lines AMAM, BNBN, and CPCP are concurrent.

b) We have FMEM=pbpc=BDCD=BFCE\frac{FM}{EM} = \frac{p-b}{p-c} = \frac{BD}{CD} = \frac{BF}{CE}, hence, from a well-known problem ("The gliding bisector Theorem") it follows that DMDM is parallel to the bisector of angle BAC\angle BAC. The bisector is perpendicular to EFEF, therefore DMDM is also perpendicular to EFEF.

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 and solution reproduced as published; topic and difficulty added by this site.