Search Results for ""
1001 - 1010 of 4217 for Strong Lawof Small NumbersSearch Results

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
An odd alternating permutation number, more commonly called an Euler number or secant number.
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
A compact manifold is a manifold that is compact as a topological space. Examples are the circle (the only one-dimensional compact manifold) and the n-dimensional sphere and ...
A number of attractive tetrahedron 10-compounds can be constructed. The first (left figures) can be obtained by combining tetrahedron 5-compounds of opposite chirality ...
kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...
Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...
Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...
A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...
The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

...