The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
DOI10.1007/s00009-023-02529-5MaRDI QIDQ6141295
Carlos Alexis Gómez Ruiz, Jhonny C. Gómez, Florian Luca
Publication date: 22 January 2024
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
lower bounds for nonzero linear forms in logarithms of algebraic numbers\(k\)-generalized Fibonacci numberseffective solution for exponential Diophantine equationmethod of reduction by continued fractions
Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative independence in \(k\)-generalized Fibonacci sequences
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- On a conjecture about repdigits in k-generalized Fibonacci sequences
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- Mersenne k-Fibonacci numbers
- Generalized Fibonacci Numbers and Associated Matrices
- Powers of two as sums of two k-Fibonacci numbers
- A simplified Binet formula for k-generalized Fibonacci numbers
- On Generalized Fibonacci Numbers
This page was built for publication: The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
