What question did this study set out to answer?

The aim is to provide an elementary proof of Goldbach's strong conjecture regarding even integers.

February 9, 2026Open Access

A Proof of Goldbach's Strong Conjecture

Key Points

The aim is to provide an elementary proof of Goldbach's strong conjecture regarding even integers.
Establish a rigorous lower bound on representations of even integers as sums of two primes.
Show that every even integer greater than or equal to 320 has at least one representation.
Combine findings with computational verifications up to 4x10^18.
Every even integer ≥ 320 can be expressed as the sum of two primes.
The result confirms Goldbach's conjecture for all even integers.

Abstract

This work presents an elementary proof of the strong Goldbach conjecture. It establishes a rigorous lower bound on the number of representations of an even integer as a sum of two primes. The proof shows that every even integer greater than or equal to 320 has at least one such representation. Combined with existing computational verification of the conjecture up to 4x10¹8, this result confirms the conjecture for all even integers.

Read Full Paperexternally

AIに質問

Bookmark

View Full Paper

Cite This Study

Emily Condit (Mon,) studied this question.

synapsesocial.com/papers/69897a14f0ec2af6756e860c https://doi.org/https://doi.org/10.5281/zenodo.18519674