Loading ...
Sorry, an error occurred while loading the content.

Re: [PrimeNumbers] proportionate differences between primes

Expand Messages
  • Jud McCranie
    ... It may be provable. Bertrand s postulate says that there is always a prime between n and 2n for n large enough (which is very small in this case). That
    Message 1 of 3 , Jun 28, 2004
    • 0 Attachment
      At 04:11 PM 6/28/2004, gulland68 wrote:
      >Is it provable that the proportionate difference between consecutive
      >odd-number primes does not, with ascension through the number scale
      >from 11, exceed that for 7 and 11?

      It may be provable. Bertrand's postulate says that there is always a prime
      between n and 2n for n large enough (which is very small in this
      case). That ratio of 2 can be reduced to any ratio > 1 with the condition
      "for sufficiently" large n. So you could take the ratio 11/7 and that
      holds for all sufficiently large n. Then if you know what that
      sufficiently large n is, you could in principle computationally test up to
      that n.
    Your message has been successfully submitted and would be delivered to recipients shortly.