he table below shows the values of f(n) for different values of n:

n 1 2 3 4 5 6
f(n) 1 2 4 16 128 4096

Which recursive function best represents the values shown in the table?
f(1) = 1, f(2) = 2, f(n) = f(n -3) + f(n - 2); n 2
f(1) = 1, f(2) = 2, f(n) = f(n -3) f(n - 2); n 2
f(1) = 1, f(2) = 2, f(n) = 2f(n -1) + f(n - 2); n 2
f(1) = 1, f(2) = 2, f(n) = 2f(n -1) f(n - 2); n 2

Question

he table below shows the values of f(n) for different values of n:


n	1	2	3	4	5	6
f(n)	1	2	4	16	128	4096


Which recursive function best represents the values shown in the table?
 f(1) = 1, f(2) = 2, f(n) = f(n -3) + f(n - 2); n > 2
 f(1) = 1, f(2) = 2, f(n) = f(n -3) f(n - 2); n > 2
 f(1) = 1, f(2) = 2, f(n) = 2f(n -1) + f(n - 2); n > 2
 f(1) = 1, f(2) = 2, f(n) = 2f(n -1) f(n - 2); n > 2

elise_a18 · Answer

@sammixboo

sammixboo · Answer

Oh dear

Functions

o_=

Anyways, give me a second to see if I can help

elise_a18 · Answer

otay, if you aren't able that's okay :D

sammixboo · Answer

Yeah, I am awful at functions. Just take a look here =) If you don't understand, then I will try to explain what I can http://openstudy.com/study#/updates/53bd8344e4b0bbb79bdbbb68

elise_a18 · Answer

Thanks :)

sammixboo · Answer

Hehe