Name: alexander kain
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
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.