Abstract
The Sieve of Eratosthenes is an efficient algorithm for computing the successive primes. Rendered informally, it is as follows:1. Write down the successive “plurals”: 2, 3, 4, …2. Repeat:(a) Take the first number that is not circled or crossed out.(b) Circle it.(c) Cross out its proper multiples.3. What is left (i.e. the circled numbers) are the successive prime numbers.
Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献