Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n 1?

5,–1, –7, –13, –19, ...

f(n + 1) = f(n) + 6
f(n) = f(n +1) – 6
f(n +1) = f(n) – 6
f(n +1) = –6f(n)

Question

Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1?

5,–1, –7, –13, –19, ...

f(n + 1) = f(n) + 6
f(n) = f(n +1) – 6
f(n +1) = f(n) – 6
f(n +1) = –6f(n)

freckles · Answer

look at the terms what is happening?

freckles · Answer

like is there a common difference?

freckles · Answer

if so what?

karolynxx · Answer

It's going down -6 each time right ?

freckles · Answer

which one of the recursive formulas shows that...
that is which one shows term=previous term - 6

karolynxx · Answer

B , C , D right now

freckles · Answer

no not all of those show that

karolynxx · Answer

I believe its B .

freckles · Answer

f(n+1) is a term
what is the term previous to f(n+1)?

karolynxx · Answer

Oh C!

freckles · Answer

yes if f(n+1) is a term in the sequence then the previous term to it is f(n)
and we were looking for the one that said term=previous term-6
so that is f(n+1)=f(n)-6

freckles · Answer

you can even verify if you want plug in n=1 and and see if you get f(2) is -1

karolynxx · Answer

I get it now cause thats the formula ! Thank you!

freckles · Answer

np