Asked by Amelia
Turn the recursive function into its equivalent explicit function:
f(1) = 18;
f(n) = f(n - 1) + 6;
n is be greater than or equal to 2*
How would I solve this? Any help is appreciated! Thanks!
*The symbol for that is the > with a line under it, I couldn't paste that in jiskha.
f(1) = 18;
f(n) = f(n - 1) + 6;
n is be greater than or equal to 2*
How would I solve this? Any help is appreciated! Thanks!
*The symbol for that is the > with a line under it, I couldn't paste that in jiskha.
Answers
Answered by
R_scott
n ≥ 2
looks like you're starting at 18, and adding 6 to each consecutive term
An = 6 (n + 2)
looks like you're starting at 18, and adding 6 to each consecutive term
An = 6 (n + 2)
Answered by
Amelia
Yes, n ≥ 2, thank you!
So the answer that was given to me was:
f(n) 12 + 6n; n ≥ 1
So do I just plug in the numbers for An = 6(n + 2) to get there? Sorry, I'm having a bit of trouble understanding it... I'm just unsure of how they came up with that answer.
So the answer that was given to me was:
f(n) 12 + 6n; n ≥ 1
So do I just plug in the numbers for An = 6(n + 2) to get there? Sorry, I'm having a bit of trouble understanding it... I'm just unsure of how they came up with that answer.
Answered by
R_scott
An becomes f(n) ... distributing the 6 ... 6n + 12
f(n) = 6 n + 12
f(n) = 6 n + 12
Answered by
Amelia
Oh wow! It was so simple I couldn't even see it! I guess I overthought it.... Thank you so much for your help!
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.