BertrandsConjecture 2001-10-16 08:59:54 2006-10-26 19:27:52 Theorem number theory \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{graphicx} \usepackage{xypic} Bertrand conjectured that for every positive integer $n > 1$, there exists at least one prime $p$ satisfying $n < p < 2n$. This result was proven in 1850 by Chebyshev, but the phrase \PMlinkescapeword{name} ``Bertrand's Conjecture'' remains in the literature.