Search Results for ""

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

A metadrome is a number whose hexadecimal digits are in strict ascending order. The first few are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, ... ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

The number of data points which fall within a given class in a frequency distribution.

In the archaic terminology of Whittaker and Watson (1990), the complex number z representing x+iy.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

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

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.