Maths Olympiad Prep

Library / South-Afrika /62 of 64

South-Afrika, 2011

Geometry Difficulty 7.0 National Olympiad, round 2 Prove it South Africa

Given a non-isosceles triangle ABCABC, let DD, EE and FF denote the midpoints of the sides BCBC, CACA and ABAB respectively. The circumcircle of triangle BCFBCF and the line BEBE meet again at PP, and the circumcircle of ABEABE and the line ADAD meet again in QQ. Finally, the lines DPDP and FQFQ meet at RR. Prove that the centroid GG of the triangle ABCABC lies on the circle PQRPQR.

Solution

We will use the following lemma:

Lemma 1. Let ADAD be a median in triangle ABCABC. Then cot⁡∠BAD=2cot⁡A+cot⁡B\cot \angle BAD = 2 \cot A + \cot B and cot⁡∠ADC=12(cot⁡B−cot⁡C)\cot \angle ADC = \frac{1}{2}(\cot B - \cot C).

Proof. Let CC1CC_1 and DD1DD_1 be the perpendiculars from CC and DD to ABAB. Using signed lengths, we write
cot⁡BAD=AD1DD1=12(AC1+AB)12CC1=CC1cot⁡A+CC1(cot⁡A+cot⁡B)CC1=2cot⁡A+cot⁡B. \begin{align*} \cot BAD &= \frac{AD_1}{DD_1} \\ &= \frac{\frac{1}{2}(AC_1 + AB)}{\frac{1}{2}CC_1} \\ &= \frac{CC_1 \cot A + CC_1(\cot A + \cot B)}{CC_1} \\ &= 2 \cot A + \cot B. \end{align*}
Similarly, denoting by A1A_1 the projection of AA onto BCBC, we get
cot⁡ADC=DA1AA1 \cot ADC = \frac{DA_1}{AA_1}
=12BC−A1CAA1=12(AA1cot⁡B+AA1cot⁡C)−AA1cot⁡CAA1=12(cot⁡B−cot⁡C). \begin{aligned} &= \frac{\frac{1}{2}BC - A_1C}{AA_1} \\ &= \frac{\frac{1}{2}(AA_1 \cot B + AA_1 \cot C) - AA_1 \cot C}{AA_1} \\ &= \frac{1}{2}(\cot B - \cot C). \end{aligned}
□

Turning to the given problem, by the lemma we get
cot⁡BPD=2cot⁡BPC+cot⁡PBC=2cot⁡BFC+cot⁡PBC(from circle BFPC)=2⋅12(cot⁡A−cot⁡B)+2cot⁡B+cot⁡C=cot⁡A+cot⁡B+cot⁡C. \begin{aligned} \cot BPD &= 2 \cot BPC + \cot PBC \\ &= 2 \cot BFC + \cot PBC \quad (\text{from circle } BFPC) \\ &= 2 \cdot \frac{1}{2}(\cot A - \cot B) + 2 \cot B + \cot C \\ &= \cot A + \cot B + \cot C. \end{aligned}
Similarly, cot⁡GQF=cot⁡A+cot⁡B+cot⁡C\cot GQF = \cot A + \cot B + \cot C, so ∠GPR=∠GQF\angle GPR = \angle GQF and GPRQGPRQ is cyclic.

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

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