For the Josephus problem,
a. compute J (n) for n = 1, 2, . . . , 15.
b. discern a pattern in the solutions for the first fifteen values of n and prove its general validity.
c. prove the validity of getting J (n) by a 1-bit cyclic shift left of the binary representation of n.
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.