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
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
@iambatman
OpenStudy (anonymous):
Well which one can we eliminate right away.
"A sequence has its first term equal to 4"
OpenStudy (anonymous):
a?
OpenStudy (anonymous):
Yes a, and?
OpenStudy (anonymous):
c?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
Nicely done
OpenStudy (anonymous):
So now we just have b and d :) making our life easier
OpenStudy (anonymous):
lol yup :)
OpenStudy (anonymous):
Now look here, "and each term of the sequence is obtained by adding 2 to the previous term."
OpenStudy (anonymous):
f(n-1) + ?n is what it's saying, what's the question mark
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
what you are asking me ?
OpenStudy (anonymous):
I'm asking you to read the question, and tell me what it's saying
OpenStudy (anonymous):
"and each term of the sequence is obtained by adding 2 to the previous term."
OpenStudy (anonymous):
We know that f(n) represents the nth term
OpenStudy (anonymous):
ok i beleve it is b?
Still Need Help?
Join the QuestionCove community and study together with friends!