Search Results for ""

The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...

Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

An idealized coin consists of a circular disk of zero thickness which, when thrown in the air and allowed to fall, will rest with either side face up ("heads" H or "tails" T) ...

The average distance between two points chosen at random inside a unit cube (the n=3 case of hypercube line picking), sometimes known as the Robbins constant, is Delta(3) = ...

A double bubble is pair of bubbles which intersect and are separated by a membrane bounded by the intersection. The usual double bubble is illustrated in the left figure ...