# Divergence of the sum of the reciprocals of the primes

(Redirected from Proof that the sum of the reciprocals of the primes diverges)

The sum of the reciprocal of the primes increasing without bound. The x axis is in log scale, showing that the divergence is very slow. The red function is a lower bound that also diverges.

The sum of the reciprocals of all prime numbers diverges; that is:

${\displaystyle \sum _{p{\text{ prime}}}{\frac {1}{p}}={\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{5}}+{\frac {1}{7}}+{\frac {1}{11}}+{\frac {1}{13}}+{\frac {1}{17}}+\cdots =\infty }$

This was proved by Leonhard Euler in 1737,[1] and strengthens (i.e. it gives more information than) Euclid's 3rd-century-BC result that there are infinitely many prime numbers.

There are a variety of proofs of Euler's result, including a lower bound for the partial sums stating that

${\displaystyle \sum _{\scriptstyle p{\text{ prime}} \atop \scriptstyle p\leq n}{\frac {1}{p}}\geq \ln \ln(n+1)-\ln {\frac {\pi ^{2}}{6}}}$

for all natural numbers n. The double natural logarithm (ln ln) indicates that the divergence might be very slow, which is indeed the case. See Meissel–Mertens constant.

## The harmonic series

First, we describe how Euler originally discovered the result. He was considering the harmonic series

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n}}=1+{\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{4}}+\cdots =\infty }$

He had already used the following "product formula" to show the existence of infinitely many primes.

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n}}=\prod _{p}\left(1+{\frac {1}{p}}+{\frac {1}{p^{2}}}+\cdots \right)=\prod _{p}{\frac {1}{1-p^{-1}}}}$

Here the product is taken over the set of all primes.

Such infinite products are today called Euler products. The product above is a reflection of the fundamental theorem of arithmetic. Euler noted that if there were only a finite number of primes, then the product on the right would clearly converge, contradicting the divergence of the harmonic series.

## Proofs

### Euler's proof

Euler considered the above product formula and proceeded to make a sequence of audacious leaps of logic. First, he took the natural logarithm of each side, then he used the Taylor series expansion for ln x as well as the sum of a converging series:

{\displaystyle {\begin{aligned}\ln \left(\sum _{n=1}^{\infty }{\frac {1}{n}}\right)&{}=\ln \left(\prod _{p}{\frac {1}{1-p^{-1}}}\right)=-\sum _{p}\ln \left(1-{\frac {1}{p}}\right)\\[5pt]&=\sum _{p}\left({\frac {1}{p}}+{\frac {1}{2p^{2}}}+{\frac {1}{3p^{3}}}+\cdots \right)\\[5pt]&=\sum _{p}{\frac {1}{p}}+{\frac {1}{2}}\sum _{p}{\frac {1}{p^{2}}}+{\frac {1}{3}}\sum _{p}{\frac {1}{p^{3}}}+{\frac {1}{4}}\sum _{p}{\frac {1}{p^{4}}}+\cdots \\[5pt]&=A+{\frac {1}{2}}B+{\frac {1}{3}}C+{\frac {1}{4}}D+\cdots \\[5pt]&=A+K\end{aligned}}}

for a fixed constant K < 1. Then he invoked the relation

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n}}=\ln \infty ,}$

which he explained, for instance in a later 1748 work,[2] by setting x = 1 in the Taylor series expansion

${\displaystyle \ln \left({\frac {1}{1-x}}\right)=\sum _{n=1}^{\infty }{\frac {x^{n}}{n}}.}$

This allowed him to conclude that

${\displaystyle A={\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{5}}+{\frac {1}{7}}+{\frac {1}{11}}+\cdots =\ln \ln \infty .}$

It is almost certain that Euler meant that the sum of the reciprocals of the primes less than n is asymptotic to ln ln n as n approaches infinity. It turns out this is indeed the case, and a more precise version of this fact was rigorously proved by Franz Mertens in 1874.[3] Thus Euler obtained a correct result by questionable means.

### Erdős's proof by upper and lower estimates

The following proof by contradiction is due to Paul Erdős.

Let pi denote the ith prime number. Assume that the sum of the reciprocals of the primes converges; i.e.,

${\displaystyle \sum _{i=1}^{\infty }{\frac {1}{p_{i}}}<\infty }$

Then there exists a smallest positive integer k such that

${\displaystyle \sum _{i=k+1}^{\infty }{\frac {1}{p_{i}}}<{\frac {1}{2}}\qquad (1)}$

For a positive integer x, let Mx denote the set of those n in {1, 2, …, x} which are not divisible by any prime greater than pk (or equivalently all nx which are a product of powers of primes pipk). We will now derive an upper and a lower estimate for |Mx|, the number of elements in Mx. For large x, these bounds will turn out to be contradictory.

Upper estimate:

Every n in Mx can be written as n = m2r with positive integers m and r, where r is square-free. Since only the k primes p1, …, pk can show up (with exponent 1) in the prime factorization of r, there are at most 2k different possibilities for r. Furthermore, there are at most x possible values for m. This gives us the upper estimate
${\displaystyle |M_{x}|\leq 2^{k}{\sqrt {x}}\qquad (2)}$

Lower estimate:

The remaining x − |Mx| numbers in the set difference {1, 2, …, x} \ Mx are all divisible by a prime greater than pk. Let Ni,x denote the set of those n in {1, 2, …, x} which are divisible by the ith prime pi. Then
${\displaystyle \{1,2,\ldots ,x\}\smallsetminus M_{x}=\bigcup _{i=k+1}^{\infty }N_{i,x}}$
Since the number of integers in Ni,x is at most x/pi (actually zero for pi > x), we get
${\displaystyle x-|M_{x}|\leq \sum _{i=k+1}^{\infty }|N_{i,x}|<\sum _{i=k+1}^{\infty }{\frac {x}{p_{i}}}}$
Using (1), this implies
${\displaystyle {\frac {x}{2}}<|M_{x}|\qquad (3)}$

