Ramanujan’s proof of Bertrand’s postulate
Bertrand’s postulate states that if \(x\geq4\), then there always exists at least one prime \(p\) with\(x<p<2x-2\). A weaker but more elegant formulation is: for every \(x>1\) there is always at least one prime p such that \(x<p<2x\). In …
Ramanujan’s proof of Bertrand’s postulate Read More