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

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 p ≤ x 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}{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.

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

The series converges extremely slowly. Thomas Nicely remarks that after summing the first one 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.^[2] 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:^[3]

B₂ ≈ 1.902160583104.

It 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.^[4]

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:

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.^[5]

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

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

\pi _{2}(x)\sim 2C_{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 \approx 3.18$ in the above.

In popular culture

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.^[6]

Notes

↑ 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.
↑ 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.
↑ Sebah, Pascal; Gourdon, Xavier. "Introduction to twin primes and Brun's constant computation". Retrieved 5 January 2018.
↑ Klyve, Dominic. "Explicit bounds on twin primes and Brun's Constant". Retrieved 13 May 2015.
↑ Nicely, Thomas R. (26 August 2008). "Enumeration to 1.6×10¹⁵ of the prime quadruplets". Some Results of Computational Research in Prime Numbers (Computational Number Theory). Retrieved 9 March 2009.
↑ Damouni, Nadia (1 July 2011). "Dealtalk: Google bid "pi" for Nortel patents and lost". Reuters. Retrieved 6 July 2011.

References

Brun, Viggo (1915). "Über das Goldbachsche Gesetz und die Anzahl der Primzahlpaare". Archiv for Mathematik og Naturvidenskab. B34 (8).
Brun, Viggo (1919). "La série 1/5+1/7+1/11+1/13+1/17+1/19+1/29+1/31+1/41+1/43+1/59+1/61+..., où les dénominateurs sont nombres premiers jumeaux est convergente ou finie". Bulletin des Sciences Mathématiques (in French). 43: 100–104, 124–128.
Cojocaru, Alina Carmen; Murty, M. Ram (2005). An introduction to sieve methods and their applications. London Mathematical Society Student Texts. 66. Cambridge University Press. pp. 73–74. ISBN 0-521-61275-6.
Landau, E. (1927). Elementare Zahlentheorie. Leipzig, Germany: Hirzel. Reprinted Providence, RI: Amer. Math. Soc., 1990.
LeVeque, William Judson (1996). Fundamentals of Number Theory. New York City: Dover Publishing. pp. 1–288. ISBN 0-486-68906-9. Contains a more modern proof.
Wu, J. (2004) [24 Sep 2007]. "Chen's double sieve, Goldbach's conjecture and the twin prime problem". Acta Arithmetica. 114 (3): 215–273. arXiv:0705.1652. Bibcode:2004AcAri.114..215W. doi:10.4064/aa114-3-2.

External links

Weisstein, Eric W. "Brun's Constant". MathWorld.
Weisstein, Eric W. "Brun's Theorem". MathWorld.
Brun's constant at PlanetMath.org.
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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[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] 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.

[3] Sebah, Pascal; Gourdon, Xavier. "Introduction to twin primes and Brun's constant computation". Retrieved 5 January 2018.

[4] Klyve, Dominic. "Explicit bounds on twin primes and Brun's Constant". Retrieved 13 May 2015.

[5] Nicely, Thomas R. (26 August 2008). "Enumeration to 1.6×10¹⁵ of the prime quadruplets". Some Results of Computational Research in Prime Numbers (Computational Number Theory). Retrieved 9 March 2009.

[6] Damouni, Nadia (1 July 2011). "Dealtalk: Google bid "pi" for Nortel patents and lost". Reuters. Retrieved 6 July 2011.