Maths Olympiad Prep

Library / /146 of 156

Geometry Difficulty 6.5 National Olympiad Prove it China

As shown in Fig. 11.1, in a plane rectangular coordinate system xOyxOy, the left and right foci of 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(x1,y1),Q2(x2,y2)Q_1(x_1, y_1), Q_2(x_2, y_2), respectively.

Find the maximum of y1y2y_1 - y_2.

Solution

As shown in Fig. 11.1, we find F1(1,0),Q2(1,0)F_1(-1, 0), Q_2(1, 0).
Denote P(x0,y0)P(x_0, y_0). By the condition, it follows that x0,y0>0x_0, y_0 > 0, y1<0y_1 < 0, y2<0y_2 < 0.
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 organizing it yields
((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 noting that x02+2y02=2x_0^2 + 2y_0^2 = 2, we get
(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 y0,y1y_0, y_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, it follows that
y1y24x0y032x0y0=223, y_1 - y_2 \le \frac{4x_0y_0}{3\sqrt{2}x_0y_0} = \frac{2\sqrt{2}}{3},
where the equal sign holds when 12x02=9y02\frac{1}{2}x_0^2 = 9y_0^2 is required, and accordingly x0=355,y0=1010x_0 = \frac{3\sqrt{5}}{5}, y_0 = \frac{\sqrt{10}}{10}.
Therefore, the maximum of y1y2y_1 - y_2 is 223\frac{2\sqrt{2}}{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.