Conjecture Suppose runners having distinct constant speeds start at a common point and run laps on a circular track with circumference 1. Then for any given runner, there is a time at which that runner is distance at least (along the track) away from every other runner.
We consider being odd prime number of runners with distinct speeds , and without loss of generality .
Consider speeds decomposition base p , with negative speeds being p-complement represented.
For each speed there is first non zero ‘digit’ base p, e.g. . We want to rearrange speeds that the positions of the first non zero digits in descending order – .
For example, if than every runner has speeds , and at time their positions on a lap are + whole number of laps – e.g. they all are distant from the origin – Lonely Runner conjecture is satisfied.
Some terminology for positions on the lap. Sector k – , beginning of the sector k . Origin – . Lonely Runner conjecture is satisfied when there are no runner sin . is occupied if at least one of the runner at position , and unoccupied (free) otherwise.
At time 0 all runners are at origin. If at time all runners are distant. Therefore, we consider the case when .
At time none of the runners at the origin, runners with are in the beginning of sectors . Since there are at most such runners at least one is unoccupied. Since multiplicative integer group modulo prime number is cyclic there is time when is free. At that time none of the runners in the last sector, none in the origin, but some may be at sector 0.
We need the following sequence of numbers , e.g. indexing the first runners with distinct .
Suppose we have runners at arbitrary positions with speeds . Consider times . Since the multiplicative group of integers modulo prime p is cyclic there is at most 2 distinct when the runner is in the vicinity of origin. Therefore, if there is m when none of the runner in the vicinity of the origin.
From that it follows that if there is a time , where is a sequence of numbers that guarantee that the first runners neither in the first nor in the last sectors by applying previous paragraph recurrently.
The difficult case that is left is when there are two or more , and .
The idea to use group operations and time proportional to , where k is does not work. For example, the time when no runners are near the origin for the runners with speeds 1 3 4 5 7 18 is and and for the times for all there is at least one runner in the vicinity of the origin. On the other hand, the time when closest runners are most distant from the origin is corresponding to the time when runners 4 and 7 are at the same distance from the origin on the opposite sides from the origin. e.g. the time for the maximum distance of closest runners from the origin is of the form for some , and the question here is to check if there are different runners close to the origin. Moreover, either all have common factor, or they are relatively prime (no pair have common factors).