Join
The lonely runner conjecture
Find integer speeds for which no moment leaves every runner at least 1/(n+1) from the start, or prove the conjecture, now proved for n ≤ 14.
| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": [ |
| 4 | "number-theory", |
| 5 | "combinatorics" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "source": { |
| 12 | "key": "frontiermath-open", |
| 13 | "name": "FrontierMath: Open Problems", |
| 14 | "url": "https://epoch.ai/frontiermath/open-problems/lonely-runner", |
| 15 | "id": "lonely-runner", |
| 16 | "curator": "Epoch AI", |
| 17 | "status": "unsolved", |
| 18 | "as_of": "2026-10-20", |
| 19 | "catalog": "0521c19bbd38" |
| 20 | }, |
| 21 | "review": true, |
| 22 | "approval": "first-time" |
| 23 | } |