View source for Bertrand postulate

{{TEX|done}}
For any natural number $n>3$ there exists a [[Prime number|prime number]] that is larger than $n$ and smaller than $2n-2$. In its weaker formulation Bertrand's postulate states that for any $x>1$ there exists a prime number in the interval $(x,2x)$. The postulate was advanced by J. Bertrand in 1845 on the strength of tabulated data, and was proved by P.L. Chebyshev (cf. [[Chebyshev theorems on prime numbers|Chebyshev theorems on prime numbers]]).

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  P.L. Chebyshev,   "Oeuvres de P.L. Tchebycheff" , '''1''' , Chelsea, reprint  (1961)  (Translated from Russian)</TD></TR></table>



====Comments====


====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  G.H. Hardy,   E.M. Wright,   "An introduction to the theory of numbers" , Clarendon Press  (1965)  pp. 343ff</TD></TR></table>