[Hilbert's] style has not the terseness of many of our modem authors in mathematics, which is based on the assumption that printer's labor and paper are costly but the reader's effort and time are not. H. Weyl [143] The purpose of this book is to describe the classical problems in additive number theory and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools used to attack these problems. This book is intended for students who want to lel?Ill additive number theory, not for experts who already know it. For this reason, proofs include many "unnecessary" and "obvious" steps; this is by design. The archetypical theorem in additive number theory is due to Lagrange: Every nonnegative integer is the sum of four squares. In general, the set A of nonnegative integers is called an additive basis of order h if every nonnegative integer can be written as the sum of h not necessarily distinct elements of A. Lagrange 's theorem is the statement that the squares are a basis of order four. The set A is called a basis offinite order if A is a basis of order h for some positive integer h. Additive number theory is in large part the study of bases of finite order. The classical bases are the squares, cubes, and higher powers; the polygonal numbers; and the prime numbers. The classical questions associated with these bases are Waring's problem and the Goldbach conjecture.

Inhalt

I Waring's problem.- 1 Sums of polygons.- 2 Waring's problem for cubes.- 3 The Hilbert-Waring theorem.- 4 Weyl's inequality.- 5 The Hardy-Littlewood asymptotic formula.- II The Goldbach conjecture.- 6 Elementary estimates for primes.- 7 The Shnirel'man-Goldbach theorem.- 8 Sums of three primes.- 9 The linear sieve.- 10 Chen's theorem.- III Appendix.- Arithmetic functions.- A.1 The ring of arithmetic functions.- A.2 Sums and integrals.- A.3 Multiplicative functions.- A.4 The divisor function.- A.6 The Möbius function.- A.7 Ramanujan sums.- A.8 Infinite products.- A.9 Notes.- A.10 Exercises.