Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:chess_match
|
| gptkbp:bfsLayer |
5
|
| gptkbp:bfsParent |
gptkb:Related_Companies
|
| gptkbp:command_structure |
If A^x + B^y = C^z has integer solutions, then A, B, and C must be distinct positive integers.
|
| gptkbp:field |
number theory
|
| gptkbp:first_published |
gptkb:1993
|
| https://www.w3.org/2000/01/rdf-schema#label |
Related Beal
|
| gptkbp:notable_for |
its simplicity and difficulty of proof.
|
| gptkbp:opened |
in mathematics
|
| gptkbp:proposed_by |
David Beal
|
| gptkbp:related_to |
gptkb:Diophantine_equations
|
| gptkbp:variant |
gptkb:Fermat's_Last_Theorem
|
| gptkbp:varieties |
exponential Diophantine equation
|