Search Results for "Warings Problem"

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...

The Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

The series sum_(k=1)^infty1/k (1) is called the harmonic series. It can be shown to diverge using the integral test by comparison with the function 1/x. The divergence, ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

A projective plane, sometimes called a twisted sphere (Henle 1994, p. 110), is a surface without boundary derived from a usual plane by addition of a line at infinity. Just ...