MathLabs

Open problem, Arithmetic and number theory, posed 1904

Infinitude of Sophie Germain primes

Open

There are infinitely many prime numbers pp such that 2p+12p+1 is also prime.

Research frontier as of 2026

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 (nn and 2n+12n+1). Weighted sieve methods prove that there are infinitely many primes pp such that 2p+12p+1 is an almost-prime with at most two prime factors (P2P_2), 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 2p+12p+1. Furthermore, because the linear forms nn and 2n+12n+1 have different leading coefficients, the Maynard–Tao bounded-gaps machinery does not directly yield pairs of primes of the exact form (p,2p+1)(p, 2p+1).

Best known results

  • There are infinitely many primes pp such that 2p+12p+1 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 xx is O(x/(log⁡x)2)O(x / (\log x)^2), matching the order of magnitude of the Hardy–Littlewood heuristic.

Tools and where they stop

ToolAchievedWhere it stops
Weighted linear sieve (Chen's method)Proves infinitely many primes pp have 2p+12p+1 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 heuristicsPredicts the precise asymptotic count 2C2x/(log⁡x)22C_2 x / (\log x)^2, closely confirmed by numerical counts up to 101310^{13} and beyond.For binary problems like (p,2p+1)(p, 2p+1), minor-arc exponential sums cannot be controlled unconditionally.

Open questions

  • Are there infinitely many Sophie Germain primes, and does their count below xx asymptotically equal 2C2x/(log⁡x)22C_2 x / (\log x)^2?
  • Do there exist Cunningham chains of the first kind of arbitrary finite length?

References

  1. Leonard E. Dickson (1904). A new extension of Dirichlet's theorem on prime numbers · DOI:10.1017/cbo9781139164986.005
  2. 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
  3. Paulo Ribenboim (1996). The New Book of Prime Number Records