Which recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1?
6, 1, –4, –9, –14, …
f (n + 1) = f(n) + 5
f (n + 1) = f(n) – 5
f (n) = f(n + 1 ) – 5
f (n + 1) = –5f(n)

 The correct option is

(B)

Step-by-step explanation:  We are given to select the correct recursive formula that can be used to generate the following sequence :

Let f(n) denote the nth term of the given sequence. Then, we note that

Therefore, the recursive formula can be written as :

Thus, the required recursive formula is

Option (B) is CORRECT.

no

step-by-step explanation:

2-7=-5

7-2=5

when you combing like terms for ech expression, 5 and -5. these numbers are not equal to each other.

i think the answer is fried chicken ; >

step-by-step explanation: