Maths Olympiad Prep

Library / /147 of 156

Geometry Difficulty 6.7 National Olympiad Prove it China

As shown in Fig. 11.1, in a plane rectangular coordinate system xOyxOy, the left and right foci of the ellipse Γ:x22+y2=1\Gamma : \frac{x^2}{2} + y^2 = 1 are F1,F2F_1, F_2, respectively. Let PP be a point on Γ\Gamma in the first quadrant, and the extensions of PF1,PF2PF_1, PF_2 intersect Γ\Gamma at points Q1,Q2Q_1, Q_2, respectively. Let r1,r2r_1, r_2 be the radii of the incircles of PF1Q2,PF2Q1\triangle PF_1Q_2, \triangle PF_2Q_1, respectively. Find the maximum of r1r2r_1 - r_2.

Solution

It is easy to find F1=(1,0),F2=(1,0)F_1 = (-1, 0), F_2 = (1, 0).
Denote P(x0,y0)P(x_0, y_0), Q1(x1,y1)Q_1(x_1, y_1), Q2(x2,y2)Q_2(x_2, y_2). By the given condition, it follows that
x0,y0>0,y1<0,y2<0. x_0, y_0 > 0, \quad y_1 < 0, \quad y_2 < 0.
By the definition of ellipse we get
PF1+PF2=Q1F1+Q1F2=Q2F1+Q2F2=22. |PF_1| + |PF_2| = |Q_1F_1| + |Q_1F_2| = |Q_2F_1| + |Q_2F_2| = 2\sqrt{2}.
Hence, the perimeters of PF1Q2\triangle PF_1Q_2 and PF2Q1\triangle PF_2Q_1 are both l=42l = 4\sqrt{2}.
And since F1F2=2|F_1F_2| = 2,
r1=2SPF1Q2l=(y0y2)F1F2l=y0y222. r_1 = \frac{2S_{\triangle PF_1Q_2}}{l} = \frac{(y_0 - y_2) \cdot |F_1F_2|}{l} = \frac{y_0 - y_2}{2\sqrt{2}}.
Similarly, we can get r2=y0y122r_2 = \frac{y_0 - y_1}{2\sqrt{2}}, so r1r2=y1y222r_1 - r_2 = \frac{y_1 - y_2}{2\sqrt{2}}.
In the following, we will first find y1y2y_1 - y_2.
Figure 1
Fig. 11.1

The equation of line PF1PF_1 is x=(x0+1)yy01x = \frac{(x_0 + 1)y}{y_0} - 1. Substituting it into x22+y2=1\frac{x^2}{2} + y^2 = 1 and rearranging it gives
((x0+1)22y02+1)y2x0+1y0y12=0. \left( \frac{(x_0 + 1)^2}{2y_0^2} + 1 \right) y^2 - \frac{x_0 + 1}{y_0} y - \frac{1}{2} = 0.
Multiplying both sides by 2y022y_0^2 and noticing that x02+2y02=2x_0^2 + 2y_0^2 = 2, we find that
(3+2x0)y22(x0+1)y0yy02=0. (3 + 2x_0)y^2 - 2(x_0 + 1)y_0y - y_0^2 = 0.
The two roots of this equation are y0y_0 and y1y_1. By Vieta's formulas, we get y0y1=y023+2x0y_0y_1 = -\frac{y_0^2}{3+2x_0}. Thus,
y1=y03+2x0. y_1 = -\frac{y_0}{3 + 2x_0}.
Similarly, we can get y2=y032x0y_2 = -\frac{y_0}{3 - 2x_0}. Therefore,
y1y2=y032x0y03+2x0=4x0y094x02. y_1 - y_2 = \frac{y_0}{3 - 2x_0} - \frac{y_0}{3 + 2x_0} = \frac{4x_0y_0}{9 - 4x_0^2}.
Since 94x02=12x02+9y02212x029y02=32x0y09 - 4x_0^2 = \frac{1}{2}x_0^2 + 9y_0^2 \ge 2\sqrt{\frac{1}{2}x_0^2 \cdot 9y_0^2} = 3\sqrt{2}x_0y_0, there is
r1r2=y1y222=2x0y094x022x0y032x0y0=13, r_1 - r_2 = \frac{y_1 - y_2}{2\sqrt{2}} = \frac{\sqrt{2}x_0y_0}{9 - 4x_0^2} \le \frac{\sqrt{2}x_0y_0}{3\sqrt{2}x_0y_0} = \frac{1}{3},
where the equality sign holds when 12x02=9y02\frac{1}{2}x_0^2 = 9y_0^2 is required. Accordingly, x0=355x_0 = \frac{3\sqrt{5}}{5}, y0=1010y_0 = \frac{\sqrt{10}}{10}.
Therefore, the maximum of r1r2r_1 - r_2 is y0=13y_0 = \frac{1}{3}. \square

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.