> n runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least 1/n units away from all others.
Interesting conjecture! And okay, a lot of interesting problems end up being distilled into tangible if eccentrically named things. Like the "dining philosophers" in computer science to describe deadlock. I'm curious how this relates to a tangible problem.
> Implications
Nice, here we go!
> Suppose C is a n-hypercube of side length s in n-dimensional space.
:|