Some family of Diophantine pairs with Fibonacci numbers (Q2283206): Difference between revisions

Let \( (F_n)_{n\ge 0} \) be the sequence of Fibonacci numbers defined by the linear recurrence: \( F_0=0 \), \( F_1=1 \), and \( F_{n+2}=F_{n+1}+F_n \) for all \( n\ge 0 \). A Diophantine \( m \)-tuple is a set of \( m \) positive integers such that the product of any two of them increased by \( 1 \) gives a perfect square. For any Diophantine triple \( \{a,b, c\} \), the set \( \{a,b,c, d_{\pm}\} \) is a Diophantine quadruple, where \[ d_{\pm}=a+b+c+2abc\pm 2rst, \] and \( r, s, t \) are the positive integers satisfying \[ ab+1=r^{2}, ~ ac+1=s^{2}, ~ bc+1=t^{2}. \] An important conjecture in this area of research states that if \( \{a,b,c,d\} \) is a Diophantine quadruple and \( d> \max\{a,b,c\} \), then \( d=d_{+} \). Such a Diophantine quadruple is called a regular Diophantine quadruple. In the paper under review, the authors prove the following theorem, which is the main result in the paper. Theorem 1. Let \( k \) be a positive integer. If the set \( \{F_{2k}, F_{2k+4}, c, d\} \) is a Diophantine qaudruple with \( c<d \), then \( d=d_{+} \). The proof of Theorem 1 follows from a clever combination of techniques in Diophantine number theory, the results from solving a system of simultaneous Pellian equations, the usual properties of the Fibonacci numbers, the theory of linear forms in logarithms of algebraic numbers á la Baker, and the reduction techniques involving the theory of continued fractions. Computations are done in \texttt{PARI/GP}.