🚀 go-pugleaf

In article <1557@anagld.analytics.com> sammy@anagld.analytics.com (Sam Blackburn) writes:
>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
>
>In my humble excursions into this arena, I've noticed that primes are roughly
>11% of the numbers of x digits in length.  Is it feasible to compile a table
>of primes? Sure.  But it's gonna be one heck of a list.  The number of primes
>is not infinite (I'm probably going to get flamed on that remark).


No personal flame intended but you should study your subject before shooting
your mouth off. At the very least you should read the first few chapters of
ANY number theory book.

(1) Primes are NOT 11% of the numbers of x digits. They have asymptotic
density ZERO. For primes near 10^75, their density is about .58%

(2) It is NOT feasible to compile such a list.

(3) Where in ****** did you get the crazy idea that the number of primes
is finite? 
--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"