Proof of Bertrand's postulate

In mathematics, Bertrand's postulate (now a theorem) states that, for each n ≥ 2 {\displaystyle n\geq 2} , there is a prime p {\displaystyle p} such that n < p < 2 n {\displaystyle n<p<2n} . First conjectured in 1845 by Joseph Bertrand, it was first proven by Chebyshev, and a shorter but also advanced proof was given by Ramanujan.

This neuron ends here.