Search Results for ""

A geometric theorem related to the pentagram and also called the Pratt-kasapi theorem. It states ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...

The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...

For all integers n and |x|<a, lambda_n^((t))(x+a)=sum_(k=0)^infty|_n; k]lambda_(n-k)^((t))(a)x^k, where lambda_n^((t)) is the harmonic logarithm and |_n; k] is a Roman ...

Markov's theorem states that equivalent braids expressing the same link are mutually related by successive applications of two types of Markov moves. Markov's theorem is ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...

If A, B, and C are three points on one line, D, E, and F are three points on another line, and AE meets BD at X, AF meets CD at Y, and BF meets CE at Z, then the three points ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...