🚀 go-pugleaf

>
>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).

A reasonably accurate and easy to remember approximation for the fraction
of numbers that are prime for a given size is 1/n where n is the number
of bits in the number.  So for example for numbers around 10 bits long
11% is not a bad approximation but for numbers 100 bits long it is
terrible.

I am going to give you a change to back out gracefully here:  When
you said the number of primes was not infinite did you mean the total
number of primes or the number of primes in a given range.  (Hint:
answer the latter and you can more or less save face :-).

Jimmy
jru@Comtech.com
n