On the Diophantine equation F_n - F_m=2a
From MaRDI portal
Publication:5207315
Abstract: In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in diophantine approximation.
Recommendations
Cited in
(21)- Sums or products of double factorials in Lucas sequences
- A generalization of the equation (2 k − 1) (3 l − 1) = 5 m − 1
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- On Fibonacci numbers of the form \(q^ky^k\).
- Sums of Fibonacci numbers close to a power of 2
- Mersenne numbers as a difference of two Lucas numbers
- On perfect powers which are sum or difference of two Lucas numbers
- On solutions of the Diophantine equation \(F_n-F_m=3^a\)
- An exponential Diophantine equation related to the sum of powers of two consecutive terms of a Lucas sequence and \(x\)-coordinates of Pell equations
- On the Diophantine equation \(B_{n_{1}} + B_{n_{2}} = 2^{a_{1}} + 2^{a_{2}} + 2^{a_{3}}\)
- scientific article; zbMATH DE number 7523832 (Why is no real title available?)
- 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}
- On the Diophantine equation \(F_n + F_m=2^a\)
- The Fibonacci numbers of the form \(2^a\pm 2^b +1\)
- Nonnegative integer solutions of the equation \(F_{n}-F_{m}=5^{a}\)
- On the nonnegative integer solutions of the equation Fn ± Fm = ya
- ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
- On a variant of an identity relating cubes of three consecutive Fibonacci numbers
- On the Diophantine equation \(L_n-L_m = 2\cdot 3^a\)
- On the equation \((2^k-1)(3^l-1)=5^m-1\)
This page was built for publication: On the Diophantine equation \(F_n - F_m=2^a\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207315)