Recursionmedium
0:00.0

In a variation of the Josephus problem, nn people stand in a circle and every second person is eliminated until only one remains. Let J(n)J(n) be the position of the survivor. If J(2k+l)=2l+1J(2^k + l) = 2l + 1 for 0l<2k0 \leq l < 2^k, what is the value of J(41)J(41)?