Re: no prime number in the given range

In article <1156012108.529151.277100@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<luiroto@xxxxxxxxx> wrote:

v4vijayakumar ha escrito:

How can I prove that there is no prime number within the given
numerical range, say from n1 to n2?

There is only one procedure:
First verify that n2 < n1 + (log(n1))^2, on contrary case there is at
least one.

So there is at least one prime between 3 and 5 ?

It's probably true that every (sufficiently long?) interval of the form
[n, n + (log(n))^2 ] contains a prime, but that's not known. We don't
even know that there's always a prime in the interval [ n, n + sqrt(n) ]
which is longer (for n > 4.2).

dave

.

Relevant Pages
Quantcast