From a guy that would know:
Quote:
As part of the process of breaking in a new data center, we ran a Beal computation in the background. If there was accounting for this, it would have cost considerably more than $1m in computing costs. No counterexamples found. So if you want to claim the prize, I suggest switching strategies to trying to prove that it is true, rather than trying to find a counterexample.
My idea was to select from a large list of known prime numbers for A, B, and C. This would save one the time it takes to check if they're co-prime.
Login
Register
FAQ
Search
