Maths Olympiad Prep

Library / /11 of 115

Geometry Difficulty 6.5 National olympiad Find the answer

Two given circles intersect in two points PP and QQ . Show how to construct a segment ABAB passing through PP and terminating on the two circles such that APPBAP\cdot PB is a maximum.

Figure (Asymptote source)
size(150); defaultpen(fontsize(7)); pair A=(0,0), B=(10,0), P=(4,0), Q=(3.7,-2.5); draw(A--B); draw(circumcircle(A,P,Q)); draw(circumcircle(B,P,Q)); label("A",A,(-1,1));label("P",P,(0,1.5));label("B",B,(1,1));label("Q",Q,(-0.5,-1.5));

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

A maximum APPBAP \cdot PB cannot be attained if ABAB intersects segment O1O2O_1O_2 because a larger value can be attained by making one of AA or BB diametrically opposite PP , which (as is easily checked) increases the value of both APAP and PBPB . Thus, assume ABAB does not intersect O1O2O_1O_2 .
Let EE and FF be the centers of the small and big circles, respectively, and rr and RR be their respective radii.
Let MM and NN be the feet of EE and FF to ABAB , and α=APE\alpha = \angle APE and ϵ=BPF\epsilon = \angle BPF
We have:
AP×PB=2rcosα×2Rcosϵ=4rRcosαcosϵAP \times PB = 2r \cos{\alpha} \times 2R \cos{\epsilon} = 4 rR \cos{\alpha} \cos{\epsilon}
AP×PBAP\times PB is maximum when the product cosαcosϵ\cos{\alpha} \cos{\epsilon} is a maximum.
We have cosαcosϵ=12[cos(α+ϵ)+cos(αϵ)]\cos{\alpha} \cos{\epsilon}= \frac{1}{2} [\cos(\alpha +\epsilon) + \cos(\alpha -\epsilon)]
But α+ϵ=180EPF\alpha +\epsilon = 180^{\circ} - \angle EPF and is fixed, so is cos(α+ϵ)\cos(\alpha +\epsilon) .
So its maximum depends on cos(αϵ)cos(\alpha -\epsilon) which occurs when α=ϵ\alpha=\epsilon . To draw the line ABAB :
Draw a circle with center PP and radius PEPE to cut the radius PFPF at HH . Draw the line parallel to EHEH passing through PP . This line meets the small and big circles at AA and BB , respectively.

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.