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”



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

  1. Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: