约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止-A descr iption of Joseph is: No. 1,2, ..., n of n individuals according to a clockwise direction around a circle, no one to hold a password. The beginning of a positive integer as a candidate off the upper limit m, from the first individual to embark on the clockwise from 1 to start off, report the number of m is to stop the newspaper. Reported m the person out of his password as the new m value, from his in a clockwise direction on the next person started to count off from 1, and so on, until all the column until all