This note is one of many taken during 2024
Fibonacci Sequence
The Fibonacci sequence is defined as
F1=Fn+2=F2=1Fn+1+FnAre there any Fibonacci numbers
Fn such that
Fn+1>2Fn?
Fn+1=Fn+Fn−1Substitute into inequality
Fn+Fn−1>2Fn
Fn−1>FnWhich is never true for the sequence.
Another question: which Fibonacci numbers
Fn are such that
Fn+2>2Fn?
Again substitute
Fn+1+Fn>2Fn
Fn+1>FnWhich is true for all Fibonacci numbers except for when
n=1.
In a similar spirit, it is obvious that
Fn=Fn−1+Fn−2But this form can be reduced further to be a sum of
Fn−2 and
Fn−3
Fn=====Fn−1+Fn−2Fn−2+Fn3+Fn−22Fn−2+Fn−3and again2Fn−3+2Fn−4+Fn−33Fn−3+2Fn−4The coefficients on the reduced forms are interesting to me. Given coefficients
ak,bk in a specific level of reduced Fibonacci, find
ak+1,bk+1
akFn−1+bkFn−2=ak(Fn−2+Fn−3)+bkFn−2=(ak+bk)Fn−2+akFn−3We define
a1=b1=1. and,
ak+1=bk+1=ak+bkak
ak+2=ak+1+bk+1=ak+1+akNotice something peculiar about the above identity: it’s also the Fibonacci sequence!
This allows us to define a specific level of reduced Fibonacci symbolically. Let
k>1
Fn=akFn−k+1+bkFn−k
Fn=FkFn−k+1+Fk−1Fn−kAs an example
n=10 and
k=4
F10=F4F7+F3F6
55=3⋅13+2⋅8
This note is one of many taken during 2024