The Linear Josephus Problem
The Linear Josephus Problem
This is a variant of the Josephus problem. There are players in a line. Beginning with the first player, move from left to right, removing every player. Change the direction at the end of the line and again remove every player. Denote by the position of the last player remaining.
n
th
r
th
r
LJ(r,n)
You can see how players are removed with the "demo" button. With the "graph" button you can see the graphs of for and . You can also see the combination of all the graphs for .
LJ(r,n)
r=2,3,…,21
n=1,2,…,300
r=2,3,…,21