解约瑟夫环的问题

约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Joseph ring problem

Joseph ring is the application of a mathematical problem: n known individual (numbered 1, 2, 3... n, respectively) sitting around a round table. People began to count off from Numbers for k, count to m out the man　His next start from 1 number off, count to m the man break the ranks　In accordance with the law repeatedly, until the round out all the people around you.