proof of Bertrand's postulate

In mathematics, Bertrand's postulate (actually a theorem) states that for each $n \ge 2$ there is a prime $p$ such that n. It was first proven by Chebyshev, and a short but advanced proof was given by Ramanujan.

The following elementary proof was published by Paul Erdős in 1932, as one of his earliest mathematical publications. The basic idea is to show that the central binomial coefficients need to have a prime factor within the interval $(n, 2n)$ in order to be large enough. This is achieved through analysis of the factorization of the central binomial coefficients.

The main steps of the proof are as follows. First, show that the contribution of every prime power factor $p^r$ in the prime decomposition of the central binomial coefficient $\textstyle\binom=\frac$ is at most $2n$. Then show that every prime larger than $\sqrt$ appears at most once.

The next step is to prove that $\tbinom$ has no prime factors in the interval $(\tfrac, n)$. As a consequence of these bounds, the contribution to the size of $\tbinom$ coming from the prime factors that are at most $n$ grows asymptotically as $\theta^$ for some $\theta<4$. Since the asymptotic growth of the central binomial coefficient is at least $4^n\!/2n$, the conclusion is that, by contradiction and for large enough $n$, the binomial coefficient must have another prime factor, which can only lie between $n$ and $2n$.

The argument given is valid for all $n \ge 468$. The remaining values of $n$ are by direct inspection, which completes the proof.

Lemmas in the proof

The proof uses the following four lemmas to establish facts about the primes present in the central binomial coefficients.

Lemma 1

For any integer $n>0$, we have
:$\frac \le \binom.$

Proof: Applying the binomial theorem,
:$4^n = (1 + 1)^ = \sum_^ \binom=2+\sum_^ \binom \le 2n\binom,$
since $\tbinom$ is the largest term in the sum in the right-hand side, and the sum has $2n$ terms (including the initial $2$ outside the summation).

Lemma 2

For a fixed prime $p$, define $R = R(n,p)$ to be the ''p''-adic order of $\tbinom$, that is, the largest natural number $r$ such that $p^r$ divides $\tbinom$.

For any prime $p$, $p^\le 2n$.

Proof: The exponent of $p$ in $n!$ is given by Legendre's formula
:$\sum_^\infty \left\lfloor \frac \right\rfloor\!,$
so
:$R =\sum_^\infty \left\lfloor \frac \right\rfloor - 2\sum_^\infty \left\lfloor \frac \right\rfloor =\sum_^\infty \left(\left\lfloor \frac \right\rfloor - 2\!\left\lfloor \frac \right\rfloor\right)\!.$
But each term of the last summation must be either zero (if $n/p^j \bmod 1< 1/2$) or one (if $n/p^j \bmod 1\ge 1/2$), and all terms with $j>\log_p(2n)$ are zero. Therefore,
:$R \leq \log_p(2n),$
and
:$p^R \leq p^ = 2n.$

Lemma 3

If $p$ is odd and $\frac < p \leq n$, then $R(n,p) = 0.$

Proof: There are exactly two factors of $p$ in the numerator of the expression $\tbinom=\tfrac$, coming from the two terms $p$ and $2p$ in $(2n)!$, and also two factors of $p$ in the denominator from one copy of the term $p$ in each of the two factors of $n!$. These factors all cancel, leaving no factors of $p$ in $\tbinom$. (The bound on $p$ in the preconditions of the lemma ensures that $3p$ is too large to be a term of the numerator, and the assumption that $p$ is odd is needed to ensure that $2p$ contributes only one factor of $p$ to the numerator.)

Lemma 4

An upper bound is supplied for the primorial function,
:$x\# = \prod_ p,$
where the product is taken over all ''prime'' numbers $p$ less than or equal to the real number $x$.

For all real numbers $x\ge 3$, $x\#<2^$.

Proof:
Since $x \# = \lfloor x \rfloor \#$ and $2^\le2^$, it suffices to prove the result under the assumption that $x = m$ is an integer, $m\ge3.$ Since $\binom$ is an integer and all the primes $m+1 \le p \le 2m-1$ appear in its numerator but not in its denominator, we have
:$\frac \le \binom = \frac\!\left(\binom + \binom\right) < \frac(1+1)^ = 2^.$
The proof proceeds by complete induction on $n.$
* If $n = 3$, then $n\# = 6 < 8 = 2^.$
* If $n = 4$, then $n\# = 6 < 32 = 2^.$
* If $n \ge 5$ is odd, $n=2m-1$, then by the above estimate and the induction assumption, since $m\ge3$ and m it is
:$n\# = (2m-1)\# < m\#\cdot2^ < 2^2^ = 2^ = 2^.$
* If $n=2m$ is even and $n \ge 6,$ then by the above estimate and the induction assumption, since $m\ge3$ and n-1 it is
:$n\# = (n-1)\# < 2^ < 2^$.

Only $x\# < 4^x$ is used in the proof.

Proof of Bertrand's Postulate

Assume that there is a counterexample: an integer ''n'' ≥ 2 such that there is no prime ''p'' with ''n'' < ''p'' < 2''n''.

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 the largest prime less than twice its predecessor) such that ''n'' < ''p'' < 2''n''. Therefore, ''n'' ≥ 468.

There are no prime factors ''p'' of $\textstyle\binom$ such that:
* 2''n'' < ''p'', because every factor must divide (2''n'')!;
* ''p'' = 2''n'', because 2''n'' is not prime;
* ''n'' < ''p'' < 2''n'', because we assumed there is no such prime number;
* 2''n'' / 3 < ''p'' ≤ ''n'': by Lemma 3.
Therefore, every prime factor ''p'' satisfies ''p'' ≤ 2''n'' / 3.

When $p > \sqrt,$ the number $\textstyle$ has at most one factor of ''p''. By Lemma 2, for any prime ''p'' we have ''p''^{''R''(''p'',''n'')} ≤ 2''n'', so the product of the ''p''^{''R''(''p'',''n'')} over the primes less than or equal to $\sqrt$ is at most $(2n)^$. Then, starting with Lemma 1 and decomposing the side into its prime factorization, and finally using Lemma 4, these bounds give:
:$\frac \le \binom = \left(\,\prod_ p^\right) \!\! \left(\prod_ p^\right) < (2n)^ \prod_ p = (2n)^ \left( \frac\right)\# \le (2n)^ 4^.$
Taking logarithms yields to
:$n \le (\sqrt+1)\log 2n\; .$
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.

Addendum to proof

It is possible to reduce the bound for ''n'' to $n=82$.

Lemma 1 can be expressed as

$\frac \le \binom$

for $n \ge 13$, and because $\frac<\frac$ for $n \ge 13$, we can say that the product $p^R$ is at most $(2n)^$, which gives

:$n \le\! \left(\sqrt+1\right)\log 2n \;$

which is true for $n=81$ and false for $n=82$.

References

External links

* Chebyshev's Theorem and Bertrand's Postulate (Leo Goldmakher): https://web.williams.edu/Mathematics/lg5/Chebyshev.pdf
* Proof of Bertrand’s Postulate (UW Math Circle): https://sites.math.washington.edu/~mathcircle/circle/2013-14/advanced/mc-13a-w10.pdf
* Proof in the Mizar system: http://mizar.org/version/current/html/nat_4.html#T56
*

{{DEFAULTSORT:Bertrands postulate, proof of
Prime numbers
Factorial and binomial topics
Article proofs
Theorems about prime numbers