A sequence has its first term equal to 8, and each term of the sequence is obtained by adding 6 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) = 6 and f(n) = f(n − 1) + 8; n 1
f(1) = 8 and f(n) = f(n − 1) + 6; n 1
f(1) = 8 and f(n) = f(n − 1) + 6n; n 1
f(1) = 6 and f(n) = f(n − 1) + 8n; n 1

Question

A sequence has its first term equal to 8, and each term of the sequence is obtained by adding 6 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) = 6 and f(n) = f(n − 1) + 8; n > 1
f(1) = 8 and f(n) = f(n − 1) + 6; n > 1
f(1) = 8 and f(n) = f(n − 1) + 6n; n > 1
f(1) = 6 and f(n) = f(n − 1) + 8n; n > 1

mhchen · Answer

This is a RECURSIVE formula
so f(n-1)+<constant>

"first term equals 8"
Only the 2nd and 3rd options have f(1) = 8
f(n-1) + 6 <-- 6 is a constant in a recursive formula.

krissiekinz · Answer

so is it B mhchen?