### Theory NO. 2: Josephus Problem

12Mar08

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

Aswer: if then the person with number stays alive. Equivalently it’s a one-bit-shift-left of number 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”

Filed under: Mathematics, Problems, Theory | Leave a Comment

Tags: flawiusz, josephus, probleme

## No Responses Yet to “Theory NO. 2: Josephus Problem”