-2
Let π(N) be the number of primes less than or equal to N (example: π(100) = 25). The famous
prime number theorem then states (with ∼ meaning asymptotically equal):
π(N) ∼N/log(N)
Proving this theorem is very hard. However, we can derive a statistical form of the prime
number theorem. For this, we...