Ask your own question, for FREE!
Mathematics 16 Online
jhonyy9 (jhonyy9):

OpenStudy (anonymous):

um.?

OpenStudy (turingtest):

no way, not real. difficult to read too.

OpenStudy (anonymous):

No way.

jhonyy9 (jhonyy9):

probe this please

jhonyy9 (jhonyy9):

1. substitution - let p and k , two prime numbers greater or equal 2,from the set of prime numbers, P, in the form : p=2a + 1 and k=2b + 1 , such that a and b are natural numbers,from the set of natural numbers N, - let m=2n ,m greater or equal 4,even number,from the set of natural numbers N and n grater or equal 2,natural number from set of natural numbers N, 2. conclusion - every even integer greater than 2 can be expressed as the sum of two primes 3. demonstration * - step 0. for n=2 --- m=4 --- 4=2+2 ** - step 1. for - if n is greater or equal 3 so always will be a number a and b such that n=a + b + 1 - dem. 3=1+1+1 4=2+1+1 5=2 +2+1 ................ n=a+b+ 1 - so for n=k than k=a+b+1 - suppose that is true - for k+1=(a+b+1)+1=(k)+1=k+1 - so for k+1 is true - for n grater than 2 always will be a number a and b such that n =a+b+ 1 *** - step 2. - every even integer greater than 4 can be expressed as the sum of two primes m=p+k - demonstration by ,,reductio ad absurdum" - so than m is not equal p+k - so than 2n is not equal 2a+1+2b+1 - so than 2n is not equal 2a+2b+2 / divide both sides by 2 - so than n is not equal a+b+1 - so but n=a+b+1 was proved that is true - so than m=p+k is proved that is true

OpenStudy (turingtest):

Is this your proof?

jhonyy9 (jhonyy9):

these are there - on this website too

OpenStudy (turingtest):

somebody cannot spell, but I have serious doubt about things like the induction part and the reduction ad absurdam.

OpenStudy (anonymous):

Its very hard to read =/ You shouldn't need demonstrations in a formal proof. The fact that you have demonstrations means you think you had to clarify some points, but instead of demonstrations, you should revise the point you are trying to make.

OpenStudy (anonymous):

hello all and happy new year!

OpenStudy (anonymous):

happy new years !

OpenStudy (turingtest):

Happy new year, though it appears Goldbach's Conjecture remains unproven =(

OpenStudy (anonymous):

new start partying and forget about math until 2012

OpenStudy (anonymous):

lol, im down for that.

OpenStudy (anonymous):

make it until 2020

OpenStudy (phi):

You say so than m is not equal p+k - so than 2n is not equal 2a+1+2b+1 but there are numbers of the form c= 2a+1 and d=2b+1 that are not prime. For example, let a= 4, b= 7, so c= 9, d= 15 2*12 = c + d = 2*a+1 +2*b+1 You cannot conclude 2n is not equal 2a+1+2b+1

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!