Answer:
Tina will pay $12.95 for shipping and handling.
Step-by-step explanation:
Because you literally just have to multiply $62.95 by .2 and you have your answer.
Answer: 
We have something in the form log(x/y) where x = q^2*sqrt(m) and y = n^3. The log is base 2.
===========================================================
Explanation:
It seems strange how the first two logs you wrote are base 2, but the third one is not. I'll assume that you meant to say it's also base 2. Because base 2 is fundamental to computing, logs of this nature are often referred to as binary logarithms.
I'm going to use these three log rules, which apply to any base.
- log(A) + log(B) = log(A*B)
- log(A) - log(B) = log(A/B)
- B*log(A) = log(A^B)
From there, we can then say the following:
Answer:
The objective function in terms of one number, x is
S(x) = 4x + (12/x)
The values of x and y that minimum the sum are √3 and 4√3 respectively.
Step-by-step explanation:
Two positive numbers, x and y
x × y = 12
xy = 12
S(x,y) = 4x + y
We plan to minimize the sum subject to the constraint (xy = 12)
We can make y the subject of formula in the constraint equation
y = (12/x)
Substituting into the objective function,
S(x,y) = 4x + y
S(x) = 4x + (12/x)
We can then find the minimum.
At minimum point, (dS/dx) = 0 and (d²S/dx²) > 0
(dS/dx) = 4 - (12/x²) = 0
4 - (12/x²) = 0
(12/x²) = 4
4x² = 12
x = √3
y = 12/√3 = 4√3
To just check if this point is truly a minimum
(d²S/dx²) = (24/x³) = (8/√3) > 0 (minimum point)
Answer:
I cant see it?
Step-by-step explanation:
Answer:
D
Step-by-step explanation:
