^{1}

^{*}

^{1}

^{1}

^{*}

We define and study the Extended Feline Josephus Game, a game in which
*n* players, each with
* ℓ* lives, stand in a circle. The game proceeds by alternating between hitting
*k* consecutive players—each of whom will consequently lose a life—and skipping
*s* consecutive players. This cycle continues until every player except one loses all of their lives. Given the nonnegative integer parameters
*n*,
*k*,
*s* and
*ℓ*, the goal of the game is to identify the surviving player. In this paper, we show how the defining parameters
*n*,
*k*,
*s*, and
*ℓ *affect the survivor of games with specific constraints on those parameters and our main results provide new closed formulas to determine the survivor of these Extended Feline Josephus Games. Moreover, for cases where these formulas do not apply, we provide recursive formulas for reducing the initial game to other games with smaller parameter values. For the interested reader, we present a variety of directions for future work in this area, including an extension which considers players lying on a general graph, rather than on a circle.

The origins of the Josephus problem and its corresponding game can be traced back to 1st century AD. Named after Jewish historian and military commander, Flavius Josephus, the game is based on his accounts of the Siege of Jotapata. Long into the siege, Josephus and 40 of his soldiers were cornered into a cave surrounded by Roman soldiers. Rather than face capture at the hands of the enemy, Josephus convinced his men to choose suicide by means of a game of “chance”. He and his men would stand in a circle. Then starting at a particular person, each would kill the neighbor to his left. Allegedly, predicting the outcome of the game, Josephus and one other man remained until the final round of the game, at which point the two decided to surrender to the Roman forces [

This historical account led mathematicians to define and study variations of the counting-out game, named the Josephus Game, which is described as follows: Given an ordered set of n players standing in a circle, the game begins by determining an initial player from which we alternate between skipping and killing a player in a clockwise direction. The Josephus Problem is to identify the position of the surviving player in this game. Although the problem has been solved in various ways [

Two of these generalizations are the Generalized Josephus Game, a variant that allows the number of consecutively skipped players to equal some fixed positive integer [

In this work, we introduce the Extended Feline Josephus Game with the goal of identifying the survivor when the number of players, consecutive hits, consecutive skips, and initial lives, are greater than or equal to 1. We remark that this new variant recovers the Feline variant when setting the hit parameter to 1, the Feline Texas Chainsaw variant when setting the skip parameter to 1, the Texas Chainsaw variant when setting both the skip and lives parameters to 1, and the original Josephus Game when setting the hit, skip, and lives parameters to 1. Thus the Extended Feline Josephus Game we present provides a generalization to much of the previous work in this area.

The main results in this paper determine closed formulas and recurrence relations for the survivor of an Extended Feline Josephus Game when the defining parameters satisfy certain relations. In what follows, we let J ( n , k , s , l ) K / S denote the surviving player of the Extended Josephus Game given n people, k hits, s skips, ℓ lives, and where the subscript denotes whether the game begins by hitting or skipping first. If both of the subscripts K and S are present, this means that the result works for each of these cases. Lastly, we remark that our games always label players 0 through n and they begin at player 0.

Our first main result presents the case where l = 1 and provides closed formulas to determine the survivor of the games considered.

Main Theorem 1. Let n , k , s ∈ ℕ : = { 1 , 2 , 3 , ⋯ } and l = 1 .

1) If n = a ( k + s s ) b + k m and s | k , the

J ( n , k , s , 1 ) S = ( ( k + s mod n ) + ( s − 1 mod ( n − k ) ) if k < n < k + s ( k + s ) m + s − 1 mod n if n ≤ k or n ≥ k + s .

2) If n = a ( k + s ) b + k m and ( k + s ) m < n ≤ k ( m + 1 ) , then

J ( n , k , s , 1 ) S = ( k + s ) m + s − 1 mod n .

Our second main result considers the case where l ≥ 1 and provides recursive formulas to determine the survivor of the games considered.

Main Theorem 2. Let n , k , s , l ∈ ℕ .

1) If gcd ( n , k + s ) = 1 and l > k , such that l ′ ≡ l mod k and l ′ > 0 , then

J ( n , k , s , l ) K / S = J ( n , k , s , l ′ ) K / S .

2) If n | s and k | n , then

