- Atlas
- Mathematics
- Additive Number Theory
Additive Number Theory
Additive number theory studies the integers through addition: which numbers can be written as sums of a prescribed kind, how many ways, and how the answers behave as the numbers grow.
10 frameworks, from 1770 to today · Number Theory · Mathematics
- Classical theory of representations by sums of powers 1770-1930
- Waring's problem 1909-Present
- Sieve theory 1915-Present
- Hardy–Ramanujan–Littlewood circle method 1918-Present
- Schnirelmann density and additive bases 1930-Present
- Computational and experimental number theory 1950-Present
- Additive combinatorics and inverse sumset theory 1960-Present
- Ergodic-theoretic methods 1975-Present
- Higher-order Fourier analysis 2001-Present
- Transference principle 2004-Present
Overview
Additive number theory studies the integers through addition: which numbers can be written as sums of a prescribed kind, how many ways, and how the answers behave as the numbers grow. Goldbach's conjecture—that every even number greater than 2 is a sum of two primes—is its most famous question, but the field is broader than any single problem. It asks whether the odd numbers are sums of three primes, whether every sufficiently large integer is a sum of a bounded number of perfect squares or cubes, how many representations a number has as a sum of \(k\) squares, and how sparse a set can be while still reaching every sufficiently large integer by repeated addition. What unites these questions is that they are additive: they concern the structure of the integers under \(+\), not under \(\times\). The history of the subject is largely the history of tools built to answer such questions—sieves, the circle method, densities, and, more recently, the transfer of ideas from ergodic theory and from combinatorics.
Classical Problems and the Arithmetic of Representations
The oldest strand is the representation of integers by sums of powers. Diophantus, in late antiquity, and later Islamic and European mathematicians posed and solved particular cases, but the systematic theory begins with Lagrange's 1770 proof that every nonnegative integer is a sum of four squares. This answered a question going back to Bachet and Fermat. The result is sharp: numbers of the form \(4^a(8b+7)\) need four squares and cannot be written as three1. Legendre and Gauss completed the three-square theorem, and Jacobi and Gauss gave exact formulas for the number of representations of \(n\) as a sum of four squares in terms of divisors of \(n\). These formulas are the model for the whole classical theory: an additive question answered by a multiplicative formula.
Waring's problem, posed in 1770, asked whether for each \(k\) there is a number \(g(k)\) such that every positive integer is a sum of at most \(g(k)\) \(k\)-th powers2. Hilbert proved in 1909 that such a \(g(k)\) always exists, but his proof gave no bound. The quantitative theory—finding \(g(k)\), and the harder question of how many \(k\)-th powers are needed for all sufficiently large integers, denoted \(G(k)\)—became a central occupation of twentieth-century additive number theory. The exact value \(g(k) = 2^k + \lfloor (3/2)^k \rfloor - 2\) was established for all \(k\) only in the twentieth century, with the final cases settled by Dickson, Pillai, and others; the value of \(G(k)\) remains unknown in general.
Schnirelmann, Density, and Additive Bases
A different idea entered in the 1930s. Schnirelmann asked not which specific numbers are sums of primes but how large a set must be, in a density sense, to guarantee that its repeated sums cover all sufficiently large integers3. He introduced what is now called Schnirelmann density: for a set \(A\) of nonnegative integers, the infimum over \(n\) of the proportion of \(\{1,\dots,n\}\) lying in \(A\). He proved that if \(A\) has positive Schnirelmann density, then some finite number of copies of \(A\) sums to all sufficiently large integers—that is, \(A\) is an additive basis of finite order3. Applying this to the primes (whose density is zero, but which he handled by a separate argument), he obtained the first unconditional bound: every sufficiently large integer is a sum of at most some fixed number of primes. The bound was enormous, but the method was new. It reframed additive questions as questions about the additive structure of sets, and it introduced the notion of an additive basis—a set \(A\) such that every sufficiently large integer is a sum of a bounded number of elements of \(A\)—as a central object.
Vinogradov's 1937 proof that every sufficiently large odd number is a sum of three primes, and his later work with Linnik and others, brought the analytic machinery of exponential sums to bear. The circle method, developed by Hardy and Littlewood from 1918 onward and refined by Vinogradov, converts a counting problem—how many representations of \(n\) as a sum of \(s\) elements of a set—into an integral over the circle, which is then split into major arcs near rational points with small denominators and minor arcs elsewhere. On the major arcs the sum is approximated by arithmetic data; on the minor arcs one needs cancellation. Vinogradov's estimate for exponential sums over primes made the minor arcs tractable for three primes. The method gave asymptotic formulas, not just existence: the number of representations of \(n\) as a sum of three primes grows like \(n^2/(2\log^3 n)\) times a singular series, a product over primes measuring local obstructions. This singular series is the modern descendant of the multiplicative formulas of Jacobi and Gauss.
Sieve Theory
Sieve methods developed alongside the circle method, with a different logic. A sieve starts from all integers and removes those divisible by small primes, estimating how many survive. The classical sieve of Eratosthenes is the prototype; Brun's work around 1915 turned it into a quantitative tool45. Brun's sieve gave upper bounds for the number of twin primes up to \(x\) and, in 1919, the first proof that the sum of reciprocals of twin primes converges—a result that showed twin primes are sparse even if infinite. Sieves were strengthened by Selberg in the 1940s and by others; they yield statements of the form "every sufficiently large even number is a sum of a prime and a number with at most \(r\) prime factors," with \(r\) reduced over decades. Chen's 1966 theorem, that every sufficiently large even number is a sum of a prime and a number with at most two prime factors, is the high-water mark of this line for Goldbach-type problems6. Sieves have a characteristic limitation, the parity problem: they cannot by themselves distinguish numbers with an even number of prime factors from those with an odd number, which is why they stop short of Goldbach itself.
Additive Combinatorics and Inverse Sumset Theory
From the 1980s onward, a combinatorial strand grew into a field of its own. Additive combinatorics studies finite sets of integers (or of abelian groups) under addition, asking how small a sumset \(A+B = \{a+b : a\in A, b\in B\}\) can be relative to \(A\) and \(B\). The basic phenomenon is that sumsets are either large or highly structured. Freiman's theorem, proved in the 1960s and refined later, says that if \(A+A\) is not much larger than \(A\), then \(A\) is contained in a generalized arithmetic progression—a set of the form \(a0 + \{x1 a1 + \cdots + xd ad : 0\le xi < L_i\}\)7. This is inverse sumset theory: from a small sumset, recover structure. It has become a standard tool, used to bound the number of solutions to additive equations and to control sets with few additive relations.
The combinatorial and analytic strands met in the transference principle, developed by Green and Tao around 2004–2006. The idea is to transfer a result known for dense sets to a sparse set, provided the sparse set behaves like a dense one relative to a suitable majorant. Green and Tao used it to prove that the primes contain arbitrarily long arithmetic progressions: the primes are sparse, but they are dense inside a pseudorandom set, and Szemerédi's theorem—that any set of positive density contains arbitrarily long progressions—transfers across. This was a landmark, and it made transference a general method.
Higher-Order Fourier Analysis
The proof of progressions in the primes exposed a gap: classical Fourier analysis controls linear patterns (like three-term progressions) but not longer ones. Higher-order Fourier analysis, developed by Gowers, Tao, and others from the early 2000s, replaces the Fourier transform with higher-order analogues—Gowers norms and nilsequences—that detect correlations invisible to ordinary Fourier analysis. The structure theorem of Green, Tao, and Ziegler describes functions with small higher-order norm as close to a nilsequence, the higher-order analogue of a character. This machinery underlies the general program of counting solutions to linear systems in the primes and in dense sets, and it connects additive number theory to ergodic theory: the Furstenberg correspondence principle translates density statements about integers into statements about measure-preserving systems, and multiple recurrence theorems in ergodic theory yield combinatorial results. The ergodic-theoretic methods, developed by Furstenberg in the 1970s, gave a second proof of Szemerédi's theorem and remain a source of structural insight8.
Computational Verification
Throughout, computation has played a supporting and sometimes decisive role. Goldbach's conjecture has been verified by computer for all even numbers up to very large bounds—currently beyond \(4\times 10^{18}\)—and such verification, while not a proof, guides conjecture and tests heuristics. Waring-type problems, representation counts, and the singular series constants in circle-method formulas are routinely computed. The interplay between computation and theory is characteristic of the field: a computation suggests a density or a constant, and the analytic theory is then asked to explain it.
The Present
Today additive number theory is a meeting point of several methods. The circle method remains the main analytic engine for Waring-type and Goldbach-type problems, with Vinogradov's and later refinements of exponential-sum estimates. Sieve theory continues to produce partial results and is now often combined with transference and combinatorial input. Additive combinatorics and inverse sumset theory supply structural tools used across the field, and higher-order Fourier analysis and ergodic methods address patterns that linear Fourier analysis cannot see. The open questions are the classical ones: Goldbach's conjecture, the twin prime conjecture, the exact value of \(G(k)\) for most \(k\), and the precise additive structure of the primes. What has changed is the toolkit—the field now moves freely between analytic estimates, combinatorial structure, and ergodic and higher-order methods, and the most substantial recent advances have come from combining them.
References
- Lagrange's four-square theorem (Historical development), Wikipedia
- Waring's problem, Wikipedia
- Additive basis, Wikipedia
- Sieve theory, Wikipedia
- Sieve of Eratosthenes, Wikipedia
- Chen's theorem (introduction, History), Wikipedia
- Freiman's theorem (introduction, History of Freiman's theorem), Wikipedia
- Szemerédi's theorem (History), Wikipedia
The frameworks of Additive Number Theory
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1770-1930
Classical theory of representations by sums of powers
How many squares or powers sum to a given number?
- 1909-Present
Waring's problem
How many k-th powers are needed to represent every integer?
- 1915-Present
Sieve theory
How many integers survive removing multiples of small primes?
- 1918-Present
Hardy–Ramanujan–Littlewood circle method
How many ways can a number be a sum of a given set?
- 1930-Present
Schnirelmann density and additive bases
How dense must a set be to sum to everything?
- 1950-Present
Computational and experimental number theory
What do computations reveal about additive patterns?
- 1960-Present
Additive combinatorics and inverse sumset theory
When is a sumset small, and what structure does that force?
- 1975-Present
Ergodic-theoretic methods
How do recurrence properties of dynamical systems yield additive patterns?
- 2001-Present
Higher-order Fourier analysis
What norms detect correlations beyond ordinary Fourier analysis?
- 2004-Present
Transference principle
When can a dense-set result transfer to a sparse set?
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Hardy–Ramanujan–Littlewood circle method influenced by Waring's problem
Hardy and Littlewood developed the circle method explicitly to attack Waring's problem, obtaining asymptotic formulas for representations as sums of k-th powers. The method's major and minor arc analysis was designed around the Waring question and later applied to primes.
Carried by Godfrey Harold Hardy; John Edensor Littlewood.
Transference principle influenced by Additive combinatorics and inverse sumset theory
The transference principle of Green and Tao was built on additive-combinatorial tools, especially the inverse sumset theory and density-increment arguments of Freiman and Szemerédi. It transfers dense-set results to sparse sets like the primes using a pseudorandom majorant, a construction rooted in additive combinatorics.
Carried by Ben Green; Terence Tao.
Transference principle influenced by Higher-order Fourier analysis
The transference principle for longer progressions required higher-order Fourier analysis: Gowers norms and nilsequences were needed to control correlations beyond the linear range. Green and Tao's later work on linear equations in primes combined transference with the higher-order structure theorem.
Carried by Ben Green; Terence Tao.
Hardy–Ramanujan–Littlewood circle method influenced by Classical theory of representations by sums of powers
The circle method's singular series is the modern descendant of the multiplicative representation formulas of Jacobi and Gauss for sums of squares. Hardy and Littlewood built the method to give asymptotic formulas for representations, generalizing the classical exact formulas to sums of powers and primes.
Carried by Godfrey Harold Hardy; John Edensor Littlewood.
Hardy–Ramanujan–Littlewood circle method rival of Sieve theory
Brun's sieve and the Hardy–Littlewood circle method were contemporary competing approaches to Goldbach-type and Waring-type problems. Sieves gave upper bounds and 'almost prime' results, while the circle method gave asymptotic formulas, and the two lines were pursued in parallel through the twentieth century.
Carried by Viggo Brun; Godfrey Harold Hardy; John Edensor Littlewood.
Higher-order Fourier analysis influenced by Ergodic-theoretic methods
Higher-order Fourier analysis drew on ergodic-theoretic structure theory, particularly Furstenberg's correspondence principle and the nilsequence/character analogy. Gowers norms and the Green–Tao–Ziegler structure theorem were developed in dialogue with ergodic multiple recurrence results.
Carried by Timothy Gowers; Terence Tao; Tamara Ziegler.
Transference principle influenced by Ergodic-theoretic methods
The transference principle used ergodic-theoretic ideas, notably the Furstenberg correspondence principle and Szemerédi's theorem as proved by ergodic methods, to transfer density results to sparse sets. Green and Tao's proof of progressions in the primes relied on this ergodic-combinatorial background.
Carried by Hillel Furstenberg; Ben Green; Terence Tao.
Beyond the field
Where Additive Number Theory's ideas came from in other fields, and what they led to there: the strongest 12 of 31 links.
Waring's problem influenced Hardy–Ramanujan–Littlewood circle method in Analytic Number Theory
Waring's problem was the motivating application for the circle method: Hardy and Ramanujan's 1918 partition work and Hardy–Littlewood's 1920s papers developed major and minor arcs to estimate representations as sums of powers. The method was built to solve Waring-type additive questions.
Carried by G. H. Hardy; John Edensor Littlewood; Srinivasa Ramanujan.
Hardy–Ramanujan–Littlewood circle method grew out of Analytic number theory in Number Theory
The circle method was created within analytic number theory and became one of its principal techniques for additive problems. It grew directly out of the analytic tradition's use of generating functions and complex analysis.
Carried by Godfrey Harold Hardy; Srinivasa Ramanujan; John Edensor Littlewood.
Additive combinatorics and inverse sumset theory influenced Ergodic-Theoretic Correspondence in Additive Combinatorics
The ergodic-theoretic correspondence arose by applying ergodic theory to the recurrence and density questions of additive combinatorics and inverse sumset theory. Furstenberg's 1977 proof of Szemerédi's theorem via ergodic theory is the defining instance of this transfer.
Carried by Hillel Furstenberg.
Additive combinatorics and inverse sumset theory influenced Sum-Product Theory in Additive Combinatorics
Sum-product theory grew directly out of additive combinatorics and inverse sumset theory, using sumset and product-set bounds together. Erdős and Szemerédi's 1983 sum-product conjecture and its later proofs are the direct descendants of inverse sumset methods.
Carried by Paul Erdős; Endre Szemerédi.
Additive combinatorics and inverse sumset theory led to Additive Combinatorics and Transference in Analytic Number Theory
Additive combinatorics and inverse sumset theory provided the structural tools that transference and the Green–Tao theorem used. The later framework grew directly out of this combinatorial tradition.
Carried by Ben Green; Terence Tao.
Ergodic-theoretic methods influenced by Ergodic theory in Dynamical Systems
Dynamical-systems ergodic theory, including recurrence and mixing, is the machinery Furstenberg adapted into the correspondence principle. The same measure-preserving systems studied in dynamics became the vehicle for proving arithmetic progression theorems.
Carried by Hillel Furstenberg.
Ergodic-theoretic methods influenced by Ergodic theory in Measure Theoretic Probability
Ergodic theory supplied the recurrence theorems and measure-preserving dynamics that Furstenberg used to prove Szemeredi's theorem. The multiple recurrence theorem is the direct technical transfer from ergodic theory into additive combinatorics.
Carried by Hillel Furstenberg.
Ergodic-theoretic methods influenced by Additive number theory in Number Theory
Additive number theory posed the density and progression questions, such as Szemeredi's theorem and van der Waerden's theorem, that Furstenberg's ergodic approach was built to answer. The correspondence principle translated those arithmetic statements into recurrence statements in measure-preserving systems.
Carried by Hillel Furstenberg.
Higher-order Fourier analysis influenced by Fourier analysis in Harmonic Analysis
Classical Fourier analysis supplied the characters, convolution, and L^p estimates that higher-order Fourier analysis generalised into Gowers norms. The higher-order theory is a direct extension of the Fourier-analytic method to uniformity of higher degree.
Carried by Timothy Gowers.
Higher-order Fourier analysis influenced by Additive number theory in Number Theory
Additive number theory posed the problems, such as Szemeredi's theorem and linear equations in dense sets, that higher-order Fourier analysis was developed to solve. Gowers's work on the norms grew directly out of these arithmetic questions.
Carried by Timothy Gowers; Ben Green; Terence Tao.
Transference principle influenced by Additive number theory in Number Theory
Additive number theory posed the sparse-set questions, such as primes containing long arithmetic progressions, that the transference principle was devised to answer. Green and Tao's work transferred density results from dense sets to the primes.
Carried by Ben Green; Terence Tao.
Classical theory of representations by sums of powers influenced Classical Sumset Theory and Small Doubling in Additive Combinatorics
The classical theory of representing integers as sums of powers (Waring's problem, Lagrange, Hilbert) posed the questions about additive structure that early sumset results generalized. Schnirelmann's and later small-doubling results reframed these representation questions in terms of sumsets of arbitrary sets.
Carried by David Hilbert; Lev Schnirelmann.

Additive Number Theory is a planet in Nousfarer
Its city has a tower for each of these 10 frameworks. Land, walk in, and climb one concept at a time.
Land on Additive Number TheoryRelated fields
Fields its ideas are linked to
- Additive Combinatorics 7 links
- Number Theory 6 links
- Analytic Number Theory 5 links
- Harmonic Analysis 2 links
- Combinatorics 2 links
- Computational Number Theory 2 links
- Elementary Number Theory 2 links
- Dynamical Systems 1 link
- Enumerative Combinatorics 1 link
- Set Theory 1 link
- Measure Theoretic Probability 1 link
- Computability 1 link
More in Number Theory
- Algebraic Number Theory
- Analytic Number Theory
- Arithmetic Geometry
- Computational Number Theory
- Elementary Number Theory
- Modular Forms And Automorphic Forms
- Number Theory
- Transcendental Number Theory
See where Additive Number Theory sits on the Map of Human Knowledge