I can prove the goldbach conjecture with a simple method
but first I prove square of any prime -1 can be divided by 12
primexprime -1 = 12k k is an integer .
if you want a more formal paper.It will take at least 10 pages.but you have to admit that my approximation is correct.
Think of that:
another function F(k) = 2*k = P(x+y) - P(x) x,y € N+ and x,y>=1 and k >=y
just give the numbers to x and y from 1 to infinity and you will have all the...
Conjecture: ANY EVEN NUMBER CAN BE REPRESENTED AS THE DIFFERENCE OF TWO PRIME NUMBERS.
The proof:
Set of Prime Numbers
P= { 3,5,7,11,13,17,19,23,.} = P(x)
Set of Even Numbers
E={2,4,6,8,10,12,..} =
E(x) = 2x ; x€ N+
Prime number function could be represented as P(x)
P(0) =2 ...