On a sequence related to the Josephus problem

2003/05/25 by Ralf Stephan, R. Stephan, Stephan, R. · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Mathematical Theories #Coding theory and cryptography #graph theory and CDMA systems #math.CO #math.NT #msc:11B37 #msc:11N45

paper · pdf · doi:10.48550/arxiv.math/0305348

2 pages, no figures; added ref, dates

arxiv created 2003/05/25 · arxiv updated 2009/11/30

Abstract

In this short note, we show that an integer sequence defined on the minimum of differences between divisor complements of its partial products is connected with the Josephus problem (q=3).

Cited by

• Representing Real Numbers in a Generalized Numeration Systems

Related

• Fixed Points of the Josephus Function via Fractional Base Expansions
• On the Recurrence Formula for Fixed Points of the Josephus Function
• Maximum Nim and Josephus Problem
• Analytical Study and Efficient Evaluation of the Josephus Function
• Maximum Nim and Josephus Problem algorithm