Diophantine Equations

Linear Case

ax+by=c has integer solutions iff gcd(a,b)|c. General solution: x=x₀+bt/d, y=y₀−at/d where d=gcd(a,b).

Examples

In Depth

A Diophantine equation requires integer (or rational) solutions. The simplest is the linear equation \(ax+by=c\), which has integer solutions iff \(\gcd(a,b)\mid c\); the general solution is \(x=x_0+bt/d\), \(y=y_0-at/d\) for integer \(t\).

Pell's equation \(x^2-Dy^2=1\) (\(D\) not a perfect square) always has infinitely many solutions, generated from the fundamental solution via the continued fraction expansion of \(\sqrt{D}\). It was studied by Brahmagupta and Fermat long before Pell.

Fermat's Last Theorem: \(x^n+y^n=z^n\) has no positive integer solutions for \(n\geq3\). Stated by Fermat in 1637, proved by Wiles in 1995 using elliptic curves and modular forms — one of the greatest achievements in 20th-century mathematics.

The Hasse–Minkowski theorem classifies which quadratic Diophantine equations have rational solutions: a quadratic form represents zero over \(\mathbb{Q}\) iff it does so over \(\mathbb{R}\) and over all \(p\)-adic fields \(\mathbb{Q}_p\). This 'local-global principle' fails for higher-degree equations.

Hilbert's tenth problem asked for an algorithm to decide whether any Diophantine equation has integer solutions. Matiyasevich (1970) proved no such algorithm exists — the problem is undecidable. This connects number theory to computability theory.

Key Properties & Applications

The Pythagorean triples \((a,b,c)\) with \(a^2+b^2=c^2\) are parameterized by \(a=m^2-n^2\), \(b=2mn\), \(c=m^2+n^2\) for integers \(m>n>0\) with \(\gcd(m,n)=1\) and \(m\not\equiv n\pmod2\). This gives all primitive triples.

Waring's problem: every positive integer is a sum of at most \(g(k)\) perfect \(k\)-th powers. Lagrange's four-square theorem (\(g(2)=4\)) states every positive integer is a sum of four squares. Hilbert proved \(g(k)\) is finite for all \(k\); the exact values are known for small \(k\).

The ABC conjecture (Masser–Oesterlé, 1985) states that for coprime \(a+b=c\), the product of distinct prime factors of \(abc\) (the 'radical') is usually large relative to \(c\). It implies Fermat's Last Theorem and many other results. Mochizuki claimed a proof in 2012; the mathematical community has not reached consensus.

Further Reading & Context

The study of diophantine equations connects to many areas of mathematics and its applications. Understanding the foundational definitions and theorems provides the basis for advanced work in analysis, algebra, and applied mathematics.

Historical development: most mathematical concepts evolved over centuries, with contributions from mathematicians across many cultures. The modern axiomatic treatment provides rigor, while computational tools enable practical application.

In modern mathematics, this topic appears in graduate courses and research across pure and applied mathematics. Connections to computer science, physics, and engineering make it a versatile and important area of study. Mastery of the core results and techniques opens doors to research in number theory, analysis, geometry, and beyond.

Recommended next steps: work through the standard theorems with full proofs, explore the connections to related topics listed above, and practice with a variety of problems ranging from computational exercises to theoretical proofs. The interplay between different areas of mathematics is one of the subject's greatest rewards.

Deep Dive: Diophantine Equations

This lesson extends core ideas for diophantine equations with rigorous reasoning, edge-case checks, and application framing in number theory.

Practice Set

References & Editorial Notes

• Stewart, Calculus.
• Strang, Introduction to Linear Algebra.
• Apostol, Mathematical Analysis.

Last editorial review: 2026-04-14.