Diophantine tuple

GPTKB entity

Statements (17)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:defines A set of m positive integers such that the product of any two, increased by 1, is a perfect square.
gptkbp:example (1, 3, 8, 120) is a Diophantine quadruple
gptkbp:field number theory
https://www.w3.org/2000/01/rdf-schema#label Diophantine tuple
gptkbp:namedAfter gptkb:Diophantus_of_Alexandria
gptkbp:property Infinitely many Diophantine quadruples exist
No Diophantine sextuple is known to exist
No Diophantine quintuple with all elements integers greater than 1 is known
gptkbp:relatedTo gptkb:Diophantine_equation
gptkb:Diophantine_quadruple
gptkb:Diophantine_quintuple
gptkbp:studiedBy gptkb:Euler
gptkb:Fermat
gptkb:Dujella
gptkbp:bfsParent gptkb:Diophantus
gptkbp:bfsLayer 6