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

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

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...

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

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the ...

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...