Bertrand's postulate is a theorem stating that for any integer n>3{\displaystyle n>3}, there always exists at least one prime number p{\displaystyle p} with
A weaker but more elegant formulation is: for every n>1{\displaystyle n>1} there is always at least one prime p{\displaystyle p} such that