Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The feline Josephus problem

From MaRDI portal
Publication:692937
Jump to:navigation, search

DOI10.1007/s00224-011-9343-6zbMath1254.68183OpenAlexW2179209375MaRDI QIDQ692937

Aaron Williams, Frank Ruskey

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


zbMATH Keywords

Chinese remainder theoremFibonacci numberBertrand's postulateJosephus problem


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Other combinatorial number theory (11B75) Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)


Related Items

Block Josephus Problem: When the reality is more cruel than the old story ⋮ Serial execution Josephus problem


Uses Software

  • OEIS


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The roots of combinatorics
  • The Josephus problem
  • An O(n log m) algorithm for the Josephus Problem
  • Functional iteration and the Josephus problem
  • On the generalized Josephus problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:692937&oldid=12597112"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki