This is a variant of the Josephus problem. There are n players in a line. Beginning with the first player, move from left to right, removing every r^(th) player. Alternately, do the same in the other direction. For either process, change the direction at the end of the line. Denote the position of the sole survivor by JLI(r,n). You can see how players are removed with the "demo" button. With the "graph" button you can see the graphs of LJ(r,n) for r=2,3,...,21 and n=1,2,...,200. You can also see the combination of all the graphs for r=2,3,...,21Ensino Médio::Matemática