203k views
3 votes
PLEASE HELP I NEED TO TURN THIS IN TONIGHT! Question

Modify the general recursive function so that it models this situation for n ≥ 2and the initial condition of f(1) = 12.
Enter the correct answer in the box.

PLEASE HELP I NEED TO TURN THIS IN TONIGHT! Question Modify the general recursive-example-1

2 Answers

7 votes

f(n) = 12 * n

This modified recursive function models the situation where the value of f(n) is equal to 12 multiplied by n, starting from the initial condition of f(1) = 12.
User Mavi
by
8.3k points
5 votes

Answer:

f(n)= f( n-1 ) + 6

User Shizzle
by
8.5k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories