@kunal patil ur right, i forgot to mention k=2. refer http://www.exploringbinary.com/powers-of-two-in-the-josephus-problem/
surender On Fri, Jul 22, 2011 at 7:21 PM, Kunal Patil <kp101...@gmail.com> wrote: > @surender: I assume you want to give general solution to Josephus problem > in which we shoot every kth person...In that case formula for pos must be: > pos = ( x*k )%n + (k-1) > > In current context, k=2...thus the formula which you gave also holds > true..but not when k != 2 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
