On sums of two Fibonacci numbers that are powers of numbers with limited Hamming weight

From MaRDI portal
Publication:6426682

DOI10.2989/16073606.2023.2256477arXiv2302.08303OpenAlexW4387370319MaRDI QIDQ6426682FDOQ6426682


Authors: Ingrid Vukusic, Volker Ziegler Edit this on Wikidata


Publication date: 16 February 2023

Abstract: In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is 38642=F36+F12. In other words, they conjectured that the equation �egin{equation} ag{ast}label{eq:abstract} y^a = F_n + F_m end{equation} has no solutions with ageq2 and ya>38642. While this is still an open problem, there exist several partial results. For example, recently Kebli, Kihel, Larone and Luca proved an explicit upper bound for ya, which depends on the size of y. In this paper, we find an explicit upper bound for ya, which only depends on the Hamming weight of y with respect to the Zeckendorf representation. More specifically, we prove the following: If y=Fn1+dots+Fnk and equation eqref{eq:abstract} is satisfied by y and some non-negative integers n,m and ageq2, then [ y^a leq expleft(C{(varepsilon)} cdot k^{(3+varepsilon)k^2} ight). ] Here, varepsilon>0 can be chosen arbitrarily and C(varepsilon) is an effectively computable constant.


Full work available at URL: https://doi.org/10.2989/16073606.2023.2256477




Recommendations




Cited In (1)





This page was built for publication: On sums of two Fibonacci numbers that are powers of numbers with limited Hamming weight

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