约瑟夫问题的一种描述是：编号为1,2，...，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一

个人开始按顺时针方向自1开始顺序报数，报到m时就停止报数。报m的人出列，将

他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，

直至所有人全部出列为止。-Joseph a descr iption of the problem is: Numbers for 1, 2,... , n n personal clockwise sat a lap, each holding a password (positive integer). A began to choose a positive integer number off as the upper m, from the first

People are beginning to clockwise order since 1 began to sound off, when they stop report m sound off. The newspaper m row, will

His password as new m value, from his clockwise direction of the next one from 1 and started to sound off, and so on,

Until all of them all so far row.