J ( n , k , s , l ) K / S = J ( n , k , s ,1 ) K / S .

3) If n | ( k + s ) and ⌈ k n ⌉ | l where a = k mod n , then

J ( n , k , s , l ) S = J ( s mod n , k , s , l − ( k − a ) l n ⌈ k n ⌉ ) S .

4) If n = a ( k + s ) , where a ∈ ℕ , then

J ( n , k , s , l ) S = ( k + s ) ⌊ J ( a s , k , s , l ) S s ⌋ + ( J ( a s , k , s , l ) S mod s ) .

5) Let a = gcd ( n , k , s ) , then

J ( n , k , s , l ) K / S = a ⋅ J ( n a , k a , s a , l ) K / S + a − 1.

The paper is organized as follows. In Section 2, we give the necessary background and notation to concretely define the Extended Feline Josephus Game. In Section 3, we consider explicit solutions for games where the lives parameter is 1, and present a proof of Main Theorem 1. In Section 4, we consider closed formulas to games where the lives parameter varies. In Section 5, we consider recursive solutions for reducing games to other games with smaller defining parameters thereby establishing Main Theorem 2. Lastly, Section 6 communicates ideas and areas for future work.

To understand the Extended Feline Josephus Game, we begin by defining the variables and notations used to describe the layout for any particular game. We label the n players 0 through n − 1 . As stated before, each player has l lives at the beginning of the game. Each time a player is hit, their number of lives decreases by 1, and a player is removed from the game once their number of lives reaches 0. In these games, k consecutive players are hit in a row, and then s consecutive players are skipped. The last variable, p, denotes the player whom the game begins with. Whether the game starts by skipping or by killing players first is referred to as either a skip-first or kill-first game, and this is denoted through the use of subscripts S or K, respectively. Thus for a specific game ( n , k , s , l , p ) K / S , the surviving player is denoted as J ( n , k , s , l , p ) K / S .

We also define a round as one set of k hits and s skips (or vice versa) and a cycle as a traversal through all (remaining) players in a game regardless of whether the action on any specific player is a hit or a skip.

We illustrate these definitions through the following example^{1}.

Example 1. We want to determine the survivor of a kill-first game where n = 10 , k = 3 , s = 3 , l = 2 , and p = 0 . We run through the game in

The following remark and result demonstrate that any game can be translated into another with a different starting player or to a kill-first/skip-first order while preserving the final position of the survivor.

Remark 1. Notice that J ( n , k , s , l , p ) K / S = ( J ( n , k , s , l , 0 ) K / S + p ) mod n since the results of any game starting at player p can be shifted back by the same amount to recover the results starting at player 0.

Lemma 1. If p ′ = ( p + s ) mod n , then J ( n , k , s , l , p ) S = J ( n , k , s , l , p ′ ) K .

Proof. Let A be a skip-first game where the survivor is J ( n , k , s , l , p ) S , and let B be a kill-first game where the survivor is J ( n , k , s , l , p ′ ) K . Game A begins at player p and initially skips s players. Game A now proceeds to hit or kill k people starting at the player in position ( p + s ) mod n . Since the number of lives of all the players have not changed after the initial skips, at this point in the game, the games A and B are equivalent and will have the same surviving player. □

As a result of Remark 1, all following results utilize games beginning at player 0. Therefore, for the sake of simplicity, from now on we denote the survivor of the game as J ( n , k , s , l ) K / S , eliminating the need for the p parameter. Also, the use of kill-first or skip-first games in describing specific results depending on which is more intuitive to understand.

We begin our analysis by establishing results for the Extended Feline Josephus Game in cases where l = 1 . We will use these results to extend to more general cases where l ≥ 1 . The following result provides an initial identification of the survivor of a game under these parameters.

Proposition 1. If n ≤ k , then J ( n , k , s , 1 ) K = n − 1 .

