#jsDisabledContent { display:none; } My Account | Register | Help

# Brun's theorem

Article Id: WHEBN0002796181
Reproduction Date:

 Title: Brun's theorem Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Brun's theorem

The convergence to Brun's constant.

In number 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 B2 (sequence A065421 in OEIS). Brun's theorem was proved by Viggo Brun in 1919, and it has historical importance in the introduction of sieve methods.

## Contents

• Asymptotic bounds on twin primes 1
• Numerical estimates 2
• Further results 3
• Notes 5
• References 6

## Asymptotic bounds on twin primes

The convergence of the sum of reciprocals of twin primes follows from bounds on the density of the sequence of twin primes. Let \pi_2(x) denote the number of primes px for which p + 2 is also prime (i.e. \pi_2(x) is the number of twin primes with the smaller at most x). Then, for x ≥ 3, we have

\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. It follows from this bound 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

\sum\limits_{ p \, : \, p + 2 \in \mathbb{P} } {\left( {\frac{1}{p} + \frac{1}} \right)} = \left( {\frac{1}{3} + \frac{1}{5}} \right) + \left( {\frac{1}{5} + \frac{1}{7}} \right) + \left( {\frac{1} + \frac{1}} \right) + \cdots

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

The fact that the sum of the reciprocals of the prime numbers diverges implies that there are infinitely many prime numbers. 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

By calculating the twin primes up to 1014 (and discovering the Pentium FDIV bug along the way), Thomas R. Nicely heuristically estimated Brun's constant to be 1.902160578.[1] Nicely has extended his computation to 1.6×1015 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 1016 to give the estimate:

B2 ≈ 1.902160583104.

It is based on extrapolation from the sum 1.830484424658... for the twin primes below 1016. Dominic Klyve showed conditionally (in an unpublished thesis) that B2 < 2.1754 (assuming the extended Riemann hypothesis).[2]

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.[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 B4, is the sum of the reciprocals of all prime quadruplets:

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:

B4 = 0.87058 83800 ± 0.00000 00005, the error range having a 99% confidence level according to Nicely.[4]

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

## Further results

Let C_2=0.6601\ldots (sequence A005597 in OEIS) be the twin prime constant. Then it is conjectured that

\pi_2(x)\sim2C_2\frac{x}{(\log x)^2}.

In particular,

\pi_2(x)<(2C_2+\varepsilon)\frac{x}{(\log x)^2}

for every \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,

\pi_2(x) < 4.5 \frac {x}{(\log x)^2}

where 4.5 corresponds to \varepsilon\approx3.18 in the above.

## Notes

1. ^ Nicely, Thomas R. (18 January 2010). "Enumeration to 1.6*10^15 of the twin primes and Brun's constant". Some Results of Computational Research in Prime Numbers (Computational Number Theory). Retrieved 16 February 2010.
2. ^ Klyve, Dominic. "Explicit bounds on twin primes and Brun's Constant". Retrieved 13 May 2015.
3. ^ Damouni, Nadia (1 July 2011). "Dealtalk: Google bid "pi" for Nortel patents and lost". Reuters. Retrieved 6 July 2011.
4. ^ Nicely, Thomas R. (26 August 2008). of the prime quadruplets"1510×"Enumeration to 1.6. Some Results of Computational Research in Prime Numbers (Computational Number Theory). Retrieved 9 March 2009.

## References

• Cojocaru, Alina Carmen;
• Reprinted Providence, RI: Amer. Math. Soc., 1990.
• Contains a more modern proof.
• Wu, J. (2004). "Chen's double sieve, Goldbach's conjecture and the twin prime problem". Acta Arithmetica 114 (3): pp. 215–273. Category:CS1 maint: Extra text)