Search Results for ""

A roll of 4 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a little Joe" is 1/12, or 8.333...%. A roll of "4 the hard ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).

The nested radical constant is the constant defined by C = sqrt(1+sqrt(2+sqrt(3+sqrt(4+sqrt(5+...))))) (1) = 1.75793275... (2) (OEIS A072449). No closed-form expression is ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

A octagrammic prism is a prism formed by two regular octagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...

The orthogonal complement of a subspace V of the vector space R^n is the set of vectors which are orthogonal to all elements of V. For example, the orthogonal complement of ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

A group that coincides with its commutator subgroup. If G is a non-Abelian group, its commutator subgroup is a normal subgroup other than the trivial group. It follows that ...