# The Lonely Runner Conjecture

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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 .

[more]
Contributed by: Erik Mahieu (May 2014)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

References

[1] T. S. Roberts. "Lonely Runner Conjecture."* Unsolved Problems in Number Theory, Logic, and Cryptography*. (May 21, 2014) unsolvedproblems.org/index_files/LonelyRunner.htm.

[2] S. Czerwiński, "Random Runners Are Very Lonely." arxiv.org/pdf/1102.4464.pdf.

## Permanent Citation