"The 'lonely runner' problem might seem simple and inconsequential, but it crops up in many guises throughout math. It's equivalent to questions in number theory, geometry, graph theory, and more—about when it's possible to get a clear line of sight in a field of obstacles, or where billiard balls might move on a table, or how to organize a network."
"For just two or three runners, the conjecture's proof is elementary. Mathematicians proved it for four runners in the 1970s, and by 2007, they'd gotten as far as seven. But for the past two decades, no one has been able to advance any further."
"Adding just one runner makes the task of proving the conjecture 'exponentially harder.' Going from seven runners to now 10 runners is amazing."
The lonely runner problem involves runners on a circular track, each with a unique pace. Mathematicians believe that every runner will be relatively far from others at least once. This problem connects to various mathematical fields, including number theory and geometry. While proofs exist for two to seven runners, progress stalled for two decades. Recently, Matthieu Rosenfeld proved the conjecture for eight runners, followed by Tanupat Trakulthongchai proving it for nine and ten runners, reigniting interest in the problem.
Read at WIRED
Unable to calculate read time
Collection
[
|
...
]