Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!husc6!hao!ames!oliveb!sun!falk
From: falk@sun.uucp (Ed Falk)
Newsgroups: sci.crypt
Subject: Re: Spacing of Prime Numbers
Message-ID: <19612@sun.uucp>
Date: Sun, 24-May-87 02:39:19 EDT
Article-I.D.: sun.19612
Posted: Sun May 24 02:39:19 1987
Date-Received: Sun, 24-May-87 08:46:36 EDT
References: <1392@phred.UUCP> <6212@ism780c.UUCP> <1938@husc6.UUCP>
Organization: Sun Microsystems, Inc. - Mtn View, CA
Lines: 13
Summary: I'm confused

In article <1938@husc6.UUCP>, greg@endor.harvard.edu (Greg) writes:
> >           Prove there is a  sequence  of at least one million
> >           consecutive integers, none of whom are prime.
>
> 1000001! + n is divisible by n for 2<=n<=1000001.

I'm confused.  How does this prove that there's a million consecutive
composite numbers?  All I see is that there's a composite number with
a million consecutive factors.

-- 
		-ed falk, sun microsystems, falk@sun.com
terrorist, cryptography, DES, drugs, cipher, secret, decode, NSA, CIA, NRO.