On solutions of the Diophantine equation Fn1+Fn2+Fn3+Fn4=2a

Abstract

Let (Fn)n≥ 0 be the Fibonacci sequence given by F0 = 0, F1 = 1 and Fn+2 = Fn+1+Fn for n ≥ 0. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we characterize.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…