Elchin Hasanalizade
Published 2022-06-14Version 1
In this paper, we find all sums of two Fibonacci numbers which are close to a power of 2. As a corollary, we also determine all Lucas numbers close to a power of 2. The main tools used in this work are lower bounds for linear forms in logarithms due to Matveev and Dujella-Peth\"{o} version of the Baker-Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of Chern and Cui.
On solutions of the Diophantine equation $L_n+L_m=3^a$
Sums of three Fibonacci numbers close to a power of 2
Powers of two as sums of two $k-$Fibonacci numbers
![QR code for arXiv:2206.10356 [math.NT]](http://oss.arxitics.com/images/favicon.svg)