Math 离散数学递归定义
所以我们在课堂上研究这个问题,对于f(2),我得到了相同的答案,但是对于f(3),我得到了与教授不同的答案Math 离散数学递归定义,math,recursion,definition,Math,Recursion,Definition,所以我们在课堂上研究这个问题,对于f(2),我得到了相同的答案,但是对于f(3),我得到了与教授不同的答案 Basis: f(0) = -1 and f(1) = 2 Recursion: f(n) = f(n-2) - f(n-1) For f(3) I am getting 1 f(3-2) - f(3-1) =f(1) - f(2) =2 - f(2-2) - f(2-1) =2 - -1 - 2 =2+1-2 = 1 但他得到的答案是: 5 这应该是 = 2 - (-1-2) =
Basis: f(0) = -1 and f(1) = 2
Recursion: f(n) = f(n-2) - f(n-1)
For f(3) I am getting 1
f(3-2) - f(3-1)
=f(1) - f(2)
=2 - f(2-2) - f(2-1)
=2 - -1 - 2
=2+1-2 = 1
但他得到的答案是:
5
这应该是
= 2 - (-1-2) = 2 + 1 + 2 = 5
因为f(2)是整个f(2-2)-f(2-1)。谢谢
= 2 - (-1-2) = 2 + 1 + 2 = 5