A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
Loser66
 one year ago
Using Euclid's proof that there are infinitely many primes, show that the nth prime p_n does not exceed \(2^{2^{n1}}\) 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
Loser66
 one year ago
Using Euclid's proof that there are infinitely many primes, show that the nth prime p_n does not exceed \(2^{2^{n1}}\) 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

This Question is Closed

Loser66
 one year ago
Best ResponseYou've already chosen the best response.0Yes, 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. !!
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.