Search Results for ""

A Room square (named after T. G. Room) of order n (for n even) is an arrangement in an (n-1)×(n-1) square matrix of n objects such that each cell is either empty or holds ...

The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

The number of ways of folding a strip of stamps has several possible variants. Considering only positions of the hinges for unlabeled stamps without regard to orientation of ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

If ABB^' and AC^'C are straight lines with BC and B^'C^' intersecting at D and AB+BD=AC^'+C^'D, then AB^'+B^'D=AC+CD. The origin and some history of this theorem are ...

The series h_q(-r)=sum_(n=1)^infty1/(q^n+r) (1) for q an integer other than 0 and +/-1. h_q and the related series Ln_q(-r+1)=sum_(n=1)^infty((-1)^n)/(q^n+r), (2) which is a ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...