Answer:
There are three intersections on the graph, therefore there are three solutions to the system
Step-by-step explanation:
In order to find the number of chips that would result in the minimum cost, we take the first derivative of the given equation. Note that the derivative refers to the slope of the graph at a given point. We can utilize this concept knowing that at the minimum or maximum point of a graph, the slope is zero.
Taking the derivative of the given equation and equating it to zero, we have:
y' = (0.000015)(2)x - (0.03)x° + 0
0 = (0.00003)x - 0.03
Solving for x or the number of chips produced, we have x = 1000. We then substitute this value in the given equation, such that,
y = (0.000015)(1000)² - (0.03)(1000) + 35
The minimized cost, y, to produce 1000 chips is then calculated to be $20.
Answer:
The exact solution for this equation would be (2.222, -11.889)
Step-by-step explanation:
Since it told us to use a graphing calculator, I went on to desmos graphing calculator, typed in the equation, then I found out where the two line intersect, and then that was the answer.
I don’t really know what the answer is
