An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers (Q2276093): Difference between revisions

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.