Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 386

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers

Open access
Bugeaud, Yann, Mignotte, Maurice, Siksek, Samir · 2006 · Annals of Mathematics

Abstract

This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat's Last Theorem.In this paper we give new improved bounds for linear forms in three logarithms.We also apply a combination of classical techniques with the modular approach to show that the only perfect powers in the Fibonacci sequence are 0, 1, 8 and 144 and the only perfect powers in the Lucas sequence are 1 and 4.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.4007/annals.2006.163.969

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 15 references

Metadata

Authors
Bugeaud, Y., Mignotte, M., & Siksek, S.
Venue
Annals of Mathematics
Published
2006-05-01
Volume
163
Issue
3
Pages
969-1018
ISSN
0003-486X (ISSN-L)
OpenAlex
W2098263571
Cited by
386
References
15
FWCI
11.63
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers. https://app.cochat.ai/papers/10.4007/annals.2006.163.969
The paper
Bugeaud, Y., Mignotte, M., & Siksek, S. (2006). Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers. Annals of Mathematics. https://doi.org/10.4007/annals.2006.163.969

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.