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