Description: Josephus problem with the definition is as follows : Suppose n player formed a ring. Given a positive integer m, from a designated first started along the Central Counting that every individual section m let out their series and counting continued. This process has been to all of them from far out. Finally out from all the winners. Everyone out in the order shown in the definition of integers 1, 2 ,..., n an order. This arrangement known as a (n, m) Josephus arranged. For example, (7,3) Josephus order of 3, 6,2,7,5,1,4. For a given set of 1,2, ... n and k the number, Josephus would like to know whether there is a positive integer m (n, m) Josephus with the final number k prior to the designated number k this.
File list (Check if you may need any files):
Download