Almost powers in the Lucas sequence
Journal de théorie des nombres de Bordeaux · 04.06.2009 · 20 (3) · 555-600
DOI: 10.5802/jtnb.642 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal de théorie des nombres de Bordeaux, online erschienen am 04.06.2009. Verfasst von Yann Bugeaud und 3 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 35 Literaturangaben.
Abstract (Originalsprache)
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 the bounds and complicated nature of the Thue equations involved. The novelty in the present paper is the use of the double-Frey approach to simplify the Thue equations and to cope with the large bounds obtained from Baker’s theory.
Zitieren
APA
Bugeaud, Y., Luca, F., Mignotte, M., & Siksek, S. (2009). Almost powers in the Lucas sequence. Journal de théorie des nombres de Bordeaux, 20(3), 555-600. https://doi.org/10.5802/jtnb.642
Vancouver
Bugeaud Y, Luca F, Mignotte M, Siksek S. Almost powers in the Lucas sequence. Journal de théorie des nombres de Bordeaux. 2009;20(3):555-600. doi:10.5802/jtnb.642
BibTeX
@article{Bugeaud2009,
author = {Bugeaud, Yann and Luca, Florian and Mignotte, Maurice and Siksek, Samir},
title = {Almost powers in the Lucas sequence},
journal = {Journal de théorie des nombres de Bordeaux},
year = {2009},
volume = {20},
number = {3},
pages = {555--600},
doi = {10.5802/jtnb.642}
}
EUVIMED