Maths Olympiad Prep

Track / Stage 6 / 322 of 400 #1802 of 2444

Problem 1802

National Olympiad, first round
Number theory Difficulty 6.7 Prove it Taiwan IMO Selection Camp · Taiwan

Choose arbitrarily a rational point P0=(xp,yp)P_0 = (x_p, y_p) on the ellipse C:x2+2y2=2098C: x^2 + 2y^2 = 2098. We will recursively determine P1,P2,P_1, P_2, \cdots in the following way: for all i=0,1,,i = 0, 1, \cdots,
(1) Select an integer point Qi=(xi,yi)Q_i = (x_i, y_i) not on CC, such that xi<50|x_i| < 50 and yi<50|y_i| < 50.
(2) Connect PiQi\overline{P_iQ_i}, and let its other intersection point with CC be Pi+1P_{i+1}.
Prove that: for any P0P_0, we can appropriately choose Q0,Q1,Q_0, Q_1, \cdots, such that there exists some nonnegative integer kk such that OPk=2017\overline{OP_k} = 2017.

(We say (x,y)(x, y) is an integer point if and only if xx and yy are both integers. We say (x,y)(x, y) is a rational point if and only if xx and yy are both rational numbers.)

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

1. It is easy to see that all the integer points on CC are (±44,±9)(\pm44, \pm9), and 442+92=201744^2 + 9^2 = 2017, so we only need to prove that after appropriate operations, some PkP_k is an integer point.

2. If P0P_0 is an integer point, then by 1. we may take k=0k=0, so assume P0=(a/m,b/m)P_0 = (a/m, b/m) is not an integer point, where a,b,mZa, b, m \in \mathbb{Z} and m>0m > 0.

– Clearly there exist integers ss and tt satisfying sam1/2|s - \frac{a}{m}| \le 1/2 and tbm1/2|t - \frac{b}{m}| \le 1/2. Also, s<2098+1<50|s| < \sqrt{2098} + 1 < 50, and similarly t<50|t| < 50, so we may take Q0=(s,t)Q_0 = (s, t).

Note that (sam)2+2(tbm)2=2098+s2+2t22(sa+2tb)/m=m/m(s - \frac{a}{m})^2 + 2(t - \frac{b}{m})^2 = 2098 + s^2 + 2t^2 - 2(sa + 2tb)/m = m'/m, where mNm' \in \mathbb{N}. But by definition, we have
(sam)2+2(tbm)21/4+2/4<1, \left| \left(s - \frac{a}{m}\right)^2 + 2\left(t - \frac{b}{m}\right)^2 \right| \le 1/4 + 2/4 < 1,
so m=m((sam)2+2(tbm)2)<mm' = m \left( \left(s - \frac{a}{m}\right)^2 + 2\left(t - \frac{b}{m}\right)^2 \right) < m.

– Now, suppose P1=(s+z(asm),t+z(btm))P_1 = (s+z(a-sm), t+z(b-tm)), then we have (s+z(asm))2+2(t+z(btm))2=2098(s+z(a-sm))^2 + 2(t+z(b-tm))^2 = 2098, and expanding gives
mmz2+2(s(asm)+2t(btm))z+(s2+2t22098)=0. \frac{m'}{m}z^2 + 2(s(a - sm) + 2t(b - tm))z + (s^2 + 2t^2 - 2098) = 0.
One solution of the above equation is z=1/mz = 1/m (corresponding to the solution for P0P_0), so by Vieta's formulas, the other solution is (s2+2t22098)/m(s^2 + 2t^2 - 2098)/m'. Therefore P1=(a/m,b/m)P_1 = (a'/m', b'/m'), where a,b,mZa', b', m' \in \mathbb{Z} and 0<m<m0 < m' < m.

- From the above discussion, if QiQ_i is chosen in the above manner at every step, then the denominator of the coordinates of the resulting Pi+1P_{i+1} will be smaller than the denominator of the coordinates of PiP_i. This means that there exists a sufficiently large kk such that PkP_k is an integer point OPk=2017\Rightarrow \overline{OP_k} = 2017. This completes the proof.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty, ordering) added by this project.