Proof. Since n ≤ k , the life of every player is decreased by 1 in the first round. Since l = 1 , each player’s life is decreased to 0, and each player is removed from the game. Therefore, the survivor is the last player to be removed, player n − 1 . □

Note that if the players only have one life, the more interesting games are where there are less players killed at a time than there are players total. The following results consider such cases.

Proposition 2. If n = k + s and k ≥ s , then J ( k + s , k , s , 1 ) K = n − 1 .

Proof. Consider a kill-first game where n = k + s . At the end of the first round, players 0 through k − 1 are eliminated, and players k through n − 1 are skipped. A total of s players remain. The second round begins with the player k. Since k ≥ s , the number of kills is greater than the number of players remaining. Therefore, by Proposition 1, the last player is the survivor, player n − 1 . □

Proposition 3. If n ≠ k + s and ⌈ n 2 ⌉ ≤ k < n , such that s ≡ a mod ( n − k ) , then

J ( n , k , s ,1 ) K = k + a − 1 mod n .

Proof. Consider the case where n ≠ k + s . In the first round, players 0 through k − 1 are removed. Players k through n − 1 remain, with a total of n − k players left. We then shift the positions of each player back by k, such that the player at position k is now at position 0, and generally the player at position x is now at position x − k . Therefore, the position of the last player skipped in the round, of the remaining players, is given by a − 1 where s ≡ a mod ( n − k ) . We then shift the players positions forward by k to return to the original game layout. Thus, at the end of the first round, the last player skipped is at position k + a − 1 mod n . Since ⌈ n 2 ⌉ ≤ k < n , the number of remaining players is strictly less than half of the initial number of players at the beginning of the game and thus less than or equal to k. By Proposition 1, the second round proceeds by removing all the remaining players starting at the player k + a mod n and ending at position k + a − 1 mod n . Therefore, the survivor is player k + a − 1 mod n . □

