Structural Proof of the Infinitude of Twin Primes via Modular Admissibility
Authors/Creators
Description
This paper presents a rigorous and elegant proof of the infinitude of twin primes, i.e.,
prime pairs (p, p+2) where both p and p+2 are prime. The method is based on a stable
arithmetic structure, the use of a universal sieve, a strictly positive density argument, and
a proof by contradiction. An experimental section strengthens the consistency of the
reasoning by testing more than 50,000 cases. The result establishes that the set of twin
primes is infinite, thereby addressing one of the oldest unsolved conjectures in
mathematics.
Files
Twin primes infinitude proof - Samuel Tomowiak 2025.pdf
Additional details
Dates
- Accepted
-
2025-05-21
References
- [1] G.H. Hardy & J.E. Littlewood, "Some Problems of 'Partitio Numerorum'; III: On the Expression of a Number as a Sum of Primes," Acta Mathematica, 1923.
- [2] R.C. Vaughan, The Hardy–Littlewood Method, Cambridge University Press.
- [3] T. Tao, "The Distribution of Prime Numbers," https://terrytao.wordpress.com.
- [4] T. Oliveira e Silva, "Computational Verification of Twin Prime Counts," http://www.ieeta.pt/~tos.