Abstract
A set {a1; : : : ; am} of m distinct positive integers is called a Diophantine m-tuple if aiaj + 1 is a perfect square for all i, j with 1 � i < jm. It is known that there does not exist a Diophantine sextuple and that there exist only finitely many Diophantine quintuples. In this paper, we first show that for a fixed Diophantine triple {a; b; c} with a < b < c, the number of Diophantine quintuples {a; b; c; d; e} with c < d < e is at most four. Using this result, we further show that the number of Diophantine quintuples is less than 10276, which improves the bound 101930 due to Dujella.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
