Xuedong Luo – Communications of the ACM

Research and Advances Mar 1 1989

Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.

Computing Applications

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.