[Paper Review] Some history about Twin Prime Conjecture

Sadegh Nazardonyavi|arXiv (Cornell University)|May 3, 2012

Advanced Mathematical Theories5 references3 citations

TL;DR

This paper provides a historical survey of the twin prime conjecture, tracing its development from early conjectures to modern computational advances. It reviews key results including Brun’s theorem, Chen's theorem, and extensive prime counting calculations, highlighting the enduring difficulty of proving infinitude of twin primes despite strong numerical evidence and partial progress.

ABSTRACT

This article is a collected information from some books and papers, and in most cases the original sentences is reserved about twin prime conjecture.

Motivation & Objective

• To compile and present a comprehensive historical account of the twin prime conjecture and related prime number problems.
• To document the evolution of mathematical understanding and computational verification of twin primes over time.
• To highlight major theoretical advances and open problems, including the twin prime conjecture, Goldbach's conjecture, and Landau’s problems.
• To summarize numerical computations of twin prime counts up to large bounds, such as π₂(1.37×10¹⁴), and the discovery of large twin primes.
• To emphasize the persistent difficulty of proving the twin prime conjecture despite significant partial results and computational verification.

Proposed method

• Compilation of historical results and conjectures from primary sources, including works by Brun, Hardy and Littlewood, Selmer, and others.
• Presentation of key theorems such as Brun’s theorem on the convergence of the sum of reciprocals of twin primes.
• Use of asymptotic formulas and constants like C_twin to model twin prime density and relate it to the Goldbach conjecture.
• Analysis of computational records, including π₂(x) values up to x = 1.37×10¹⁴, based on calculations by Brent, Nicely, and others.
• Incorporation of results from Chen (1973) on almost primes and Ramaré’s theorem on the sum of six or fewer primes.
• Use of heuristic and probabilistic models to support the extended twin prime and Goldbach conjectures, including the role of the twin prime constant C_twin.

Experimental results

Research questions

• RQ1 Are there infinitely many twin primes, and what evidence supports or challenges this conjecture?
• RQ2 How do the distributions of twin primes and primes in general relate to other classical problems in number theory?
• RQ3 What is the current status of computational verification of the twin prime conjecture up to large bounds?
• RQ4 To what extent can partial results, such as Chen’s theorem, be seen as progress toward proving the full twin prime conjecture?
• RQ5 Why do certain problems like the twin prime conjecture and Goldbach’s conjecture remain unsolved despite extensive research and computational verification?

Key findings

• The number of twin primes below 1.37×10¹⁴ is exactly π₂(1.37×10¹⁴) = 182,312,485,795, as computed independently by M. Kutrib and J. Richstein and confirmed by T.R. Nicely.
• The largest known twin primes as of 2002 are 33218925·2¹⁶⁹⁶⁹⁰±1, each with 51,090 digits.
• Chen's theorem establishes that every sufficiently large even integer can be written as the sum of a prime and a number with at most two prime factors.
• Ramaré proved that every even integer can be expressed as the sum of at most six primes, improving on Schnirelmann’s bound.
• The twin prime constant C_twin ≈ 0.670927 is central to both the extended twin prime and extended Goldbach conjectures.
• Despite extensive computation, no prime gap of size 796 has been found, suggesting that not all even gap sizes occur between consecutive primes.