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 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.
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 commentsProblem Recent Solvers17
Suggested Problems
-
2061 Solvers
-
Given two arrays, find the maximum overlap
1522 Solvers
-
Test if a Number is a Palindrome without using any String Operations
232 Solvers
-
Sort numbers by outside digits
147 Solvers
-
How many trades represent all the profit?
602 Solvers
More from this Author281
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!