Lonely Runner

Consider 3 3 runners on a circular track of unit length. At t = 0 t = 0 , all runners are at the same position and start to run and the runners' speeds are pairwise distinct. A runner is said to be lonely at time t t if they are at a distance of at least 1 3 \frac 13 along the track from every other runner at time t t .

Will every runner be lonely at some time?


Bonus: What about 4 4 runners and lonely means they are at a distance of at least 1 4 \frac 14 from every other runner?

Yes No

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Jon Haussmann
Dec 7, 2018

@Jon Haussmann Sir, I was able to solve the problem, because I already KNEW about this conjecture.............But, could you please guide me to the proofs of other cases of the conjecture???

Aaghaz Mahajan - 2 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...