Question: Proof. Consider any number n. Let n! be the factorial of n, and consider the number p = n! + 1. So p is
Proof. Consider any number n. Let n! be the factorial of n, and consider the number p = n! + 1. So p is larger than n, and it has a remainder of 1 when divided by any number up to n. So p is prime, and we have therefore found a prime number above n. So there are infinitely many prime numbers.
Step by Step Solution
★★★★★
3.42 Rating (142 Votes )
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
This is a proof by contradiction of Euclids theorem which states that there are infinitely many ... View full answer
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
