People are standing in a [url=https://en.wikipedia.org/wiki/Circle]circle[/url] waiting to be executed. Counting begins at a specified point in the circle and proceeds around the circle in a specified direction. After a specified number of people are skipped, the next person is executed. The procedure is repeated with the remaining people, starting with the next person, going in the same direction and skipping the same number of people, until only one person remains, and is freed.[br][br]The problem — given the number of people, starting point, direction, and number to be skipped — is to choose the position in the initial circle to avoid execution. (Wikipedia)

If you want to hear more about a specific variation of the problem, watch this Numberphile video. Stop at around 50 seconds if you want to figure it out yourself!

Here's an applet that lets you change up the number of people and the number of people skipped each turn:

If you want to learn more about the problem... and some of the math behind it, check out its Wikipedia page:

Wikipedia Page: https://en.wikipedia.org/wiki/Josephus_problem[br]A Josephus Calculator: http://webspace.ship.edu/deensley/mathdl/Joseph.html