Introduction - If you have any usage issues, please Google them yourself
A description of Josephus (Joseph) the problem is: numbered 1,2, ..., n by n individuals sitting clockwise circle, each holding a password (positive integer). Optional start a positive integer as the number of reported upper limit m, the first person to start a clockwise direction since the beginning of the sequence reported number, the number of reported stops at registration m. M people out newspaper columns, his password as the new value of m, its beginning in the next person in a clockwise direction a number off again, and so on, until all the columns until everyone. Trial design by tired Josephus problem solving out the order of columns.