February 26, 2002
Practical Aspects of Modern Cryptography
48
The Prime Number Theorem
n
n
The number of primes less than
N
is
approximately
N/(ln N)
.
n
n
Thus, approximately
1
out of every
n
randomly selected
n
-bit integers will
be prime.