The Beal Conjecture
Edit Page
Report
Scan day: 17 February 2014 UTC
14
Virus safety - good
Description: $75,000 prized problem pertaining to the Diophantine equation of the form A^x + B^y = C^z where A, B, C, x, y and z are positive integers and x, y and z are all greater than 2, then A, B and C must have a common factor.
where A, B, C, x, y and z are positive integers and x, y and z are all greater than 2, then A, B and C must have a common prime factor. The conjecture and prize was announced in the December 1997 issue of the Notices of the American Mathematical Society. Since that time Andy Beal has increased the amount of the prize for his conjecture. The prize is now this: $1,000,000 for either a proof or a counterexample of his conjecture. The prize money is being held by the American Mathematical Society until it is awarded. In the meantime the interest is being used to fund some AMS activities and the annual
Size: 604 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | The Beal Conjecture |
| Keywords: | Fermat's Last Theorem, Andrew Beal, Dan Mauldin |
| Description: | Description of the Beal Conjecture and the Beal Prize. |
| IP-address: | 129.120.32.150 |
WHOIS Info
| NS | Name Servers: NS-A.PUBLIC.GRID.UNT.EDU 129.120.14.12 NS-B.PUBLIC.GRID.UNT.EDU 129.120.14.13 |
| WHOIS | |
| Date | activated: 29-Sep-1986 last updated: 21-Nov-2013 expires: 31-Jul-2014 |