Which sequence could be partially defined by the recursive formula f (n + 1) = f(n) + 2.5 for n ≥ 1?

2.5, 6.25, 15.625, 39.0625, …
2.5, 5, 10, 20
–10, –7.5, –5, –2.5, …
–10, –25, 62.5, 156.25

Option C: –10, –7.5, –5, –2.5, … is the sequence that could be partially defined by the recursive formula

Explanation:

The given recursive formula is for and

We need to determine the sequence.

The sequence can be determined by substituting n = 1, 2, 3, 4,....

2nd term of the sequence:

Substituting n = 1 in the formula , we get,

Simplifying, we have,

Thus, the 2nd term of the sequence is -7.5

3rd term of the sequence:

Substituting n = 2 in the formula , we get,

Simplifying, we have,

Thus, the 3rd term of the sequence is -5

4th term of the sequence:

Substituting n = 3 in the formula , we get,

Simplifying, we have,

Thus, the 4th term of the sequence is -2.5

Therefore, the sequence is –10, –7.5, –5, –2.5, …

Hence, Option C is the correct answer.

first option

a function is a relation in which an input is paired with exactly one output.

so, let's find the right answer.

in our first option, our inputs are january, february, and march. the outputs are 30, 28, and 25. each input has it's own output. this is correct!

our second option we know is incorrect, because ms. valverade has two outputs, dogs and cats. this is not a function.

our third option is incorrect as well. the yellow square has two ouputs, the square and the triangle.

lastly, in our fourth option, we see the number 7 two times with a different output. therefore, this is not a function.

remember: each input must be paired with only one output!

jeff jeff

step-by-step explanation: