An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (Q2276093)

From MaRDI portal
Revision as of 09:59, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
scientific article

    Statements

    An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    The authors prove that there is no integer \(s\geq 3\) such that the sum of \(s\)-powers of two consecutive Fibonacci numbers is a Fibonacci number. The main tool of the proof is a lower bound for a linear form in three logarithms of algebraic numbers combined with the use of the Baker-Davenport Lemma.
    0 references
    0 references
    0 references
    0 references
    0 references
    Fibonacci numbers
    0 references
    applications of linear forms in logarithms
    0 references
    0 references