ratios of consecutive primes

Jon Perry perry at globalnet.co.uk
Mon Sep 30 19:24:38 CEST 2002


There is an online proof of this at:

http://dmoz.org/Science/Math/Number_Theory/Prime_Numbers/

Look for:

Proof of Bertrand's Postulate - International Mathematics Olympiad tutorial
proving the theorem of Chebyshef that there is a prime between n and 2n for
all positive integers n > 1.

Jon Perry
perry at globalnet.co.uk
http://www.users.globalnet.co.uk/~perry/maths
BrainBench MVP for HTML and JavaScript
http://www.brainbench.com


-----Original Message-----
From: David Wasserman [mailto:dwasserm at mail.earthlink.net]
Sent: 29 September 2002 21:07
To: seqfan at ext.jussieu.fr
Subject: ratios of consecutive primes


Has it been proven that the ratio of consecutive primes is never more than
2?
If so, please send me a reference.






More information about the SeqFan mailing list