Here is our profit as a function of # of posters
p(x) =-10x² + 200x - 250
Here is our price per poster, as a function of the # of posters:
pr(x) = 20 - x
Since we want to find the optimum price and # of posters, let's plug our price function into our profit function, to find the optimum x, and then use that to find the optimum price:
p(x) = -10 (20-x)² + 200 (20 - x) - 250
p(x) = -10 (400 -40x + x²) + 4000 - 200x - 250
Take a look at our profit function. It is a normal trinomial square, with a negative sign on the squared term. This means the curve is a downward facing parabola, so our profit maximum will be the top of the curve.
By taking the derivative, we can find where p'(x) = 0 (where the slope of p(x) equals 0), to see where the top of profit function is.
p(x) = -4000 +400x -10x² + 4000 -200x -250
p'(x) = 400 - 20x -200
0 = 200 - 20x
20x = 200
x = 10
p'(x) = 0 at x=10. This is the peak of our profit function. To find the price per poster, plug x=10 into our price function:
price = 20 - x
price = 10
Now plug x=10 into our original profit function in order to find our maximum profit:
<span>p(x)= -10x^2 +200x -250
p(x) = -10 (10)</span>² +200 (10) - 250
<span>p(x) = -1000 + 2000 - 250
p(x) = 750
Correct answer is C)</span>
Answer:
The traveler can plan such a tour in 3003 ways.
Step-by-step explanation:
The order that the cities are chosen is not important, since it is chosen by the company and not by the traveler. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In this problem, we have that:
Combinations of 5 cities from a set of 15. So
The traveler can plan such a tour in 3003 ways.
Y= 2x
Every hour 2 bags
Afer 1 hour. 2 bags
After 2 hours 4 bags
After 3 hours. 6 bagds
Answer:
it 24 on all side together
Step-by-step explanation:
6+6+6+6
yhe other one is 8
2+2+2+2
