我家有个zz~

Discussion The i’th Fibonacci number f(i) is recursively defined in the following way: •f(0)=0 f(0) = 0 andf(1)=1f(1) = 1 • f(i+2)=f(i+1)+f(i)f(i + 2) = f(i + 1) + f(i) for every i ≥ 0