Banker Offers $1M To Solve Beal Conjecture
oxide7 writes "A Texas banker with a knack for numbers has offered $1 million for anyone who can solve a complex math equation that has stumped mathematicians since the 1980s. The Beal Conjecture states that the only solutions to the equation A^x + B^y = C^z, when A, B and C are positive integers, and x, y and z are positive integers greater than two, are those in which A, B and C have a common factor. Like most number theories, it's "easy to say but extremely difficult to prove.""
... along with some postulated constraints and ask people to prove them? Whats so special about this one - does it have some mathematical relevance?
We have a fairly good hunch what Fermat's actual "proof in the margin" was. I can't remember how it goes, but it falls apart because rings Z^n with n>13 are no longer Unique Factorization Domains (UFD: a ring where all numbers have a single unique prime factorization) (or something like that). The concept of something not being a UFD was unheard of at the time of Fermat. Disclaimer: it's a few years since I did Algebra, so there may be errors in this post.
for i in `facebook friends "=bday" 2>/dev/null | cut -d " " -f 3-`; do facebook wallpost $i "Happy birthday!"; done
Maybe if I present it in the form of a cryptography scheme for terrorist communications...
"When information is power, privacy is freedom" - Jah-Wren Ryel