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

Re: [PrimeNumbers] Re: primes between squares calcs

Expand Messages
  • Paul Leyland
    ... The proof is trivial. For prime p, all integers n s.t. p!+1
    Message 1 of 5 , Dec 12, 2010
    View Source
    • 0 Attachment
      On Sun, 2010-12-12 at 10:13 +0000, Aldrich wrote:
      > However the pattern of these gaps can be very uneven and I believe
      > that
      > it HAS been proven that the gap between primes can be arbitrarily
      > large. This does not disprove Legendre's conjecture - probably

      The proof is trivial. For prime p, all integers n s.t.
      p!+1 < n <= p!+p are divisible by at least one prime <= p and p can be
      taken arbitrarily large.

      Paul
    Your message has been successfully submitted and would be delivered to recipients shortly.