🚀 go-pugleaf

In article <9208101729.AA24006@gandalf.ssw.com> rjl@GANDALF.SSW.COM (Robert J  
Leone) writes:
> In an encyclopedia reference on RSA, it mentioned using values around 10**75
> for p and q. One question (and please excuse my possible mathematical
> naivete):
>   Does anyone here have a feel for how sparse primes are in the range
> 10**75 to 10**76? In other words, is it computationally feasible to
> compile a table of primes

The prime number theorem tells us that there are approximately N/log(N) primes
less then N. So in the range from 10**75 to 10**76 there are approximately
         (10**76)/log(10**76) - (10**75)/log(10**75) = 5*(10**73) 
primes. If you arrange one prime in a line and 50 lines on a
page, the table is a book of 10**72 pages. I think these is more pages then the
number of atoms in the universe.
--
Prof. Dr. Klaus Pommerening                                                     
Institut fuer Medizinische Statistik und Dokumentation                          
der Johannes-Gutenberg-Universitaet                                             
Obere Zahlbacher Strasse 69, W-6500 Mainz