Let for distinct positive integer speeds. The stationary runner gives runners in total. Divide the speeds by their gcd and sort them to obtain the primitive set.
Theorem. The primitive speed sets satisfying for are as follows. Each listed set attains equality.
| Runners | All primitive speed sets |
|---|---|
| 11 | |
| 12 | |
| 13 | |
| 14 | and |
The first three rows settle the prediction stated by Sungkawichai and Trakulthongchai in §7.1. The second fourteen-runner example was found by Goddyn and Wong. The new conclusion is exhaustiveness over arbitrary integer speeds. The proof uses the earlier authors’ finite modular sieves, together with a geometric argument and an additional finite computation to determine the integer directions. Sungkawichai and Trakulthongchai, §§5–7 · Goddyn and Wong · Allikvere, §§4–7
Size and separation bounds
Use for a rational subspace . Assume primitive and . Every rational subspace containing is contained in no coordinate hyperplane. If its dimension is , it has loneliness at least by coordinate coalescence and the already proved lower-dimensional lonely runner bounds. In particular every rational plane containing has loneliness at least . Allikvere, Lemma 3.3
Project the integer lattice orthogonally onto with its ordinary Euclidean metric. Its covolume is . Let be the squared Gram–Schmidt lengths of a Korkine–Zolotarev basis. For the space spanned by and integer lifts of the first basis vectors, subtract integer multiples of the lifts in reverse basis order. Each remaining projected Gram–Schmidt coefficient has absolute value at most . The component parallel to can be absorbed into the circle parameter. Every point of that torus is consequently within Euclidean distance of the speed circle, hence within this sup distance as well. Since loneliness is 1-Lipschitz in sup distance,
Set , and . The verifier checks exactly. The KZ basis satisfies . Allikvere’s product minimization lemma therefore gives . In particular by AM–GM. This argument allows equality in the prefix bounds. Allikvere, Lemmas 3.5–3.6
For , if no speed were divisible by , time would give . Thus divides . For the prime set of each row below, with product , the verifier checks that and are coprime and that
Consequently one of the listed primes divides no speed. These four comparisons use rational arithmetic. Verifier and exact prime lists
Short vector lemma. If and , then is parallel to . Otherwise is integral and independent of . Represent any phase on their plane by with modulo one. It is within of . Therefore the plane has loneliness strictly less than , a contradiction. A recorded short vector thus determines the primitive integer direction by its sorted absolute coordinates divided by their gcd.
Which modular orbits an equality case can occupy
Fix a prime dividing no coordinate. Consider binary lifts, with moduli . In every row of our proof has an odd prime factor different from , so does not divide . A grid distance at least on these grids is automatically strictly greater. Hence a tuple with has no witness on any such grid. At binary levels the gcd deletion in the earlier sieves can only mean that all entries, or all but one, are even. All-even entries contradict primitivity. With exactly one odd speed, the even speeds have a time of loneliness at least by the lower-dimensional theorem. They keep their phases half a turn later, and in one of the two positions the odd speed has distance at least . Thus this deletion also gives a strict witness. The complete binary searches cited below therefore cover an actual equality case up to permutation, individual signs and multiplication by a unit.
- Ten and twelve speeds. For use the 61 primes in Table 1 of Sungkawichai and Trakulthongchai, and for use the corresponding 91. Their binary sieve through , projected back to , leaves only the orbit of . We use the result of the binary phase before their polynomial argument. For , Allikvere separately audited all 1,092 residual tuples. Binary sieve and prime lists · Audit of the twelve-speed residuals
- Thirteen speeds. For each of Allikvere’s 111 archived primes, the binary sieve leaves only the two orbits represented by and modulo . We need 62 of those primes, namely the 61 primes in the second fourteen-runner proof together with 557. We use the binary result through , before the final factor-seven lift. Binary survivors · Original 111-prime table
Eleven speeds. Here the published final sieve uses a modulus divisible by twelve. We instead extract an earlier count from the authors’ original log. For the 44 primes listed as TWELVE in our verifier, the first lift from to yields exactly rows. The original implementation expands all common-unit rescalings modulo , folds the signs there and retains distinct sorted lifts. These counts determine every row at . Original log at its fixed commit · Normalizer and lift representation
Indeed, for each unit modulo , start with , choose each sign to put its residue modulo in , reduce modulo , and sort. Each such tuple must be retained. It has six odd coordinates, and a grid witness would be strict, contradicting the elementary equality . The verifier explicitly constructs these representatives and counts exactly distinct rows for each of the 44 primes. They exhaust the logged first-lift count, so any equality case has the consecutive orbit as its reduction modulo . The optional source-log check and CI compare the extracted counts against the hash-pinned original file.
From residue classes to integer sets
The preceding results restrict to one or two possible orbits modulo the prime dividing no speed. A single modular match alone would allow infinitely many integer sets. We now apply the short vector lemma to all binary descendants of each permitted root.
At a node enumerate all children modulo . A parent unit lifts to a child unit, so the original choice of representative is harmless. At even the unit flips the lift bits at every odd entry at once. Fixing the bit at the first odd entry preserves at least one representative. Exclude all-even and single-odd children as above. At each remaining child and each odd , form the absolute centered coordinates .
- If for every , discard the child by its strict witness.
- If , the signed centered residues are a short vector as in the lemma. For an actual primitive tuple the residue vector has order ; hence this multiplier produces a nonzero vector. A zero coordinate or equal absolute coordinates exclude a distinct positive primitive tuple. Otherwise record the normalized direction.
- Recurse on all other children. An unresolved node at depth ten causes the verifier to fail.
Every one of the 258 prime searches terminates. In every search the recorded directions are exactly the integer sets in the theorem for its respective number of speeds. Finally, their exact maxima can be computed at for two distinct speeds. They contain 1 and 2, so their maximum is below . Every positive local maximum below has two active slopes of opposite signs, which forces such a denominator. The verifier obtains precisely in all five cases. Binary lift code · Arithmetic and exact maxima
This is an unrefereed computer-assisted proof. Its new verifier replays the deductions from the prior modular sieve results. The cited papers and their archives supply the underlying exhaustive prime-level calculations.