### Theory NO. 2: Josephus Problem

12Mar08

Problem: If you’ll eliminate every second person from the circle of $n$ people going clockwise, which one stays alive? (As first the second person dies)

Aswer: if $n=2^{n}+l$ then the person with number $2l +1$ stays alive. Equivalently it’s a one-bit-shift-left of number $n$ written binary

I will not write here the whole solution, thus it can be found in a great book “Concrete Mathematics. A foundation for Computer Science”