User:Roviury

Unconfirmed proof of Goldbach conjecture(only for reference)

Please dont unreasonably delete! Even it is unconfirmed
It just for everybody to think and verify

Unconfirmed proof of weak Goldbach conjecture

ps.ALL primes must be formed "2k+1"(k>=1,where k is an integer)
(
2k
2k+1
2k+2=2(k+1)
2k+3=2(k+1)+1
...
)

pf:
Let a and b are the 2 primes, p and q are >=1
a=2p+1>=3
b=2q+1>=3
a+b=2p+2q+2
a+b=2(p+q+1)
i.e. a+b=2n,where n is an integer
(a+b>=6)

however,it cannot use in "a+b=4"
but 4 also can be formed 2+2
i.e. a+b>=4

Unconfirmed proof of strong Goldbach conjecture

ps.ALL primes must be formed "2k+1"(k>=1,where k is an integer)
(
2k
2k+1
2k+2=2(k+1)
2k+3=2(k+1)+1
...
)

pf:
Let a, b and c are the 3 primes, p, q and r are >=1
a=2p+1>=3
b=2q+1>=3
c=2r+1>=3
a+b+c=2p+2q+2r+3
a+b+c=2(p+q+r+1)+1
i.e. a+b+c=2n+1,where n is an integer
(a+b+c>=9)