Diophantine quintuple

From testwiki
Revision as of 20:24, 3 November 2023 by imported>Trappist the monk (Diophantine ''m''-tuples: cite repair;)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description

In number theory, a diophantine Template:Mvar-tuple is a set of Template:Mvar positive integers {a1,a2,a3,a4,,am} such that aiaj+1 is a perfect square for any 1i<jm.[1] A set of Template:Mvar positive rational numbers with the similar property that the product of any two is one less than a rational square is known as a rational diophantine Template:Mvar-tuple.

Diophantine m-tuples

The first diophantine quadruple was found by Fermat: {1,3,8,120}.[1] It was proved in 1969 by Baker and Davenport [1] that a fifth positive integer cannot be added to this set. However, Euler was able to extend this set by adding the rational number 7774808288641.[1]

The question of existence of (integer) diophantine quintuples was one of the oldest outstanding unsolved problems in number theory. In 2004 Andrej Dujella showed that at most a finite number of diophantine quintuples exist.[1] In 2016 it was shown that no such quintuples exist by He, Togbé and Ziegler.[2]

As Euler proved, every Diophantine pair can be extended to a Diophantine quadruple. The same is true for every Diophantine triple. In both of these types of extension, as for Fermat's quadruple, it is possible to add a fifth rational number rather than an integer.[3]

The rational case

Diophantus himself found the rational diophantine quadruple {116,3316,174,10516}.[1] More recently, Philip Gibbs found sets of six positive rationals with the property.[4] It is not known whether any larger rational diophantine m-tuples exist or even if there is an upper bound, but it is known that no infinite set of rationals with the property exists.[5]

References

Template:Reflist