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.

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．