how prove that every even number is a sum of two odd number ?
By contradiction probably.
Wiat, don't have to.
say we have the even number a. since a is even, we can divide a by two. if a/2 is odd, then we have a sum of two odd numbers.
if a/2 is even, then a/2+1 and a/2-1 are odd numbers that sum up to the even number a.
2n =n +n if n i odd if n is even, n=2p 2(2p) = 4p= 2p-1 + 2p +1
so with this is proven that every even can be expressed a sum of two odds ?
Yes
so if this is like easy to proving,than why not is possibile proving the same the Goldbach's conjecture ?
prime numbers and even numbers are very different.
ok is sure right but than the way,styla,method why not can being the same ?
@KingGeorge once proved that the product of 2 even numbers is always even..can that be used as well?
This is easily done if you know the definition of even numbers.
Join our real-time social learning platform and learn together with your friends!