answersLogoWhite

0

Yes. To prove this, we must first assume the answer to be no. If there are a finite number of primes, there must be a largest prime. We'll call this Prime number n. n! is n*(n-1)*(n-2)*...*3*2*1. n!, therefore, is divisible by all numbers smaller than or equal to n. It follows, then that n!+1 is divisible by none of them, except for 1. There are two possibilities: n!+1 is divisible by prime numbers between n and n!, or it is itself prime. Either way, we have proved that there are prime numbers greater than n, contradicting our initial assumption that primes are finite, proving that the number of primes is infinite.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
RossRoss
Every question is just a happy little opportunity.
Chat with Ross

Add your answer:

Earn +20 pts
Q: Is there a infinite number of prime numbers?
Write your answer...
Submit
Still have questions?
magnify glass
imp