A Detailed Proof of the Strong Goldbach Conjecture Based on Partitions of a New Formulation of a Set of Even Numbers

Daniel Sankei *

Department of Mathematics, Meru University of Science and Technology, P. O. Box 972, Meru, Kenya.

Loyford Njagi

Department of Mathematics, Meru University of Science and Technology, P. O. Box 972, Meru, Kenya.

Josephine Mutembei

Department of Mathematics, Meru University of Science and Technology, P. O. Box 972, Meru, Kenya.

*Author to whom correspondence should be addressed.


Abstract

The Strong Goldbach's conjecture, a fundamental problem in Number Theory, asserts that every even integer greater than 2 can be expressed as the sum of two prime numbers. Despite significant efforts over centuries, this conjecture remains unproven, challenging the core of mathematics. The known algorithms for attempting to prove or verify the conjecture on a given interval [a,b] consist of finding two sets of primes Pi and Pj such that Pi+Pj cover all the even numbers in the interval [a,b]. However, the traditional definition of an even number as 2n for n ∈ ℕ (where ℕ is the set of natural numbers), has not provided mathematicians with a straightforward method to obtain all Goldbach partitions for any even number of this form. This paper introduces a novel approach to the problem, utilizing all odd partitions of an even number of a new formulation of the form Eij = n + nj + (nj - ni)n or alln ∈ ℕ. By demonstrating that there exist at least a pair of prime numbers in these odd partitions, the fact that the sum of any two prime numbers is even and there exists infinitely many prime numbers, this paper provides a compelling proof of the conjecture. This breakthrough not only solves a long-standing mathematical mystery but also sheds light on the structure of prime numbers.

Keywords: Goldbach conjecture, goldbach partition, even numbers, odd numbers, prime numbers, natural numbers


How to Cite

Sankei, D., Njagi, L., & Mutembei, J. (2024). A Detailed Proof of the Strong Goldbach Conjecture Based on Partitions of a New Formulation of a Set of Even Numbers. Asian Research Journal of Mathematics, 20(4), 8–17. https://doi.org/10.9734/arjom/2024/v20i4793

Downloads

Download data is not yet available.

References

Lemmermeyer F, Mattmüller M. Correspondence of leonhard euler with christian Goldbach; 2015.

Aouessare A, El Haddouchi A, Essaaidi M. A Rigorous Proof for the Strong Goldbach Conjecture. International Journal of Computer Applications. 2016;975:8887.

Barca RG. Every sufficiently large even number is the sum of two primes(with an alternative proof of Lemma 7.1); 2022. Available:https://hal.science/hal-03771421

Dawson Jr JW. Dawson JW. Why prove it again?: alternative proofs in mathematical practice. Birkhäuser; 2015.

Wang Y. A Proof of Goldbach Conjecture by Mirror-Prime Decomposition. WSEAS Transactions on Mathematics. 2022;21:563-571. Available:https://doi.org/10.37394/23206.2022.21.63

Jörg Richstein, "Verifying the Goldbach Conjecture up to 4 · 1014." Mathematics of Computation. 2001;70.236:1745-1749.

e Silva, Tomás Oliveira, Siegfried Herzog, and Silvio Pardi. "Empirical Verification of the Even Goldbach Conjecture and Computation of Prime Gaps up to 4·1018." Mathematics of Computation. 2014;2033-2060

Sankei D, Njagi L, Mutembei J. A New Formulation of a Set of Even Numbers. European Journal of Mathematics and Statistics. 2023;4(4):93-97.

Sankei D, Njagi L, Mutembei J. Partitioning an even number of the new formulation into all pairs of odd numbers. Journal of Mathematical Problems, Equations and Statistics. 2023;4(2):35-37. Available:https://doi.org/10.22271/math.2023.v4.i2a.104.

Daniel S, Njagi L, Mutembei J. A NUMERICAL VERIFICATION OF THE STRONG GOLDBACH CONJECTURE UP TO 9× 10^ 18. GPH-International Journal of Mathematics. 2023;6(11):28-37.

Sucic F. THE CIRCLE METHOD; 2018.

South JR. An algebraic approach to the goldbach conjecture. arXiv preprint arXiv:2206.01179.; 2022.

Bado IO. Demonstration of Goldbach Conjecture; 2018. Available:https://dx.doi.org/10.2139/ssrn.3097058

Zhang, Yitang. "Bounded Gaps Between Primes." Annals of Mathematics. 2014;1121-1174.

email: jrsouth@smu.edu.

Hirschhorn MD. There are infinitely many prime numbers. Australian Mathematical Society Gazette. 2002;29(2):103-103.

Available:https://en.wikipedia.org/wiki/Euclid%27s_theorem

Goldston DA. Are There Infinitely Many Primes?. arXiv preprint arXiv:0710.2123.; 2007.

Available:https://www.toppr.com/ask/question/prove-that-the-sum-of-two-odd-numbers-is-even/