Published June 15, 2025
| Version v1
Publication
Restricted
On Goldbach Conjecture
Authors/Creators
Description
This paper presents a proof of Goldbach's Conjecture by modeling the problem as a connectivity theorem in an additive graph constructed from the prime number set. Using a contradiction-based strategy and leveraging modern prime gap bounds, we demonstrate that every even integer must be the sum of two primes. The argument is supported by computational verification and analytic number theory, culminating in a contradiction that no such gap-based counterexample can exist.
Files
Restricted
The record is publicly accessible, but files are restricted. <a href="https://zenodo.org/account/settings/login?next=https://zenodo.org/records/15666884">Log in</a> to check if you have access.
Additional details
Dates
- Copyrighted
-
2025-06-15
References
- • Oliveira e Silva, T., Herzog, S., & Pardi, S. (2014). Empirical verification of the even Goldbach conjecture and computation of prime gaps up to . Mathematics of Computation, 83(288), 2033–2060. https://doi.org/10.1090/S0025-5718-2013-02787-X
- • Dusart, P. (2010). Estimates of some functions over primes without RH. arXiv preprint arXiv:1002.0442.
- • Hardy, G. H., & Littlewood, J. E. (1923). Some Problems of 'Partitio Numerorum' III: On the Expression of a Number as a Sum of Primes. Acta Mathematica, 44(1), 1–70.
- • Rosser, J. B., & Schoenfeld, L. (1962). Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, 6(1), 64–94.
- • Chebyshev, P. L. (1852); Erd\u0151s, P. (1932). Beweis eines Satzes von Tschebyschef. Acta Sci. Math. (Szeged), 5, 194–198.