Proof Of Binary Goldbach’s Conjecture In A Poem

The binary Goldbach’s conjecture says that
Every even integer great than 2
Is the sum of two primes

Who says that it is hard to prove?
Here we skitch a proof

Let
n be any even integer greater than 2

Let
n be the sum of
An integer d1
And a prime p1

If
d1 is even
And likewise
p1 is even
It must be that
d1 is 2
And
p1 is 2

As
2 is prime
Thus
n is the sum of two primes
Hence Q.E.D.

If
d1 is odd and a prime
As
p1 is already a prime
Thus
n is the sum of two primes
Hence QED

If
d1 is odd but not a prime
We can write d1
Is the sum of
An integer d2
And a prime p2

Thus, the original n
Is now the sum of three integers
We note that
One integer is the prime p1
And the other integer is the prime p2
And the third integer is d2

As
p1 is odd
Also
p2 is odd
It must be that
d2 is even
Because the original n
Is even

We can write the sum of
p1 and p2
Is the difference of
The original n
And d2

As the original n
Is even
Also, by construction
d2 is also even

As the difference of even numbers is even
Thus, we arrive at the proof

What we have actually proved is that
The difference of two even numbers is even
And that difference is the sum of two primes
Hence Q.E.D.

The formal proof can be found here.