Back to Search
Start Over
A Linear Sieve Algorithm for Finding Prime Numbers.
- Source :
- Communications of the ACM; Dec1978, Vol. 21 Issue 12, p999-1003, 5p, 1 Chart
- Publication Year :
- 1978
-
Abstract
- A new algorithm is presented for finding all primes between 2 and n. The algorithm executes in time proportional to n (assuming that multiplication of integers not larger than n can be performed in unit time). The method has the same arithmetic complexity as the algorithm presented by Mairson [6]; however, our version is perhaps simpler and more elegant. It is also easily extended to find the prime factorization of all integers between 2 and n in time proportional to n. [ABSTRACT FROM AUTHOR]
- Subjects :
- ALGORITHMS
PRIME numbers
MATHEMATICS
MATHEMATICAL models
ARITHMETIC
FACTORIZATION
Subjects
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 21
- Issue :
- 12
- Database :
- Complementary Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 5495661
- Full Text :
- https://doi.org/10.1145/359657.359660