Search Results for ""

An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

The Kronecker symbol is an extension of the Jacobi symbol (n/m) to all integers. It is variously written as (n/m) or (n/m) (Cohn 1980; Weiss 1998, p. 236) or (n|m) (Dickson ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

A magic tesseract is a four-dimensional generalization of the two-dimensional magic square and the three-dimensional magic cube. A magic tesseract has magic constant ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...