Diophantine Equations — Pell's Equation and Thue-Mahler

Pell's equation $x^{2} - D y^{2} = 1$ always has infinitely many integer solutions for non-square $D$ , generated from a fundamental solution.
Solutions to Pell's equation correspond to units in real quadratic fields and form a group structure.
Thue's theorem (1909) proved that binary form equations $F (x, y) = m$ with degree ≥ 3 have only finitely many solutions.
Thue-Mahler equations generalize Diophantine problems by allowing $m$ to have prime factors from a specified finite set.
These equations connect to modern techniques: continued fractions, Baker's theory of linear forms in logarithms, and S-unit equations.
The contrast between infinite solutions (Pell) and finite solutions (Thue-Mahler) reveals how polynomial degree and form structure control solution behavior.

Diophantine Equations — Pell's Equation and Thue-Mahler

Overview

Pell's equation, despite being named after the 17th-century mathematician John Pell (who had little to do with it), stands as one of the most elegant and thoroughly studied families of Diophantine equations. The equation $x^{2} - D y^{2} = 1$ , where $D$ is a positive non-square integer, asks us to find integer solutions—a seemingly simple question that leads to profound connections with algebraic number theory, continued fractions, and the structure of quadratic fields. The fundamental fact that Pell's equation always has infinitely many solutions when $D$ is not a perfect square distinguishes it sharply from other Diophantine problems.

The Thue-Mahler equation generalizes this classical problem by considering equations of the form $F (x, y) = m$ , where $F$ is a binary form (homogeneous polynomial in two variables) of degree at least 3, and $m$ lies in a finitely generated multiplicative group. While Pell's equation has infinitely many solutions, Thue's theorem (1909) revolutionized the field by proving that equations $F (x, y) = m$ with $de g (F) \geq 3$ have only finitely many integer solutions. The Thue-Mahler equation represents a significant generalization, allowing the right-hand side to have prime divisors from a specified finite set.

These equations exemplify a fundamental principle in Diophantine analysis: the geometry of the solution set reflects deep arithmetic properties. Pell's equation corresponds to finding units in real quadratic fields, while Thue-Mahler equations connect to S-unit equations and ultimately to modern tools like Baker's theory of linear forms in logarithms and the Roth-Ridout theorem.

Pell's equation $x^{2} - D y^{2} = 1$ has infinitely many solutions governed by the fundamental solution and forms a group under a natural operation, while Thue-Mahler equations $F (x, y) = m$ with $de g (F) \geq 3$ have only finitely many solutions—a dichotomy that reflects the deep connection between Diophantine equations and algebraic geometry through the genus of associated curves.

Pell's Equation: For a positive integer

D

that is not a perfect square, Pell's equation is

x^{2} - D y^{2} = 1

where we seek integer solutions

(x, y) \in Z^{2}

. Negative Pell's Equation: The equation

x^{2} - D y^{2} = - 1

. Thue Equation: For an irreducible binary form

F (x, y) \in Z [x, y]

of degree

n \geq 3

and a non-zero integer

m

, the Thue equation is

F (x, y) = m

where we seek integer solutions

(x, y) \in Z^{2}

. Thue-Mahler Equation: Let

F (x, y) \in Z [x, y]

be an irreducible binary form of degree

n \geq 3

, let

S = {p_{1}, \dots, p_{s}}

be a finite set of primes, and let

m \in Z ∖ {0}

. The Thue-Mahler equation is

F (x, y) = m i = 1 \prod s p_{i}^{z_{i}}

where we seek solutions

(x, y, z_{1}, \dots, z_{s}) \in Z^{2 + s}

with

g cd (x, y) = 1

Core Theory

Main Results

