Question

Help for MEDAL : question about sequences

n 1 2 3 4 5 6
f(n) 1 2 3 5 8 13

Answer 1

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

f(1) = 1, f(2) = 2, f(n) = f(n -1) + 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) = f(n -3) f(n - 2); n > 2

Answer 2

@briannamooney

Answer 3

can you help @shinalcantara

Answer 4

you were right why did you delete your answer

Answer 5

i found it having problem when having it as a function of 5 & 6.. there's something wrong about it.. it will only be true to 1,2,3 & 4

Answer 6

ohh but it was still the 2nd one