2.01 PAD Creator version: 2.0.0 available for FREE at http://www.padcreator.com Portable Application Description, or PAD for short, is a data set that is used by shareware authors to disseminate information to anyone interested in their software products. To find out more go to http://www.asp-shareware.org/pad Harry J. Smith 19629 Via Monte Dr. Saratoga CA 95070-4522 United States http://harry-j-smith.com/hjsmithh/ Harry Smith hjsmithh@sbcglobal.net Harry Smith hjsmithh@sbcglobal.net hjsmithh@sbcglobal.net 1-408-741-0406 JosephusCS 2.1.1 07 08 2008 Freeware New Release Install and Uninstall Win95,Win98,WinME,WinNT 3.x,WinNT 4.x,WinXP,Windows2000,Windows2003 English Added new functions and features Education Education::Mathematics Mathematics May need to install .NET Framework Package for C# N N N Joseph21.exe Joseph21.exe Joseph.exe JosephusCS21a.exe 1025800 1002 0.98 N Math, Flavius Josephus, Permutation, Cyclic notation, Graphics The Flavius Josephus Permutation Program JosephusCS is a program that solves the Josephus Permutation problem. JosephusCS is a program that solves the Josephus Permutation problem. Can compute and plot the Josephus Permutations 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, 5, etc., 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. 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, 5, etc., 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. Example, n=6: Shoot 1,3,5,2,6; 4 survives. The General Problem: There is an ordered set of n objects arranged in a circle with object i (n >= i >= 1) in position i. All n objects are selected and removed in a certain order and placed in a new circle with the new position number k beings the order of selection. Object f is selected first. After each selection, m minus 1 of the remaining objects following the one removed are skipped and the next object is then selected. We are interested in the nature of the permutation generated by this process, its fixed elements, and in particular the original position L of the last object selected. Note that m and f can be as low as 1 and can be larger than n. n = The number of objects in the circle f = index of first object to be selected [1, n] m = difference in index of items selected, m = 2 => every other All of the source is included in the distributed file. Please let me know what you think about this program. -Harry hjsmithh@sbcglobal.net http://harry-j-smith.com/hjsmithh/Josephus/index.html http://harry-j-smith.com/hjsmithh/Josephus/JosephusCSScreenShot.gif http://harry-j-smith.com/hjsmithh/josephuscs.xml http://harry-j-smith.com/hjsmithh/JosephusCS21a.exe You may include JosephusCS on any CD compilation. You may not sell JosephusCS, it is FREEWARE! GNU GENERAL PUBLIC LICENSE 1991 Free Software Foundation, Inc. 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.