The original version of this story appeared in Quanta Magazine.
Picture a bizarre training exercise: A group of runners starts jogging around a circular track, with each runner maintaining a unique, constant pace. Will every runner end up “lonely,” or relatively far from everyone else, at least once, no matter their speeds?
Mathematicians conjecture that the answer is yes.
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
→ Continue reading at Wired - Science