Maths Olympiad Prep

Library / China Mathematical Competition /132 of 136

China Mathematical Competition

Geometry Difficulty 6.8 National Olympiad Prove it China

Suppose that the line ll: y=kx+my = kx + m (kk, mm are integers) intercepts an ellipse x216+y212=1\frac{x^2}{16} + \frac{y^2}{12} = 1 at two different points AA, BB, and intercepts the hyperbola x24−y212=1\frac{x^2}{4} - \frac{y^2}{12} = 1 at two different points CC, DD. Can the line ll be such that AC⃗+BD⃗=0\vec{AC} + \vec{BD} = 0? If yes, how many different possibilities are there for the line ll? If no, explain the reason.

Solution

For {y=kx+m,x216+y212=1\begin{cases} y = kx + m, \\ \frac{x^2}{16} + \frac{y^2}{12} = 1 \end{cases} by eliminating yy and simplifying it, we get
(3+4k2)x2+8kmx+4m2−48=0. (3 + 4k^2)x^2 + 8kmx + 4m^2 - 48 = 0.
Define A(x1,y1)A(x_1, y_1), B(x2,y2)B(x_2, y_2). Then x1+x2=−8km3+4k2x_1 + x_2 = -\frac{8km}{3+4k^2}.
Δ1=(8km)2−4(3+4k2)(4m2−48)>0.1◯ \Delta_1 = (8km)^2 - 4(3 + 4k^2)(4m^2 - 48) > 0. \quad \textcircled{1}
For {y=kx+m,x24−y212=1\begin{cases} y = kx + m, \\ \frac{x^2}{4} - \frac{y^2}{12} = 1 \end{cases} by eliminating yy and simplifying it, we get
(3−k2)x2−2kmx−m2−12=0. (3 - k^2)x^2 - 2kmx - m^2 - 12 = 0.
Define C(x3,y3)C(x_3, y_3), D(x4,y4)D(x_4, y_4). Then x3+x4=2km3−k2x_3 + x_4 = \frac{2km}{3 - k^2}.
Δ2=(−2km)2+4(3−k2)(m2+12)>0.2◯ \Delta_2 = (-2km)^2 + 4(3-k^2)(m^2+12) > 0. \quad \textcircled{2}
From AC⃗+BD⃗=0\vec{AC} + \vec{BD} = 0 we get (x4−x2)+(x3−x1)=0(x_4 - x_2) + (x_3 - x_1) = 0, which implies that x1+x2=x3+x4x_1 + x_2 = x_3 + x_4.
Then
−8km3+4k2=2km3−k2. -\frac{8km}{3+4k^2} = \frac{2km}{3-k^2}.
Therefore, km=0km = 0 or −43+4k2=13−k2-\frac{4}{3+4k^2} = \frac{1}{3-k^2} (discarded).
Then a possible solution is either k=0k = 0 or m=0m = 0.
When k=0k=0, from ① and ② we have −23<m<23-2\sqrt{3} < m < 2\sqrt{3}. As mm is an integer, it can be −3,−2,−1,0,1,2,3-3, -2, -1, 0, 1, 2, 3.
When m=0m=0, from ① and ② we have −3<k<3-\sqrt{3} < k < \sqrt{3}. As kk is an integer, it can be −1,0,1-1, 0, 1.
Combining the results above, we conclude that there are nine lines in total satisfying the given conditions.

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.