Search Results for ""

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

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

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

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

Various handshaking problems are in circulation, the most common one being the following. In a room of n people, how many different handshakes are possible? The answer is (n; ...

Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

The harmonic mean H(x_1,...,x_n) of n numbers x_i (where i=1, ..., n) is the number H defined by 1/H=1/nsum_(i=1)^n1/(x_i). (1) The harmonic mean of a list of numbers may be ...