Josephus problem
mathematical counting-out question
Press Enter · cited answer in seconds
0 sources
Josephus problem
Summary
Josephus problem is a mathematical problem[1]. It ranks in the top 7% of mathematical_problem entities by monthly Wikipedia readership (527 views/month).[2]
Key Facts
- Josephus problem's instance of is recorded as mathematical problem[3].
- Josephus is named after Josephus problem[4].
- Josephus problem's Freebase ID is recorded as /m/05yqjv[5].
- Josephus problem's Stack Exchange tag is recorded as https://stackoverflow.com/tags/josephus[6].
- Josephus problem's defining formula is recorded as g(n,k)=\begin{cases}(g(n-1,k)+k)\bmod n&n>1\0&n=1\end{cases}[7].
- Josephus problem's MathWorld ID is recorded as JosephusProblem[8].
- Josephus problem's Rosetta Code page ID is recorded as Josephus_problem[9].
- Josephus problem's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- Josephus problem's Microsoft Academic ID is recorded as 14039904[11].
- Josephus problem's Brilliant Wiki ID is recorded as josephus-problem[12].
- Josephus problem's ProofWiki ID is recorded as Definition:Josephus_Problem[13].
Why It Matters
Josephus problem ranks in the top 7% of mathematical_problem entities by monthly Wikipedia readership (527 views/month).[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.[14] It is known by 14 alternative names across languages and contexts.[15]