This produces a contradiction: when x ≥ 22k + 2, the estimates (2) and (3) cannot both hold, because x/2 ≥ 2kx.

### Proof that the series exhibits log-log growth

Here is another proof that actually gives a lower estimate for the partial sums; in particular, it shows that these sums grow at least as fast as ln ln n. The proof is an adaptation of the product expansion idea of Euler. In the following, a sum or product taken over p always represents a sum or product taken over a specified set of primes.

The proof rests upon the following four inequalities:

• Every positive integer i can be uniquely expressed as the product of a square-free integer and a square. This gives the inequality
${\displaystyle \sum _{i=1}^{n}{\frac {1}{i}}\leq \prod _{p\leq n}\left(1+{\frac {1}{p}}\right)\sum _{k=1}^{n}{\frac {1}{k^{2}}}}$
where for every i between 1 and n the (expanded) product corresponds to the square-free part of i and the sum corresponds to the square part of i (see fundamental theorem of arithmetic).
{\displaystyle {\begin{aligned}\ln(n+1)&=\int _{1}^{n+1}{\frac {dx}{x}}\\&=\sum _{i=1}^{n}\underbrace {\int _{i}^{i+1}{\frac {dx}{x}}} _{{}\,<\,{\frac {1}{i}}}\\&<\sum _{i=1}^{n}{\frac {1}{i}}\end{aligned}}}
• The lower estimate 1 + x < exp(x) for the exponential function, which holds for all x > 0.
• Let n ≥ 2. The upper bound (using a telescoping sum) for the partial sums (convergence is all we really need)
{\displaystyle {\begin{aligned}\sum _{k=1}^{n}{\frac {1}{k^{2}}}&<1+\sum _{k=2}^{n}\underbrace {\left({\frac {1}{k-{\frac {1}{2}}}}-{\frac {1}{k+{\frac {1}{2}}}}\right)} _{=\,{\frac {1}{k^{2}-{\frac {1}{4}}}}\,>\,{\frac {1}{k^{2}}}}\\&=1+{\frac {2}{3}}-{\frac {1}{n+{\frac {1}{2}}}}<{\frac {5}{3}}\end{aligned}}}

Combining all these inequalities, we see that

{\displaystyle {\begin{aligned}\ln(n+1)&<\sum _{i=1}^{n}{\frac {1}{i}}\\&\leq \prod _{p\leq n}\left(1+{\frac {1}{p}}\right)\sum _{k=1}^{n}{\frac {1}{k^{2}}}\\&<{\frac {5}{3}}\prod _{p\leq n}\exp \left({\frac {1}{p}}\right)\\&={\frac {5}{3}}\exp \left(\sum _{p\leq n}{\frac {1}{p}}\right)\end{aligned}}}

Dividing through by 5/3 and taking the natural logarithm of both sides gives

${\displaystyle \ln \ln(n+1)-\ln {\frac {5}{3}}<\sum _{p\leq n}{\frac {1}{p}}}$

as desired.

Using

${\displaystyle \sum _{k=1}^{\infty }{\frac {1}{k^{2}}}={\frac {\pi ^{2}}{6}}}$

(see the Basel problem), the above constant ln 5/3 = 0.51082… can be improved to ln π2/6 = 0.4977…; in fact it turns out that

${\displaystyle \lim _{n\to \infty }\left(\sum _{p\leq n}{\frac {1}{p}}-\ln \ln n\right)=M}$

where M = 0.261497… is the Meissel–Mertens constant (somewhat analogous to the much more famous Euler–Mascheroni constant).

### Proof from Dusart's inequality

From Dusart's inequality, we get

${\displaystyle p_{n}

Then

{\displaystyle {\begin{aligned}\sum _{n=1}^{\infty }{\frac {1}{p_{n}}}&\geq \sum _{n=6}^{\infty }{\frac {1}{p_{n}}}\\&\geq \sum _{n=6}^{\infty }{\frac {1}{n\ln n+n\ln \ln n}}\\&\geq \sum _{n=6}^{\infty }{\frac {1}{2n\ln n}}=\infty \end{aligned}}}

by the integral test for convergence. This shows that the series on the left diverges.

## Partial sums

While the partial sums of the reciprocals of the primes eventually exceed any integer value, they never equal an integer.

One proof[4] is by induction: The first partial sum is 1/2, which has the form odd/even. If the nth partial sum (for n ≥ 1) has the form odd/even, then the (n + 1)st sum is

${\displaystyle {\frac {\text{odd}}{\text{even}}}+{\frac {1}{p_{n+1}}}={\frac {{\text{odd}}\cdot p_{n+1}+{\text{even}}}{{\text{even}}\cdot p_{n+1}}}={\frac {{\text{odd}}+{\text{even}}}{\text{even}}}={\frac {\text{odd}}{\text{even}}}}$

as the (n + 1)st prime pn + 1 is odd; since this sum also has an odd/even form, this partial sum cannot be an integer (because 2 divides the denominator but not the numerator), and the induction continues.

Another proof rewrites the expression for the sum of the first n reciprocals of primes (or indeed the sum of the reciprocals of any set of primes) in terms of the least common denominator, which is the product of all these primes. Then each of these primes divides all but one of the numerator terms and hence does not divide the numerator itself; but each prime does divide the denominator. Thus the expression is irreducible and is non-integer.