The Josephus Problem is defined as follows :
Suppose n people are arranged in a circle and we are given a
positive integer m <= n. Starting with a designated person,
proceed around the circle removing every m th person. After removal,
counting continues around the remaining circle. When all n people
have been removed, the order in which the removal has occured defines the
(n, m)-Josephus Permutation of the integers 1,2,...,n.