Search Results for ""

The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.

A game in which each player has a finite number of moves and a finite number of choices at each move.

A number n for which a shortest chain exists (which is also a Hansen chain) is called a Hansen number.

In general, an integer n is divisible by d iff the digit sum s_(d+1)(n) is divisible by d. Write a positive decimal integer a out digit by digit in the form ...

A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

A formula for the Bell polynomial and Bell numbers. The general formula states that B_n(x)=e^(-x)sum_(k=0)^infty(k^n)/(k!)x^k, (1) where B_n(x) is a Bell polynomial (Roman ...

The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...

Let u_(B,b)(n) be the number of digit blocks of a sequence B in the base-b expansion of n. The following table gives the sequence {u_(B)(n)} for a number of blocks B. B OEIS ...