The Strong Goldbach Conjecture: Proof for All Even Integers Greater than\n 362

2013/03/18 by Redha Bournas, Bournas, Redha
Mathematics · #Analytic Number Theory Research #FOS: Mathematics #General Mathematics (math.GM) #History and Theory of Mathematics

paper · pdf · doi:10.48550/arxiv.1303.4649

openalex publication_date 2013/03/18 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28

Abstract

The Strong Goldbach conjecture dates back to 1742. It states that every even\ninteger greater than four can be written as the sum of two prime numbers. Since\nthen, no one has been able to prove the conjecture. The only best known result\nso far is that every sufficiently large even integer N can be written as the\nsum of a prime number and the product of at most two prime numbers.\nAdditionally, the conjecture has been verified to be true for all even integers\nup to 4.10¹8. In this paper, we prove that the conjecture is true for all even\nintegers greater than 362.\n

Related

• Can We Prove Goldbach's Conjecture?
• Definitive Proof of Goldbach's conjecture
• The binary Goldbach conjecture is also true
• From the Goldbach Conjecture to the Theorem
• A proof of Goldbach's conjecture that all even numbers greater than four are the sum of two primes