20070322, 10:59  #1 
Jan 2006
JHB, South Africa
157_{10} Posts 
Goldbach's Conjecture
Hi all,
At the risk of getting the , would this constitute as a proof of the Goldbach conjecture?? Code:
It can be shown that all primes greater than 3 have the form 6n+1 or 6n1 where n is any positive integer > 1. It can be shown that any even integer of 10 and greater has one of three forms, namely 6n2, 6n and 6n+2 The sum of two primes > 3 will have one of 3 forms. (6a1) + (6b1) = 6(a+b) 2 (6a1) + (6b+1) = 6(a+b) or (6a+1) + (6b1) = 6(a+b) (6a+1) + (6b+1) = 6(a+b) +2 Letting a and b be any number > 0, it can be shown that all even numbers > 10 are the sum of two primes. It can be shown manually for the even numbers 4,6 and 8 as the sum of their primes include the primes 2 and 3. Patrick 
20070322, 11:40  #2 
Jun 2003
The Texas Hill Country
2·541 Posts 
Patrick,
Although your "proof" deserves the "crank" label, I will give you the benefit of doubt and simply point out that you have made a typical error in logic. By your first axiom, IF p is prime, then p is of the form …. You then claim IF n is of the form …, then n is prime. http://en.wikipedia.org/wiki/Affirming_the_consequent Last fiddled with by Wacky on 20070322 at 11:42 
20070322, 11:59  #3 
Jan 2006
JHB, South Africa
157 Posts 
Thanks Wacky,
I had a block but just could not see where, at this stage all I've shown is that all even numbers can be split in the form (6a +or 1) + (6b +or 1). I've not shown that they are prime. Selfinflicted Regards Patrick 
20070413, 05:35  #4 
Jun 2003
Pa.,U.S.A.
304_{8} Posts 
A little more on Goldbach
Greetings to Johannesburg.
I come from a family (one branch)of american coal miners,and happen to have attended nursery school in saxonwald, before retreating to east london as my father was in the nylon business: I am unfortunately a heavy coffee drinker, but have managed to keep the yellowing hands down to a minimum . I want to point out something I am convinced is a must for a proof of Goldbach, that is not generally accepted: It must be proven by parts, a) for those evens divisible by 2 once b) for those evens divisible by 4 or more This divides all evens into exactly two seperate types, which behave totally differently, so as to try for a proof without seperation, is totally ludicrous in my opinion. I can go into more detail if you wish. Its been a long time since I witnessed the mine dances, by the way. 
20070413, 17:01  #5  
"Richard B. Woods"
Aug 2002
Wisconsin USA
1110000010100_{2} Posts 
Quote:
Quote:
Quote:
Quote:
Just because two sets of numbers (the set of even integers each 10 or greater, and the set of sums of two primes each greater than 3, in this case) map to the same set of equivalence classes doesn't mean that the sets of numbers are equal ... or that they have a single member in common! Now, by examining specific cases, you can show that the sets share at least one member (e.g., 10 is in both sets). But showing that the sets are equal (i.e., that the sets share all of their members) is an (*ahem*) infinitely greater task. Last fiddled with by cheesehead on 20070413 at 17:04 

20100716, 15:19  #6 
"Forget I exist"
Jul 2009
Dumbassville
10000010110001_{2} Posts 
I'm going to add my 2 cents (and yes I know it won't necessarily be counted in the dollars given). number freak talks of something similar and then says "it remains unsolved as of this writing" (about Goldbach's conjecture) could we use a similar method to the one on pg. 124 (with one major alteration) to help Goldbach's conjecture ?

20100716, 17:20  #7 
"Forget I exist"
Jul 2009
Dumbassville
8369_{10} Posts 
.5x±n= prime for a certain n and a even x is basically what Goldbach's conjecture says if i understand it right.

20100716, 17:29  #8 
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
Goldbach's conjecture states that any even number that is greater than 2 can be decomposed into the sum of two prime numbers.
Ex: 100 = 53 + 47 In most cases, there is more than 1 decomposition into prime numbers. Last fiddled with by 3.14159 on 20100716 at 17:33 
20100716, 18:24  #9 
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 
I realize that but .5x±n= prime just means that they have to be the same distance away from the mean of all the 2 number sums to a number which is obvious.

20100716, 23:11  #10  
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
0.5x ± n = p? If you're referring to the Goldbach conjecture, it would be: p_{1} + p_{2} = 2n.
If I didn't understand your statement, apologies. Quote:
Last fiddled with by 3.14159 on 20100716 at 23:13 

20100717, 00:37  #11  
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 
Quote:
my equation is logical as any 2 numbers that add to a third must have and average of half that third number. this in turn means to average correctly to that .5x that they are equally displaced (hence the +/n) . so in my mind my equation is what would have to be solved for all even x and a given n (which seems to be 0 or an odd number) Last fiddled with by science_man_88 on 20100717 at 00:38 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Factorial and Goldbach conjecture.  MisterBitcoin  MisterBitcoin  17  20180129 00:50 
Goldbach's weak conjecture  MattcAnderson  MattcAnderson  17  20170321 18:17 
Goldbach's weak conjecture  MattcAnderson  MattcAnderson  1  20170318 23:32 
Goldbach Conjecture  MattcAnderson  MattcAnderson  3  20170317 15:34 
Goldbach's conjecture  Citrix  Puzzles  3  20050909 13:58 