[net.math] Prime between n and 2n

trough@ihuxa.UUCP (Chris Scussel) (03/26/84)

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