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

Let \((F_n)_{n\ge 0}\) be the Fibonacci sequence given by \(F_0=0,~F_1=1\) and \(F_{n+2}=F_{n+1}+F_n\) for all \(n\ge 0\). The authors look at the Diophantine equation \(F_{n+1}^x+F_n^x-F_{n-1}^x=F_m\) in nonnegative integers \((m,n,x)\). The above equation has a parametric family of solutions with \(x=3\) because of the identity \(F_{n+1}^3+F_n^3-F_{n-1}^3=F_{3n}\). The authors prove that there are no other solutions \((m,n,x)\) with \(x\ge 2\) and \(n\ge 2\). The proof uses linear forms in logarithms of algebraic numbers and reduction methods based on continued fractions.