SOLUTION: A sequence is defined recursively by f(1)=20 and fn=f(n-1)-4n find f(3)

SOLUTION: A sequence is defined recursively by f(1)=20 and fn=f(n-1)-4n find f(3)

Algebra.Com

Question 1181257: A sequence is defined recursively by f(1)=20 and fn=f(n-1)-4n find f(3)
Answer by ikleyn(52776) (Show Source): You can put this solution on YOUR website!
.

INSTRUCTION on how to make your first step

Simplify your task and make first step on your own, calculating f(2) with the formula.

For it, substitute n= 2 into the formula and use the value of 20 for f(1).

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

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

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)

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

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)

A function f is defined on the set of positive integers by f(1) = 1, f(3) = 3, f(2n) = n, (answered by greenestamps)

The sequence is defined recursively. Write the first five terms. {{{a[1]=-3}}};... (answered by Edwin McCravy)

The sequence u_n is defined recursively by the rules u_1 = 3, u_2 = 3, u_(n+2) = u_(n+1) (answered by richard1234)

A sequence has its first term equal to 4, and each term of the sequence is obtained by... (answered by ikleyn)