Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 exptools 1/6/84; site ihuxa.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!ihnp4!ihuxa!trough
From: trough@ihuxa.UUCP (Chris Scussel)
Newsgroups: net.math
Subject: Prime between n and 2n
Message-ID: <438@ihuxa.UUCP>
Date: Mon, 26-Mar-84 11:42:04 EST
Article-I.D.: ihuxa.438
Posted: Mon Mar 26 11:42:04 1984
Date-Received: Tue, 27-Mar-84 01:25:30 EST
Organization: AT&T Bell Labs, Naperville, IL
Lines: 11

The "theorem" that there is a prime between n and 2n is known as "Bertrand's
Conjecture", and also as "Bertrand's Postulate". The following stronger
theorem has been proved:

	For any x > 1, there exists N such that for all n>N there is
a prime between n and xn.

I believe that this was first shown by chebychev (sp?), but I'm not certain.

						Chris Scussel
						..!ihnp4!ihuxa!trough