Problem 50913. Compute the nth term from the golden sieve

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 a(n) 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 a(2) = 3 position (i.e., 4) to get 2, 3, 5, 6, 7, 8, 9,…In the third step, delete the term in the a(3) = 5 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.
Solve

Solution Stats

100.0% Correct | 0.0% Incorrect
Last Solution submitted on Jan 21, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers17

Suggested Problems

More from this Author301

Problem Tags

sequence sieve

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!