Register
A sequence is defined by the recursive function f(n + 1) = f(n) – 2. If f(1) = 10, what is f(3)?
9.5k views
4 votes
A sequence is defined by the recursive function f(n + 1) = f(n) – 2.

If f(1) = 10, what is f(3)?

User Desolate
by
7.9k points

2 Answers

4 votes

Answer:

f (3) = 6

Explanation:

User Natim
by
8.4k points
1 vote
I hope this helps you
A sequence is defined by the recursive function f(n + 1) = f(n) – 2. If f(1) = 10, what-example-1
User Sunsetjunks
by
7.2k points
← Prev Question Next Question →

No related questions found

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

9.4m questions

12.2m answers

Other Questions

How do you can you solve this problem 37 + y = 87; y =
How do you estimate of 4 5/8 X 1/3
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?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
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!