Question

If a sequence is defined recursively by f(o)=3 and f(n+1) = -f(n) + 5 for n≥0, then f(2) is?

Answer 1

f(0)=3 and f(n+1) = -f(n) + 5 for n≥0
so f(1) = -f(0) + 5 = -3 + 5 = 2
f(2) = -f(1) + 5 = -2 + 5 = 3