Answer:
The solution for this equation is n= -4. I didn't see any other equations listed so i can not help compare each equation but hopefully this helps you :)
Step-by-step explanation:
-5n+31= -14n-5
**add 14
9n+31= -5
** subtract 31
9n= -36
** divide 9
n= -36/9
n= -4
Answer:
N = 85
Step-by-step explanation:
(236 + 542)+N = 863
778 + N = 863
N = 863 - 778
N = 85
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.
I think that the value of n is -10
Are you taking the state test-