September 13th, 2016, 01:32 AM  #1 
Newbie Joined: Sep 2016 From: algeria Posts: 2 Thanks: 0  Goldbach's conjecture proof
Here I will proof Goldbach's conjecture by a simple way: to prove the conjecture, we will prove that any odd natural number greater than (3) is a sum of a prime number and an even number, we take that an even number is a sum of two odd numbers, from the first proof we decompose the result to a sum of two prime numbers and two even numbers, then we substitute the sum of the two even numbers from the original even number we get an even number equal a sum of two prime numbers and that is the Goldbach's conjecture. For the interval [10, +∞ [ we have: Let ({prime, even, odd}, +, ×) be a field with three elements. All odd numbers greater than 3 is a sum of a prime number and an even number: (Odd= prime + even)……………………………………… ………………………….(1) We have that every even number is a sum of two odd numbers: Even = odd + odd From (1) we get: that every even number is a sum of two prime numbers and two even numbers: Even = prime + even + prime + even Sash as the sum of two even numbers is an even number we get: => Even = prime + prime + even => Even – even = prime + prime Sash as the substitution of two even numbers is an even number we get: Even = prime + prime……………………………………… …………………...……………….(2) Sash as the set of even numbers and prime numbers are both an infinite sets the equation is correct for every even number belong to the interval [10, +∞] . For the interval ]2, 10[: We have only three even numbers : 4,6,8 : And we know that: 4=2+2……………………………………… …………………………...…………(3) 6=3+3……………………………………… …………………………...…………(4) 8=5+3……………………………………… …………………………...…………(5) Conclusion: From (2) , (3) , (4) , (5) we have that every even number belong to the interval ]2, +∞ [ is a sum of two prime numbers and the Goldbach's conjecture is correct. . . Last edited by skipjack; September 13th, 2016 at 11:38 AM. 
September 13th, 2016, 03:32 AM  #2 
Member Joined: Aug 2015 From: Montenegro (Podgorica) Posts: 37 Thanks: 4 
This is nice work. Good luck with publishing it.
Last edited by 1ucid; September 13th, 2016 at 03:57 AM. 
September 13th, 2016, 04:46 AM  #3 
Math Team Joined: Dec 2013 From: Colombia Posts: 7,690 Thanks: 2669 Math Focus: Mainly analysis and algebra  In this line, you need to prove that the lefthand side is any even number. At the moment your derivation shows only that any even number less some particular even number (that depends on the choice of prime) is equal to the righthand side.
Last edited by skipjack; September 13th, 2016 at 11:37 AM. 
September 13th, 2016, 05:52 AM  #4 
Newbie Joined: Sep 2016 From: algeria Posts: 2 Thanks: 0  I think is already proven by the proofs of Olivier Ramaré and Harald Helfgott which is saying that any even number is the sum of 6 primes, that means: even = prime + prime + (prime + prime + prime + prime) we know that (prime + prime + prime + prime) is an even number. But I still think that is proven by the derivation I wrote above. Last edited by skipjack; September 13th, 2016 at 11:36 AM. 
September 13th, 2016, 10:06 AM  #5 
Math Team Joined: Dec 2013 From: Colombia Posts: 7,690 Thanks: 2669 Math Focus: Mainly analysis and algebra 
That idea suffers from the same problem as your proof, which explains why you think it is correct. Perhaps you should ask Olivier Ramaré and Harald Helfgott whether they think they have proved Goldbach. I can guarantee that if they thought they had, their paper giving the six prime proof would have had Goldbach as its main focus.
Last edited by skipjack; September 13th, 2016 at 11:35 AM. 
September 18th, 2016, 08:15 AM  #6 
Senior Member Joined: Sep 2010 Posts: 221 Thanks: 20 
Can you please give a numerical example, illustrating all steps of obtaining (even=prime+prime)?

September 18th, 2016, 09:21 AM  #7 
Math Team Joined: Dec 2013 From: Colombia Posts: 7,690 Thanks: 2669 Math Focus: Mainly analysis and algebra 
The Goldbach Conjecture is a statement of the existence of such primes, not a claim that there exists any special method for finding them.

September 11th, 2017, 06:14 AM  #8 
Newbie Joined: Jan 2010 Posts: 9 Thanks: 0  goldbach proof
The formula that generates whole prime numbers : y=(2^(x1)1)/x ( formula1) If y is an integer , then x must be absolutely a prime number . the set of x for any value of integer y ; x = { 3,5,7,11,13,....} and it generates all the prime numbers . The question is that for the set of prime numbers ( x1 , x2) does the formula generates all the even numbers or not ? y1 = (2^(x11) 1 ) /x1 + (2^(x21) 1 ) /x2 for ( x1 , x2) = ( 3,3) then y1 = 2 ; for ( x1 , x2) = ( 3,5) then y2 = 4 ; for ( x1 , x2) = ( 5,5) then y3 = 6 ; for ( x1 , x2) = (5,7) then y4 = 8 ; .................... The result for whole prime sets of ( x1 , x2) then you can generate all the even number's set . P.S.: For the proof of formula1 and to learn more about it please contact me . For example formula1 must be always divided by 3 . METE UZUN TEL: +905315540733 email: meteuzun@hotmail.com 
September 11th, 2017, 07:44 AM  #9 
Global Moderator Joined: Dec 2006 Posts: 21,029 Thanks: 2259  
September 11th, 2017, 09:12 AM  #10 
Newbie Joined: Jan 2010 Posts: 9 Thanks: 0 
Thank you skipjack. Can you test this formula, please? (2^(x1) + (x1)!)/x Last edited by skipjack; June 25th, 2019 at 08:37 PM. 

Tags 
conjecture, goldbach, proof 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Proof of Goldbach Conjecture  mark eaton24  Number Theory  40  May 18th, 2016 05:38 AM 
Goldbach's conjecture  proof ???  notIntoMath  Number Theory  18  July 25th, 2014 09:49 AM 
The proof of the Goldbach's conjecture  Al78Ex53:Fe#!D%03  Number Theory  3  July 19th, 2013 04:17 PM 
Proof of Goldbach Conjecture?  eddybob123  Number Theory  61  April 25th, 2013 02:53 AM 
Proof of Goldbach's conjecture  choe  Number Theory  1  September 22nd, 2011 06:10 PM 