Search Results for ""

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

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...

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 permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

A hyperbola (plural "hyperbolas"; Gray 1997, p. 45) is a conic section defined as the locus of all points P in the plane the difference of whose distances r_1=F_1P and ...

A product involving an infinite number of terms. Such products can converge. In fact, for positive a_n, the product product_(n=1)^(infty)a_n converges to a nonzero number iff ...

A regular continued fraction is a simple continued fraction x = b_0+1/(b_1+1/(b_2+1/(b_3+...))) (1) = K_(k=1)^(infty)1/(b_k) (2) = [b_0;b_1,b_2,...], (3) where b_0 is an ...