Search Results for ""

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A Cullen number is a number of the form C_n=2^nn+1. The first few are 3, 9, 25, 65, 161, 385, ... (OEIS A002064). Cullen numbers are divisible by p=2n-1 if p is a prime of ...

A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...

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

The theorem of Möbius tetrads, also simply called Möbius's theorem by Baker (1925, p. 18), may be stated as follows. Let P_1, P_2, P_3, and P_4 be four arbitrary points in a ...

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

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

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