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.

why can't you?

step-by-step explanation:

answer: solve 5\cdot 2^x=2405⋅2  

x

=2405, dot, 2, start superscript, x, end superscript, equals, 240.

solution

to solve for xxx, we must first isolate the exponential part. to do this, divide both sides by 555 as shown below. we do not multiply the 555 and the 222 as this goes against the order of operations!

\begin{aligned} 5\cdot 2^x& =240 2^x& =48 \\ \end{aligned}  

5⋅2  

x

2  

x

​    

=240

=48

​

step-by-step explanation: