| Display title | Josephus problem |
| Default sort key | Josephus problem |
| Page length (in bytes) | 23,438 |
| Namespace ID | 0 |
| Page ID | 183150 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Jworkorg (talk | contribs) |
| Date of page creation | 21:48, 6 February 2024 |
| Latest editor | Jworkorg (talk | contribs) |
| Date of latest edit | 21:48, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game. Such games are used to pick out a person from a group, e.g. eeny, meeny, miny, moe.
In the particular counting-out game that gives rise to the Josephus... |
