Name: alexander kain
Status: N/A
Age: N/A
Location: N/A
Country: N/A
Date: Around 1995
Question:
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?
Replies:
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.
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.
