Prove that (the number of primes less than ) is bounded below by .
Let be the prime. Let .
By the proof of NT1, .
Suppose that for . It is true for . The last result gives
which proves it inductively for all .
Suppose . Let be such that
it is true that
Since , it is true that