On the exponential Diophantine equation F_n+1x - F_n-1x = F_m^y
Let \( (F_n)_{n\ge 0} \) be the usual sequence of Fibonacci number defined by the linear recurrence: \( F_0=0, ~ F_1=1, \) and \( F_{n+2}=F_{n+1}+F_n \) for all \( n\ge 0 \). In the paper under review, the authors study the exponential Diophantine equation: \[ F_{n+1}^x-F_{n-1}^x=F_m^{y},\tag{1} \] in positive integers \(n, m, x\) and \(y\). This is an extension of a previous problem considered by \textit{B. K. Patel} and \textit{A. P. Chaves} in [Mediterr. J. Math. 18, No. 5, Paper No. 187, 11 p. (2021; Zbl 1490.11042)], by adding an extra exponent ``\( y \). In their main result, the authors prove that the exponential Diophantine equation (1) does not have any other solutions in positive integers \( (n,m,x,y) \), except the trivial ones: \[ (n,m,x,y) \in \{(1,1,x,y), (1,2,x,y), (2,1,1,y), (2,2,1,y): x,y\ge 1\} \cup \{(3,3,2,3), (6,3,1,2)\}, \] as well as the parametric ones: \( (n,m,x,y)\in \{(n,n,1,1), ~(n,2n,2,1):~n\ge 1\} \). The proof of their main result follows from a clever combination of techniques in Diophantine number theory, the usual properties of the Fibonacci numbers, the Baker's theory of nonzero linear forms in logarithms of algebraic numbers, as well as the reduction techniques involving the theory of continued fractions plus the LLL-algorithm. The rigorous computations are carefully done with the aid of a computer program in \texttt{Mathematica}.
- On the Diophantine equation \(\sum^5_{k=1}F_{n_k}=2^a\)
- 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\)
- An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
- The Diophantine equation \(x_1^{x_1}\cdot x_2^{x_2}\cdot\dots\cdot x_k^{x_k}=y_1^{y_1}\cdot y_2^{y_2}\cdot\dots\cdot y_m^{y_m}\). III.
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- On the Diophantine equation on reciprocal Fibonacci numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
- On the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}
- A Diophantine equation related to the sum of squares of consecutive k-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
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- Modular elliptic curves and Fermat's Last Theorem
- Number Theory
- On the Diophantine equation \(F_n^x+F_{n+1}^x=F_m^y\)
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- On the exponential Diophantine equation related to powers of two consecutive terms of Lucas sequences
- On the sum of powers of terms of a linear recurrence sequence
- 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
- Primary cyclotomic units and a proof of Catalans conjecture
- Problems in Algebraic Number Theory
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- Upper bounds for solutions of an exponential Diophantine equation
- An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- 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\)
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
- About a Diophantine equation
- scientific article; zbMATH DE number 3458725 (Why is no real title available?)
- The Diophantine equation F_n=P(x)
- On the exponential Diophantine equation \(P_n^x+P_{n+1}^x+\cdots +P_{n+k-1}^x=P_m\)
- An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers
- Nonnegative integer solutions of the equation \(F_{n}-F_{m}=5^{a}\)
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- On the Diophantine equation F_n + F_m=2a
- Some remarks on the equation \(F[n]=kF[m]\) in Fibonacci numbers
- On the Diophantine equation \(\sum^5_{k=1}F_{n_k}=2^a\)
- On the Diophantine equation on reciprocal 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?
- Fibonacci numbers at most one away from a perfect power
This page was built for publication: On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167797)
