Question

WILL FAN AND MEDAL!!!
The 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

Answer 1

Please helpp!!!

Answer 2

@KlOwNlOvE

Answer 3

@deadpool123 @Catseyeglint911

Answer 4

I personally don't know how to solve for the answer, but
http://openstudy.com/study#/updates/53bd8344e4b0bbb79bdbbb68
has the answer as well as an excellent explanation.
Hope it help. :)

Answer 5

@campbell_st

Answer 6

thanks @Catseyeglint911

Answer 7

And to be honest, just by looking at the problem above, I agree with what the person had to say.
And no problem. ^^

Answer 8

well i'd say the last answer...

so to get the 4th term

is 2* 3rd term * 2nd term

16 = 2* 4 * 2

now try it for the 5th term

128 = 2 * 16 * 4

seems to work

Answer 9

okay thanks @campbell_st, so which answer would that be? it looks like the last one

Answer 10

yes

Answer 11

Thank ya'll so much!!!