This is wrong...or at least I hope it is since Fermat's last theorem states that A^n+B^n = C^n is never true for any A,B,C, and n > 2....
RE: Win 1 Million Dollars ($1,000,000) by solving this with positive integers that disprove the Beal Conjecture
You are viewing a single comment's thread from:
Win 1 Million Dollars ($1,000,000) by solving this with positive integers that disprove the Beal Conjecture
In Beal's Conjecture the exponents can have different values so this is more general then Fermat's Last Theorem.
Downvoting a post can decrease pending rewards and make it less visible. Common reasons:
Submit