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?

A. f(1) = 2 and f(n) = f(n - 1) + 4; n 1

B. f(1) = 4 and f(n) = f(n - 1) + 2n; n 1

C. f(1) = 2 and f(n) = f(n - 1) + 4n; n 1

D. f(1) = 4 and f(n) = f(n - 1) + 2; n 1

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?

A. f(1) = 2 and f(n) = f(n - 1) + 4; n > 1

B. f(1) = 4 and f(n) = f(n - 1) + 2n; n > 1

C. f(1) = 2 and f(n) = f(n - 1) + 4n; n > 1

D. f(1) = 4 and f(n) = f(n - 1) + 2; n > 1

anonymous · Answer

@KamiBug @TheRaggedyDoctor @FibonacciChick666

theraggedydoctor · Answer

Why do I keep getting mentioned XD GAH