Page 1

Displaying 1 – 8 of 8

Showing per page

Almost powers in the Lucas sequence

Yann Bugeaud, Florian Luca, Maurice Mignotte, Samir Siksek (2008)

Journal de Théorie des Nombres de Bordeaux

The famous problem of determining all perfect powers in the Fibonacci sequence ( F n ) n 0 and in the Lucas sequence ( L n ) n 0 has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations L n = q a y p , with a > 0 and p 2 , for all primes q < 1087 and indeed for all but 13 primes q < 10 6 . Here the strategy of [10] is not sufficient due to the sizes of...

Currently displaying 1 – 8 of 8

Page 1