Bounding the number of primes

55 Views Asked by At

I have to prove that $$\pi(x)>c\log \log x$$ for some absolute constant $c$. So far I have proven that the nth prime $p_n$ will always be less than $2^{2^{n}}+1$, which I feel maybe helpful.