On the exponential Diophantine equation F_n+1x - F_n-1x = F_m
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 in the title in nonnegative integers \((m,n,x)\). The above equation has two parametric families of solutions with \(x=1\) and \(x=2\) because of the identities \(F_{n+1}-F_{n-1}=F_n\) and \(F_{n+1}^2-F_{n-1}^2=F_{2n}\). The authors prove that there are no other solutions \((m,n,x)\) with \(x\ge 3\) and \(n\ge 3\). 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^y\)
- On the exponential Diophantine equation \(F_n^x+F_{n+1}^x+\cdots+F_{n+k-1}^x=F_m\)
- On the Diophantine equation F_n + F_m=2a
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- On the Diophantine equation \(F_n - F_m=2^a\)
- 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 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
- Fibonacci numbers at most one away from a perfect power
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- Linear forms in two logarithms and interpolation determinants
- On the Diophantine equation \(F_n^x+F_{n+1}^x=F_m^y\)
- 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
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- The Fibonacci Numbers: Exposed
- Upper bounds for solutions of an exponential Diophantine equation
- An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
- On a variant of an identity relating cubes of three consecutive Fibonacci numbers
- On the exponential Diophantine equation \(F_n^x+F_{n+1}^x+\cdots+F_{n+k-1}^x=F_m\)
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
- Linear forms in logarithms and the mathematical method of Diophantine equations: applications in chemistry and physics
- On solutions of the Diophantine equation F_n-F_m=3a
- Sums of Fibonacci numbers close to a power of 2
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- About a Diophantine equation
- On the Diophantine equation \(F_n - F_m=2^a\)
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- On the Diophantine equation F_n + F_m=2a
- On the Diophantine equation \(\sum^5_{k=1}F_{n_k}=2^a\)
- The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
- A Pillai-Catalan-type problem involving Fibonacci numbers
- On the exponential Diophantine equation P_m^2+ P_n^2= 2a
- When does \((P^x_{n+1}+P^x_{n-1})/2\) equal a pell-Lucas number?
This page was built for publication: On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2050151)
