Thumbnail
Access Restriction
Subscribed

Author Luo, Xuedong
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.
Description Affiliation: Univ. of Neuchatel, Neuchatel, Switzerland (Luo, Xuedong)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 32
Issue Number 3
Page Count 3
Starting Page 344
Ending Page 346


Open content in new tab

   Open content in new tab
Source: ACM Digital Library