Cody Problem 45367 involved the Sieve of Eratosthenes, and Cody Problem 50811 involved the Sieve of Flavius Josephus. To apply the golden sieve, start with the natural numbers and at the nth step, take the sequence, which we will call a, and delete the term in the 
position.
position. In the first step, delete the term in the 
position to get 2, 3, 4, 5, 6, 7,…Then in the second step, delete the term in the 
position (i.e., 4) to get 2, 3, 5, 6, 7, 8, 9,…In the third step, delete the term in the 
position (i.e., 7) to get 2, 3, 5, 6, 8, 9, 10,…Et cetera.
position to get 2, 3, 4, 5, 6, 7,…Then in the second step, delete the term in the position (i.e., 4) to get 2, 3, 5, 6, 7, 8, 9,…In the third step, delete the term in the position (i.e., 7) to get 2, 3, 5, 6, 8, 9, 10,…Et cetera.Write a function that returns the nth term in the sequence after an infinite number of steps.
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers21
Suggested Problems
-
118723 Solvers
-
281 Solvers
-
The number of trailing zero digit of a factorial
66 Solvers
-
I'm going to enjoy watching you calculate, Mr Anderson
50 Solvers
-
Number of Even Elements in Fibonacci Sequence
1697 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
OK, but you can you *derive* that formula?
Does “look up in OEIS” count as “derive”?
Tim: You, William, David, and others have figured me out. I suppose there are worse habits than repeatedly clicking the "Webcam" button on OEIS.