On \(Y\)-coordinates of Pell equations which are Fibonacci numbers (Q6175553)

Let \(\{F_n\}_{n\ge 0}\) be the Fibonacci sequence with the initial values \(F_0=0\), \(F_1=1\) and the linear recurrence \(F_{n+2}=F_{n+1}+F_n\) for all \(n\ge 0\). Furthermore, let \(d\ge 2\) be an integer which is not a square. Consider the Pell equation \[ X^2-dY^2=\pm 1. \tag{1} \] All its positive integer solutions \((X,Y)\) are given by \((X,Y)=(X_m, Y_m)\) for some positive integer \(m\), where \[ X_m+Y_m\sqrt{d}=(X_1+Y_1\sqrt{d})^{m}, \] and \((X_1,Y_1)\) stands for the smallest positive integer solution. In the paper under review, the authors prove the following theorem, which is the main result of the paper. Theorem 1. Let \(d\ge 2\) be an integer which is not a square, \((X_m,Y_m)_{m\ge 1}\) be the \(m\)th positive integer solution to the Pell equation (1). Then the Diophantine equation \[ Y_m=F_n \] has at most two positive integer solutions \((m,n)\) with \(m\ge 1\), \(n\ge 1\) except for \(d=2\) when it has three solutions \((m,n)\in\{(1,2), (2,3), (3,5)\}\). The proof of Theorem 1 follows from a clever combination of techniques in Diophantine number theory, the usual properties of the Fibonacci sequence and Pell equations, Baker's theory for nonzero lower bound for linear forms in logarithms of algebraic numbers, and the reduction techniques involving the theory of continued fractions. All computations can be done with the aid of a simple computer program in \texttt{Mathematica}, \texttt{Maple} or \texttt{SageMath}.