Lonely runner conjecture

If k runners move along a circular track of unit circumference at pairwise distinct constant integer speeds, is each runner at some moment 'lonely' — meaning at distance at least 1/k from all others?

The conjecture is proven for up to seven runners. The general case is unsolved and connects to view-obstruction problems in diophantine approximation.