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 set of n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). The numbers ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...

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

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...