Question

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

Answer 1

@ganeshie8

Answer 2

Hey!

Answer 3

still need help ?

Answer 4

Yes, I do. but it is 11 pm now. I am asleep. If you can put the solution here, it would be great. I am sorry for not staying to get help. My friend. !!