# Category:Additive number theory

Here is a list of articles in the Additive number theory category of the Computing portal that unifies foundations of mathematics and computations using computers. **Additive number theory** is the branch of number theory that studies ways to represent numbers as sums.

## Pages in category "Additive number theory"

The following 34 pages are in this category, out of 34 total.

- Additive number theory
*(computing)*

### 1

- 15 and 290 theorems
*(computing)*

### A

- Additive basis
*(computing)* - Arithmetic combinatorics
*(computing)*

### C

- Cameron–Erdős conjecture
*(computing)*

### E

- Erdős–Tetali theorem
*(computing)* - Erdős–Turán conjecture on additive bases
*(computing)*

### F

- Fermat polygonal number theorem
*(computing)* - Fermat's theorem on sums of two squares
*(computing)* - Proofs of Fermat's theorem on sums of two squares
*(computing)* - Folkman's theorem
*(computing)* - Friedlander–Iwaniec theorem
*(computing)* - Furstenberg–Sárközy theorem
*(computing)*

### G

- Goldbach's conjecture
*(computing)* - Goldbach's weak conjecture
*(computing)* - Green–Tao theorem
*(computing)*

### L

- Lagrange's four-square theorem
*(computing)* - Landau–Ramanujan constant
*(computing)* - Legendre's three-square theorem
*(computing)* - Lemoine's conjecture
*(computing)*

### M

- Minimum overlap problem
*(computing)*

### P

- Polite number
*(computing)* - Pollock's conjectures
*(computing)* - Postage stamp problem
*(computing)* - Pythagorean quadruple
*(computing)*

### R

- Restricted sumset
*(computing)* - Romanov's theorem
*(computing)*

### S

- Schnirelmann density
*(computing)* - Skolem–Mahler–Lech theorem
*(computing)* - Sum of two squares theorem
*(computing)* - Sums of three cubes
*(computing)*

### W

- Waring's prime number conjecture
*(computing)* - Waring's problem
*(computing)* - Waring–Goldbach problem
*(computing)*