The feline Josephus problem
DOI10.1007/S00224-011-9343-6zbMATH Open1254.68183OpenAlexW2179209375MaRDI QIDQ692937FDOQ692937
Authors: Frank Ruskey, Aaron Williams
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9343-6
Recommendations
Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Congruences; primitive roots; residue systems (11A07) Other combinatorial number theory (11B75) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Functional iteration and the Josephus problem
- The roots of combinatorics
- The Josephus problem
- Generalizations of the Josephus problem
- Title not available (Why is that?)
- An O(n log m) algorithm for the Josephus Problem
- Title not available (Why is that?)
- On the generalized Josephus problem
Cited In (5)
Uses Software
This page was built for publication: The feline Josephus problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692937)