ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
From MaRDI portal
Publication:5077101
DOI10.22124/jart.2021.19294.1266zbMath1499.11086arXiv2202.10127OpenAlexW4225355744MaRDI QIDQ5077101
Pagdame Tiebekabe, Ismaïla Diouf
Publication date: 17 May 2022
Full work available at URL: https://arxiv.org/abs/2202.10127
Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Powers of two as sums of three Fibonacci numbers
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
- 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=3^a\)
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- On factorials expressible as sums of at most three Fibonacci numbers
- On the Diophantine equation $F_{n}-F_{m}=2^{a}$
- Nonnegative integer solutions of the equationFn
- On The diophantine equationFn+Fm=2a
- Determining Number of Some Families of Cubic Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a