In number theory, Bertrand's postulate is the theorem that for any integer n > 3 {\displaystyle n>3} , there exists at least one prime number p {\displaystyle p} with n < p < 2 n − 2. {\displaystyle n<p<2n-2.} A less restrictive formulation is: for every n > 1 {\displaystyle n>1} , there is always at least one prime p {\displaystyle p} such that n < p < 2 n .
In number theory, Bertrand's postulate is the theorem that for any integer n > 3 {\displaystyle n>3} , there exists at least one prime number p {\displaystyle p} with n < p < 2 n − 2. {\displaystyle n<p<2n-2.} A less restrictive formulation is: for every n > 1 {\displaystyle n>1} , there is always at least one prime p {\displaystyle p} such that n < p < 2 n .
Source: Wikipedia "Bertrand's postulate" · CC BY-SA 4.0
Share this article: X · Bluesky