The lonely runner conjecture

if k runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1/k from each other runner) at some time?

Open the “Combinatorics” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)