answersLogoWhite

0

There are an infinite number of prime numbers. The first to have proven this was Euclid. Here are the general lines of his proof:

  1. Suppose there are n prime numbers overall.
  2. Let N be a common multiple of all these primes.
  3. Is N+1 prime? If it is, we have found a new prime.
  4. Suppose N+1 is not prime. Thus, there exists a Prime number p which divides N+1 evenly. If p is one of the primes dividing N, it also divides 1 evenly, which is impossible. Thus, p is not one of the n primes, and we found a new prime.

(see the related link for a list of the first 500 prime numbers)

User Avatar

Wiki User

13y ago

Still curious? Ask our experts.

Chat with our AI personalities

JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
RossRoss
Every question is just a happy little opportunity.
Chat with Ross
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
More answers

That's an infinite amount.

User Avatar

Wiki User

12y ago
User Avatar

Add your answer:

Earn +20 pts
Q: How many prime numbers are theree?
Write your answer...
Submit
Still have questions?
magnify glass
imp