Question

A sequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. If f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 I WILL AWARD BRAINLIEST!!!

Answer 1

It would be f(n)= f(n-1) +4 this is because f(n-1) means the previous term and you would add your 4 that you gain every time.

Answer 2

Answer:

Option D

Step-by-step explanation:

A sequence has its first term f(1) = 4 and each term of the sequence is obtained by adding 2 to the previous terms.

Now we have to design a recursive formula for the nth term of the sequence.

f(n) = f(n-1) + 2 where n > 1 and f(1) = 4

Here f(n) means nth term

and f(n-1) is the previous term of the nth term of the sequence.

Option D will be the answer.