BRUN'S CONSTANT
In 1919 Viggo Brun showed that the sum of the reciprocals of the twin primes (pairs of prime numbers which differ by 2) converges to a mathematical constant now called 'Brun's constant for twin primes' and usually denoted by ''B''2 :
:
in stark contrast to the fact that the sum of the reciprocals of all primes is divergent. Had this series diverged, we would have a proof of the twin prime conjecture. But since it converges, we do not yet know if there are infinitely many twin primes. Similarly, if it were ever to be proved that Brun's constant was irrational, the twin primes conjecture would follow immediately, whereas a proof that it is rational wouldn't decide it either way.
Brun's sieve was refined by J.B. Rosser, G. Ricci and others.
By calculating the twin primes up to 1014 (and discovering the infamous Pentium FDIV bug along the way), Thomas R. Nicely heuristically estimated Brun's constant to be 1.902160578. The best estimate to date was given by Pascal Sebah and Patrick Demichel in 2002, using all twin primes up to 1016:
: ''B''2 ≈ 1.902160583104.
While 1.9 < ''B''2 is shown, no real number N is known such that ''B''2 < N.
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''4, is the sum of the reciprocals of all prime quadruplets:
:
with value:
:''B''4 = 0.87058 83800 ± 0.00000 00005.
This constant should not be confused with the 'Brun's constant for cousin primes', prime pairs of the form (''p'', ''p'' + 4), which is also written as ''B''4. Wolf derived an estimate for the Brun-type sums ''B''n of 4/''n''. This gives the estimate for ''B''n of 2, about 5% higher than the true value.
★ Twin prime conjecture
★ Meissel-Mertens constant
★ Nicely's article on twins enumeration and Brun's constant
★ Computation of Brun's constant
★
★
★ Wolf's article on Brun-type sums
:
in stark contrast to the fact that the sum of the reciprocals of all primes is divergent. Had this series diverged, we would have a proof of the twin prime conjecture. But since it converges, we do not yet know if there are infinitely many twin primes. Similarly, if it were ever to be proved that Brun's constant was irrational, the twin primes conjecture would follow immediately, whereas a proof that it is rational wouldn't decide it either way.
Brun's sieve was refined by J.B. Rosser, G. Ricci and others.
By calculating the twin primes up to 1014 (and discovering the infamous Pentium FDIV bug along the way), Thomas R. Nicely heuristically estimated Brun's constant to be 1.902160578. The best estimate to date was given by Pascal Sebah and Patrick Demichel in 2002, using all twin primes up to 1016:
: ''B''2 ≈ 1.902160583104.
While 1.9 < ''B''2 is shown, no real number N is known such that ''B''2 < N.
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''4, is the sum of the reciprocals of all prime quadruplets:
:
with value:
:''B''4 = 0.87058 83800 ± 0.00000 00005.
This constant should not be confused with the 'Brun's constant for cousin primes', prime pairs of the form (''p'', ''p'' + 4), which is also written as ''B''4. Wolf derived an estimate for the Brun-type sums ''B''n of 4/''n''. This gives the estimate for ''B''n of 2, about 5% higher than the true value.
| Contents |
| See also |
| External links |
See also
★ Twin prime conjecture
★ Meissel-Mertens constant
External links
★ Nicely's article on twins enumeration and Brun's constant
★ Computation of Brun's constant
★
★
★ Wolf's article on Brun-type sums
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
ä¸å›½
Français
Deutsch
Ελληνική
हिनà¥à¤¦à¥€
Italiano
日本語
Português
РуÑÑкий
Español