Brun's Theorem
Jump to navigation
Jump to search
Theorem
The sum of the reciprocals of all the twin primes converges.
Proof
![]() | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Also see
Source of Name
This entry was named for Viggo Brun.
Historical Note
While Brun's Theorem proves that the sum of the reciprocals of all the twin primes converges, it has not yet been established what it actually converges to.
The number, whatever it is, is referred to as Brun's constant. Its best estimate is updated as and when the occasion demands.
As pointed out by David Wells in his Curious and Interesting Numbers of $1986$:
- Its value is exceedingly hard to calculate.
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $1 \cdotp 90195 \ldots$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $1 \cdotp 90216 \, 054 \ldots$