• Loser66
Using Euclid's proof that there are infinitely many primes, show that the nth prime p_n does not exceed $$2^{2^{n-1}}$$ whenever n is a positive integer. Conclude that when n is a positive integer, there are at least n+1 primes less than $$2^{2^{n}}$$ Please, help
Mathematics

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.