Consider a variant of Josephus Problem. Instead of finding the initial position p_survive of the survivor, I want vary the skip interval k and determine if the following is true:
For all positions
pin the circle, there exists a value ofksuch thatp = p_surviveexists.
Intuitively, it seems like the statement is true because the circle changes in size after each elimination while the skip interval remains constant, so there is a chance for each position to be the surviving position after using many values of k. However, I am not sure if there is a more robust proof (or disproof) for this.
Any help would be greatly appreciated, thanks!