Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (secret-ninja):

Medals! Last question! Am I right? The table below shows the values of f(n) for different values of n:

OpenStudy (secret-ninja):

OpenStudy (secret-ninja):

Which recursive function best represents the values shown in the table?

OpenStudy (secret-ninja):

OpenStudy (secret-ninja):

I don't know how to get the answer.

OpenStudy (secret-ninja):

I think it might be B... I'm not sure.

OpenStudy (secret-ninja):

@immanuelv

OpenStudy (aum):

From the table we can see the entry for f(n) is the sum of the previous two entries for f(n). For example, when n = 4, f(n) = 5 which is sum of the previous two entries: 3 + 2.

OpenStudy (secret-ninja):

... I still don't really get it..

OpenStudy (secret-ninja):

:[

OpenStudy (secret-ninja):

Is it C? @aum

OpenStudy (secret-ninja):

Please help me you guys. D':

OpenStudy (secret-ninja):

@iGreen Please help! This is my last question. :(

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!