**Additive Number Theory**

The first is principally devoted to consideration of *direct problems* over (typically) the integers, that is, determining the structure of *hA* from the structure of *A*, *B*: for example, determining which elements can be represented as a sum from *hA*, where *A* is a fixed subset. Two classical problems of this type are the Goldbach conjecture (which is the conjecture that 2*P* contains all even numbers greater than two, where *P* is the set of primes) and Waring's problem (which asks how large must *h* be to guarantee that *hA _{k}* contains all positive integers, where

is the set of k-th powers). Many of these problems are studied using the tools from the Hardy-Littlewood circle method and from sieve methods. For example, Vinogradov proved that every sufficiently large odd number is the sum of three primes, and so every sufficiently large even integer is the sum of four primes. Hilbert proved that, for every integer *k* > 1, every nonnegative integer is the sum of a bounded number of *k*-th powers. In general, a set *A* of nonnegative integers is called a basis of order *h* if *hA* contains all positive integers, and it is called an assymptotic basis if *hA* contains all sufficiently large integers. Much current research in this area concerns properties of general asymptotic bases of finite order. For example, a set *A* is called a minimal asymptotic basis of order *h* if *A* is an asymptotic basis of order h but no proper subset of *A* is an asymptotic basis of order *h*. It has been proved that minimal asymptotic bases of order *h* exist for all *h*, and that there also exist asymptotic bases of order *h* that contain no minimal asymptotic bases of order *h*. Another question to be considered is how small can the number of representations of *n* as a sum of *h* elements in an asymptotic basis can be. This is the content of the Erdős–Turán conjecture on additive bases.

Read more about this topic: Additive Number Theory

### Other articles related to "additive number theory, additive, theory, number":

**Additive Number Theory**- Additive Combinatorics

... sometimes associated to this sub-division is

**additive**combinatorics.) Unlike problems related to classical bases, as described above, this sub-area often deals with finite subsets rather ... of mathematics, including combinatorics, ergodic

**theory**, analysis, graph

**theory**, group

**theory**, and linear algebraic and polynomial methods ...

**Additive Number Theory**

... One of the most important problems in

**additive number theory**is Waring's problem, which asks whether it is possible, for any k ≥ 2, to write any positive integer as the sum of a bounded

**number**of kth powers ... method, and give explicit upper bounds for the function G(k), the smallest

**number**of kth powers needed, such as Vinogradov's bound ...

### Famous quotes containing the words theory and/or number:

“The things that will destroy America are prosperity-at-any- price, peace-at-any-price, safety-first instead of duty-first, the love of soft living, and the get-rich-quick *theory* of life.”

—Theodore Roosevelt (1858–1919)

“I who have been involved with all styles of painting can assure you that the only things that fluctuate are the waves of fashion which carry the snobs and speculators; the *number* of true connoisseurs remains more or less the same.”

—Pablo Picasso (1881–1973)