Loading field map
Number theory is the branch of mathematics that studies the properties of the integers—the whole numbers and their negatives, including zero. At its core, it asks questions about divisibility, prime numbers, and the solutions to equations where only integer answers are allowed. Because its subject matter is the most familiar objects in mathematics, number theory is often called "arithmetic," but the field is anything but elementary: its problems have driven the development of deep and abstract theories for over two millennia.
The enduring questions of number theory can be grouped into a few broad families. The first concerns the distribution of primes. A prime number is an integer greater than 1 with no positive divisors other than 1 and itself. Euclid proved around 300 BCE that there are infinitely many primes, but many questions about how they are arranged remain open. For instance, the twin prime conjecture asks whether there are infinitely many pairs of primes that differ by 2, such as 11 and 13. While partial results have shown that such pairs occur infinitely often with bounded gaps, the full conjecture is unproven.
A second family concerns Diophantine equations—polynomial equations for which one seeks integer or rational solutions. The simplest example is the linear equation \(ax + by = c\), whose solutions are fully understood. The famous Pythagorean equation \(x^2 + y^2 = z^2\) has infinitely many integer solutions, the Pythagorean triples. Fermat's Last Theorem, which states that the equation \(x^n + y^n = z^n\) has no positive integer solutions for \(n > 2\), was a central problem for over 350 years until Andrew Wiles proved it in the 1990s. The general theory of Diophantine equations is vast and incomplete; there is no single method that works for all of them.
A third family concerns modular arithmetic, the arithmetic of remainders. In this setting, two integers are considered equivalent if they leave the same remainder when divided by a fixed modulus \(m\). This idea, formalized by Carl Friedrich Gauss in his 1801 Disquisitiones Arithmeticae, is both a tool for studying the integers and a subject in its own right. Questions about quadratic residues (which numbers are perfect squares modulo a given prime), for example, led to the law of quadratic reciprocity, a deep and surprising symmetry that Gauss called the "golden theorem."
Number theory's roots lie in ancient Greek mathematics. Euclid's Elements contains the fundamental theorem of arithmetic—that every integer greater than 1 can be written uniquely as a product of primes—and a proof of the infinitude of primes. Diophantus of Alexandria, writing around the third century CE, studied equations with integer or rational solutions, and his work Arithmetica gave the field its name for Diophantine equations. These early contributions were isolated results rather than a systematic theory.
A major turning point came in the seventeenth century with Pierre de Fermat, a lawyer and amateur mathematician who posed many problems and conjectures in the margins of his copy of Arithmetica. Fermat's work on sums of squares, on the equation \(x^2 - Ny^2 = 1\) (now called Pell's equation), and his famous "last theorem" stimulated later mathematicians, though he published almost nothing himself. Leonhard Euler in the eighteenth century proved many of Fermat's assertions and introduced the use of analytic methods—calculus and infinite series—into the study of integers, founding what is now called analytic number theory.
Gauss's Disquisitiones in 1801 organized and extended much of this material, introducing the concept of congruence and proving quadratic reciprocity. Gauss also developed the theory of binary quadratic forms, which classify expressions like \(ax^2 + bxy + cy^2\) up to equivalence. This work, though initially motivated by concrete questions about representability of integers, led to the notion of the class group, a finite abelian group attached to a quadratic field. This was a seed of algebraic number theory, which studies number fields—finite field extensions of the rational numbers—and their rings of integers.
In the nineteenth century, the field split into distinct but intertwined traditions. On the analytic side, Peter Gustav Lejeune Dirichlet proved that any arithmetic progression \(a, a+m, a+2m, \ldots\) with \(\gcd(a,m)=1\) contains infinitely many primes, using a new kind of function, the Dirichlet \(L\)-function. Bernhard Riemann, in his 1859 paper on the distribution of primes, introduced the Riemann zeta function \(\zeta(s)\) and conjectured that its nontrivial zeros all lie on the line \(\text{Re}(s) = 1/2\). The Riemann hypothesis, still unproven, is one of the most important open problems in all of mathematics, and it is intimately connected to the error term in the prime number theorem, which describes how primes thin out among the integers.
On the algebraic side, Ernst Kummer, attempting to prove Fermat's Last Theorem, introduced ideal numbers to restore unique factorization in cyclotomic fields, where ordinary unique factorization can fail. Richard Dedekind reformulated this as the theory of ideals in rings of integers, and David Hilbert's Zahlbericht of 1897 systematized the subject. This line of work led to class field theory, developed by Hilbert, Emil Artin, and others in the early twentieth century, which describes abelian extensions of number fields in terms of the arithmetic of the base field. Class field theory is a crowning achievement of algebraic number theory, but it applies only to abelian (commutative) Galois groups; the non-abelian case remains a vast open frontier, often described under the banner of the Langlands program.
The field today is organized less by a single method than by a set of complementary approaches, each with its own strengths and limitations.
Elementary number theory works directly with the integers, using divisibility, congruences, and combinatorial arguments. It includes results like the Euclidean algorithm, the fundamental theorem of arithmetic, and the theory of continued fractions. Its methods are accessible but often limited; many deep results resist elementary proofs. The term "elementary" does not mean easy—it means avoiding advanced tools—and some elementary proofs, such as the 1949 proof of the prime number theorem by Paul Erdős and Atle Selberg, are highly sophisticated.
Analytic number theory uses the tools of real and complex analysis to study the distribution of primes and other arithmetic objects. The central objects are Dirichlet series, especially the Riemann zeta function and Dirichlet \(L\)-functions. The prime number theorem, proved independently by Jacques Hadamard and Charles de la Vallée Poussin in 1896, states that the number of primes up to \(x\) is asymptotically \(x / \log x\). Its proof relies on showing that the zeta function has no zeros on the line \(\text{Re}(s) = 1\). Analytic number theory also includes the Hardy–Littlewood circle method, which has been used to study additive problems such as whether every sufficiently large even integer is the sum of two primes (Goldbach's conjecture, still open) or the sum of three primes (proved by Vinogradov for sufficiently large odd numbers). The strength of analytic number theory is its ability to produce asymptotic formulas and to prove results about averages; its weakness is that it often cannot say anything about individual cases.
Algebraic number theory studies number fields and their rings of integers. A number field is a finite extension of \(\mathbb{Q}\), such as \(\mathbb{Q}(\sqrt{2})\) or \(\mathbb{Q}(\zetan)\), where \(\zetan\) is a primitive \(n\)-th root of unity. The ring of integers of such a field is the analogue of \(\mathbb{Z}\) inside it. Unique factorization can fail in these rings, but Dedekind's theory of ideals restores a form of unique factorization at the level of ideals. The class group measures the failure of unique factorization; it is a finite abelian group, and its size, the class number, is a fundamental invariant. Algebraic number theory also studies the splitting of primes in extensions, which is governed by the Frobenius element and, in the abelian case, by class field theory. Its methods are algebraic and structural, and it has deep connections to geometry through the theory of algebraic curves and, more recently, to the arithmetic of elliptic curves.
Arithmetic geometry is a modern synthesis of algebraic number theory and algebraic geometry. It studies solutions to polynomial equations over number fields, viewing them as geometric objects. The key insight is that a Diophantine equation defines an algebraic variety, and its rational points can be studied using geometric tools. The theory of elliptic curves—cubic equations of the form \(y^2 = x^3 + ax + b\)—is a central example. The Mordell–Weil theorem states that the rational points on an elliptic curve form a finitely generated abelian group. The Birch and Swinnerton-Dyer conjecture, one of the Clay Millennium Prize Problems, relates the rank of this group to the behavior of the associated \(L\)-function at \(s=1\). Arithmetic geometry also includes the theory of schemes, developed by Alexander Grothendieck, which provides a unified language for studying arithmetic and geometric objects. Wiles's proof of Fermat's Last Theorem was achieved by proving a special case of the modularity theorem, which states that every elliptic curve over \(\mathbb{Q}\) is modular—that is, its \(L\)-function is the \(L\)-function of a modular form. This proof is a landmark of arithmetic geometry and of the Langlands program.
Computational number theory uses algorithms to compute with integers, primes, and algebraic structures. It includes primality testing, integer factorization, and algorithms for computing class groups and elliptic curve point counts. Its practical importance is enormous: the security of the RSA cryptosystem rests on the difficulty of factoring large integers, while elliptic curve cryptography relies on the difficulty of the discrete logarithm problem in the group of points on an elliptic curve. Computational number theory is not a rival to the other approaches; rather, it provides data that guides conjectures and supplies tools for verifying theoretical results.
The Langlands program, initiated by Robert Langlands in the late 1960s, is the most ambitious unifying framework in contemporary number theory. It posits a deep correspondence between two seemingly different worlds: Galois representations (algebraic objects arising from the symmetries of number fields) and automorphic forms (analytic objects arising from harmonic analysis on certain groups). The program predicts that every Galois representation should correspond to an automorphic form, and that the \(L\)-functions attached to each side should match. The modularity theorem for elliptic curves is a special case, and Wiles's proof was a major confirmation of the program's power. The Langlands program is not a single theorem but a web of conjectures, many of which have been proved in special cases, and it connects number theory to representation theory, harmonic analysis, and algebraic geometry.
The modern landscape of number theory is characterized by the productive interaction of these approaches. Analytic number theory provides estimates for the distribution of primes and the size of class groups; algebraic number theory provides the structural framework; arithmetic geometry connects these to geometric intuition; and computational methods test conjectures and generate new ones. The field is also increasingly connected to other areas of mathematics, including ergodic theory (through the study of equidistribution), model theory (through the study of definable sets in number fields), and mathematical physics (through connections to modular forms and the theory of \(L\)-functions).
Number theory is unusual among mathematical disciplines in the number of its central problems that remain open despite centuries of effort. The Riemann hypothesis, the twin prime conjecture, Goldbach's conjecture, and the Birch and Swinnerton-Dyer conjecture are all unresolved. This is not a sign of weakness but of the field's depth: its questions are easy to state but require the full machinery of modern mathematics to attack. The field's progress often comes not from direct assaults on these problems but from the development of new theories that reframe them. The proof of Fermat's Last Theorem, for example, came not from elementary manipulations but from the modularity theorem, a result about elliptic curves and modular forms that was far broader than the original problem.
For a newcomer, the most useful map of number theory is not a list of results but an understanding of its central tension: the integers are simple to define but extraordinarily complex in their structure. Each major approach—elementary, analytic, algebraic, geometric, computational—offers a different lens on this complexity, and the field's vitality comes from the interplay among them. The subject rewards patience: many of its deepest results are difficult to prove, but the questions themselves are accessible to anyone who has learned to count.