(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result.

(number theory) The theorem that, for any prime number p and integer a, aᵖ-a is an integer multiple of p.

Synonym of de Moivre's formula

(aerodynamics) A fundamental theorem used to calculate the lift of an airfoil and any two-dimensional bodies including circular cylinders translating in a uniform fluid at a constant speed large enough so that the flow seen in the body-fixed frame is steady and unseparated.

(number theory) The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity.

plural of prime number theorem

(mathematics) In knot theory, a theorem stating that three-dimensional smooth curves with small total curvature must be unknotted.

(graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary).

(number theory) A result that is useful in establishing the transcendence of numbers, stating that, if α₁, ..., αₙ are algebraic numbers which are linearly independent over the rational numbers ℚ, then e^(α₁), ..., e^(αₙ) are algebraically independent over ℚ.

(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.