Ads
related to: josephus problem examples pdf worksheet template excel editable download
Search results
Results From The WOW.Com Content Network
The problem is named after Flavius Josephus, a Jewish historian and leader who lived in the 1st century. According to Josephus's firsthand account of the siege of Yodfat, he and his 40 soldiers were trapped in a cave by Roman soldiers. They chose suicide over capture, and settled on a serial method of committing suicide by drawing lots.
Template documentation Editors can experiment in this template's sandbox ( create | mirror ) and testcases ( create ) pages. Add categories to the /doc subpage.
NP-complete special cases include the edge dominating set problem, i.e., the dominating set problem in line graphs. NP-complete variants include the connected dominating set problem and the maximum leaf spanning tree problem. [3]: ND2 Feedback vertex set [2] [3]: GT7 Feedback arc set [2] [3]: GT8 Graph coloring [2] [3]: GT4
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
Then it gives a proof that uses a different specific example ("we explicitly solve the problem when every second person will be killed"). But in no case does it actually give the answer. I believe the answer for the Josephus example of 41 participants and a step of three is that position 31 is the survivor and position 16 is the next-to-last.
Josephus problem table: Image title: Claude Gaspar Bachet de Méziriac's interpretation of the Josephus problem with 41 soldiers and a step size of 3, visualised by CMG Lee. Time progresses inwards along the spiral, green dots denoting live soldiers, grey dead soldiers, and crosses killings.