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
-
116067 Solvers
-
Find the longest sequence of 1's in a binary sequence.
6813 Solvers
-
Return the largest number that is adjacent to a zero
5527 Solvers
-
Find state names that end with the letter A
1198 Solvers
-
1751 Solvers
More from this Author328
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