Math 2.0

Number theory Proof

Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation

Builds on Pell's equationIrrationality of square roots of non-squaresDirichlet's approximation theoremPigeonhole principleInfinite pigeonhole principleBrahmagupta–Fibonacci identity

Proof

  1. Since dd is not a perfect square, d\sqrt{d} is irrational by the irrationality of square roots of non-squares.
  2. Claim: there are infinitely many pairs of integers (p,q)(p, q) with q≥1q \ge 1 and ∣p−qd∣<1/q\abs{p - q\sqrt{d}} < 1/q.
  3. For a positive integer NN, Dirichlet's approximation theorem gives integers pp, qq with 1≤q≤N1 \le q \le N and ∣qd−p∣≤1N+1<1N≤1q\abs{q\sqrt{d} - p} \le \frac{1}{N+1} < \frac{1}{N} \le \frac{1}{q}. So at least one such pair exists.
  4. Suppose only finitely many pairs had this property. By step 1, p−qd≠0p - q\sqrt{d} \ne 0 for each of them. Let μ>0\mu > 0 be the least value of ∣p−qd∣\abs{p - q\sqrt{d}} over them.
  5. Choose NN with 1N+1<μ\frac{1}{N+1} < \mu. Step 3 gives a pair with the property and ∣p−qd∣<μ\abs{p - q\sqrt{d}} < \mu. It is not in the finite list, a contradiction. This proves the claim.
  6. For each pair of step 2, ∣p+qd∣≤∣p−qd∣+2qd<1q+2qd\abs{p + q\sqrt{d}} \le \abs{p - q\sqrt{d}} + 2q\sqrt{d} < \frac{1}{q} + 2q\sqrt{d}.
  7. So ∣p2−dq2∣=∣p−qd∣⋅∣p+qd∣<1q(1q+2qd)≤1+2d\abs{p^2 - d q^2} = \abs{p - q\sqrt{d}} \cdot \abs{p + q\sqrt{d}} < \frac{1}{q}\left(\frac{1}{q} + 2q\sqrt{d}\right) \le 1 + 2\sqrt{d}.
  8. Also p2−dq2≠0p^2 - d q^2 \ne 0, since otherwise d=∣p∣/q\sqrt{d} = \abs{p}/q would be rational.
  9. So p2−dq2p^2 - dq^2 takes values in the finite set of nonzero integers kk with ∣k∣<1+2d\abs{k} < 1 + 2\sqrt{d}. By the infinite pigeonhole principle, some such kk equals p2−dq2p^2 - dq^2 for infinitely many pairs of step 2.
  10. Each such pair gives a pair of residues (p mod ∣k∣,q mod ∣k∣)(p \bmod \abs{k}, q \bmod \abs{k}), and there are only k2k^2 of these. By the pigeonhole principle, there are two different pairs (p1,q1)≠(p2,q2)(p_1, q_1) \ne (p_2, q_2) among them with p1≡p2p_1 \equiv p_2 and q1≡q2(mod∣k∣)q_1 \equiv q_2 \pmod{\abs{k}}.
  11. Put X=p1p2−dq1q2X = p_1 p_2 - d q_1 q_2 and Y=q1p2−p1q2Y = q_1 p_2 - p_1 q_2. Then (p1+q1d)(p2−q2d)=X+Yd(p_1 + q_1\sqrt{d})(p_2 - q_2\sqrt{d}) = X + Y\sqrt{d}.
  12. Modulo ∣k∣\abs{k}, step 10 gives X≡p12−dq12=k≡0X \equiv p_1^2 - d q_1^2 = k \equiv 0 and Y≡q1p1−p1q1=0Y \equiv q_1 p_1 - p_1 q_1 = 0. So X=kxX = kx and Y=kyY = ky for integers xx and yy.
  13. Expanding both sides, as in the Brahmagupta–Fibonacci identity, gives X2−dY2=(p12−dq12)(p22−dq22)=k2X^2 - dY^2 = (p_1^2 - d q_1^2)(p_2^2 - d q_2^2) = k^2.
  14. By steps 12 and 13, k2(x2−dy2)=k2k^2 (x^2 - d y^2) = k^2. Since k≠0k \ne 0, x2−dy2=1x^2 - d y^2 = 1.
  15. Suppose y=0y = 0. Then Y=0Y = 0, so p2/q2=p1/q1p_2/q_2 = p_1/q_1. Put t=q2/q1>0t = q_2/q_1 > 0; then p2=tp1p_2 = t p_1 and q2=tq1q_2 = t q_1.
  16. Then k=p22−dq22=t2(p12−dq12)=t2kk = p_2^2 - d q_2^2 = t^2 (p_1^2 - d q_1^2) = t^2 k, so t2=1t^2 = 1 and t=1t = 1. This gives (p2,q2)=(p1,q1)(p_2, q_2) = (p_1, q_1), contrary to step 10. So y≠0y \ne 0.
  17. So Pell's equation has a solution (x,y)(x, y) with y≠0y \ne 0. Replacing xx by ∣x∣\abs{x} and yy by ∣y∣\abs{y}, we may take x≥1x \ge 1 and y≥1y \ge 1.
  18. For infinitely many solutions, put u=x+ydu = x + y\sqrt{d}. Then u≥1+d>1u \ge 1 + \sqrt{d} > 1.
  19. Define integers xnx_n, yny_n for n≥0n \ge 0 by x0=1x_0 = 1, y0=0y_0 = 0, xn+1=xxn+dyynx_{n+1} = x x_n + d y y_n and yn+1=yxn+xyny_{n+1} = y x_n + x y_n.
  20. By induction on nn, xn+ynd=unx_n + y_n \sqrt{d} = u^n and xn−ynd=(x−yd)nx_n - y_n\sqrt{d} = (x - y\sqrt{d})^n. Both follow by multiplying out (x±yd)(xn±ynd)(x \pm y\sqrt{d})(x_n \pm y_n\sqrt{d}).
  21. Multiplying the two formulas of step 20 gives xn2−dyn2=(x2−dy2)n=1x_n^2 - d y_n^2 = (x^2 - d y^2)^n = 1. So each (xn,yn)(x_n, y_n) is a solution.
  22. Since u>1u > 1, the numbers unu^n are pairwise different. So the pairs (xn,yn)(x_n, y_n) are pairwise different, and Pell's equation has infinitely many integer solutions.

