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
well the first term is 4 so which 2 options can you rule out?
A and C?
yes
now try which of the other 2 options add 2 to a term in the series/
try plugging in 2 for n and see if it gives 6 as the second term (we know that the series is 4,6,8 ...)
B?
we know its either b or d
i think its B
lets try b: f(n-1) + 2n f(2) = f(2-1) + 2(2) = f(1) + 4 now f(1) = 4 so f(20 = 4+4 = 8 this one?
do you follow theabove?
yea but did you mean to put(2)
yes
if you try d you get f(1) + 2 = 4 + 2 = 6
sorry i was talking to my teacher but so its D?
yes
Join our real-time social learning platform and learn together with your friends!