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 k such that: for every circle that contains k 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 in the plane have 3 rational points Pi(xi,yi)(i=1,2,3) on its circumference, with the center C0(x0,y0).
Since the perpendicular bisectors of segments P1P2 and P1P3 pass through the center C0, we have {(y2−y1)(y0−2y1+y2)+(x2−x1)(x0−2x1+x2)=0,(y3−y1)(y0−2y1+y3)+(x3−x1)(x0−2x1+x3)=0.
Since xi、yi(i=1,2,3) are all rational numbers, the solution (x0,y0) of the above system of linear equations in x0、y0 is also a rational number, i.e., C0 is a rational point. Suppose the coordinates of the rational point Pn(xn,yn) are {xn=x0+an(x3−x0)−bn(y3−y0),yn=y0+bn(x3−x0)+an(y3−y0), where, an=n2+1n2−1,bn=n2+12n(n=4,5,⋯).
Then ∣PnC0∣2 ===[an(x3−x0)−bn(y3−y0)]2+[bn(x3−x0)+an(y3−y0)]2(an2+bn2)[(x3−x0)2+(y3−y0)2](x3−x0)2+(y3−y0)2=∣P3C0∣2.
Hence, the points Pn(n=4,5,⋯) are all on the circumference of ⊙C0, i.e., the circumference of ⊙C0 contains infinitely many rational points.
Second, construct an example of a circle whose circumference contains only two rational points. C:(x−2)2+(y−2)2=6.
It is easy to verify that P1(−1,1) and P2(1,−1) are on the circumference of C. If the circumference of C contains another rational point P3(x3,y3) different from P1 and P2, then (x3−2)2+(y3−2)2=6,
i.e., x32+y32−2=22(x3+y3). Since the left side is a rational number and 2 is an irrational number, we have x3+y3=0. Thus, x32=1. Hence, x3=±1,y3=∓1. This contradicts the assumption that P3 is different from P1 and P2. In conclusion, the minimum value of k 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.