On the generalized Josephus problem
Glasgow mathematical journal, Tome 14 (1973) no. 2, pp. 168-173
Voir la notice de l'article provenant de la source Cambridge University Press
The problem of Josephus and the forty Jewsis well known [1, 3]. In its most general form, this problem is equivalent to the problem of m-enumeration of a set, as described below.Define the ordered setWe choose and remove cyclically, from left to right, each with element of Zn until the set is exhausted. The chosen elements are ordered into a new ordered setwhich is therefore a permutation of Zn, obtained by what we call m-enumeration of theset Zn.
Jakóbczyk, F. On the generalized Josephus problem. Glasgow mathematical journal, Tome 14 (1973) no. 2, pp. 168-173. doi: 10.1017/S0017089500001919
@article{10_1017_S0017089500001919,
author = {Jak\'obczyk, F.},
title = {On the generalized {Josephus} problem},
journal = {Glasgow mathematical journal},
pages = {168--173},
year = {1973},
volume = {14},
number = {2},
doi = {10.1017/S0017089500001919},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500001919/}
}
[1] 1.Ahrens, W., Mathematische Unterhaltungen und Spiele (Leipzig, 1918), 118–169. Google Scholar
[2] 2.Rankin, R. A.(R. A. MacFhraing), Aireamh muinntir Fhinn is Dhubhain, agus sgeul Iosephuis is an da fhichead Iudhaich, Proc. Roy. Irish Acad.Sect. A. 52 (1948), 87–93. Google Scholar
[3] 3.Ball, W. W. Rouse and Coxeter, H. S. M., Mathematical recreations and essays (London, 1939),32–35. Google Scholar
Cité par Sources :