Open problem, Arithmetic and number theory, posed 1904
Infinitude of Sophie Germain primes
There are infinitely many prime numbers such that is also prime.
As of 2026, the infinitude of Sophie Germain primes remains completely open. Like the twin prime conjecture, the problem asks for simultaneous prime values of two linear forms ( and ). Weighted sieve methods prove that there are infinitely many primes such that is an almost-prime with at most two prime factors (), and that the sum of reciprocals of Sophie Germain primes converges. However, the sieve-theoretic parity barrier prevents existing methods from distinguishing primes from products of two primes in . Furthermore, because the linear forms and have different leading coefficients, the Maynard–Tao bounded-gaps machinery does not directly yield pairs of primes of the exact form .
Best known results
- There are infinitely many primes such that has at most two prime factors (Chen-type theorem via weighted linear sieve).
- Upper bound sieve estimates show the number of Sophie Germain primes up to is , matching the order of magnitude of the Hardy–Littlewood heuristic.
Tools and where they stop
| Tool | Achieved | Where it stops |
|---|---|---|
| Weighted linear sieve (Chen's method) | Proves infinitely many primes have either prime or a product of two primes. | Cannot eliminate products of two primes due to the parity barrier in sieve theory. |
| Hardy–Littlewood circle method and prime-tuple heuristics | Predicts the precise asymptotic count , closely confirmed by numerical counts up to and beyond. | For binary problems like , minor-arc exponential sums cannot be controlled unconditionally. |
Open questions
- Are there infinitely many Sophie Germain primes, and does their count below asymptotically equal ?
- Do there exist Cunningham chains of the first kind of arbitrary finite length?
References
- Leonard E. Dickson (1904). A new extension of Dirichlet's theorem on prime numbers · DOI:10.1017/cbo9781139164986.005
- G. H. Hardy, J. E. Littlewood (1923). Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes · DOI:10.1007/BF02403921
- Paulo Ribenboim (1996). The New Book of Prime Number Records