The Josephus Problem
A group of m soldiers are surrounded by the enemy and there is only a single horse for escape.
The soldiers determine a pact to see who will escape and summon help.
The form a circle and pick a number n which is between 1 and m.
One of their names is also selected at random.