Search Results for ""

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...

A man of Seville is shaved by the Barber of Seville iff the man does not shave himself. Does the barber shave himself? This pseudoparadox was proposed by Bertrand Russell.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

A proof which can be accomplished using only real numbers (i.e., real analysis instead of complex analysis; Hoffman 1998, pp. 92-93).

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

A factorial prime is a prime number of the form n!+/-1, where n! is a factorial. n!-1 is prime for n=3, 4, 6, 7, 12, 14, 30, 32, 33, 38, 94, 166, 324, 379, 469, 546, 974, ...

Numbers 1, alpha_1, ..., alpha_L are rationally independent iff under the action of rotation rho_(alpha_1)×...×rho_(alpha_L) on the L-dimensional torus, every orbit is ...