On sums of two Fibonacci numbers that are powers of numbers with limited Hamming weight
From MaRDI portal
Publication:6426682
Abstract: In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is . In other words, they conjectured that the equation �egin{equation} ag{}label{eq:abstract} y^a = F_n + F_m end{equation} has no solutions with and . 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 , which depends on the size of . In this paper, we find an explicit upper bound for , which only depends on the Hamming weight of with respect to the Zeckendorf representation. More specifically, we prove the following: If and equation eqref{eq:abstract} is satisfied by and some non-negative integers and , then [ y^a leq expleft(C{(varepsilon)} cdot k^{(3+varepsilon)k^2}
ight). ] Here, can be chosen arbitrarily and is an effectively computable constant.
Recommendations
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)