Breakthroughs Extend the Lonely Runner Problem to 10 Runners
The lonely runner problem asks whether, on a circular track with N runners at unique speeds, every runner will eventually be far from all others; it has been proven for up to seven runners, with recent computer-assisted work extending the result to eight (Rosenfeld) and then nine and ten (Trakulthongchai and Rosenfeld). These advances hint at a new, cross-disciplinary approach and have researchers planning a workshop to bridge number theory, geometry, and graph theory in pursuit of a general proof—though solving the full conjecture for all N may still take decades.