Register
Find f(1), f(2), f(3) and f(4) if f(n) is defined recursively by f(0)=4 and for n=0,1,2,… by: (a) f(n+1)=1f(n)
60.5k views
5 votes
Find f(1), f(2), f(3) and f(4) if f(n) is defined recursively by f(0)=4 and for n=0,1,2,… by: (a) f(n+1)=1f(n)

User Khrystyna
by
7.5k points

1 Answer

4 votes


f(3) = 6
Given that,

f(n + 1) = f(n) - 2


f(n + 1) - f(n) = - 2
User GeoffM
by
8.0k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

8.3m questions

11.0m answers

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
Link Copied!