GoldBach's Conjecture is part of a mathematical definition.

The reason the conjecture is so hard to prove is because it's part of
a mathematical definition:

(1) q = p+ 2k if and only if (2) e = p + q.

where p and q are any positive primes; e > 2 is any even integer; k
belongs to the set, {0,1,2,3,...}.

There's a hint if you do not get it. Draw a picture of (1) q = p + 2k.
Then, discover how this relates to (2). Then start with (2) and derive
(1).

You may want to exclude the trivial case of e = 4 = 2 + 2 for the
moment. And assume p and q are distinct odd primes. This implies e>4.

.

Relevant Pages
Quantcast