prime proofs

Richard Schroeppel rcs at CS.Arizona.EDU
Fri Mar 7 17:06:22 EST 2003


Dave Wagner writes
>  ...  Here's a simple method, due to Pratt.  ...

People were doing this fourty years before Pratt's paper.
See, for example, Dick Lehmer's 1933 paper "Hunting Big Game
in the Theory of Numbers", where he describes proving primality
for a 19 digit divisor of 2^95+1.  It's on my web page at

http://www.cs.arizona.edu/~rcs/biggame4

Or see Math. Comp. in the early 1970s for examples with more
depth in the recursions.

Rich Schroeppel    rcs at cs.arizona.edu


---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com



More information about the cryptography mailing list