A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
There are inﬁnitely many prime numbers.
Proof. Following Euclid’s proof, we shall show that to every prime p there is a
greater one. Assume that p is the greatest prime number, and let q = 1 · 2 · 3 · . . . · p.
Then, q + 1 is not divisible by 2, 3, . . . , p. It follows that q is divisible only by 1
and itself, and thus, it is a prime number greater than p. This, however, contradicts
the hypothesis that p is the greatest prime, and it follows that there is no greatest
prime. In other words, the set of primes is inﬁnite.
Help clarify how 1*2*3..*p + 1 is not divisible by 1,2,3 etc..
anonymous
 5 years ago
There are inﬁnitely many prime numbers. Proof. Following Euclid’s proof, we shall show that to every prime p there is a greater one. Assume that p is the greatest prime number, and let q = 1 · 2 · 3 · . . . · p. Then, q + 1 is not divisible by 2, 3, . . . , p. It follows that q is divisible only by 1 and itself, and thus, it is a prime number greater than p. This, however, contradicts the hypothesis that p is the greatest prime, and it follows that there is no greatest prime. In other words, the set of primes is inﬁnite. Help clarify how 1*2*3..*p + 1 is not divisible by 1,2,3 etc..

This Question is Closed

KingGeorge
 5 years ago
Best ResponseYou've already chosen the best response.2Well, we know that 1*2*3*...*p is divisible by 1, 2, 3, ..., p because it's the product of those numbers. Thus, if we add 1, we know that it can't be divisible by any number 2, 3, 4, ..., p. Does this help clarify?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0So q would be odd? How can we verify that in any instance it is not divisible by 3 for example?

KingGeorge
 5 years ago
Best ResponseYou've already chosen the best response.2Well, q would be even since it's divisible by two. But therefore q+1 is odd. Likewise, q is divisible by 3, but q+1 obviously can't. This argument can be continued up to p, where we know p divides q, but therefore, p can't divide q+1. However, this is a proof that there is a prime greater than p, not necessarily that q is prime. Take 5 as an example. 5! is 120, so 5!+1 is 121. This is 11*11, and 11 is both prime and greater than 5, but 121 is not prime.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Ok. So if it's not prime then what does it prove? That there's a possibility that it's square root is prime?

KingGeorge
 5 years ago
Best ResponseYou've already chosen the best response.2All it proves is that there exists a prime larger than p. It doesn't say what that prime is, just that it exists.

KingGeorge
 5 years ago
Best ResponseYou've already chosen the best response.2You can try this with various values of p and using wolfram alpha you can find and factor q+1
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.