Search Results for ""

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...

The Haferman carpet is the beautiful fractal constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[1 1 1; 1 1 1; 1 1 1],1->[0 1 0; 1 0 1; ...

A linear functional defined on a subspace of a vector space V and which is dominated by a sublinear function defined on V has a linear extension which is also dominated by ...

The orthogonal polynomials defined by h_n^((alpha,beta))(x,N)=((-1)^n(N-x-n)_n(beta+x+1)_n)/(n!) ×_3F_2(-n,-x,alpha+N-x; N-x-n,-beta-x-n;1) =((-1)^n(N-n)_n(beta+1)_n)/(n!) ...

Sequences of integers generated in the Collatz problem. For example, for a starting number of 7, the sequence is 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, ...