The Fibonacci sequence, F0,F1,F2,…, is defined by the initial condition F0=0, F1=1, and the recurrence relation Fn=Fn−1+Fn−2 for n=2,3,4,...
0,1,1,2,3,5,8,13,21,34,55,89,144,... A.
Fn+1=Fn+Fn−1<Fn+Fn=2Fn,n≥3 The statement 2Fn>Fn+1 is true for n≥3
B.
2Fn+4=2(Fn+3+Fn+2)=Fn+3+Fn+3+2Fn+2 Since Fk>0 for k≥1, then
2Fn+4=Fn+3+Fn+3+2Fn+2>Fn+3,n≥3 The statement 2Fn+4=Fn+3 is false for n≥3.
Comments