SOLUTION: 2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then f(2) is equal to A. -11 B. 1 C. 5 D. 17

SOLUTION: 2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then f(2) is equal to A. -11 B. 1 C. 5 D. 17

Algebra.Com

Question 1049756: 2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then f(2) is equal to
A. -11
B. 1
C. 5
D. 17
Answer by MathLover1(20850) (Show Source): You can put this solution on YOUR website!

given:
and
for ,
here is the sequence for the first three numbers:

:

:

so, is equal to and your answer is C.

RELATED QUESTIONS
If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2)... (answered by greenestamps)

If a sequence is defined recursively by f(1)= -2 and f(n-1) = 3(n-1)-4, then find the... (answered by ikleyn)

A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 2n Find... (answered by robertb)

A sequence is defined recursively by f(1)=20 and fn=f(n-1)-4n find... (answered by ikleyn)

Let f be a function defined by f(n)=2f(n-1)+3f(n-2), where f(1)=3 and f(2) = 1.... (answered by ikleyn)

If f(x)= x-2/x+1, then f(n+1) is equal to.. A)-1/2 b)n-2/n+1 c)n-1/n+2... (answered by richard1234)

The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. (answered by CPhill,greenestamps)

if f(1)=5 and f(n)=-2f(n-1)+2 then what is the value of... (answered by MathLover1)

Let (Fn)=(1,1,2,3,5,8,13,21,34,55,...) be the fibonacci sequence defined by F1=F2=1,... (answered by venugopalramana)