Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

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

ganeshie8 (ganeshie8):

first term equal to 4

ganeshie8 (ganeshie8):

that gives f(1) = 4

ganeshie8 (ganeshie8):

each term of the sequence is obtained by adding 2 to the previous term. gives f(n) = f(n-1) + 2

OpenStudy (anonymous):

Would it be D? :)

ganeshie8 (ganeshie8):

Yes :)

OpenStudy (anonymous):

Thanks soo much! :D I appreciate your help! :D<3

ganeshie8 (ganeshie8):

u wlc :D

OpenStudy (anonymous):

:D

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!