Answer:
778%, 7.42, and V48
Step-by-step explanation:
I think that is right
Answer:
Answer is C
Step-by-step explanation:
The very pharmacy technician must be held guilty
<h3>
Answer: Choice C) 31</h3>
==============================================
Explanation:
The recursive rule
f(n+1)=f(n)-3
can be rearranged to
f(n) = f(n+1)+3
after adding 3 to both sides
----------------
Now let's say we plug in n = 3
f(n) = f(n+1)+3
f(3) = f(3+1)+3
f(3) = f(4)+3
f(3) = 22+3
f(3) = 25
Repeat for n = 2
f(n) = f(n+1)+3
f(2) = f(2+1)+3
f(2) = f(3)+3
f(2) = 25+3
f(2) = 28
Each time we keep adding 3 to get the previous term (since the original recursive rule says to subtract 3 to get the next term; we just go backwards of what the instructions say).
Lastly, we can find that f(1) = f(2)+3 = 28+3 = 31 making the answer to be choice C.
Using synthetic division to divide
x³ + 2x² - x - 2. Since (x + 1) is the factor, we can divide by -1. See the attached file for the synthetic division. After that, we are left with x² + x - 2. This can easily be factored into (x + 2)(x - 1). The remaining factors are (x + 2) and (x - 1).
