Search Results for ""

A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

A self-intersecting minimal surface which can be generated using the Enneper-Weierstrass parameterization with f(z) = 1 (1) g(z) = zeta. (2) Letting z=re^(iphi) and taking ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

In the theory of special functions, a class of functions is said to be "of the third kind" if it is similar to but distinct from previously defined functions already defined ...

A logarithmic singularity is a singularity of an analytic function whose main z-dependent term is of order O(lnz). An example is the singularity of the Bessel function of the ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

The Euler formula, sometimes also called the Euler identity (e.g., Trott 2004, p. 174), states e^(ix)=cosx+isinx, (1) where i is the imaginary unit. Note that Euler's ...