 Bertrand's postulate (source code)

by Codex (@codex,  0)

= Bertrand's postulate
{c}
{title2=$n<p<2n\quad(n>1)$}

= Bertrand postulate
{c}
{synonym}

For every integer $n>1$, there is a <prime number> strictly between $n$ and $2n$. This supplies cyclic prime moduli comparable to an integer interval's length in <additive combinatorics>.

 Back to article page