Ideal timeline of the dance routine = 4 minutes = 4 × 60 seconds = 240 seconds
Variation allowed in the dance routine timeline = +- 5 seconds
Let the timeline of the dance routine be T
⇒ 240 seconds - 5 seconds < T < 240 seconds + 5 seconds
⇒ 235 seconds < T < 245 seconds
⇒
minutes < T <
minutes
⇒ 3.92 minutes < T < 4.08 minutes
So the least possible time of the dance routine can be 3.92 minutes (or 235 seconds) and the greatest possible time of the dance routine can be 4.08 minutes (or 245 seconds)
Given: C(N) = 15,000 + 8000N <span>
In the above equation simply substitute:
N(t) = 100t - 5t^2
for N
</span>
<span>Therefore:
C(t) = 15,000 + 8000{ 100t-5t^2 }
C(t) =15,000 + 800,000t - 40,000t^2.</span>
at t = 5
C(5) = 15,000 + 800,000*5
- 40,000*(5)^2
<span>C(5) = 3,015,000</span>
Answer:
A. You may set the variables in either order. But for argument sake, let's set as follows:
x = Amount of bookshelves
y = Amount of tables
B. Because of the amount of things you need to make, the following is an inequality using those variables.
x + y > 25
Plus you can determine a second inequality based on the amount of money that you have to spend.
20x + 45y < 675
Finally you may also add in that each value must be greater than or equal to zero, since they cannot have negative tables.
C. By solving the system and looking at basic constraints when graphed, you can see the feasible region has 4 vertices.
(0,0)
(18, 7)
(0, 15)
(33.75, 0) or (33, 0) if you insist on rounding.
Step-by-step explanation: Good luck and hope this helps :)
Answer:
slope=0, y-intercept=2
Step-by-step explanation: