Can any number be present in a Fibonacci-like sequence?

168 Views Asked by At

Can any natural number be expressed in an increasing series (whole numbers, greater than 2 elements) in which the next element is the sum of the previous two elements? If so, what is the proof and how does one find some of these elements (such as Binets formula for the original Fibonacci sequence)?

1

There are 1 best solutions below

0
On

The answer is trivially yes: Say you have the number $N$. Then take the sequence $$ A_0 = 1 \\ A_1 = N-1 \\ \forall k>1: A_k = A_{k-1}+A_{k-2} $$

Then $A_2 = N$.