show that Fibonacci numbers satisfy the recurrence relation fn=5f(n-4)+3f(n-5) for n=5,6,7...,together with the initial conditions f0=0,f1=1,f2=1,f3=2,f4=3.use this recurrence relation to show that f5n is divisible by 5,for n=1,2,3...注:fibonacci

来源:学生作业帮助网 编辑:作业帮 时间:2024/11/29 15:43:16
xSR0-D A&fe! V 3).4@CaHB  &C;!ұdg/6Lݳ񕮮=(Edel\,-j[t 5djXN.`2 d:OHb&,~% l/5mEݞ L<lV],D)LjSE~R鴚J,Xѭ tnV[zv^C%Dp&09<7,YsIQ"ˠғcǸ(j⊌0; J 5mDTrw0&XК#Y-̇ػD~):5TZ/Ϯ@Ytv7FGMP,.{y+1/}vN;,C9K, o:A^vwz=يPc$!+-?| r{^=?;wI+a3n/݂oxM[NUQ{a(_u