Idea

Dirichlet's theorem gives infinitely many fractions p/qp/q near d\sqrt{d}, and for them p2−dq2p^2 - dq^2 stays bounded. So one value kk repeats infinitely often, and two of these pairs agree modulo kk. Dividing one by the other, in the form (p1+q1d)(p2−q2d)/k(p_1 + q_1\sqrt{d})(p_2 - q_2\sqrt{d})/k, gives a solution of norm 11. Powers of one solution then give infinitely many.

Reading path

To understand this page from the ground up, read these 120 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the approximation property of the supremum, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof that a composition of injections is injective, Proof of Euclid's lemma, Proof of the Brahmagupta–Fibonacci identity, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of strong induction from ordinary induction, Proof of the fundamental theorem of arithmetic, Proof of the complement principle, Proof of the pigeonhole principle, Proof that a composition of surjections is surjective, Proof of the existence of prime factorization, Proof of Dirichlet's approximation theorem by the pigeonhole principle, Proof of the rule of sum, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof that the reals are Archimedean from the completeness axiom, Proof of the bijection principle, Proof of the irrationality of square roots of non-squares, Proof of the existence of a prime divisor, Proof of the infinite pigeonhole principle.

  1. Cardinality of a finite set definition
  2. Construction of the reals from Cauchy sequences concept
  3. Definition by recursion concept
  4. Diophantine equation concept
  5. Divisibility definition
  6. Element definition
  7. Group concept
  8. Integers object
  9. Mathematical induction concept
  10. Natural numbers object
  11. Ordered field definition
  12. Peano axioms concept
  13. Proposition concept
  14. Rational numbers object
  15. Real numbers object
  16. Set bounded above definition
  17. Pell's equation definition
  18. Greatest common divisor definition
  19. Prime number definition
  20. Set definition
  21. Ring definition
  22. Ring of integers statement
  23. Archimedean ordered field definition
  24. Successor function definition
  25. Conjunction definition
  26. Implication definition
  27. Predicate definition
  28. Irrational number definition
  29. The reals form a field statement
  30. Supremum definition
  31. Coprime integers definition
  32. Prime factorization definition
  33. Empty set object
  34. Ordered pair definition
  35. Commutative ring definition
  36. Intersection definition
  37. Addition of natural numbers definition
  38. The rationals form a field statement
  39. The successor function is injective statement
  40. Zero is not a successor statement
  41. Existential quantifier definition
  42. Universal quantifier definition
  43. Completeness axiom statement
  44. Cartesian product definition
  45. Disjoint sets definition
  46. Proof of the Brahmagupta–Fibonacci identity proof
  47. Proof of the commutativity of addition by induction proof
  48. Subset definition
  49. Order on the natural numbers definition
  50. The rationals form an ordered field statement
  51. Uniqueness quantifier definition
  52. Binary relation definition
  53. Brahmagupta–Fibonacci identity statement
  54. Order on the reals definition
  55. Commutativity of addition statement
  56. Proof of strong induction from ordinary induction proof
  57. Antisymmetric relation definition
  58. Reflexive relation definition
  59. Transitive relation definition
  60. Function definition
  61. Strong induction statement
  62. Preorder definition
  63. Codomain definition
  64. Function composition definition
  65. Identity function definition
  66. Injective function definition
  67. Image of a set definition
  68. Proof of the well-ordering principle from strong induction proof
  69. Partial order definition
  70. Surjective function definition
  71. Left inverse definition
  72. Right inverse definition
  73. Proof that a composition of injections is injective proof
  74. Well-ordering principle statement
  75. Total order definition
  76. Proof that a composition of surjections is surjective proof
  77. Bijective function definition
  78. Composition of injections is injective statement
  79. Proof of the existence of a prime divisor proof
  80. Proof of the division algorithm proof
  81. Proof of the rule of sum proof
  82. Composition of surjections is surjective statement
  83. Equinumerous sets definition
  84. Proof that a function is bijective iff it has a two-sided inverse proof
  85. Existence of a prime divisor statement
  86. Division algorithm statement
  87. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  88. Rule of sum statement
  89. Finite set definition
  90. Bijective iff it has a two-sided inverse statement
  91. Proof of the existence of prime factorization proof
  92. Proof of Bézout's identity proof
  93. The reals form an ordered field statement
  94. Proof of the complement principle proof
  95. Infinite set definition
  96. Proof of the bijection principle proof
  97. Bézout's identity statement
  98. Existence of prime factorization statement
  99. Proof of the approximation property of the supremum proof
  100. Complement principle statement
  101. Proof of the infinite pigeonhole principle proof
  102. Bijection principle statement
  103. Proof of the generalized Euclid's lemma proof
  104. Approximation property of the supremum statement
  105. Generalized Euclid's lemma statement
  106. Proof of the pigeonhole principle proof
  107. Proof that the reals are Archimedean from the completeness axiom proof
  108. Pigeonhole principle statement
  109. Proof of Euclid's lemma proof
  110. The reals are Archimedean statement
  111. Infinite pigeonhole principle statement
  112. Euclid's lemma statement
  113. Floor function definition
  114. Proof of Dirichlet's approximation theorem by the pigeonhole principle proof
  115. Proof of the fundamental theorem of arithmetic proof
  116. Dirichlet's approximation theorem statement
  117. Fundamental theorem of arithmetic statement
  118. Proof of the irrationality of square roots of non-squares proof
  119. Irrationality of square roots of non-squares statement
  120. Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation proof

Where this leads

4 pages build on this one.

Further reading

  1. Web https://kconrad.math.uconn.edu/blurbs/ugradnumthy/pelleqn2.pdf, Lemma 2.1 and Theorem 2.3
About this page
TagEYTD2KSD8X
URIm2://EYTD2KSD8X
Kindproof
WritingW0 stub
MSC11D09
ProvesExistence of nontrivial solutions of Pell's equation
UsesPell's equation, Irrationality of square roots of non-squares, Dirichlet's approximation theorem, Pigeonhole principle, Infinite pigeonhole principle, Brahmagupta–Fibonacci identity
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.