Distinct points , , , lie on the circle and have integer coordinates. The distances and are irrational numbers. What is the greatest possible value of the ratio ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Only 12 lattice points lie on the circle; the longest irrational chord is sqrt(98) = 7 sqrt(2) and the shortest is sqrt(2), so the ratio is 7.
Solution
The integer solutions of come from , giving the points , , , .
The squared distance between two lattice points is an integer, so a distance is irrational exactly when that integer is not a perfect square. To maximize , make as large as possible and as small as possible.
Largest: the diameter has length , which is rational and not allowed. The next-longest chords join nearly opposite points such as and : squared distance , so . (Any other pair gives a smaller squared distance, e.g. to gives .)
Smallest: neighboring points such as and have squared distance , so . No two distinct lattice points are closer than , and distance does not occur on this circle.
These four points are distinct, and
The answer is .
Why this works
A finite, listable set of points turns an optimization into an enumeration: maximize the numerator and minimize the denominator separately, subject to the irrationality filter. Squared distances between lattice points are integers, so "irrational" simply means "not a perfect square," and the diameter is the one natural candidate that fails.
The trap
Using the diameter 10 as PQ, forgetting that PQ must be irrational.
Common mistakes
- Using the diameter 10 as PQ, forgetting that PQ must be irrational.
- Missing the points and working only with and the axis points, so the shortest chord is never found.
Techniques
Organized listing / direct enumeration · Consider the largest/smallest element or boundary case