Diophantine Equations - Key Properties

Understanding when Diophantine equations have solutions and how to find them requires sophisticated techniques from algebra, geometry, and analytic number theory. Key properties help determine solvability and structure of solution sets.

TheoremGeneral Solution of Linear Diophantine Equations

The linear equation $ax + by = c$ has integer solutions if and only if $d = \gcd(a, b)$ divides $c$ .

If $(x_0, y_0)$ is a particular solution, then the general solution is: $x = x_0 + \frac{b}{d}t, \quad y = y_0 - \frac{a}{d}t$ for any integer $t$ .

This parametrization describes all solutions as a linear combination involving a single parameter, showing that the solution set forms a line in $\mathbb{Z}^2$ when it exists.

ExampleAll Solutions

For $12x + 18y = 30$ , we have $\gcd(12, 18) = 6$ and $6 \mid 30$ , so solutions exist.

Simplified: $2x + 3y = 5$ has particular solution $(x_0, y_0) = (-5, 5)$ (from before).

General solution: $x = -5 + 3t, y = 5 - 2t$ for $t \in \mathbb{Z}$ .

Check several values:

$t = 0$ : $(x, y) = (-5, 5)$
$t = 1$ : $(x, y) = (-2, 3)$
$t = 2$ : $(x, y) = (1, 1)$
$t = 3$ : $(x, y) = (4, -1)$

All satisfy $2x + 3y = 5$ .

TheoremParametrization of Pythagorean Triples

All primitive Pythagorean triples $(a, b, c)$ with $a$ odd are given by: $a = m^2 - n^2, \quad b = 2mn, \quad c = m^2 + n^2$ where $m > n > 0$ , $\gcd(m, n) = 1$ , and exactly one of $m, n$ is even.

Non-primitive triples are multiples of primitive ones.

This beautiful parametrization completely solves the problem of finding all right triangles with integer sides.

ExampleGenerating Pythagorean Triples

Using different values of $(m, n)$ :

$(m, n) = (2, 1)$ : $(a, b, c) = (3, 4, 5)$
$(m, n) = (3, 2)$ : $(a, b, c) = (5, 12, 13)$
$(m, n) = (4, 1)$ : $(a, b, c) = (15, 8, 17)$
$(m, n) = (4, 3)$ : $(a, b, c) = (7, 24, 25)$
$(m, n) = (5, 2)$ : $(a, b, c) = (21, 20, 29)$

Each pair generates a unique primitive triple.

TheoremFundamental Solution of Pell's Equation

For $x^2 - dy^2 = 1$ where $d$ is a positive non-square integer, there exists a fundamental solution $(x_1, y_1)$ with $x_1, y_1 > 0$ minimal.

All positive solutions are generated by: $x_n + y_n\sqrt{d} = (x_1 + y_1\sqrt{d})^n$ for $n = 1, 2, 3, \ldots$

ExamplePell Solutions

For $x^2 - 3y^2 = 1$ , the fundamental solution is $(2, 1)$ since $4 - 3 = 1$ .

Generate more solutions: $(2 + \sqrt{3})^2 = 4 + 4\sqrt{3} + 3 = 7 + 4\sqrt{3}$ So $(x_2, y_2) = (7, 4)$ . Check: $49 - 48 = 1$ . ✓

$(2 + \sqrt{3})^3 = (7 + 4\sqrt{3})(2 + \sqrt{3}) = 14 + 7\sqrt{3} + 8\sqrt{3} + 12 = 26 + 15\sqrt{3}$ So $(x_3, y_3) = (26, 15)$ . Check: $676 - 675 = 1$ . ✓

Remark

The theory of Pell's equation connects deeply with continued fractions and algebraic number theory. The fundamental solution can be found using the continued fraction expansion of $\sqrt{d}$ , providing an efficient algorithm.

TheoremFermat's Method of Descent

The method of infinite descent proves the non-existence of solutions by showing that any solution would generate a strictly smaller solution, contradicting the well-ordering of positive integers.

Fermat used this to prove that $x^4 + y^4 = z^2$ has no positive integer solutions.

These properties and techniques provide powerful tools for analyzing when Diophantine equations have solutions and for finding all solutions when they exist.