100 consecutive composite numbers (fwd)

[Jim choate <ravage@bga.com>]

Forwarded message:
From hip-hop!benjie@amdahl.com Mon May 30 16:55:29 1994
Apparently-To: 95MSINGHAL@vax.mbhs.edu, tonya@vax1.bemidji.msus.edu,
        stjaffe@vaxsar.vassar.edu, ravage@bga.com,
        chenym@wangwei.math.ncu.edu.tw
Message-Id: <m0q7qDV-000039a@hip-hop.hh.sbay.org>
Date: Sun, 29 May 94 12:08 PDT
Sender: benjie@hh.sbay.org (Benjie KE6BCU)
From: David G Radcliffe <radcliff@alpha2.csd.uwm.edu>
Subject: 100 consecutive composite numbers
Designated-To: Internet Amateur Mathematics Society
Replied-From: Internet Amateur Mathematics Society
Precedence: bulk
Sender: iams@hh.sbay.org (Internet Amateur Mathematics Society)
X-Info: email to listserv@hh.sbay.org with "FAQ iams" in the message
X-Ignore: iams  Ignore this line. It's a mailing-list-loop detector.


If N is the product of all prime numbers less than k, then
the numbers N+2,N+3,...,N+k are all composite.  This is the
best upper bound that I can find without doing a brute force
search.

I wrote a Maple program to search for the first prime gap of
100 or more.  I am not a programmer, so please don't laugh too hard:

  for i from 100 to 1500000 by 100
  while nextprime(i) - prevprime(i) < 100 do
  od;

The result is that there are no prime numbers between
370261 and 370373.