In mathematics, Bertrand's postulate (actually a theorem) states that for each
n
≥
1
there is a prime
p
such that
n
<
p
≤
2
n
. It was first proven by Pafnuty Chebyshev, and a short but advanced proof was given by Srinivasa Ramanujan. The gist of the following elementary proof is due to Paul Erdős. The basic idea of the proof is to show that a certain central binomial coefficient needs to have a prime factor within the desired interval in order to be large enough. This is made possible by a careful analysis of the prime factorization of central binomial coefficients.
The main steps of the proof are as follows. First, one shows that every prime power factor
p
r
that enters into the prime decomposition of the central binomial coefficient
(
2
n
n
)
:=
(
2
n
)
!
(
n
!
)
2
is at most
2
n
. In particular, every prime larger than
2
n
can enter at most once into this decomposition; that is, its exponent
r
is at most one. The next step is to prove that
(
2
n
n
)
has no prime factors at all in the gap interval
(
2
n
3
,
n
)
. As a consequence of these two bounds, the contribution to the size of
(
2
n
n
)
coming from all the prime factors that are at most
n
grows asymptotically as
O
(
θ
n
)
for some
θ
<
4
. Since the asymptotic growth of the central binomial coefficient is at least
4
n
/
2
n
, one concludes that for
n
large enough the binomial coefficient must have another prime factor, which can only lie between
n
and
2
n
. Indeed, making these estimates quantitative, one obtains that this argument is valid for all
n
>
468
. The remaining smaller values of
n
are easily settled by direct inspection, completing the proof of Bertrand's postulate. This proof is so short and elegant that it is considered to be one of the Proofs from THE BOOK.
Lemma: For any integer
n
>
0
, we have
4
n
2
n
≤
(
2
n
n
)
.
Proof: Applying the binomial theorem,
4
n
=
(
1
+
1
)
2
n
=
∑
k
=
0
2
n
(
2
n
k
)
=
2
+
∑
k
=
1
2
n
−
1
(
2
n
k
)
≤
2
n
(
2
n
n
)
,
since
(
2
n
n
)
is the largest term in the sum in the right-hand side, and the sum has
2
n
terms (including the initial
2
outside the summation).
For a fixed prime
p
, define
R
(
p
,
n
)
to be the largest natural number
r
such that
p
r
divides
(
2
n
n
)
.
Lemma: For any prime
p
,
p
R
(
p
,
n
)
≤
2
n
.
Proof: The exponent of
p
in
n
!
is (see Factorial#Number theory):
∑
j
=
1
∞
⌊
n
p
j
⌋
,
so
R
(
p
,
n
)
=
∑
j
=
1
∞
⌊
2
n
p
j
⌋
−
2
∑
j
=
1
∞
⌊
n
p
j
⌋
=
∑
j
=
1
∞
(
⌊
2
n
p
j
⌋
−
2
⌊
n
p
j
⌋
)
.
But each term of the last summation can either be zero (if
n
/
p
j
mod
1
<
1
/
2
) or 1 (if
n
/
p
j
mod
1
≥
1
/
2
) and all terms with
j
>
log
p
(
2
n
)
are zero. Therefore
R
(
p
,
n
)
≤
log
p
(
2
n
)
,
and
p
R
(
p
,
n
)
≤
p
log
p
2
n
=
2
n
.
This completes the proof of the lemma.
Lemma: If
p
is odd and
2
n
3
<
p
≤
n
, then
R
(
p
,
n
)
=
0.
Proof: There are exactly two factors of
p
in the numerator of the expression
(
2
n
n
)
=
(
2
n
)
!
(
n
!
)
2
, coming from the two terms
p
and
2
p
in
2
n
!
, and also two factors of
p
in the denominator from two copies of the term
p
in
n
!
. These factors all cancel, leaving no factors of
p
in
(
2
n
n
)
. (The bound on
p
in the preconditions of the lemma ensures that
3
p
is too large to be a term of the numerator, and the assumption that
p
is odd is needed to ensure that
2
p
contributes only one factor of
p
to the numerator.)
We estimate the primorial function,
x
#
=
∏
p
≤
x
p
,
where the product is taken over all prime numbers
p
less than or equal to the real number
x
.
Lemma: For all real numbers
x
≥
3
,
x
#
<
2
2
x
−
3
.
Proof: Since
x
#
=
⌊
x
⌋
#
and
2
2
⌊
x
⌋
−
3
≤
2
2
x
−
3
, it suffices to prove the result under the assumption that
x
=
n
is an integer,
n
≥
3
. Since
(
2
n
−
1
n
)
is an integer and all the primes
n
+
1
≤
p
≤
2
n
−
1
appear in its numerator but not in its denumerator, we have
(
2
n
−
1
)
#
n
#
≤
(
2
n
−
1
n
)
=
1
2
(
(
2
n
−
1
n
−
1
)
+
(
2
n
−
1
n
)
)
<
1
2
(
1
+
1
)
2
n
−
1
=
2
2
n
−
2
.
.
The proof proceeds by mathematical induction.
If
n
=
3
, then
n
#
=
6
<
8
=
2
2
n
−
3
.
If
n
=
4
, then
n
#
=
6
<
16
=
2
2
n
−
3
.
If
n
=
2
m
−
1
is odd and
n
≥
5
, then by the above estimate and the induction assumption for
m
≥
3
it's
n
#
=
(
2
m
−
1
)
#
<
m
#
⋅
2
2
m
−
2
<
2
2
m
−
3
2
2
m
−
2
=
2
4
m
−
5
=
2
2
n
−
3
.
If
n
=
2
m
is even and
n
≥
6
, then by the above estimate and the induction assumption for
m
≥
3
it's
n
#
=
(
2
m
)
#
=
(
2
m
−
1
)
#
<
m
#
⋅
2
2
m
−
2
<
2
2
m
−
3
2
2
m
−
2
=
2
4
m
−
5
<
2
4
m
−
3
=
2
2
n
−
3
.
Thus the lemma is proven.
Proof of Bertrand's Postulate
Assume there is a counterexample: an integer n ≥ 2 such that there is no prime p with n < p < 2n.
If 2 ≤ n < 468, then p can be chosen from among the prime numbers 3, 5, 7, 13, 23, 43, 83, 163, 317, 631 (each being less than twice its predecessor) such that n < p < 2n. Therefore n ≥ 468.
There are no prime factors p of
(
2
n
n
)
such that:
2n < p, because every factor must divide (2n)!;
p = 2n, because 2n is not prime;
n < p < 2n, because we assumed there is no such prime number;
2n / 3 < p ≤ n: by Lemma 3.
Therefore, every prime factor p satisfies p ≤ 2n/3.
When
p
>
2
n
,
the number
(
2
n
n
)
has at most one factor of p. By Lemma 2, for any prime p we have pR(p,n) ≤ 2n, so the product of the pR(p,n) over the primes less than or equal to
2
n
is at most
(
2
n
)
2
n
. Then, starting with Lemma 1 and decomposing the right-hand side into its prime factorization, and finally using Lemma 4, these bounds give:
4
n
2
n
≤
(
2
n
n
)
=
(
∏
p
≤
2
n
p
R
(
p
,
n
)
)
(
∏
2
n
<
p
≤
2
n
3
p
R
(
p
,
n
)
)
<
(
2
n
)
2
n
∏
1
<
p
≤
2
n
3
p
=
(
2
n
)
2
n
(
2
n
3
)
#
≤
(
2
n
)
2
n
4
2
n
/
3
.
Taking logarithms yields to
log
4
3
n
≤
(
2
n
+
1
)
log
2
n
.
By concavity of the right-hand side as a function of n, the last inequality is necessarily verified on an interval. Since it holds true for n=467 and it does not for n=468, we obtain
n
<
468.
But these cases have already been settled, and we conclude that no counterexample to the postulate is possible.
Using Lemma 4, Tochiori refined Erdos's method and proved if there exists a positive integer
n
≥
5
such that there is no prime number
n
<
p
≤
2
n
then
n
<
64
.
First, refine lemma 1 to:
Lemma 1': For any integer
n
≥
4
, we have
4
n
n
<
(
2
n
n
)
.
Proof: By induction:
4
4
4
=
64
<
70
=
(
8
4
)
,
and assuming the truth of the lemma for
n
−
1
,
(
2
n
n
)
=
2
2
n
−
1
n
(
2
(
n
−
1
)
n
−
1
)
>
2
2
n
−
1
n
4
n
−
1
n
−
1
>
2
⋅
2
4
n
−
1
n
=
4
n
n
.
Then, refine the estimate of the product of all small primes via a better estimate on
π
(
x
)
(the number of primes at most
n
):
Lemma 5: For any natural number
n
, we have
π
(
n
)
≤
1
3
n
+
2.
Proof: Except for
p
=
2
,
3
, every prime number has
p
≡
1
or
p
≡
5
(
mod
6
)
. Thus
π
(
n
)
is upper bounded by the number of natural numbers
k
≤
n
with
k
≡
1
or
k
≡
5
(
mod
6
)
, plus one (since this counts
1
and misses
2
,
3
). Thus
π
(
n
)
≤
⌊
n
+
5
6
⌋
+
⌊
n
+
1
6
⌋
+
1
≤
n
+
5
6
+
n
+
1
6
+
1
=
1
3
n
+
2.
Now, calculating the binomial coefficient as in the previous section, we can use the improved bounds to get (for
n
≥
5
, which implies
2
n
≥
3
so that
2
n
#
≥
3
#
=
6
):
4
n
n
≤
(
2
n
n
)
=
∏
p
≤
2
n
p
R
(
p
,
n
)
⋅
∏
2
n
<
p
≤
2
n
3
p
R
(
p
,
n
)
<
(
2
n
)
π
(
2
n
)
∏
2
n
<
p
≤
2
n
3
p
=
(
2
n
)
1
3
2
n
+
2
(
2
n
/
3
)
#
2
n
#
<
(
2
n
)
1
3
2
n
+
2
2
2
⋅
2
n
/
3
−
3
6
<
(
2
n
)
1
3
2
n
+
2
2
4
n
/
3
−
5
.
Taking logarithms to get
2
3
n
log
2
<
1
3
2
n
log
2
n
+
3
log
n
2
and dividing both sides by
2
3
n
:
log
2
<
2
⋅
log
n
n
+
9
4
log
n
2
n
2
+
log
2
2
n
≡
f
(
n
)
.
Now the function
g
(
x
)
=
log
x
x
is decreasing for
x
≥
e
, so
f
(
n
)
is decreasing when
n
≥
e
2
>
2
e
. But
f
(
2
6
)
log
2
=
2
⋅
3
8
+
9
4
⋅
5
32
+
2
16
=
0.97
⋯
<
1
<
f
(
n
)
log
2
,
so
n
<
2
6
=
64
. The remaining cases are proven by an explicit list of primes, as above.
