Maths Olympiad Prep

Library / /1150 of 1394

Geometry Difficulty 5.7 AIME, harder Prove it United States

Problem:

Point YY lies on line segment XZX Z such that XY=5X Y=5 and YZ=3Y Z=3. Point GG lies on line XZX Z such that there exists a triangle ABCA B C with centroid GG such that XX lies on line BCB C, YY lies on line ACA C, and ZZ lies on line ABA B. Compute the largest possible value of XGX G.

Solution

Solution:

The key claim is that we must have 1XG+1YG+1ZG=0\frac{1}{X G}+\frac{1}{Y G}+\frac{1}{Z G}=0 (in directed lengths).

We present three proofs of this fact.

Proof 1: By a suitable affine transformation, we can assume without loss of generality that ABCA B C is equilateral. Now perform an inversion about GG with radius GA=GB=GCG A=G B=G C. Then the images of X,Y,ZX, Y, Z (call them X,Y,ZX', Y', Z') lie on (GBC),(GAC),(GAB)(G B C), (G A C), (G A B), so they are the feet of the perpendiculars from A1,B1,C1A_1, B_1, C_1 to line XYZX Y Z, where A1,B1,C1A_1, B_1, C_1 are the respective antipodes of GG on (GBC),(GAC),(GAB)(G B C), (G A C), (G A B). But now A1B1C1A_1 B_1 C_1 is an equilateral triangle with medial triangle ABCA B C, so its centroid is GG. Now the centroid of (degenerate) triangle XYZX' Y' Z' is the foot of the perpendicular of the centroid of A1B1C1A_1 B_1 C_1 onto the line, so it is GG. Thus XG+YG+ZG=0X' G + Y' G + Z' G = 0, which yields the desired claim.

Proof 2: Let WW be the point on line XYZX Y Z such that WG=2GXW G = 2 G X (in directed lengths). Now note that (Y,Z;G,W)(Y, Z ; G, W) is a harmonic bundle, since projecting it through AA onto BCB C gives (B,C;MBC,BC)(B, C ; M_{B C}, \infty_{B C}). By harmonic bundle properties, this yields that 1YG+1ZG=2WG\frac{1}{Y G} + \frac{1}{Z G} = \frac{2}{W G} (in directed lengths), which gives the desired.

Proof 3: Let PGP \neq G be an arbitrary point on the line XYZX Y Z. Now, in directed lengths and signed areas, GPGX=[GBP][GBX]=[GCP][GCX]\frac{G P}{G X} = \frac{[G B P]}{[G B X]} = \frac{[G C P]}{[G C X]}, so GPGX=[GBP][GCP][GBX][GCX]=[GBP][GCP][GBC]=3([GBP][GCP])[ABC]\frac{G P}{G X} = \frac{[G B P] - [G C P]}{[G B X] - [G C X]} = \frac{[G B P] - [G C P]}{[G B C]} = \frac{3([G B P] - [G C P])}{[A B C]}. Writing analogous equations for GPGY\frac{G P}{G Y} and GPGZ\frac{G P}{G Z} and summing yields GPGX+GPGY+GPGZ=0\frac{G P}{G X} + \frac{G P}{G Y} + \frac{G P}{G Z} = 0, giving the desired.

With this lemma, we may now set XG=gX G = g and know that
1g+1g5+1g8=0 \frac{1}{g} + \frac{1}{g-5} + \frac{1}{g-8} = 0
Solving the quadratic gives the solutions g=2g = 2 and g=203g = \frac{20}{3}; the latter hence gives the maximum (it is not difficult to construct an example for which XGX G is indeed 20/320/3).

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.