Additive Number Theory The Classical Bases
[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  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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
additive number theory Algebraic arithmetic function basis of finite basis of order bounded number Brun sieve Chen's theorem circle method completes the proof congruence classes modulo converges absolutely counts the number covering congruences denote the number distinct prime divides equation estimate exists an integer finite order Goldbach conjecture implied constant depends infinite product kth powers Lagrange's theorem Lemma log log logn major arcs matrix minor arcs Mobius function modulo multiplicative function nonnegative cubes nonnegative integer number of positive number of representations numbers of order obtain odd integer partial summation polynomial identity positive cubes positive integers positive rational numbers positive-definite prime numbers Prove quadratic form quadratic residue real number relatively prime Selberg sieve set of integers sieving function sieving range square-free square-free integer sufficiently large integer sum of four sum of three support level three squares upper bound Vinogradov's theorem Waring's problem Weyl's inequality