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

Question

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

anonymous · Answer

It is gonna be one of the ones with the Plus sign in it. so..
you have a 50% chance.

anonymous · Answer

which one should I pick then?

anonymous · Answer

hold on i am trying to work it out.

anonymous · Answer

go wid the second one  with the plus so the 3rd.

anonymous · Answer

Unless I did something wrong.

anonymous · Answer

k

anonymous · Answer

Just look at n = 4, 5 and 6 and figure how you can get 4096 for that very big 6th term.

anonymous · Answer

some prior suggestions here were incorrect