By Bertrand's postulate, we know that there exists at least one prime number between and for any . In other words, we have
for any . The assertion we would like to prove is that the number of primes between and tends to , if , that is,
Do you see an elegant proof?