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 3 5 8 13


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 1

@freckles , @RosieF , @SolomonZelman , @timo86m

Answer 2

@mathway u where doing good

let n=3

then

f(3)= 3 and find that f(n) that = 3

For example....

Answer 3

eh anyhoo just a thought

Answer 4

Well I got B as the answer.

Answer 5

sorry i am not 100% sure

but it seems it can be look for more help :)

Answer 6

ooh the pattern is the last 2 added up

Answer 7

so for example if we are at f(3)

Option b says
f(n -1) + f(n - 2)

f(3-1)+f(3-2)
f(2)+f(1)
2 + 1=3 f(1)=1 and f(2)=2


its b :)

Answer 8

Got it. Thank you.

Answer 9

its a fibonacci series