Clearly every even integer greater than 2 can be expressed as the sum of two primes. I have discovered a truly wonderful proof of this proposition, but the signature is too small to contain it.
The expression gives the remainder upon dividing a by n. From there, once you see that (mod 27), seeing the expression evaluates to 26 becomes fairly simple.
Clearly every even integer greater than 2 can be expressed as the sum of two primes. I have discovered a truly wonderful proof of this proposition, but the signature is too small to contain it.