Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (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

OpenStudy (loser66):

@ganeshie8

ganeshie8 (ganeshie8):

Hey!

OpenStudy (anonymous):

still need help ?

OpenStudy (loser66):

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. !!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!