Answer by BlueSky06
The equation described above can also be written as, y = -x² + 100x + 4000To get the number of notebooks that will give them the maximum profit, we derive the equation and equate to zero. dy/dx = -2x + 100 = 0The value of x from the equation is 50. Then, we substitute 50 to the original equation to get the profit. y = -(50^2) + 100(50) + 4000 = 6500Thus, the maximum profit that the company makes is $6,500/day.
Read more on Brainly.com -
brainly.com/question/3586459#readmore
We have the following values:
Total people: 31
People per team: 4
The number of teams will then be:
N = (31) / (4)
N = 7.75
Round to the previous whole number.
N = 7
There are 7 teams.
Answer:
they can make about 7 teams.
F(x) = 16ˣ
A. g(x) = 8(2ˣ)
g(x) = (2³)(2ˣ)
g(x) = 2ˣ⁺³
The answer is not A.
B. g(x) = 4096(16ˣ⁻³)
g(x) = (16³)(16ˣ⁻³)
g(x) = 16ˣ
The answer is B.
C. g(x) = 4(4ˣ)
g(x) = 4ˣ⁺¹
The answer is not C.
D. g(x) = 0.0625(16ˣ⁺¹)
g(x) = (16⁻¹)(16ˣ⁺¹)
g(x) = 16ˣ
The answer is D.
E. g(x) = 32(16ˣ⁻²)
g(x) = (2⁵)(2⁴ˣ⁻⁸)
g(x) = 2(⁴ˣ⁻³)
The answer is not E.
F. g(x) = 2(8ˣ)
g(x) = 2(2³ˣ)
g(x) = 2³ˣ⁺¹
The answer is not F.
The answer is B and D.
Answer:
x=3
Step-by-step explanation:
3 squared is 9. 9 plus 2 times 2=22 each of the sides on the angle are 11. 22 plus 22= 44. then 3 -1 equals 2. 44 minus 4 equals 40. equaling the area
Firstly, we'll fix the postions where the 
women will be. We have 
forms to do that. So, we'll obtain a row like:
The n+1 spaces represented by the underline positions will receive the men of the row. Then,
Since there is no women sitting together, we must write that 
. It guarantees that there is at least one man between two consecutive women. We'll do some substitutions:
The equation (i) can be rewritten as:
We obtained a linear problem of non-negative integer solutions in (ii). The number of solutions to this type of problem are known: ![\dfrac{[(n)+(m-n+1)]!}{(n)!(m-n+1)!}=\dfrac{(m+1)!}{n!(m-n+1)!}](https://tex.z-dn.net/?f=%5Cdfrac%7B%5B%28n%29%2B%28m-n%2B1%29%5D%21%7D%7B%28n%29%21%28m-n%2B1%29%21%7D%3D%5Cdfrac%7B%28m%2B1%29%21%7D%7Bn%21%28m-n%2B1%29%21%7D)
[I can write the proof if you want]
Now, we just have to calculate the number of forms to permute the men that are dispposed in the row: 
Multiplying all results:
