Existence of a nontrivial solution
Statement
For every positive integer that is not a perfect square, has a solution with positive integers.
Why is it true?
It is not obvious at all that a hyperbola , which certainly has real points, must pass through a lattice point — this theorem guarantees it always does, for every non-square , via a clever pigeonhole argument on rational approximations.
Proof sketch
By Dirichlet's approximation theorem, for any integer there exist integers with and . Letting produces infinitely many pairs with .
For each such pair, , so . Thus takes one of only finitely many integer values in , while there are infinitely many pairs .
By the pigeonhole principle, some fixed nonzero integer in that finite range satisfies for infinitely many pairs . Among these infinitely many pairs, again by pigeonhole, infinitely many share the same residues .
Take two distinct such pairs with and matching residues mod . Set ; expanding shows and are honest integers precisely because of the matching residues mod , and multiplicativity of the norm gives . Since but they give the same ratio in the limit, one checks , and replacing by (still a solution, since only squares appear) gives a solution in positive integers.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Sean Hallgren (2007). Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem · DOI:10.1145/1206035.1206039
- Hendrik W. Lenstra Jr. (2002). Solving the Pell Equation