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?

Choices:

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?

Choices:


 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

Hey @sleepyjess I hate to bother you again but could you please help me out on this one too?

sleepyjess · Answer

mmmm recursive functions, I was never very good at these, @dan815

anonymous · Answer

@mathstudent55

anonymous · Answer

@jdoe0001 could you help?