Search Results for ""

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

A theorem, also called the iteration theorem, that makes use of the lambda notation introduced by Church. Let phi_x^((k)) denote the recursive function of k variables with ...

The Hopf invariant one theorem, sometimes also called Adams' theorem, is a deep theorem in homotopy theory which states that the only n-spheres which are H-spaces are S^0, ...

A special case of Stokes' theorem in which F is a vector field and M is an oriented, compact embedded 2-manifold with boundary in R^3, and a generalization of Green's theorem ...

Let A be a sum of squares of n independent normal standardized variates X_i, and suppose A=B+C where B is a quadratic form in the x_i, distributed as chi-squared with h ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...