Maths Olympiad Prep

Library / /281 of 520

Geometry Difficulty 5.3 AIME, harder Find the answer

12. (16 points) On the Cartesian plane, a point whose both coordinates are rational numbers is called a rational point. Find the smallest positive integer kk such that: for every circle that contains kk rational points on its circumference, the circle must contain infinitely many rational points on its circumference.

A number or a short expression. Spacing and $ signs are ignored.

Solution

12. First, prove: If a circle's circumference contains 3 rational points, then the circumference must contain infinitely many rational points.

Let C0\odot C_{0} in the plane have 3 rational points Pi(xi,yi)(i=1,2,3)P_{i}\left(x_{i}, y_{i}\right)(i=1,2,3) on its circumference, with the center C0(x0,y0)C_{0}\left(x_{0}, y_{0}\right).

Since the perpendicular bisectors of segments P1P2P_{1} P_{2} and P1P3P_{1} P_{3} pass through the center C0C_{0}, we have
{(y2y1)(y0y1+y22)+(x2x1)(x0x1+x22)=0,(y3y1)(y0y1+y32)+(x3x1)(x0x1+x32)=0. \left\{\begin{array}{l} \left(y_{2}-y_{1}\right)\left(y_{0}-\frac{y_{1}+y_{2}}{2}\right)+\left(x_{2}-x_{1}\right)\left(x_{0}-\frac{x_{1}+x_{2}}{2}\right)=0, \\ \left(y_{3}-y_{1}\right)\left(y_{0}-\frac{y_{1}+y_{3}}{2}\right)+\left(x_{3}-x_{1}\right)\left(x_{0}-\frac{x_{1}+x_{3}}{2}\right)=0 . \end{array}\right.

Since xiyi(i=1,2,3)x_{i} 、 y_{i}(i=1,2,3) are all rational numbers, the solution (x0,y0)\left(x_{0}, y_{0}\right) of the above system of linear equations in x0y0x_{0} 、 y_{0} is also a rational number, i.e., C0C_{0} is a rational point.
Suppose the coordinates of the rational point Pn(xn,yn)P_{n}\left(x_{n}, y_{n}\right) are
{xn=x0+an(x3x0)bn(y3y0),yn=y0+bn(x3x0)+an(y3y0), where, an=n21n2+1,bn=2nn2+1(n=4,5,). \begin{array}{l} \qquad\left\{\begin{array}{l} x_{n}=x_{0}+a_{n}\left(x_{3}-x_{0}\right)-b_{n}\left(y_{3}-y_{0}\right), \\ y_{n}=y_{0}+b_{n}\left(x_{3}-x_{0}\right)+a_{n}\left(y_{3}-y_{0}\right), \end{array}\right. \\ \text { where, } a_{n}=\frac{n^{2}-1}{n^{2}+1}, b_{n}=\frac{2 n}{n^{2}+1}(n=4,5, \cdots) . \end{array}

Then PnC02\left|P_{n} C_{0}\right|^{2}
=[an(x3x0)bn(y3y0)]2+[bn(x3x0)+an(y3y0)]2=(an2+bn2)[(x3x0)2+(y3y0)2]=(x3x0)2+(y3y0)2=P3C02. \begin{aligned} = & {\left[a_{n}\left(x_{3}-x_{0}\right)-b_{n}\left(y_{3}-y_{0}\right)\right]^{2}+} \\ & {\left[b_{n}\left(x_{3}-x_{0}\right)+a_{n}\left(y_{3}-y_{0}\right)\right]^{2} } \\ = & \left(a_{n}^{2}+b_{n}^{2}\right)\left[\left(x_{3}-x_{0}\right)^{2}+\left(y_{3}-y_{0}\right)^{2}\right] \\ = & \left(x_{3}-x_{0}\right)^{2}+\left(y_{3}-y_{0}\right)^{2}=\left|P_{3} C_{0}\right|^{2} . \end{aligned}

Hence, the points Pn(n=4,5,)P_{n}(n=4,5, \cdots) are all on the circumference of C0\odot C_{0}, i.e., the circumference of C0\odot C_{0} contains infinitely many rational points.

Second, construct an example of a circle whose circumference contains only two rational points.
C:(x2)2+(y2)2=6. C:(x-\sqrt{2})^{2}+(y-\sqrt{2})^{2}=6 .

It is easy to verify that P1(1,1)P_{1}(-1,1) and P2(1,1)P_{2}(1,-1) are on the circumference of CC. If the circumference of CC contains another rational point P3(x3,y3)P_{3}\left(x_{3}, y_{3}\right) different from P1P_{1} and P2P_{2}, then
(x32)2+(y32)2=6 \left(x_{3}-\sqrt{2}\right)^{2}+\left(y_{3}-\sqrt{2}\right)^{2}=6 \text {, }

i.e., x32+y322=22(x3+y3)x_{3}^{2}+y_{3}^{2}-2=2 \sqrt{2}\left(x_{3}+y_{3}\right).
Since the left side is a rational number and 2\sqrt{2} is an irrational number, we have x3+y3=0x_{3}+y_{3}=0. Thus, x32=1x_{3}^{2}=1. Hence, x3=±1,y3=x_{3}= \pm 1, y_{3}= 1\mp 1. This contradicts the assumption that P3P_{3} is different from P1P_{1} and P2P_{2}.
In conclusion, the minimum value of kk is 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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.