Published online by Cambridge University Press: 18 May 2009
The problem of Josephus and the forty Jewsis well known [1, 3]. In its most general form, this problem is equivalent to the problem of m-enumeration of a set, as described below.
Define the ordered set
We choose and remove cyclically, from left to right, each with element of Zn until the set is exhausted. The chosen elements are ordered into a new ordered set
which is therefore a permutation of Zn, obtained by what we call m-enumeration of theset Zn.