An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
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.
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- On a variant of an identity relating cubes of three consecutive Fibonacci numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
- On solutions of the Diophantine equation F_n-F_m=3a
- A Diophantine equation related to the sum of powers of two consecutive generalized Fibonacci numbers
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Diophantine approximation
- Fibonacci and Lucas Numbers With Applications
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
- Linear forms in two logarithms and interpolation determinants
- On a Conjecture Regarding Balancing with Powers of Fibonacci Numbers
- On the Diophantine equation \(F_n^x+F_{n+1}^x=F_m^y\)
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- On the sum of powers of two consecutive Fibonacci numbers
- On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers
- Powers of two in generalized Fibonacci sequences
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- Upper bounds for solutions of an exponential Diophantine equation
- On a variant of an identity relating cubes of three consecutive Fibonacci numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- A Diophantine Equation With Powers of Three Consecutive $$k-$$Fibonacci Numbers
This page was built for publication: An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021672)
