MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayThe Josephus Challenge is to find the position that is the last remaining when every Kth item is removed from a list of N items. The removal wraps from the end to the start.

**Input:** N, K where N is the number of players and K is the removal period.

**Output:** S the last position remaining

**Example:** N=4 K=2 produces the sequence

1 2 3 4; 1 3 4; 1 3; 1

**Comment:**

This is a replication of Decimation by James but has a different Historical story reference.

14 correct solutions
2 incorrect solutions

Last solution submitted on Oct 25, 2014

1 player likes this problem

4 Comments