Question

In a sequence is defined recursively by f(0)=3 and f(n+1)=-f(n)+5 for n≥ 0, then f(2) is eqaul to

Answer 1

$f(0) = 3 \\ \Rightarrow f(1) = - f(0) + 5 = - 3 + 5 = 2 \\ \Rightarrow f(2) = - f(1) + 5 = - 2 + 5 = 3$