Skip to search formSkip to main contentSkip to account menu

Josephus problem

Known as: Josephan count, Josephus permutation 
In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Image encryption is an efficient visual technology to protect private images. This paper develops an image encryption algorithm… 
Review
2016
Review
2016
This thesis presents an edition of the first five books of Josephus Scottus's eighteen-book Abbreviatio commentarii S. Hieronymi… 
2011
2011
AbstractIn the classic Josephus problem, elements 1,2,…,n are placed in order around a circle and a skip value k is chosen. The… 
2010
2010
One of the most prevalent features in John Chrysostom’s writings is his numerous portrayals of exemplar figures. In this thesis… 
2007
2007
. In this paper we will study an alternative row version of Josephus problem. Suppose that nnumbers 1, 2, $\cdot$ . . , $n$ are… 
2002
2002
In this paper a brief introduction is presented to the nature and different types of mathematical visualization. Then we shall… 
1997
1997
We give explicit non-recursive formulas to compute the Josephus-numbers j(n; 2; i) and j(n; 3; i) and explicit upper and lower… 
1991
1991
The problem of Josephus is the following. We are given two positive integers n, q. There are n places arranged around a circle… 
1973
1973