Suppose there is a circular track with length 1. There are n runners on the track, each running at different and constant

speeds.
At any given time, a

runner is

lonely if the runner is 1/n or a greater arc distance away from all other runners.
The problem states that every runner is eventually lonely for all n and for all combinations of speeds.

The assertion has been proved for n up to 5.