On the Diophantine equation \displaystyle \sum _{k=1}^{5}F_{n_k}=2a

Authors Pagdame Tiebekabe, Ismaïla Diouf

Publication date 16 September 2022

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

arXiv classification

math.NT

Abstract: Let

(F_{n})_{n g e q 0}

be the Fibonacci sequence given by

F_{0} = 0, F_{1} = 1

and

F_{n + 2} = F_{n + 1} + F_{n}

for

n g e q 0

. In this paper, we have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that we characterize. We have also stated an open problem relating to the number of solutions of equations like those studied in this paper.

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

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