```Date: Nov 26, 2012 12:15 AM
Author: forbisgaryg@gmail.com
Subject: questions about a "proof" of the Goldbach Conjecture.

I'm new to sci.math.  I came here from comp.ai.philosophy by way of sci.logicbecause google groups doesn't allow crossposting and several people includec.a.p in their crossposted articles.  In sci.logic the Goldbach Conjecturecame up with a lot of nonsense and it lead me to start thinking about it.Since my math is pretty rusty I'm having a bit of trouble.  I came up withthe assertion that there would be a prime p between n and 2n and othersidentified this as Bertrand's Postulate.  I'm using a slighly strongerconjecture that says "all even numbers greater than 7 can be expressedas the sum of two distinct primes."  I'm asserting the problem is atopology problem and proposed there would be a proof related to thespacing of equadistant prime from all natural numbers n greater than 3.Today I found http://milesmathis.com/gold3.htmlIt's quite similar to what I proposed.Since it's not an accepted proof I'm assuming there must be a flaw. Is the flaw easy to spot and if so what is it?Another corollary to my modified Goldbach Conjecture:There is no natural number n such that for all primes p less than n2n-p is not a prime.If you question that read it again.  Sure some 2n-p will not be primebut not all of them or else n is prime and my stronger version is falseor the Goldbach Conjecture is false.Except where n is a multiple of some prime p, 2n-p must be prime ora multiple of some prime other than p, http://en.wikipedia.org/wiki/Chen%27s_theoremappears to be a poof that's a bit weaker than what's stated as aproof at http://milesmathis.com/gold3.htmlI find references to Chen's theorem on the web but I don't see theactual proof of it on the web.  How complex is it?
```