Goldbach's Conjecture - Proof (better link)
View Single Post
Jan14-10, 08:16 AM
In the proof, you explicitly use the theorem that there is no string of n consecutive numbers below n^2 so that they are all divisible by at least one of 3,5,...,n, and you must prove this, or it will not be valid.
In fact, I did not use this conjecture as part of the proof. Rather I suggest it is a result that has been proved (though unintentionally) by my proof of GC.