• Security incident: ISF was recently accessed by intruders. Please change your password, and change it anywhere else you used it. Read more

RIP Uncle Petros?

Southwind17

Philosopher
Joined
Sep 6, 2007
Messages
5,154
Is anybody able to comment on the status of the disproving or otherwise of the "strong" or "binary" Golbach Conjecture subsequent to the expiry of Bloomsbury/Faber & Faber's $1 million challenge on 20 March 2002? I would have thought that, given today's computing power, the conjecture should easily be capable of being disproved through simple trial and error, or, if not, have been ascribed an extraordinarily high probability of being correct, such that mathematical proof could be considered a formality (except to the real mathematicians out there, of course).
 

ISF - Join now!

Every member here is approved by hand. No bots, no spam, just people who care about evidence and honest debate.

Membership is free!

Create your free account

Back
Top Bottom