SOLUTION: If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2) is equal to?

SOLUTION: If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2) is equal to?

Algebra.Com

Question 1131897: If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0
then f(2) is equal to?
Answer by greenestamps(13200) (Show Source): You can put this solution on YOUR website!

f(0)=2; for n >= 0, f(n+1) = -2*f(n)+3.

Set n = 0 in the recursive definition to find f(1):
n=0: f(1) = -2*f(0)+3 = -2(2)+3 = -4+3 = -1

Set n = 1 in the recursive definition to find f(2):
n=1: f(2) = -2*f(1)+3 = -2(-1)+3 = 2+3 = 5

ANSWER: f(2) = 5
RELATED QUESTIONS
2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then (answered by MathLover1)

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(n)} = {1,1,2,3,5,8,13,21,34,55,��} be the Fibonacci sequence defined by F(1) = (answered by AnlytcPhil)

The sequence an is defined recursively by the rules a0 = 0, a1 = 3, and for n is greater... (answered by davethejackal)

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)

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

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