Corpus ID: 18319440

Generilizations of the Josephus problem

@inproceedings{ThriaultGenerilizationsOT,
  title={Generilizations of the Josephus problem},
  author={N. Th{\'e}riault}
}
This article presents two algorithmic solutions to an extended version of the Josephus problem. In addition, the number of steps required for one of these algorithms is discussed. Finally, a variation on the Josephus problem and an algorithmic solution to this new problem are also given. 

References

SHOWING 1-7 OF 7 REFERENCES
Functional iteration and the Josephus problem
The problem of Josephus is the following. We are given two positive integers n, q. There are n places arranged around a circle, and numbered clockwise 1, 2, …, n. Each of n people takes one of theExpand
Mathematical Recreations and Essays
THIS edition differs from the third by containing chapters on the history of the mathematical tripos at Cambridge, Mersenne's numbers, and cryptography and ciphers, besides descriptions of someExpand
Collected Scientific Papers
THESE papers make a stately volume of considerably more than 700 pages, and our thanks are due to the editors, Mr. Guy Barlow and Dr. Shakespear, for the ability with which they have performed theirExpand
Das problem der Abzählreime und Zahlentwicklungen mit gebrochenen basen
Vorgegeben seien die Zahlen 1, 2,..., n im Kreis angeordnet, d.h. ein “nKreis.” Beginnen wir nun bei 1 zu zahlen streichen, die k-te, 2k-te, 3k-te Zahl usw. und setzen diesen Zahlund StreichprozebExpand
Observationes circa novum et singulare progressionum genus
  • Opera Omnia Series Prima, Opera Mathematica 7, pp. 246-261
  • 1923
Observationes circa novum et singulare progressionum genus, Opera Omnia Series Prima, Opera Mathematica 7
  • Observationes circa novum et singulare progressionum genus, Opera Omnia Series Prima, Opera Mathematica 7
  • 1923