Concern a variant of the Josephus Problem in which every second person is eliminated. We assume that n people are arranged in a circle and numbered 1,2.....n clockwise. Then, proceeding clockwise, 2 is eliminated, 4 is eliminated, and so on, until there is one survivor, denoted J(n).
Compute J(6).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.