TOPICS
Search

Brun's Theorem


Brun's theorem states that the sum of the reciprocals of all twin primes converges. Let P denote the set of primes and define

 P_2={p in P:p+2 in P},
(1)

so P_2 is the set of smaller members p of the twin-prime pairs. Define its counting function by

 pi_2(x)=#{p<=x:p in P_2}.
(2)

Brun's sieve gives the big-O notation estimate

 pi_2(x)<<(x(lnlnx)^2)/((lnx)^2).
(3)

This estimate is strong enough to force convergence. In fact, summation by parts gives

 sum_(p<=x; p in P_2)1/p=(pi_2(x))/x+int_2^x(pi_2(t))/(t^2)dt,
(4)

and the bound makes the integral converge as x->infty. Since 1/(p+2)<1/p, it follows that

 B_2=sum_(p in P_2)(1/p+1/(p+2))<infty.
(5)

Brun proved the result using a new form of sieve argument (Brun 1919). The conclusion holds whether P_2 is finite or infinite, so the theorem does not decide whether there are infinitely many twin primes. That assertion is the unproved twin prime conjecture.


See also

Brun's Constant, Twin Prime Conjecture, Twin Primes

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Brun, V. "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+..., les dénominateurs sont nombres premiers jumeaux est convergente ou finie." Bull. Sci. Math. 43, 100-104 and 124-128, 1919.Halberstam, H. and Richert, H.-E. Sieve Methods. New York: Academic Press, 1974.Landau, E. Elementare Zahlentheorie. Leipzig, Germany: Hirzel, 1927. Reprinted Providence, RI: Amer. Math. Soc., 1990.Veritasium. "We're 99.9% Sure This Pattern Is True, but No One Can Prove It." Jun. 14, 2026. https://www.youtube.com/watch?v=8HBDE-msUjw.

Referenced on Wolfram|Alpha

Brun's Theorem

Cite this as:

Weisstein, Eric W. "Brun's Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BrunsTheorem.html

Subject classifications