On the Diophantine equation ^5_k=1F_n_k=2a

MaRDI QIDQ5889301zbMATH OpenFDO

Authors Pagdame Tiebekabe, Ismaïla Diouf

Publication date 19 April 2023

Full work available at URL https://arxiv.org/abs/2209.07871, https://www.fq.math.ca/Papers1/60-5/tiebekabe.pdf

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)

Recommendations

• On the exponential Diophantine equation \(F_n^x+F_{n+1}^x+\cdots+F_{n+k-1}^x=F_m\)
• On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
• On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
• On the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}
• On the Diophantine equation F_n + F_m=2a

Cited in

(6)

• On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
• On the Diophantine equation in the form that a sum of cubes equals a sum of quintics
• On the period-five trichotomy of the rational equation
• On the Diophantine equation $\displaystyle \sum _{k=1}^{5}F_{n_k}=2^a$
• On the Diophantine equation \(F_n^2+F_m^2=2^{\alpha}\)
• Powers as Fibonacci sums

This page was built for publication: On the Diophantine equation \(\sum^5_{k=1}F_{n_k}=2^a\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889301)