The Lonely Runner Conjecture

There are runners going around a circular track of unit length. They all start together from the same spot and each one has their own distinct speed. The distance between two runners is the distance around the track between them. A runner is defined as lonely if his distance to any other runner is at least .
The Lonely Runner conjecture states that each runner becomes lonely at some time [1]. The conjecture has been proven for up to seven runners [2].
This Demonstration lets you verify this conjecture. Select a number of runners and start the race. When a runner becomes lonely, his position and his marker on the speed gauge turn red and two red arcs of length are displayed fore and aft of his position.
Each new race or renewed selection of the number of runners generates a different set of random speeds.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


[1] T. S. Roberts. "Lonely Runner Conjecture." Unsolved Problems in Number Theory, Logic, and Cryptography. (May 21, 2014)
[2] S. Czerwiński, "Random Runners Are Very Lonely."
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.