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)

You can try them out and see which one works.

a: f(2) = f(1) +6 = 5+6 = 11 . . . . . . not this one

b: f(1) = f(2) -6 = -1-6 = -7 . . . . . . not this one (5 ≠ -7)

c: f(2) = f(1) - 6 = 5 - 6 = -1 . . . . . this gives the right f(2)

d: f(2 = -6(f(1) = -6(5) = -30 . . . . not this one

The appropriate choice is ...

... f(n +1) = f(n) - 6

— — — — — 

You can also recognize that the next term is 6 less than the current one, so f(n+1) = f(n) - 6, which corresponds to the 3rd selection.

step-by-step explanation:

*calories burned = (weight)(calorie factor)*

calories burned = 180 (0.65)

calories burned = 117

the calories he used up is 117, which is 65% of his weight.