A Revised Elementary Proof of Goldbach’s Conjecture (Strong Case)
DAVID COLE*
Abstract—This paper presents a revised
elementary proof of Goldbach’s Conjecture (Strong
Case) The conjecture states that every even integer
greater than two is the sum of two primes. The
method of proof is direct and simple. The proof
assumes that there exists sufficient evidence from
direct computation of Goldbach’s partitions up to
and including even integers of order 10^17 and
from some computations of randomly selected even
integers of far greater magnitude. In addition, the
principle of symmetry, Bertrand’s Theorem, and
Euclid Theorem support the proof.
Keywords—number theory.
I. INTRODUCTION
four is the sum of two primes.
This paper presents an elementary proof of the
Goldbach’s Conjecture first proposed by the
Prussian mathematician, Christian Goldbach, in a
letter to Leonhard Euler in 1742. Its equivalent
statement as given by Euler states that every even
integer greater than two is the sum of two primes.
II. PROOF OF GOLDBACH’S CONJECTURE (STRONG
CASE)
Let e > 10^17 be an even integer, and let e > p
> q be any odd positive primes such that
(II.1) e = p + q is doubtful.
For e < 10^17, we know that
(II.2) e/2 = p +q.
Therefore,
e = 2e/2 = e*/2 = Q +P.
Q > P are primes.
Since inductively,
e* = 2p +2q = p+q+p+q
= (p+q+x) + (p+q-x)
= Q* + P* are primes for some integer x>0.
Thus, all even integers greater than or equal to
III. CONCLUSION
The proof is trivially simple but subtle. And if
we can see the proof as a definition, we may find
it more acceptable. Moreover, we may see it as a
definition of primality and more...
By studying the conjecture, we may come to
see the relationship between the distribution,
calculation, and determination of primes. And the
added incentive is the development of an
efficient algorithm for the factorization of very
large composites.
“Don’t fret over the fewer golden nuggets ahead when
there are so many left behind. Nature has efficiently
provided what is needed. Don’t you see. Symmetry is the
key. Bertrand and Euclid will second this.
 And though the pickings may be sparse on the very
rocky road ahead, it is nonetheless worthwhile when the
opportunity of an uncommon even rears its head. More
golden nuggets are near. Don’t you see.

Goldbach and Euler tell us to be faithful but prudent.

Trust is not enough so calculate and gather wealth . And
be thankful for all the good there is… .”

General Solution Theorem: “There is no problem if one can drop it.”

* david.cole@wayne.edu