To apply the Sieve of Eratosthenes, start with the natural numbers (skipping 1), keep the first number (i.e., 2), and delete all multiples (4, 6, 8, 10, etc.). Then repeat: keep the first remaining number (3) and delete all multiples (9, 15, 21, etc.). The remaining numbers are the primes.
To apply the Sieve of Flavius Josephus, start with the natural numbers. On the kth step, remove every
st term remaining after the
st step. So, on the first step, remove every second number (2, 4, 6, 8, etc.) to leave 1, 3, 5, 7, 9, 11, 13, 15, 17…On the second step, remove every third number (5, 11, 17, etc.) to leave 1, 3, 7, 9, 13, 15, 19,…
Write a function to compute the nth term in the sequence remaining after the Sieve of Flavius Josephus is applied.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers19
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
Project Euler: Problem 10, Sum of Primes
2124 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
692 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2211 Solvers
-
178 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Making me thing that i can get away with brute force was vicious at the very least :D