My name is Todd and I have a posted a proof of Goldbach's Conjecture. I have been looking around for a while to find a place to post it and this seems like a reasonable place to start. I have stopped by here before but never registered. The proof is http://www.just-got-lucky.com/gc-083110-draft1.pdf" [Broken]. The proof is somewhat geometric, wolfram NKS-like, and does not use much advanced math per se so the concepts are much different than you usually see posted here. Perhaps someone will look - I understand that I am both new here and probably a crackpot but we all have to do what we feel we need to do. So if there is a horrific glaring error please be at least somewhat kind. The basic proof is fairly simple in concept: I create a diagonal "table" where the diagonal is odd primes > 3 and under the diagonal all even numbers appear at the intersection of rows and columns. I then derive a "counter diagonal" that shows, for a given even number, all the unique odd number pairs that can generate it. I then eliminate all the non-prime odd pairs from this table and show that, with what's left, you basically have to violate Betrand's Postulate in order to contradict the conjecture.