September 2026
3 submissions active in September 2026
A certified congruence family for fifteen lonely runners
cats: Computational Number Theory
We prove the classical Lonely Runner assertion for an infinite family of fifteen-runner configurations. If the integer speeds, in a suitable labeling, form a fifteen-term arithmetic progression modulo an integer m >= 900 with invertible common difference, every runner is at some time at least 1/15 from all the others....