• Josephus problem

Josephus problem (suomeksi)

Määritelmät:

• (lb, en, math) A theoretical problem in which every ''n''th person, counting around a circle of people, is chosen for execution, and this process repeats after the removal of each chosen person, with the last person left being freed. The problem is to select one's position so as to be the last to be chosen.