Register
A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 12 find f(4)
94.6k views
3 votes
A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 12 find f(4)

User Flashburn
by
7.8k points

1 Answer

1 vote

f(1)=16\\ f(n)=f(n-1)+12\\\\ f(2)=f(2-1)+12=f(1)+12=16+12=28\\ f(3)=f(3-1)+12=f(2)+12=28+12=40\\ f(4)=f(4-1)+12=f(3)+12=40+12=52\\\\ \boxed{f(4)=52}
User Cruppstahl
by
7.6k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

8.6m questions

11.2m answers

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
Write words to match the expression. 24- ( 6+3)
A dealer sells a certain type of chair and a table for $40. He also sells the same sort of table and a desk for $83 or a chair and a desk for $77. Find the price of a chair, table, and of a desk.
Link Copied!