The problem of Josephus is the following. We are given two positive integers n, q. There are n places arranged around a circle, and numbered clockwise 1, 2, …, n. Each of n people takes one of the places, then (please excuse this, but we didn't invent the problem!) every qth one is executed, until just one remains. More precisely, the occupant of place q is ‘removed’ first, and in general, if some place j has just been vacated, then the qth one of the places clockwise around from j that are still occupied will be vacated next. One question is this: if you would like to be the last survivor, then into what place should you go initially? We denote the answer to this question by Jq(n). For example, if n = 5 and q = 2, the order of execution is 2, 4, 1, 5, 3, and J2(5) = 3. Other questions have been raised about the problem, and it has an extensive literature (see –). In this paper we deal with the Jq(n)'s.