Search Results for ""

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, .... ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

A ternary diagram is a triangular diagram which displays the proportion of three variables that sum to a constant and which does so using barycentric coordinates. The ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...

Pre-Algebra

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

The golden ratio, also known as the divine proportion, golden mean, or golden section, is a number often encountered when taking the ratios of distances in simple geometric ...