The ‘Lonely Runner’ Problem Only Appears Simple

Key Points:

• The "lonely runner" problem, a longstanding mathematical conjecture, posits that in a group of runners each moving at a unique constant speed around a circular track, every runner will eventually be "lonely," or at least 1/N distance away from others.
• While the conjecture was proven for up to seven runners by 2007, progress stalled until 2023 when Matthieu Rosenfeld proved it for eight runners, followed shortly by Oxford undergraduate Paul Trakulthongchai extending the proof to nine and ten runners.
• The problem connects to various mathematical fields including number theory, geometry, and graph theory, and has applications ranging from network organization to visibility problems and billiard ball trajectories.
• Key advances involved reducing infinite speed cases to finite computations using Terence Tao’s threshold method, and employing number theory and computer-assisted proofs to rule out possible counterexamples based on prime factorization constraints.
• The recent breakthroughs represent a significant leap forward, overcoming the exponential difficulty increase with each additional runner, and have revitalized interest in the problem within the mathematical community.