Contents

Brun's theorem

Theorem that the sum of the reciprocals of the twin primes converges

Innumber theory, Brun's theorem states that the sum of the reciprocals of the twin primes (pairs of prime numbers which differ by 2) converges to a finite value known as Brun's constant, usually denoted by B₂ (sequence A065421 in the OEIS). Brun's theorem was provedbyViggo Brun in 1919, and it has historical importance in the introduction of sieve methods.

Asymptotic bounds on twin primes[edit]

The convergence of the sum of reciprocals of twin primes follows from bounds on the density of the sequence of twin primes. Let ${\displaystyle \pi _{2}($x)} denote the number of primes p ≤ x for which p + 2 is also prime (i.e. ${\displaystyle \pi _{2}($x)} is the number of twin primes with the smaller at most x). Then, we have

${\displaystyle \pi _{2}($x)=O\!\left({\frac {x(\log \log x)^{2}}{(\log x)^{2}}}\right)\!.}

That is, twin primes are less frequent than prime numbers by nearly a logarithmic factor. This bound gives the intuition that the sum of the reciprocals of the twin primes converges, or stated in other words, the twin primes form a small set. In explicit terms, the sum

${\displaystyle \sum \limits _{p\,:\,p+2\in \mathbb {P} }{\left({{\frac {1}{p}}+{\frac {1}{p+2}}}\right)}=\left({{\frac {1}{3}}+{\frac {1}{5}}}\right)+\left({{\frac {1}{5}}+{\frac {1}{7}}}\right)+\left({{\frac {1}{11}}+{\frac {1}{13}}}\right)+\cdots }$

either has finitely many terms or has infinitely many terms but is convergent: its value is known as Brun's constant.

If it were the case that the sum diverged, then that fact would imply that there are infinitely many twin primes. Because the sum of the reciprocals of the twin primes instead converges, it is not possible to conclude from this result that there are finitely many or infinitely many twin primes. Brun's constant could be an irrational number only if there are infinitely many twin primes.

Numerical estimates[edit]

The series converges extremely slowly. Thomas Nicely remarks that after summing the first billion (10⁹) terms, the relative error is still more than 5%.^[1]

By calculating the twin primes up to 10¹⁴ (and discovering the Pentium FDIV bug along the way), Nicely heuristically estimated Brun's constant to be 1.902160578.^[1] Nicely has extended his computation to 1.6×10¹⁵ as of 18 January 2010 but this is not the largest computation of its type.

In 2002, Pascal Sebah and Patrick Demichel used all twin primes up to 10¹⁶ to give the estimate^[2] that B₂ ≈ 1.902160583104. Hence,

The last is based on extrapolation from the sum 1.830484424658... for the twin primes below 10¹⁶. Dominic Klyve showed conditionally (in an unpublished thesis) that B₂ < 2.1754 (assuming the extended Riemann hypothesis). It has been shown unconditionally that B₂ < 2.347.^[3]

There is also a Brun's constant for prime quadruplets. A prime quadruplet is a pair of two twin prime pairs, separated by a distance of 4 (the smallest possible distance). The first prime quadruplets are (5, 7, 11, 13), (11, 13, 17, 19), (101, 103, 107, 109). Brun's constant for prime quadruplets, denoted by B₄, is the sum of the reciprocals of all prime quadruplets:

${\displaystyle B_{4}=\left({\frac {1}{5}}+{\frac {1}{7}}+{\frac {1}{11}}+{\frac {1}{13}}\right)+\left({\frac {1}{11}}+{\frac {1}{13}}+{\frac {1}{17}}+{\frac {1}{19}}\right)+\left({\frac {1}{101}}+{\frac {1}{103}}+{\frac {1}{107}}+{\frac {1}{109}}\right)+\cdots }$

with value:

B₄ = 0.87058 83800 ± 0.00000 00005, the error range having a 99% confidence level according to Nicely.^[1]

This constant should not be confused with the Brun's constant for cousin primes, as prime pairs of the form (p, p + 4), which is also written as B₄. Wolf derived an estimate for the Brun-type sums B_n of 4/n.

Further results[edit]

Let ${\displaystyle C_{2}=0.6601\ldots }$ (sequence A005597 in the OEIS) be the twin prime constant. Then it is conjectured that

${\displaystyle \pi _{2}($x)\sim 2C_{2}{\frac {x}{(\log x)^{2}}}.}

In particular,

${\displaystyle \pi _{2}($x)<(2C_{2}+\varepsilon ){\frac {x}{(\log x)^{2}}}}

for every ${\displaystyle \varepsilon >0}$ and all sufficiently large x.

Many special cases of the above have been proved. Most recently, Jie Wu proved that for sufficiently large x,

${\displaystyle \pi _{2}($x)<4.5\,{\frac {x}{(\log x)^{2}}}}

where 4.5 corresponds to ${\displaystyle \varepsilon \approx 3.18}$ in the above.

In popular culture[edit]

The digits of Brun's constant were used in a bid of $1,902,160,540 in the Nortel patent auction. The bid was posted by Google and was one of three Google bids based on mathematical constants.^[4] Furthermore, academic research on the constant ultimately resulted in the Pentium FDIV bug becoming a notable public relations fiasco for Intel.^[5][6]

See also[edit]

• Divergence of the sum of the reciprocals of the primes
• Meissel–Mertens constant

Notes[edit]

References[edit]

External links[edit]

• Weisstein, Eric W. "Brun's Constant". MathWorld.
• Weisstein, Eric W. "Brun's Theorem". MathWorld.
• Brun's constantatPlanetMath.
• Sebah, Pascal and Xavier Gourdon, Introduction to twin primes and Brun's constant computation, 2002. A modern detailed examination.
• Wolf's article on Brun-type sums