Department of Energy Argonne National Laboratory Office of Science NEWTON's Homepage NEWTON's Homepage
NEWTON, Ask A Scientist!
NEWTON Home Page NEWTON Teachers Visit Our Archives Ask A Question How To Ask A Question Question of the Week Our Expert Scientists Volunteer at NEWTON! Frequently Asked Questions Referencing NEWTON About NEWTON About Ask A Scientist Education At Argonne Fast and efficient way to generate prime numbers
Name: alexander kain
Status: N/A
Age: N/A
Location: N/A
Country: N/A
Date: Around 1995

Is there a computer-algorithm that generates prime numbers? I am aware of the Euclidian sieve - but I am looking for something more efficient. I also know how to check if a number is prime: 2^(k - 1) mod k = 1. Are there better methods?

A good reference is The Lore of Prime Numbers by G. P. Loweke (1982). The bibliography there leads to more specific references in special areas that you are mentioning.


Click here to return to the Mathematics Archives

NEWTON is an electronic community for Science, Math, and Computer Science K-12 Educators, sponsored and operated by Argonne National Laboratory's Educational Programs, Andrew Skipor, Ph.D., Head of Educational Programs.

For assistance with NEWTON contact a System Operator (, or at Argonne's Educational Programs

Educational Programs
Building 360
9700 S. Cass Ave.
Argonne, Illinois
60439-4845, USA
Update: June 2012
Weclome To Newton

Argonne National Laboratory