Functional iteration and the Josephus problem

DOI10.1017/S0017089500008272zbMath0751.05007MaRDI QIDQ3976908

Herbert S. Wilf, Andrew M. Odlyzko

Publication date: 25 June 1992

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Josephus problemfunctional iteration

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

Related Items (14)

Rational base number systems forp-adic numbers ⋮ A Number System with Base −32 ⋮ Disproof of a conjecture of Neumann-Lara ⋮ Rational self-affine tiles ⋮ On a Conjecture of Víctor Neumann-Lara ⋮ Binary subtrees with few labeled paths ⋮ An application of Fourier transforms on finite abelian groups to an enumeration arising from the Josephus problem ⋮ The feline Josephus problem ⋮ Representing real numbers in a generalized numeration system ⋮ Powers of rationals modulo 1 and rational base number systems ⋮ General solution to the spectator-first Tantalizer problem ⋮ Block Josephus Problem: When the reality is more cruel than the old story ⋮ Serial execution Josephus problem ⋮ Topology of acyclic complexes of tournaments and coloring

Cites Work

• Unnamed Item
• An O(n log m) algorithm for the Josephus Problem
• A New Relation Between Primitive Roots and Permutations

This page was built for publication: Functional iteration and the Josephus problem