Write the numbers 1 to N in a list.
Namer names a distance d.
Claimer claims a subset of remaining numbers such that no two are d apart.
How long does it take Claimer to claim every number?
This paper proves it's O(log log n) turns. twitter.com/MathPaper/stat…