Having established the prior results, we now use a proof technique similar to that of Sullivan, Beatty, and Insko’s for the Texas Chainsaw Josephus Problem [

Theorem 3. If n = a ( k + s s ) b + k m and s | k , then

J ( n , k , s , 1 ) S = ( ( k + s mod n ) + ( s − 1 mod ( n − k ) ) if k < n < k + s ( k + s ) m + s − 1 mod n if n ≤ k or n ≥ k + s

where n ≡ a mod k , b is as large as possible, m ∈ ℤ ≥ 0 , and ( k + s ) | a ( k + s s ) b if k + s ≤ a ( k + s s ) b .

Proof. The proof consists of three cases based on the value of n. We first consider case 1 where n ≤ k . Note that a ≡ n , so b = 0 and m = 0 . Thus by Proposition 1 and Lemma 1, the survivor is player ( s − 1 ) mod n .

Next, we consider case 2 where n > k and n = a ( k + s s ) b . Therefore, b > 0 and m = 0 . If n = k + s , then by Proposition 2 and Lemma 1, the survivor is player ( s − 1 ) mod n . If n < k + s , then since s | k , we know that k ≥ s , n < 2 k , and thus ⌈ n 2 ⌉ ≤ k . Therefore by Proposition 3 and Lemma 1, the survivor is player ( k + s mod n ) + ( s − 1 mod ( n − k ) ) . Lastly, if n > k + s , since ( k + s ) | n , we know that there are exactly n k + s rounds in a cycle through all of the players. Since in each round, we skip s out of the k + s players in the round, it follows that at the end of the first cycle, there are

s ( n k + s ) = a ( k + s s ) b ( s k + s ) = a ( k + s s ) b − 1

players remaining, the next round starting at player 0. Similarly, after a total of b cycles, there are only a players remaining since b is reduced to 0. Note that in each cycle, players 0 through s − 1 are skipped and are thus part of the remaining a players. Since a ≤ k , and the next round starts at player 0, this case reduces back to case 1. Thus, the survivor is player ( s − 1 ) mod n .

Finally, we consider case 3 where n > k and n = a ( k + s s ) b + k m . Thus b ≥ 0 and m > 0 . We use induction to establish the result for n ≥ k . The base cases are shown in cases 1 and 2. In the general case, after the first round, players 0 through s − 1 are skipped and players s through k + s − 1 are killed. Note that players k + s through k + 2 s − 1 are the next to be skipped, so we shift all of the currently living players’ positions back by k + s . Thus player k + s is now at position 0 and player 0 is now at position n − k − s . Note that there are now n − k players. Since n − k ≡ a mod k , we have

n − k = a ( k + s s ) b + k m − k = a ( k + s s ) b + k ( m − 1 )

keeping b and m fixed. By induction,

J ( n − k , k , s ,1 ) S = ( k + s ) ( m − 1 ) + s − 1 mod n .

By shifting the positions forward to their original indices, we get

J ( n , k , s ,1 ) S = ( k + s ) m + s − 1 mod n ,

the desired solution. Note that this process of shifting positions occurs m times, reducing m to 0 and reducing back to case 2 beginning at player ( k + s ) m mod n . □

We illustrate Theorem 3 with the following.

Example 2. We want to know the survivor of a skip-first game where n = 485 , k = 12 , s = 3 , and l = 1 . Since n > k + s , we first calculate that 485 ≡ a mod 12 , which implies that a = 5 . The largest value of b such that 485 − 5 ( 12 + 3 3 ) b ≥ 0 is 2. It follows that m = 485 − 5 ( 5 ) 2 12 = 30 . Thus

J ( 485 , 12 , 3 , 1 ) = ( 12 + 3 ) 30 + 3 − 1 = 452.

while Theorem 3 places strong restrictions on the parameters n, k, and s, the following results introduces a solution which loosens some of these requirements and establishes Main Theorem 1 Part 2.

Theorem 4. If n = a ( k + s ) b + k m and ( k + s ) m < n ≤ k ( m + 1 ) , then

J ( n , k , s ,1 ) S = ( k + s ) m + s − 1 mod n

where n ≡ a mod k , b is as large as possible, and m ∈ ℤ ≥ 0 .

Proof. Similar to Theorem 3, the proof consists of 3 cases based on the value of n. We first consider case 1 where n ≤ k . This parallels case 1 from Theorem 3. Thus the survivor is player ( s − 1 ) mod n . Next, we consider case 2 where n = a ( k + s ) b . Thus b ≥ 0 and m = 0 . Note that ( k + s ) m < n ≤ k ( m + 1 ) implies that n ≤ k , so this case reduces back to case 1 beginning at player 0. Thus the survivor is player ( s − 1 ) mod n . For the last case, we consider where n = a ( k + s ) b + k m , with m ≥ 1 . The proof is similar to that of case 3 in Theorem 3, so we omit it. □

In order to find the surviving player in games where l ≥ 1 , we first consider closed formulas of special cases with respect to n.

Proposition 4. If n l ≤ k , then J ( n , k , s , l ) K = n − 1 .

Proof. Since n l ≤ k , the lives of every player is decreased to 0 in the first round, removing every player. The survivor is player n − 1 , the last to be removed. □

Similarly to Proposition 1, the more interesting cases are where n l > k , which the following formulas explore. The results are derived from attempts to find solutions to the cases where n = k and n = s , respectively.

Proposition 5. If n | k , then J ( n , k , s , l ) S = s ⌈ n l k ⌉ − 1 mod n .

Proof. In the first round, since n | k , all n players have lost k n lives. The round ends on player k + s − 1 mod n , which simplifies to s − 1 mod n . The game continues but now starting at player s mod n . Thus with each round i, the player ending the round is player s i − 1 mod n and all players have lost a total of k n i lives. Therefore after round l ( k n ) , all players have lost their lives, and the last player skipped in the previous round is player s ⌈ n l k ⌉ − 1 mod n , the survivor. □

Proposition 6. If n | s and k ≥ n , then

J ( n , k , s , l ) K / S = ( ( s mod ( n l − a ) + a − 1 ) mod n if n ( l − 1 ) < a < n l n − 1 if a ≤ n ( l − 1 ) or a = n l

where a = ⌊ n l k ⌋ k .

Proof. Since n | s , by Lemma 1, the surviving player of a skip-first game of this form is the same as its kill-first counterpart. It suffices to only consider the skip-first game.

We first look at the case where a = n l . Since a = n l , we know that k | n l and that n l k is an integer. It follows that n l k is the total number rounds in the game, and since s is a multiple of n, every player is hit in order and thus also removed in order in the last round. Therefore, the survivor is player n − 1 .

For all other cases, it must be that k | n l . Note that n l k is thus not an integer, so ⌊ n l k ⌋ is the number of rounds needed for at least one but not all players to be removed. It follows that ⌊ n l k ⌋ k is the total number of lives lost after those rounds. Since n | s , all n players are initially skipped in the first round before the k hits. At the end of the round, since k ≥ n , all players have lost at least 1 life. The new round starts on player k + s mod n which simplifies to k mod n . Thus, players are being hit in order. Since this pattern can only continue while there are all n players, after ⌊ n l k ⌋ rounds, the pattern ends on the player at position ⌊ n l k ⌋ k − 1 mod n , denoted as a − 1 mod n . Note that at this point in the game, there are n l − a players left, which we know is a nonzero amount. Since a lives have also been removed at this point, we know that there are n l − a < k players remaining. Thus, by Proposition 4, the player at the end of the next round of skips is the survivor, player ( s mod ( n l − a ) + a − 1 ) mod n .

However, if a ≤ n ( l − 1 ) , it must be the case that after ⌊ n l k ⌋ rounds, there are still at least n lives, so all players must still be in the game with at least 1 life each. Since after ⌊ n l k ⌋ rounds, it must be that there are n l − a players remaining. it must be the case that k > n l thus ⌊ n l k ⌋ = 0 and a = 0 ≤ n ( l − 1 ) . Since k > n l , by Proposition 4, the survivor is at position n − 1 . □

To better illustrate the proof of Proposition 6, we provide the following.

Example 3. We want to know the survivor of a skip-first game where n = 5 , k = 6 , s = 5 , and l = 3 . We run the game in

Using Proposition 6, we calculate that n l = 15 , n ( l − 1 ) = 10 , and a = ⌊ 5 × 3 6 ⌋ 6 = 12 . Note that after ⌊ 5 × 3 6 ⌋ = 2 rounds, the first two players are removed, the next round starting on player 2. Since 10 < a < 15 , then

J ( 5 , 6 , 5 , 3 ) S = ( 5 mod ( 15 − 12 ) + 12 − 1 ) mod 5 = 3.

If the problem does not fall into one of the cases where there is a known closed formula for identifying the survivor, the best alternative is to reduce the amount of time it takes to identify the survivor iteratively. We do this by reducing the parameters involved with a particular game.

Note that for certain games where parameters n, k, and s are fixed, we see a repeating sequence of numbers for the survivor as ℓ increases. In order to more clearly illustrate, we define an step as any act occurring in the game, whether it be a skip, hit, or kill. Additionally we define a reset as a point in a game where after a number of rounds, the next round begins at the initial player, and every player in the game has had their lives decreased by the same amount. The game has effectively been simplified to a game starting at the same player with the same layout, only with fewer lives.

Example 4. Given a kill-first game where n = 5 , k = 2 , s = 2 , and ℓ is sufficiently large, resets happen after the lives of all players are decreased by 2. Specifically, this game resets after 5 rounds (or 4 cycles). We run the game in

The following results provide insight into what constraints need to be satisfied to reduce the value of ℓ and specify how small the lives parameter can be reduced to while keeping the rest of the game’s parameters fixed. The results that follow establish each part of Main Theorem 2 individually.

Theorem 5. If gcd ( n , k + s ) = 1 and l > k , such that l ′ ≡ l mod k and l ′ > 0 , then

J ( n , k , s , l ) K / S = J ( n , k , s , l ′ ) K / S .

Proof. Since gcd ( n , k + s ) = 1 , the number of steps until a reset is n ( k + s ) . Therefore, there are k + s cycles until a reset. Using ( [

While Theorem 5 reduces ℓ, we are particularly interested in solutions which would reduce ℓ to one, so that we can utilize the results from Section 3. The following result provides such a solution, establishing Part 2 of Main Theorem 2.

Theorem 6. If n | s and k | n , then J ( n , k , s , l ) K / S = J ( n , k , s , 1 ) K / S .

Proof. Since n | s , by Lemma 1, the surviving player of a skip-first game of this form is the same as its kill-first counterpart. In each round, the skip of s players starts the next round at the same point as where the last hit left off. Thus, the immediate next group of k players get their lives reduced by one. Since k | n , after n k rounds, the game resets with every player’s life reduced by 1. This continues until the game resets with every player’s life reduced to 1. □

The following results, establishing Parts 3 and 4 of Main Theorem 2, focus on reducing n as opposed to ℓ.

Theorem 7. If n | ( k + s ) and ⌈ k n ⌉ | l , then

J ( n , k , s , l ) S = J ( s mod n , k , s , l − ( k − a ) l n ⌈ k n ⌉ ) S

where a = k mod n .

Proof. Since n | ( k + s ) , it follows that until a player is removed from the game, each round starts at player 0. For the first round, the skipping ends with player s − 1 mod n . Then, the next k players are hit, ending on player n − 1 . Note that players 0 through s − 1 mod n are hit k − a n times each, and players s through n − 1 are hit k − a n + 1 times each, which simplifies to ⌈ k n ⌉ . Thus, after l ⌈ k n ⌉ rounds, players s mod n through n − 1 are removed, leaving players 0 through s − 1 remaining. The next round starts at player 0. Note that the surviving players have lost k − a n ⋅ l ⌈ k n ⌉ lives each, and the survivor of the game is now J ( s mod n , k , s , l − k − a n ⋅ l ⌈ k n ⌉ ) S . □

Example 5. We want to know the survivor of a skip-first game where n = 11 , k = 6 , s = 5 , and l = 3 . We run the game in

Corollary 1. If n = k + s and k ≥ s , then

J ( n , k , s , l ) S = ( ( s mod ( s l − a ) + a − 1 ) mod s if s ( l − 1 ) < a < s l s − 1 if a ≤ s ( l − 1 ) or a = s l

where a = ⌊ s l k ⌋ k .

Proof. Since n | ( k + s ) and ⌈ k n ⌉ | l trivially, by Theorem 7,

J ( k + s , k , s , l ) S = J ( s , k , s , l ) S .

Note that the layout of the game now has s players. Since k ≥ s , by Proposition 6, the survivor is the same. □

Example 6. We want to know the survivor of a skip-first game where n = 11 , k = 6 , s = 5 , and l = 3 . Doing so will require the use of Example 3. We run the game in

Theorem 8. If n = a ( k + s ) , where a ∈ ℕ , then

J ( n , k , s , l ) S = ( k + s ) ⌊ J ( a s , k , s , l ) S s ⌋ + ( J ( a s , k , s , l ) S mod s ) .

Proof. Note that in the first round, we skip players 0 through s − 1 and

reduce the lives of players s through k + s − 1 players. The next round begins on player k + s . Since a = n k + s , it follows that it takes a rounds to complete a cycle while no players have been removed. Note that after a rounds, the players i ( k + s ) through i ( k + s ) + s − 1 where 0 ≤ i < a have all been skipped and the players i ( k + s ) + s through ( i + 1 ) ( k + s ) − 1 have had their lives decreased by 1. Thus, after ℓ cycles, these players have been removed, leaving as players remaining. Note that this method of removal has segmented the remaining players into groupings of s players distance k apart from another neighboring grouping. Therefore the survivor of the initial game is contained within the players of this now smaller game. Assuming we know the position of the survivor in the smaller game, denoted J ( a s , k , s , l ) S , we derive which grouping of players J ( a s , k , s , l ) belongs to in the initial game by ( k + s ) ⌊ J ( a s , k , s , l ) s ⌋ . We also derive the position for which J ( a s , k , s , l ) stands within its grouping of players by J ( a s , k , s , l ) mod s . Thus, the survivor of the initial game is player

( k + s ) ⌊ J ( a s , k , s , l ) S s ⌋ + ( J ( a s , k , s , l ) S mod s ) .

The following example illustrates the proof of Theorem 8. □

Example 7. We want to know the survivor of the skip-first game with n = 15 , k = 2 , s = 3 , and l = 2 . We run the example in

Using Theorem 8, we calculate that a = 3 and find that J ( 3 × 3 , 2 , 3 , 2 ) S = 7 . Therefore

J ( 15 , 2 , 3 , 2 ) S = ( 2 + 3 ) ⌊ 7 3 ⌋ + ( 7 mod 3 ) = 11.

Note that while k and s are fixed parameters, there values can still be reduced. In particular, their values can be reduced as long as they retain the same proportions relative to n. The following result, offers an equation to recover the initial game’s survivor using this method of reduction. This is also the content of Part 5 of Main Theorem 2.

Theorem 9. If a = gcd ( n , k , s ) , then

J ( n , k , s , l ) K / S = a ⋅ J ( n a , k a , s a , l ) K / S + a − 1.

Proof. The proof consists of two cases based on the value of a. For the first case, let a = gcd ( n , k , s ) = 1 . Trivially, J ( n , k , s , l ) K / S = J ( n , k , s , l ) K / S + 1 − 1 .

We now consider the case where a > 1 . Let A be game ( n , k , s , l ) K / S where a = gcd ( n , k , s ) > 1 , and let B be game ( n a , k a , s a , l ) K / S . Note that

gcd ( n a , k a , s a ) = 1 ,

therefore by the first case, B can only be reduced by this theorem trivially. Note that each of the n players of A can be surjectively mapped onto one of the n a players of B using the function f ( i ) = ⌊ i a ⌋ to provide their position. Note that when mapping all of the players, there are a consecutive players in A mapped to each player in B. It follows that in a round, the hits and skips also are mapped from A to B. For instance, in a round, k hits in A are mapped to k a hits in B on the corresponding mapped players. Therefore, given the survivor of game B, we know the corresponding remaining players in game A; the first of the remaining a players is player a ⋅ J ( n a , k a , s a , l ) K / S . Note that in this point of game A, each player has one life. Since a | s and a | k , by Proposition 1 and Lemma 1, the last of the remaining players, player a ⋅ J ( n a , k a , s a , l ) K / S + a − 1 is the survivor. □

Example 8. We want to know the survivor of a skip-first game where n = 8 , k = 2 , s = 4 , and l = 2 . We run the game in

Since a = gcd ( 8 , 2 , 4 ) = 2 , by Theorem 9 we find that J ( 4 , 1 , 2 , 2 ) S = 0 , as illustrated in

J ( 8 , 2 , 4 , 2 ) S = 2 ( 0 ) + 2 − 1 = 1.

In this paper, we showed how parameters n , k , s , and ℓ affect the survivor of games with specific constraints on those parameters. However, the general problem of identifying the survivor with any set of parameters has not yet been solved. Similar to Sullivan and Inkso’s variant, it is of note that since ℓ can be reduced to less than or equal to k in any game where n and k + s are relatively prime, any direct solution for this case would only need to consider l ≤ k . Other questions include but are not limited to: Are there other relationships between n, k, and s which produce similar reduction patterns? For many of the results in this paper, k ≥ s . Through working with this problem, we noticed that the survivor becomes harder to identify as k becomes smaller, relative to s or n. Is there a recursive solution for cases when k is relatively close to either s or n?

Another direction for further research includes exploring other Josephus game variants. For example, S. Sharma, Tripathi, Bagai, Saini, and N. Sharma explore a variant in which the number of people hit at a time varies with each round [

The authors declare no conflicts of interest regarding the publication of this paper.

Ariyibi, D., Chang, K. and Harris, P.E. (2019) Generalizations of the Feline and Texas Chainsaw Josephus Problems. Open Journal of Discrete Mathematics, 9, 144-158. https://doi.org/10.4236/ojdm.2019.94011