On squares in Lucas sequences (Q880073)

Let \(P\) and \(Q\) be non-zero integers. The Lucas sequence \((U_n(P,Q))_{n\geq 0}=(U_n)_{n\geq 0}\) associated to \(P\) and \(Q\) is defined by the equalities \[ U_0=0,\quad U_1=1,\quad U_n=PU_{n-1}-QU_{n-2} \quad (n\geq 2). \] The authors are interested in the question of when \(U_n(P,Q)\) can be a perfect square. In case \(P=1\) and \(Q=-1\), it is the classical Fibonacci sequence. Cohn has proved in 1964 that the only perfect square greater than \(1\) in this sequence is \(U_{12}=144\). In their paper, the authors prove the following result: Suppose that \(P\) and \(Q\) are coprime such that, if \(Q=1\) then \(P\neq \pm 1, \pm 2\). If \(n\in \{2,3,4,5,6,7\}\), there exist infinitely many such pairs \((P,Q)\) for which \(U_n(P,Q)\) is a square. If \(n\in\{8,9,10,11,12\}\), the only solutions such that \(U_n(P,Q)\) is a square are given by the equalities \(U_8(1,-4)=21^2\), \(U_8(4,-17)=620^2\) and \(U_{12}(1,-1)=12^2\). In order to get this result if \(n=8,10,11\), the authors are typically faced with the problem of finding all points on an elliptic curve defined over a number field, whose the \(X\)-coordinate satisfy a \(\mathbb Q\)-rationality condition. Sometimes, this can be solved by using methods of Chabauty type. For that purpose, they have used routines which have been implemented by Nils Bruin on computers.