Prove that there are infinitely many …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Daksh Chattha 5 years, 8 months ago
- 1 answers
Related Questions
Posted by Vanshika Bhatnagar 1 year, 3 months ago
- 2 answers
Posted by Sahil Sahil 1 year, 3 months ago
- 2 answers
Posted by Lakshay Kumar 11 months, 2 weeks ago
- 0 answers
Posted by Parinith Gowda Ms 2 months ago
- 1 answers
Posted by Hari Anand 4 months, 3 weeks ago
- 0 answers
Posted by Kanika . 2 months, 3 weeks ago
- 1 answers
Posted by Parinith Gowda Ms 2 months ago
- 0 answers

myCBSEguide
Trusted by 1 Crore+ Students

Test Generator
Create papers online. It's FREE.

CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
myCBSEguide
Gaurav Seth 5 years, 8 months ago
For any finite set of primes {p1 , p2 , p3 ,......., pn }, Euclid considered the number
n = p1 * p2 * p3 *.......* pn + 1
n has a prime divisor p(every integer has at least one prime divisor). But p is not equal to
any of the pi .(If p were equal to any of the pi , then p would have to divide 1, which is
impossible.
So for any finite set of prime numbers, it is possible to find another prime that is not in
that set.
In other words, a finite set of primes cannot be the collection of all prime numbers.
Hence, there are infinitely many positive primes.
0Thank You