- View SourceOn Sun, 2010-12-12 at 10:13 +0000, Aldrich wrote:
> However the pattern of these gaps can be very uneven and I believe

The proof is trivial. For prime p, all integers n s.t.

> that

> it HAS been proven that the gap between primes can be arbitrarily

> large. This does not disprove Legendre's conjecture - probably

p!+1 < n <= p!+p are divisible by at least one prime <= p and p can be

taken arbitrarily large.

Paul