Talk:Goldbach's Weak Conjecture

Removed: "This limits the threshold so that it is feasible to test any single odd number below that threshold, so to a certain extent it is now only a matter of time" -- while technically true it suggests that $10^{10^3}$ is within computational reach. --Linus44 06:39, 11 March 2011 (CST)


 * Well it is. At least, it's only a matter of time before it is within computational reach. You'll allow a little ironic levity on occasion, yeah? Aw, come on ... --prime mover 13:34, 11 March 2011 (CST)


 * Haha, don't really mind -- I tried to put it in context a little (a conservative estimate; $10^{64}$ or less would do I think) --Linus44 13:04, 12 March 2011 (CST)


 * At The Moment, dude. I point you towards Barlow's Prediction. Crysake, us mathematicians gotta have fuuuhn that doesn't involve The Simpsons on occasion. (BTW you rock.) --prime mover 13:29, 12 March 2011 (CST)