|
|
|
Josephus problem : Mathematics
|
There are n people standing in a circle waiting to be executed. After the first man is skipped, k − 2 people are skipped (skipping over k − 1 people set you over the k-th man) and the k-th man is executed. Then again, k − 1 people are skipped and the k-th man is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last man remains, who is given freedom.
The task is to choose the place in the initial circle so that you survive (are the last one remaining), given n and k.
created by syam1224 on 2008-05-04 03:58:33
|
|
|
|
Josephus Problem from Mathworld
Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in which you should stand in order to be the last survivor (Ball and Coxeter 1987).
http://mathworld.wolfram.com/JosephusProblem.html
created by syam1224 on 2008-05-04 04:00:10
|
|
Josephus problem from Wikipedia
The problem is named after Flavius Josephus, a Jewish historian living in the 1st century. As his own account goes, he and his 40 comrade soldiers were trapped in a cave, surrounded by Romans. They chose suicide over capture and decided that they would draw lots to determine who would kill whom. Josephus and one other man were the last remaining. Josephus convinced the other Jew that they should both surrender to the Romans rather than to kill themselves. Josephus attributed his survival to luck or to Providence, he knew not which
http://en.wikipedia.org/wiki/Josephus_problem
created by syam1224 on 2008-05-04 03:59:17
|
|
|
