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

I mean i dont even think its either a geometric sequence or arithmetic

Answer 3

ill help you dont worry

Answer 4

If you need the explicit formulas let me know

Answer 5

yes i would like that it would be very help ful

Answer 6

Arithmetic explicit formula: f(n)=f(1)+d(n-1)
Geometric explicit formula : f(n)=f(1)*r ^n-1

Answer 7

\[f(n)=f(1)*r ^{n-1}\]

Answer 8

thats the geometric , just to make it easier to see

Answer 9

hold on im going to get some help

Answer 10

lol

Answer 11

Hey sorry was afk but what guy commented? he must of deleted the comments. Thanks everyone who tried to help :)

Answer 12

f(1)=1
f(2)=2

Answer 13

f(n)=f(n-1)+f(n-2) for n>2
as for n=3
f(3)=f(3-1)+f(3-2)=f(2)+f(1)=2+1=3

Answer 14

2nd one

Answer 15

Thank you! @gorv