JosephusCS Solve the Josephus Permutation problem.
Download

JosephusCS Ranking & Summary

JosephusCS Tags

problem solve optimization problem permutation sheet permutation list permutation template permutation solve flight problem color permutation crator matematical problem solve math problem problem-s permutation calculator permutation report calculate permutation cause of problem solve BITS problem solve problem permutation composer solve geometry problem solve linear problem solve algebra problem solve computational problem solve chemistry problem dilution problem solve network problem Fermi-Pasta-Ulam problem solve estimation problem solve trigonometry problem solve four color problem solve vector problem Boundary Value Problem keyword permutation keyphrase permutation

JosephusCS Description

From Harry J. Smith: JosephusCS is a program that solves the Josephus Permutation problem. Original Problem: 1000 slaves in a circle, numbered 1 to 1000, are all to be shot except one lucky survivor. The order of shooting is 1, 3, and 5, always alternating, and always immediately removing the fallen bodies. Once a body has fallen, it is no longer considered part of the circle for purposes of future counting and alternation. All of the source is included. This version is the first release on CNET Download.com. What's new in this version: This version is the first release on CNET Download.com.

JosephusCS Related Software