- Category:
- Other systems
- Tags:
-
- File Size:
- 37kb
- Update:
- 2017-12-09
- Downloads:
- 0 Times
- Uploaded by:
- 代阳
Description: The Joseph question is a classic question, and we might as well extend this classic problem into a two-way Joseph problem.
(as known n individuals respectively to number 1, 2, 3,..., n) sitting around a round table, the first k from a number of people from the beginning of 1 clockwise off, 1, 2, 3,..., the man down clockwise to the m, at the same time from number k people began to counterclockwise number, 1, 2, 3,..., m count, two people at the same time out. Then a column from the next person and from the beginning of 1 to the two two-way number, count m out at the same time,...;. This repeated until all of the people out around the table. Until there was only one person left around the round table.
If two back off m falls in the same person, the time out of only one person.
To Search:
File list (Check if you may need any files):
Download