arXiv · 2104.12593
On sums of Fibonacci numbers with few binary digits
Abstract
In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport reduction method, we use $p$-adic versions of both tools.
Explore related subjects
Keep this discovery
Ingrid Vukusic, Volker Ziegler. 2021-04-26. On sums of Fibonacci numbers with few binary digits. https://arxiv.org/abs/2104.12593
Cite the original work for its findings. Save a collection to share your selection of sources.