Search Results for ""

A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).

The encrypted form of a plaintext.

A circle bundle pi:E->M is a fiber bundle whose fibers pi^(-1)(x) are circles. It may also have the structure of a principal bundle if there is an action of SO(2) that ...

A notation for large numbers due to Steinhaus (1999). In circle notation, is defined as n in n squares, where numbers written inside squares (and triangles) are interpreted ...

A partially ordered set P is a circle order if it is isomorphic to a set of disks ordered by containment.

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

Gradshteyn and Ryzhik (2000) define the circulant determinant by (1) where omega_j is the nth root of unity. The second-order circulant determinant is |x_1 x_2; x_2 ...

The ratio of a measure of the size of a "fit" to the size of a "residual."