goldbach conjecture proof

PAllen

Forget proof, you don't even posit any argument at all that an 'a' with right properties exists. Listing that it does for N cases is irrelevant, unless you list all infinity cases. Certainly, there is no induction in your (total non) argument.

HallsofIvy

Quote by Sievert

Goldbach Conjecture is 2n = Prime (a+n)+ Prime (a-n), 1 is here prime

2 = (0+1)+(1-0)

4 = (1+2)+(2-1)

6 = (2+3)+(3-2)

8 = (3+4)+(4-3)

10= (2+5)+(5-2)

12= (1+6)+(6-1)

14 =(4+7)+(7-4)

16 =(3+8)+(8-3)

18 =(4+9)+(9-4)

20=(3+10)+(10-3)

22=(6+11)+(11-6)
.
.
.
2n=(a+n)+(n-a)

Yes, there exist many numbers "a" that will fit here. What about "prime"?

Proof:

(a+n) = 2n+(a-n)=2n-(n-a)

q.e.d.[/QUOTE]
So, essentially, you are telling us that you do not know what a "proof" is.

micromass

After this silliness, I'm locking the thread.

Similar Threads for: goldbach conjecture proof
Thread	Forum	Replies
Goldbach’s Conjecture and the 2-Way Sieve	General Math	6
euler product and Goldbach conjecture..	Linear & Abstract Algebra	1
Are Riemann hypothesis and Goldbach conjecture related?...	Linear & Abstract Algebra	2
a partial solution to the Goldbach Conjecture	Linear & Abstract Algebra	7
Goldbach conjecture	Linear & Abstract Algebra	20

PAllen Blog Entries: 1 Recognitions: Gold Member Science Advisor	goldbach conjecture proof Forget proof, you don't even posit any argument at all that an 'a' with right properties exists. Listing that it does for N cases is irrelevant, unless you list all infinity cases. Certainly, there is no induction in your (total non) argument.

micromass Blog Entries: 8 Recognitions: Gold Member Science Advisor Staff Emeritus	After this silliness, I'm locking the thread.