Find f(1), f(2), f(3), and f(4) if f(n) is defined recursively by f(0) = 1 and for n = 0,1,2,...

a) f(n+1) = f(n) + 2
b) f(n+1) = 3 f(n)

Question

Find f(1), f(2), f(3), and f(4) if f(n) is defined recursively by f(0) = 1 and for n = 0,1,2,...

a) f(n+1) = f(n) + 2 
b) f(n+1) = 3 f(n)

gorv · Answer

f(n+1) what value of n we should take so that we get f(1)
f(n+1)=f(1)??? at what value on n

gorv · Answer

what we put in place of n in  f(n+1) so that it become f(1)??

gorv · Answer

yeah you are right

gorv · Answer

so now 
f(n+1)=f(n)+1
for n=0
f(1)=f(0)+1   =????

gorv · Answer

plug in value of f(0)

anonymous · Answer

f(1) = f(0) + 1 = 1 

f(1)?

gorv · Answer

f(0)=1
f(1)=1+1=2
similarly find others

anonymous · Answer

The answers in the back of textbook: f (1) = 3, f (2) = 5, f (3) = 7, f (4) = 9

so f(1) is 3 not 2..