Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Brun's Theorem

Number Theory

Brun's Theorem states that the sum of the reciprocals of the twin primes, pairs of primes differing by two, converges to a finite value, now called Brun's constant, even though it remains unknown whether infinitely many twin primes exist. Proved by Viggo Brun, it was among the first results of sieve theory and shows that the twin primes, whatever their ultimate number, are comparatively sparse among the primes generally.

Facts
Statement
The sum of the reciprocals of the twin primes, pairs of prime numbers differing by two, converges to a finite value known as Brun's constant, regardless of whether infinitely many twin primes exist. 1
Proof Year
1919 1
Classification
Statement Form
Existence Theorem 1
Connections

Has Statement Form

In Branch

Proved By

Source Brun's Theorem (Wikipedia)
Sources
1. Brun's Theorem (Wikipedia)
Wikimedia Foundation
  • Lead section
    In number theory, Brun's theorem states that the sum of the reciprocals of the twin primes converges to a finite value known as Brun's constant.
  • Lead section
    Brun's theorem was proved by Viggo Brun in 1919. It has historical importance in the introduction of sieve methods.
  • Proved By: Viggo Brun, Lead
    Brun's theorem was proved by Viggo Brun in 1919.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.