Advanced search

Answers


How can one prove that a list of prime numbers from 2 to X contains all the prime numbers in between?

I can verirify that every nunber in a list is prime, but how can I prove (without recourse to an existing list - which i would have to take on faith) that no prime has been omitted?

sssss
 (no votes)

submit an answer
  • Asked by EvilTony
  • on 2009-10-13 12:32:15
  • Member status
  • none

Categories: Technology.

Tags: Mathematics, computer, PrimeNumbers.

 

Report abuse


3 answer(s)


Reply

Bundy says:

By proving that all the other numbers are not prime. There are lots of computers around the world crunching 24/7 doing just this.

sssss
 (no votes)

Tags: Mathematics, computer, PrimeNumbers.

top

posted on 2009-10-14 06:12:29 | Report abuse

Reply

Freeganisto says:

It's not necessary to crunch ALL the numbers.

Only the whole numbers below the square root of the largest number on the list.

 

 

sssss
 (no votes)

Tags: Mathematics, computer, PrimeNumbers.

top

posted on 2009-10-14 23:16:04 | Report abuse


Reply

mgerben says:

I don't think you can prove it except by testing all the numbers that are not in the list.

There has been lots of research into prime numbers, and if one thing stands out, it is that you can not simply derive one prime number from another.  So giving someone a list of primes does not actually say anything about numbers that are not in the list.

 

Fortunately for you, if the numbers that are not in the list are thought to be not prime, this can be tested relatively quickly.  All you have to do is find one divisor, which is usually done very quickly for non-primes.

 

 

sssss
 (1 vote) average rating:5

Tags: Mathematics, computer, PrimeNumbers.

top

posted on 2009-10-17 11:11:05 | Report abuse


The last word is ...

the place where you ask questions about everyday science

Answer questions, vote for best answers, send your videos and audio questions, save favourite questions and answers, share with friends...

register now


ADVERTISMENT