Bertrand's theorem

prime

what

a.k.a: Bertrand’s postulate, Bertrand–Chebyshev theorem, Chebyshev’s theorem

For every $n>1$, there is always at least one prime $p$ such that $n<p<2n$.

references

• Bertrand’s postulate - Wikipedia