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
-
273 Solvers
-
Return the first and last characters of a character array
9407 Solvers
-
Set the array elements whose value is 13 to 0
1351 Solvers
-
Replace pattern 0 1 0 and 1 0 1
137 Solvers
-
1443 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!