Theorem 1 (Existence of Solutions to Pell's Equation): Let

D

be a positive integer that is not a perfect square. Then the equation

x^{2} - D y^{2} = 1

has infinitely many solutions in positive integers. Theorem 2 (Fundamental Solution): Among all positive integer solutions to

x^{2} - D y^{2} = 1

, there exists a unique solution

(x_{1}, y_{1})

with minimal

x_{1} > 1

(equivalently, minimal

y_{1} > 0

), called the fundamental solution. Every other positive solution

(x_{n}, y_{n})

is given by

x_{n} + y_{n} D = (x_{1} + y_{1} D)^{n}

for

n \in N

. Theorem 3 (Thue's Theorem): Let

F (x, y) \in Z [x, y]

be an irreducible binary form of degree

n \geq 3

, and let

m \in Z ∖ {0}

. Then the equation

F (x, y) = m

has only finitely many solutions

(x, y) \in Z^{2}

. Theorem 4 (Thue-Mahler Finiteness): Let

F (x, y) \in Z [x, y]

be an irreducible binary form of degree

n \geq 3

, let

S

be a finite set of primes, and let

m \in Z ∖ {0}

. Then the Thue-Mahler equation

F (x, y) = m \prod_{p \in S} p^{z_{p}}

has only finitely many solutions with

g cd (x, y) = 1

. Proof of Theorem 1 and 2: We prove these together using the theory of continued fractions and algebraic units. Step 1: Connection to units in $Z [D]$ . Note that if

(x, y)

is a solution to

x^{2} - D y^{2} = 1

, then

N (x + y D) = (x + y D) (x - y D) = x^{2} - D y^{2} = 1

where

N

is the norm from

Q (D)

Q

. Thus

x + y D

is a unit in

Z [D]

. Conversely, any unit

u = x + y D \in Z [D]

with

N (u) = 1

gives a solution. Step 2: Existence via continued fractions. The continued fraction expansion of

D

is eventually periodic:

D = [a_{0}; \overline{a_{1}, a_{2}, \dots, a_{r}}]

Let

p_{k} / q_{k}

denote the

k

-th convergent. A classical result states that if the period length is

r

, then

p_{r - 1}^{2} - D q_{r - 1}^{2} = (- 1)^{r}

This gives either a solution to Pell's equation (if

r

is even) or to the negative Pell equation (if

r

is odd). In the latter case,

(p_{2 r - 1}, q_{2 r - 1})

satisfies

p_{2 r - 1}^{2} - D q_{2 r - 1}^{2} = 1

. Step 3: Fundamental solution. Let

(x_{1}, y_{1})

be the positive solution with minimal

y_{1} > 0

(equivalently, minimal

x_{1} > 1

). Set

ε = x_{1} + y_{1} D > 1

. This is the fundamental unit of

Z [D]

among those with norm 1. Step 4: All solutions from powers. For any

n \in Z

ε^{n}

has norm 1. Write

ε^{n} = x_{n} + y_{n} D

where

x_{n}, y_{n} \in Z

. Then

(x_{n}, y_{n})

satisfies Pell's equation.

Conversely, suppose $(x, y)$ is any positive solution. Then $u = x + y D$ is a unit with $u > 1$ . We can write $u = ε^{n}$ for some $n \in Z$ (since the units of norm 1 form a cyclic group generated by $ε$ ). Since $u > 1$ and $ε > 1$ , we have $n \geq 1$ .

The formulas for $x_{n}, y_{n}$ follow from the binomial expansion and the recurrence relations:

x_{n + 1} = x_{1} x_{n} + D y_{1} y_{n}, y_{n + 1} = x_{1} y_{n} + y_{1} x_{n}

This establishes infinitely many distinct solutions and their parametrization. □

Proof Sketch of Theorem 3 (Thue's Theorem): We provide an outline of the classical approach. Step 1: Reduction to approximation problem. Write

F (x, y) = a_{n} \prod_{i = 1}^{n} (x - α_{i} y)

where

α_{i}

are the (distinct) roots of

F (x, 1)

C

. If

F (x, y) = m

with

y \neq = 0

, dividing by

y^{n}

gives

m / y^{n} = a_{n} i = 1 \prod n (x / y - α_{i})

For at least one root $α$ , we must have

∣ x / y - α ∣ \leq C ∣ y ∣^{- n + 1}

for some constant

C

depending on

F

and

m

Step 2: Diophantine approximation. Since

F

is irreducible of degree

n \geq 3

, at least one root

α

has degree

n

over

Q

. The inequality above shows

x / y

approximates

α

better than

C ∣ y ∣^{- n + 1}

. Step 3: Application of Thue-Siegel-Roth. For any algebraic number

α

of degree

n \geq 2

and any

ε > 0

, the inequality

α - \frac{p}{q} < \frac{1}{q ^{n /2 + 1 + ε}}

has only finitely many solutions in coprime integers

p, q

(this is Thue's theorem on Diophantine approximation, later strengthened by Siegel and Roth).

Since $n \geq 3$ , we have $n - 1 \geq 2 > n /2 + 1$ for small $ε$ , so the approximations forced by solutions to $F (x, y) = m$ contradict Thue's approximation theorem for all but finitely many $(x, y)$ . □

Common Misconception: Not all values of

D

admit solutions to the negative Pell equation

x^{2} - D y^{2} = - 1

. For example,

D = 3

has the solution

(1, 1)

, but

D = 3 \cdot 5 = 15

has no solutions. The negative Pell equation is solvable if and only if the period length of the continued fraction of

D

is odd. Additionally, students often forget that Thue's finiteness theorem says nothing about how to find the solutions—it is an existence result, not a constructive one. Effective bounds came much later through Baker's work. Axel Thue (1909) — Proved that irreducible Diophantine equations

F (x, y) = m

with

de g (F) \geq 3

have only finitely many integer solutions, pioneering the use of Diophantine approximation in solving Diophantine equations.

Examples and Applications

1

Solving Pell's Equation for $D = 2$

Find all positive integer solutions to $x^{2} - 2 y^{2} = 1$ .

Solution: The continued fraction expansion of

2

[1; \overline{2}]

, which has period 1 (odd).

Computing convergents:

$p_{0} / q_{0} = 1/1$
$p_{1} / q_{1} = 1 + 1/ (2) = 3/2$

Since the period is odd, $(p_{0}, q_{0}) = (1, 1)$ satisfies the negative Pell equation: $1^{2} - 2 (1)^{2} = - 1$ .

For the positive Pell equation, we compute $(p_{1}, q_{1})$ : indeed, $3^{2} - 2 (2)^{2} = 9 - 8 = 1$ .

The fundamental solution is $(x_{1}, y_{1}) = (3, 2)$ , with $ε = 3 + 22$ .

All solutions come from:

(x_{n} + y_{n} 2) = (3 + 22)^{n}

For $n = 2$ :

(3 + 22)^{2} = 9 + 122 + 8 = 17 + 122

(x_{2}, y_{2}) = (17, 12)

. Verify:

1 7^{2} - 2 (1 2^{2}) = 289 - 288 = 1

. ✓

For $n = 3$ :

(3 + 22)^{3} = (3 + 22) (17 + 122) = 51 + 362 + 342 + 48 = 99 + 702

(x_{3}, y_{3}) = (99, 70)

. □

2

A Thue Equation

Consider the equation $x^{3} - 2 y^{3} = 1$ .

This is a Thue equation with $F (x, y) = x^{3} - 2 y^{3}$ , which is irreducible over $Q$ (by Eisenstein's criterion with $p = 2$ applied to $F (x, 1) = x^{3} - 2$ ).

By inspection, $(x, y) = (1, 0)$ is a solution.

We can verify that $(x, y) = (- 1, - 1)$ is also a solution: $(- 1)^{3} - 2 (- 1)^{3} = - 1 + 2 = 1$ . ✓

By Thue's theorem, there are only finitely many solutions. In fact, these are the only integer solutions (this can be verified through various methods, including reduction modulo small primes and height bounds).

Note the stark contrast with Pell's equation: degree 2 gives infinitely many solutions, degree 3 gives finitely many. □

Why Degree Matters: The Quadratic Case

Consider $F (x, y) = x^{2} - 2 y^{2}$ , a binary quadratic form. The equation $x^{2} - 2 y^{2} = 1$ is Pell's equation and has infinitely many solutions.

Thue's theorem requires $de g (F) \geq 3$ . This is not a technicality—the conclusion fails for quadratic forms. The geometric reason is that $x^{2} - D y^{2} = m$ defines a genus 0 curve (a conic), which has either no rational points or infinitely many.

In contrast, $F (x, y) = m$ with $de g (F) = n \geq 3$ typically defines a curve of genus $g \geq 1$ . For example, $x^{3} - 2 y^{3} = 1$ can be transformed into a plane cubic curve. By Faltings' theorem (formerly Mordell's conjecture), curves of genus $g \geq 2$ have only finitely many rational points, and genus 1 curves (elliptic curves) have finitely many points if the Mordell-Weil group is finite.

The hypothesis $de g (F) \geq 3$ is sharp and essential. □

Geometric Picture: Pell's equation

x^{2} - D y^{2} = 1

describes a hyperbola in the

(x, y)

-plane. Integer points on this hyperbola correspond to units in

Z [D]

. The fundamental solution is the "smallest" unit greater than 1, and all other solutions are obtained by repeatedly "multiplying" this unit by itself—geometrically, this corresponds to a discrete but infinite sequence of points marching off to infinity along each branch of the hyperbola.

For Thue equations with degree $\geq 3$ , the curve $F (x, y) = m$ is no longer a conic but a higher-degree algebraic curve. These curves "bend" more severely, and the spacing between integer points grows rapidly. The finiteness result reflects a deep principle: higher-genus curves are "more rigid" and cannot support infinitely many rational (or integer) points scattered along them. Think of it as the curve having "too much curvature" to admit infinitely many lattice points. □

Historical Development

The study of Pell's equation dates back to ancient times. Indian mathematicians, particularly Brahmagupta (7th century) and Bhaskara II (12th century), developed sophisticated methods for solving what is now called Pell's equation, including the chakravala method. Fermat challenged European mathematicians with the problem in 1657, and solutions were found by Wallis and Brouncker.

The name "Pell's equation" is a historical accident due to Euler's misattribution in the 18th century. Lagrange (1768) gave the first complete proof using continued fractions that solutions always exist for non-square $D$ , establishing the theory on rigorous foundations.

The connection to algebraic number theory emerged in the 19th century through the work of Dirichlet on the unit theorem for number fields. The recognition that solutions to $x^{2} - D y^{2} = 1$ are precisely the units in $Z [D]$ unified Pell's equation with the broader theory of algebraic integers.

Axel Thue's groundbreaking 1909 paper "Über Annäherungswerte algebraischer Zahlen" introduced completely new methods to prove that

F (x, y) = m

with irreducible

F

of degree

\geq 3

has only finitely many solutions. His approach via Diophantine approximation was revolutionary, though his bounds were ineffective.

The Thue-Mahler equation was studied by Kurt Mahler in the 1930s, who recognized that allowing finitely many prime divisors on the right-hand side (creating $S$ -unit equations) still preserved finiteness. This work connected to Siegel's theorem on integral points on curves.

Effective bounds for Thue equations came from Alan Baker's theory of linear forms in logarithms (1960s-1970s), for which he received the Fields Medal in 1970. Modern computational methods can now solve many specific Thue and Thue-Mahler equations completely.

Connections to Other Areas

Connection to Cryptography: Pell's equation has surprising applications in public-key cryptography. The infrastructure of the fundamental unit in real quadratic fields, based on Pell's equation solutions, has been used to construct cryptographic protocols analogous to those based on elliptic curves. The Buchmann-Williams cryptosystem uses the arithmetic of ideal classes in real quadratic orders, where computing the fundamental solution to Pell's equation becomes a crucial subroutine. The difficulty of computing the fundamental solution for large

D

(the regulator problem) provides potential computational hardness for cryptographic security, offering an alternative to factoring and discrete logarithm problems.

Diophantine Equations — Pell's Equation and Thue-Mahler