Fourteen lonely runners
We prove the Lonely Runner Conjecture for fourteen runners by a computer-assisted extension of the finite-checking framework of Sungkawichai and Trakulthongchai. With one runner stationary, their thirteen-runner result supplies the induction input, and their reduction leaves finitely many modular calculations indexed by primes. We...