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

Someone please help me for a medal and fan?!?!

OpenStudy (anonymous):

A sequence has its first term equal to 3, and each term of the sequence is obtained by adding 5 to the previous term. If f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence?

geerky42 (geerky42):

f(n) is term, so f(n-1) is previous term

geerky42 (geerky42):

So you can express it as \(f(n) = 5+f(n-1)\)

geerky42 (geerky42):

Does that make sense?

OpenStudy (anonymous):

Yeah, it does. I got f(1) = 3 and f(n) = f(n - 1) + 5; n > 1, is that correct?

geerky42 (geerky42):

Looks good!

OpenStudy (anonymous):

3+5(n-1)

OpenStudy (anonymous):

Okay, thanks geerky!

geerky42 (geerky42):

@DordtCollege Key words: "recursive functions"

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!