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

Consider the number of sequences that can be formed from permutations of a set of elements such that each partial sum is nonnegative. The number of sequences with nonnegative ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

A symbol used to distinguish one quantity x^' ("x prime") from another related x. Prime marks are most commonly used to denote 1. Transformed coordinates, 2. Conjugate ...

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 walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

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

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...