约瑟夫问题的一种描述为：编号为1，2，…，m的m个人按顺时针方向围坐一圈，每个人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值n。从第一个人开始按顺时针方向自1开始顺序报数，报到n时停止报数。报n的人出列，将他的密码作为新的n值，从他在顺序方向上的下一个人开始重新从1开始报数，如此下去，直到所有的人都出列。-a problem described as : No. 1, 2, ..., m m by individuals sitting around a circle clockwise direction. Each person has a password (positive integers). An optional beginning of a positive integer, as reported limits on the number of n. From the first individuals to embark on the clockwise direction since the beginning of a sequence of several reported, the report n reportedly stopped a few. N reported from the series of his password as a new value of n, From his direction on the order of one person started to re-start from a few reported so on, until all of them out of ranks.