The number of Diophantine quintuples
Author(s) -
Yasutsugu Fujita
Publication year - 2010
Publication title -
glasnik matematicki
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.332
H-Index - 17
eISSN - 1846-7989
pISSN - 0017-095X
DOI - 10.3336/gm.45.1.02
Subject(s) - mathematics , diophantine equation , discrete mathematics , arithmetic
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 < j ≤ m. 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom