Newsgroups: sci.crypt
Path: msuinfo!caen!zaphod.mps.ohio-state.edu!rpi!cecchinr
From: cecchinr@cs.rpi.edu (Ron Cecchini)
Subject: Re: Prime Number list (40-43 digit and 80-83 digit)
Message-ID: <009r4+m@rpi.edu>
Nntp-Posting-Host: cs.rpi.edu
Organization: Rensselaer Computer Science, Troy NY
References: <1992Jan26.083119.69248@ns1.cc.lehigh.edu> <1992Jan29.135645.17830@linus.mitre.org>
Date: 29 Jan 92 22:40:45 GMT
Lines: 21

In article <1992Jan29.135645.17830@linus.mitre.org> bs@faron.mitre.org (Robert D. Silverman) writes:
>In article <1992Jan26.083119.69248@ns1.cc.lehigh.edu> mlf3@ns1.cc.lehigh.edu writes:
>:
>:							Sun 0100
>:Greetings,
>:
>:	If anybody is interested (for whatever reason) I have 
>:compiled a list of about 2000 primes in the 40-43 digit and 80-83 digit
>:range.  If anybody would care for such a list reply to me and I will 
>:be happy to send you a copy.
>
>How did you PROVE they were prime????   What method(s)??
>
>If they are merely probable primes you should state so.

Interesting.  There is a PhD student here at my school whose doctoral
thesis is on this very subject.  Believe it or not, his system routinely
proves numbers of up to about 1000 digits prime or not prime (when I say
"proves" I mean it.  His system actually generates proofs.)

Ron
