To get minimized number of x steel bars, we differentiate the equation and then equate to zero:
d/dx (C(x) = 0.02x² – 3.4x + 150)
C'(x) = 0.02(2)x – 3.4 = 0
Solving for x
0.04x – 3.4 = 0
x = 85 steel bars
For minimum cost,
C(x = 85) = 0.02(85)² – 3.4(85) + 150 = 5.5 dollars
Answer:
298.788
Step-by-step explanation:
110+49.99+89 = 248.99
248.99 + 20%
= 298.788
C im pretty sure thats it
Answer:
Step-by-step explanation:
Given : The total number of programmers in the company = 30
The company wants to select a group of 6 programmers to work on a particular project.
Since the order of selecting them does not matters , therefore we use combinations.
The number of combinations of r things taken from n things is given by :-

here, n= 30 and r= 6
So the number of different ways to form they could select a group of 6 would be 

i.e. Total ways =593775
In terms of factorials , the number of total ways to form they could select a group of 6 is
.