Irregularity of distributions explained

The irregularity of distributions problem, stated first by Hugo Steinhaus, is a numerical problem with a surprising result. The problem is to find N numbers,

x1,\ldots,xN

, all between 0 and 1, for which the following conditions hold:

Mathematically, we are looking for a sequence of real numbers

x1,\ldots,xN

such that for every n ∈  and every k ∈  there is some i ∈  such that

k-1
n

\leqxi<

k
n

.

Solution

The surprising result is that there is a solution up to N = 17, but starting at N = 18 and above it is impossible. A possible solution for N ≤ 17 is shown diagrammatically on the right; numerically it is as follows:

\begin{align} x1&=0.029\\ x2&=0.971\\ x3&=0.423\\ x4&=0.71\\ x5&=0.27\\ x6&=0.542\\ x7&=0.852\\ x8&=0.172\\ x9&=0.62\\ x10&=0.355\\ x11&=0.777\\ x12&=0.1\\ x13&=0.485\\ x14&=0.905\\ x15&=0.218\\ x16&=0.667\\ x17&=0.324 \end{align}

In this example, considering for instance the first 5 numbers, we have

0<x1<

1
5

<x5<

2
5

<x3<

3
5

<x4<

4
5

<x2<1.

Mieczysław Warmus concluded that 768 (1536, counting symmetric solutions separately) distinct sets of intervals satisfy the conditions for N = 17.

References