L'anneau... et l'algorithme euclidien.
Let be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are and , respectively. We show that the Diophantine equation has only finitely many solutions in , where , is even and . Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral points on...