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?
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
Answers
Only authorized users can leave an answer!
Can't find the answer?
If you are not satisfied with the answer or you can’t find one, then try to use the search above or find similar answers below.
Find similar answersMore questions
Answered by Felecityyy
The answer is the fourth option - f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 The first term is 4, So, f(1) = 4 The difference between two consecutive integer = 2, so, n = (n-1) + 2 It would be Option D) f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 Hope this helps!