Processing math: 100%

Friday, December 23, 2022

Unfortunately Goldbach's Conjecture

 The previous post on Goldbach's Conjecture is unfortunately falsehood, a simplified 'proof' but on the same line of argument is,

All primes are odd, let,

2n1+1=p 

and

2n2+1=q

so p+q=2(n1+n2+1)=2n

where n=n1+n2+1.

The actual proof needed is that n spans all integer greater than 2.