New Strides Made on Deceptively Simple ‘Lonely Runner’ Problem

A straightforward conjecture about runners moving around a track turns out to be equivalent to many complex mathematical questions. Three new proofs mark the first significant progress on the problem in decades.

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…

Source

المصدر: المصدر الأصلي

{“@context”:”https://schema.org”,”@type”:”NewsArticle”,”headline”:”New Strides Made on Deceptively Simple ‘Lonely Runner’ Problem”,”description”:”A straightforward conjecture about runners moving around a track turns out to be equivalent to many complex mathematical questions. Three new proofs mark the first significant progress on the problem in decades.

The post New Strides Made on Deceptively Simple ‘Lonely Runner’ Problem first appeared on Quanta Magazine

“,”datePublished”:”2026-03-06 15:00:33″,”author”:{“@type”:”Organization”,”name”:”العربية”},”publisher”:{“@type”:”Organization”,”name”:”Newsly”,”url”:”https://wordpress-hr2d6.wasmer.app”},”image”:”https://www.quantamagazine.org/wp-content/uploads/2026/03/Lonely-Runner-cr-Mark-Belan-Default.webp”}