On the Diophantine equation F_n - F_m=2a

DOI10.4064/CM7485-12-2018zbMATH Open1452.11022arXiv1712.10138OpenAlexW2982152481MaRDI QIDQ5207315FDOQ5207315

Authors: Zafer Ṣiar, Refik Keskin 

Publication date: 19 December 2019

Published in: Colloquium Mathematicum (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1712.10138

Recommendations

• On the Diophantine equation \(F_n + F_m=2^a\)
• On solutions of the Diophantine equation \(F_n-F_m=3^a\)
• On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
• The Fibonacci numbers of the form \(2^a\pm 2^b +1\)
• On perfect powers which are sum or difference of two Lucas numbers

zbMATH Keywords

Fibonacci numbersBaker-Davenport reduction methodBaker's theory for linear forms in logarithms

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Cited In (14)

• On the Diophantine equation \(B_{n_{1}} + B_{n_{2}} = 2^{a_{1}} + 2^{a_{2}} + 2^{a_{3}}\)
• On the nonnegative integer solutions of the equation F_n ± F_m = y^a
• On a variant of an identity relating cubes of three consecutive Fibonacci numbers
• Sums or products of double factorials in Lucas sequences
• Mersenne numbers as a difference of two Lucas numbers
• On solutions of the Diophantine equation \(F_n-F_m=3^a\)
• Nonnegative integer solutions of the equationFn
• 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 nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
• Sums of Fibonacci numbers close to a power of 2
• On Fibonacci numbers of the form \(q^ky^k\).
• ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
• Title not available (Why is that?)
• On the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}

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)