Joseph Louis François Bertrand
Existence of a prime number between any number and its double
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
.
{\displaystyle n<p<2n.}
Another formulation, where
p
n
{\displaystyle p_{n}}
is the
n
{\displaystyle n}
-th prime, is: for
n
≥
1
{\displaystyle n\geq 1}
p
n
+
1
<
2
p
n
.
{\displaystyle p_{n+1}<2p_{n}.}
[1]
This statement was first conjectured in 1845 by Joseph Bertrand [2] (1822–1900). Bertrand himself verified his statement for all integers
2
≤
n
≤
3
000
000
{\displaystyle 2\leq n\leq 3\,000\,000}
.
His conjecture was completely proved by Chebyshev (1821–1894) in 1852[3] and so the postulate is also called the Bertrand–Chebyshev theorem or Chebyshev's theorem . Chebyshev's theorem can also be stated as a relationship with
π
(
x
)
{\displaystyle \pi (x)}
, the prime-counting function (number of primes less than or equal to
x
{\displaystyle x}
):
π
(
x
)
−
π
(
x
2
)
≥
1
,
for all
x
≥
2.
{\displaystyle \pi (x)-\pi {\bigl (}{\tfrac {x}{2}}{\bigr )}\geq 1,{\text{ for all }}x\geq 2.}
^ Ribenboim, Paulo (2004). The Little Book of Bigger Primes . New York: Springer-Verlag. p. 181 . ISBN 978-0-387-20169-6 .
^ Bertrand, Joseph (1845), "Mémoire sur le nombre de valeurs que peut prendre une fonction quand on y permute les lettres qu'elle renferme." , Journal de l'École Royale Polytechnique (in French), 18 (Cahier 30): 123–140 .
^ Tchebychev, P. (1852), "Mémoire sur les nombres premiers." (PDF) , Journal de mathématiques pures et appliquées , Série 1 (in French): 366–390 . (Proof of the postulate: 371-382). Also see Tchebychev, P. (1854), "Mémoire sur les nombres premiers." , Mémoires de l'Académie Impériale des Sciences de St. Pétersbourg (in French), 7 : 15–33