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..
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Well, 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?
So q would be odd? How can we verify that in any instance it is not divisible by 3 for example?
Well, 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.