15 and 290 theorems
In mathematics, the 15 theorem or Conway–Schneeberger Fifteen Theorem, proved by John H. Conway and W. A. Schneeberger in 1993, states that if a positive definite quadratic form with integer matrix re
Green–Tao theorem
In number theory, the Green–Tao theorem, proved by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for e
Legendre's three-square theorem
In mathematics, Legendre's three-square theorem states that a natural number can be represented as the sum of three squares of integers if and only if n is not of the form for nonnegative integers a a
Restricted sumset
In additive number theory and combinatorics, a restricted sumset has the form where are finite nonempty subsets of a field F and is a polynomial over F. If is a constant non-zero function, for example
Goldbach's weak conjecture
In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that Every odd number greater than 5 can be expre
Romanov's theorem
In mathematics, specifically additive number theory, Romanov's theorem is a mathematical theorem proved by Nikolai Pavlovich Romanov. It states that given a fixed base b, the set of numbers that are t
Additive number theory
Additive number theory is the subfield of number theory concerning the study of subsets of integers and their behavior under addition. More abstractly, the field of additive number theory includes the
Additive basis
In additive number theory, an additive basis is a set of natural numbers with the property that, for some finite number , every natural number can be expressed as a sum of or fewer elements of . That
Friedlander–Iwaniec theorem
In analytic number theory the Friedlander–Iwaniec theorem states that there are infinitely many prime numbers of the form . The first few such primes are 2, 5, 17, 37, 41, 97, 101, 137, 181, 197, 241,
Skolem–Mahler–Lech theorem
In additive and algebraic number theory, the Skolem–Mahler–Lech theorem states that if a sequence of numbers satisfies a linear difference equation, then with finitely many exceptions the positions at
Waring–Goldbach problem
The Waring–Goldbach problem is a problem in additive number theory, concerning the representation of integers as sums of powers of prime numbers. It is named as a combination of Waring's problem on su
Fermat polygonal number theorem
In additive number theory, the Fermat polygonal number theorem states that every positive integer is a sum of at most n n-gonal numbers. That is, every positive integer can be written as the sum of th
Waring's prime number conjecture
In number theory, Waring's prime number conjecture is a conjecture related to Vinogradov's theorem, named after the English mathematician Edward Waring. It states that every odd number exceeding 3 is
Waring's problem
In number theory, Waring's problem asks whether each natural number k has an associated positive integer s such that every natural number is the sum of at most s natural numbers raised to the power k.
Erdős–Tetali theorem
In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fix
Erdős–Turán conjecture on additive bases
The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. The que
Square-difference-free set
In mathematics, a square-difference-free set is a set of natural numbers, no two of which differ by a square number. Hillel Furstenberg and András Sárközy proved in the late 1970s the Furstenberg–Sárk
Polite number
In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. A positive integer which is not polite is called impolite. The impo
Lagrange's four-square theorem
Lagrange's four-square theorem, also known as Bachet's conjecture, states that every natural number can be represented as the sum of four integer squares. That is, the squares form an additive basis o
Lemoine's conjecture
In number theory, Lemoine's conjecture, named after Émile Lemoine, also known as Levy's conjecture, after Hyman Levy, states that all odd integers greater than 5 can be represented as the sum of an od
Folkman's theorem
Folkman's theorem is a theorem in mathematics, and more particularly in arithmetic combinatorics and Ramsey theory. According to this theorem, whenever the natural numbers are partitioned into finitel
Arithmetic combinatorics
In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.
Schnirelmann density
In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the firs
Cameron–Erdős conjecture
In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in is The sum of two odd numbers is even, so a set of odd numbers is always s
Pythagorean quadruple
A Pythagorean quadruple is a tuple of integers a, b, c, and d, such that a2 + b2 + c2 = d2. They are solutions of a Diophantine equation and often only positive integer values are considered. However,
Fermat's theorem on sums of two squares
In additive number theory, Fermat's theorem on sums of two squares states that an odd prime p can be expressed as: with x and y integers, if and only if The prime numbers for which this is true are ca
Pollock's conjectures
Pollock's conjectures are two closely related unproven conjectures in additive number theory. They were first stated in 1850 by Sir Frederick Pollock, better known as a lawyer and politician, but also
Postage stamp problem
The postage stamp problem is a mathematical riddle that asks what is the smallest postage value which cannot be placed on an envelope, if the latter can hold only a limited number of stamps, and these
Minimum overlap problem
In number theory and set theory, the minimum overlap problem is a problem proposed by Hungarian mathematician Paul Erdős in 1955.
Sum of two squares theorem
In number theory, the sum of two squares theorem relates the prime decomposition of any integer n > 1 to whether it can be written as a sum of two squares, such that n = a2 + b2 for some integers a, b
Sums of three cubes
In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum.
Goldbach's conjecture
Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime num
Landau–Ramanujan constant
In mathematics and the field of number theory, the Landau–Ramanujan constant is the positive real number b that occurs in a theorem proved by Edmund Landau in 1908, stating that for large , the number