Skip to main content
MathOverflow

Return to Answer

added 58 characters in body
Source Link
Martin Sleziak
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

The lonely runner conjecture. As WikipediaWikipedia puts it:

Consider $k + 1$ runners on a circular track of unit length. At $t = 0$, all runners are at the same position and start to run; the runners' speeds are pairwise distinct. A runner is said to be lonely if at distance of at least $1/(k + 1)$ from each other runner. The lonely runner conjecture states that every runner gets lonely at some time.

The lonely runner conjecture. As Wikipedia puts it:

Consider $k + 1$ runners on a circular track of unit length. At $t = 0$, all runners are at the same position and start to run; the runners' speeds are pairwise distinct. A runner is said to be lonely if at distance of at least $1/(k + 1)$ from each other runner. The lonely runner conjecture states that every runner gets lonely at some time.

The lonely runner conjecture. As Wikipedia puts it:

Consider $k + 1$ runners on a circular track of unit length. At $t = 0$, all runners are at the same position and start to run; the runners' speeds are pairwise distinct. A runner is said to be lonely if at distance of at least $1/(k + 1)$ from each other runner. The lonely runner conjecture states that every runner gets lonely at some time.

Post Made Community Wiki
Source Link
Timothy Chow
Timothy Chow
  • 82.6k
  • 26
  • 363
  • 587

The lonely runner conjecture. As Wikipedia puts it:

Consider $k + 1$ runners on a circular track of unit length. At $t = 0$, all runners are at the same position and start to run; the runners' speeds are pairwise distinct. A runner is said to be lonely if at distance of at least $1/(k + 1)$ from each other runner. The lonely runner conjecture states that every runner gets lonely at some time.