 Lonely runner conjecture

The Lonely Runner Conjecture is a hypothesis in the field of number theory and combinatorial geometry. It proposes that if \( k \) runners, each moving at different constant speeds, start running around a circular track of unit length, then for sufficiently large time, each runner will be at a distance of at least \( \frac{1}{k} \) from every other runner at some point in time.