Dear Sir:I was so happy to find this site. It's really cool, and I really needed the algorithm for m=2 in the Josephus recursion problem.
It states that you are addressing m=2 in the simple solution, and the graphics appear to support this, but the data and the algorithm support m=1. I'm a little confused.
Am I correct?
I apologize if not.
Katherine