odd number theorem is a theorem in strong gravitational lensing which comes directly from differential topology. The theorem states that the number of...

In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit...

In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, b,...

are of this form. This is known as the Euclid–Euler theorem. It is not known whether there are any odd perfect numbers, nor whether infinitely many perfect...

The Feit–Thompson theorem states that a finite group is always solvable if its order is an odd number. This is an example of odd numbers playing a role...

In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number ap − a is an integer multiple of p. In...

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...

proofs. A similar result to Nicomachus's theorem holds for all power sums, namely that odd power sums (sums of odd powers) are a polynomial in triangular...

Groups of 2-rank 0, in other words groups of odd order, which are all solvable by the Feit–Thompson theorem. Groups of 2-rank 1. The Sylow 2-subgroups are...

smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime...

In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there...

The fundamental theorem of algebra, also called d'Alembert's theorem or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial...

perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither odd holes (odd-length induced...

In additive number theory, Fermat's theorem on sums of two squares states that an odd prime p can be expressed as: p = x 2 + y 2 , {\displaystyle p=x^{2}+y^{2}...

m is even or odd do not require separate arguments. The classical proof It is sufficient to prove the theorem for every odd prime number p. This immediately...

In mathematics, Euler's pentagonal number theorem relates the product and series representations of the Euler function. It states that ∏ n = 1 ∞ ( 1 −...

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...

The hairy ball theorem of algebraic topology (sometimes called the hedgehog theorem in Europe) states that there is no nonvanishing continuous tangent...

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers...

lines. Number the sectors consecutively in a clockwise or anti-clockwise fashion. Then the pizza theorem states that: The sum of the areas of the odd-numbered...

odd length, which require Δ + 1 colors. The theorem is named after R. Leonard Brooks, who published a proof of it in 1941. A coloring with the number...

2-factor theorem (graph theory) 15 and 290 theorems (number theory) 2π theorem (Riemannian geometry) AF+BG theorem (algebraic geometry) ATS theorem (number theory)...

In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers...

The Euclid–Euler theorem is a theorem in number theory that relates perfect numbers to Mersenne primes. It states that an even number is perfect if and...

theorem Mersenne prime Pierpont prime Primality test Proth's theorem Pseudoprime Sierpiński number Sylvester's sequence For any positive odd number m...

antihole as it is in an odd hole. As the strong perfect graph theorem states, the odd holes and odd antiholes turn out to be the minimal forbidden induced subgraphs...

subfield of Q(ζn) where n is a squarefree odd number. This result was introduced by Hilbert (1897, Satz 132, 1998, theorem 132) in his Zahlbericht and by Speiser (1916...

Jacobi's theorem can refer to: Maximum power theorem, in electrical engineering The result that the determinant of skew-symmetric matrices with odd size vanishes...

creates a number of finite odd components larger than the size of the subset. Bipartite matching Hall's marriage theorem Petersen's theorem Lovász & Plummer...

Euclid's theorem is a fundamental statement in number theory that asserts that there are infinitely many prime numbers. It was first proven by Euclid in...