Search Results for ""

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

A Heegaard splitting of a connected orientable 3-manifold M is any way of expressing M as the union of two (3,1)-handlebodies along their boundaries. The boundary of such a ...

A framework is called "just rigid" if it is rigid, but ceases to be so when any single bar is removed. Lamb (1928, pp. 93-94) proved that a necessary (but not sufficient) ...

The space of currents arising from rectifiable sets by integrating a differential form is called the space of two-dimensional rectifiable currents. For C a closed bounded ...

A phi-prime is a prime number appearing in the decimal expansion of the golden ratio phi. The first few are 1618033, 1618033988749, ... (OEIS A064117). The numbers of decimal ...

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...