Search Results for ""

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

Church proved several important theorems that now go by the name Church's theorem. One of Church's theorems states that there is no consistent decidable extension of Peano ...

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...

The triangulation point Y of a reference triangle DeltaABC for which triangles DeltaBYC, DeltaCYA, and DeltaAYB have congruent incircles. It is a special case of an Elkies ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...