The Lonely Runner Conundrum
The question of how many runners will always end up running alone, no matter their speed, has vexed mathematicians for decades. The ‘lonely runner’ problem involves a group of runners moving at unique, constant speeds around a track. The core question is: can we guarantee at least one lonely runner for any set of speeds?
The problem centers on the relative motion of the runners. A runner moving at a speed that is a rational multiple of another runner’s speed will eventually meet that runner.
Mathematicians seek to determine the conditions under which a lonely runner can be guaranteed. The source material emphasizes this core question, which remains unsolved.
Updates
Related Articles
The Lonely Runner Conundrum
Mathematicians tackle the 'lonely runner' problem, a puzzle about runners circling a track at unique paces.
The Lonely Runner Problem
Mathematicians struggle to solve the 'lonely runner' problem, a decades-old question about runners circling a track at unique paces.
Anthropic Plans to Pace AI Frontier as US Labs Push Open‑Weight
Anthropic's CEO outlines a pacing strategy while Garry Tan urges US labs to distill frontier models, sparking pushback from mathematicians worried about AI's reach.