Ask A Scientist

Mathematics Archive

Fast and efficient way to generate prime numbers

Author:      alexander kain
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?

Response #:  1 of 1
Author:      tee
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.

Back to Mathematics	Ask A Scientist Index
NEWTON Homepage	Ask A Question

NEWTON is an electronic community for Science, Math, and Computer Science K-12 Educators.
Argonne National Laboratory, Division of Educational Programs, Harold Myron, Ph.D., Division Director.