Search Results for ""

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

Quantifier elimination is the removal of all quantifiers (the universal quantifier forall and existential quantifier exists ) from a quantified system. A first-order theory ...

There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...

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

The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...

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