Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For example, there are 10 people sitting there.

So the 1st round, such people leave: $$\#1, \#3, \#5, \#7, \#9$$ and remains $$\#2, \#4, \#6, \#8, \#10$$

Then the 2nd round, such people leave: $$\#2, \#6, \#10$$ and remains $$\#4, \#8$$

Then the 3rd round, such people leave: $$\#8$$ and remains $$\#4$$

so the last one remained is #4.

If we note f(10)=4, how to get a general formula for f(N)?

share|cite|improve this question
3  
For a more general problem of the same kind, please see the Josephus Problem. – André Nicolas Sep 26 '13 at 7:23
    
so there's no close form for the general case $k!=2$? – athos Sep 26 '13 at 7:29
1  
None that I know. There is one for $k=2$. – André Nicolas Sep 26 '13 at 7:32
    
got it, thanks! :) – athos Sep 26 '13 at 8:44

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.