Josephus problem
mathematical counting-out question
Facts
3 properties- Instance of
- mathematical problem
- Defining formula
- g(n,k)=\begin{cases}(g(n-1,k)+k)\bmod n&n>1\\0&n=1\end{cases}
🏷️ Also known as
en Josephus problem
de Josephus-Permutation
de Josephusproblem
de Josephus Permutation
de Josephus-Problem
es Problema de Flavio Josefo
es El problema de Flavio Josefo
es permutación de Josefo
fa مسئله ژوزفوس
fa مسئلهٔ ژوزفوس
fa مساله ژوزفوس
fr Problème de Josèphe
fr Problème de Joséphus
he בעיית יוסיפוס
he בעיית יוספוס
it Problema di Giuseppe
ja ジョセファスの問題
ja ヨセフスの問題
ko 요세푸스 순열
ko 조세푸스 순열
🔖 Identifiers · 7
- Brilliant Wiki ID
- josephus-problem
- Freebase ID
- /m/05yqjv
- MathWorld ID
- JosephusProblem
- Microsoft Academic ID (discontinued)
- 14039904
- ProofWiki ID
- Definition:Josephus_Problem
- Rosetta Code page ID
- Josephus_problem
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Instance of 1
Maintained by WikiProject 1
Named after 1
Press Enter · cited answer in seconds
0 sources
Summary
Josephus problem is a mathematical problem[1].