Answer:
range = {-8,-5,-2,1}
Step-by-step explanation:
you can plug in each value for x.
138,202 is closest to 138,201 because 138,202 is closer to 138,201 than it is to 138,203
The requirement is that every element in the domain must be connected to one - and one only - element in the codomain.
A classic visualization consists of two sets, filled with dots. Each dot in the domain must be the start of an arrow, pointing to a dot in the codomain.
So, the two things can't can't happen is that you don't have any arrow starting from a point in the domain, i.e. the function is not defined for that element, or that multiple arrows start from the same points.
But as long as an arrow start from each element in the domain, you have a function. It may happen that two different arrow point to the same element in the codomain - that's ok, the relation is still a function, but it's not injective; or it can happen that some points in the codomain aren't pointed by any arrow - you still have a function, except it's not surjective.
Answer:
- 280 financial
- 20 scientific
Step-by-step explanation:
The linear programming problem can be formulated as ...
minimize 10f +12s subject to ...
10f +20s ≥ 3200 . . . . number of chips used
f + s ≥ 300 . . . . . . . . . .number of switches used
f ≥ 100 . . . . . . . . . . . . .minimum number of financial calculators
Graphing these inequalities, we find the feasible region to be bounded by the points (f, s) = (100, 200), (280, 20), (320, 0). The one of these that minimizes the number of production steps is ...
f = 280, s = 20
280 financial and 20 scientific calculators should be produced to minimize the number of production steps.
Answer:
D
Step-by-step explanation:
using the rule of logarithms
log x - log y ⇔ log (
)
then
(
) =
a -
d