Search Results for ""

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...

Decimal is the base-10 notational system for representing real numbers. The expression of a number using the decimal system is called its decimal expansion, examples of which ...

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

There are several different kinds of magic numbers. The digital root and magic constant are sometimes known as magic numbers. In baseball, the magic number for a team in ...

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 radical integer is a number obtained by closing the integers under addition, multiplication, subtraction, and root extraction. An example of such a number is RadicalBox[7, ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

Rubik's Clock is a puzzle consisting of 18 small clocks, 14 of which are independent, each of which may be set to any 12-hour position. There are therefore 12^(14) possible ...