Answer:
C
Step-by-step explanation:
<span>We want to optimize f(x,y,z)=x^2 y^2 z^2, subject to g(x,y,z) = x^2 + y^2 + z^2 = 289.
Then, ∇f = λ∇g ==> <2xy^2 z^2, 2x^2 yz^2, 2x^2 y^2 z> = λ<2x, 2y, 2z>.
Equating like entries:
xy^2 z^2 = λx
x^2 yz^2 = λy
x^2 y^2 z = λz.
Hence, x^2 y^2 z^2 = λx^2 = λy^2 = λz^2.
(i) If λ = 0, then at least one of x, y, z is 0, and thus f(x,y,z) = 0 <---Minimum
(Note that there are infinitely many such points.)
(f being a perfect square implies that this has to be the minimum.)
(ii) Otherwise, we have x^2 = y^2 = z^2.
Substituting this into g yields 3x^2 = 289 ==> x = ±17/√3.
This yields eight critical points (all signage possibilities)
(x, y, z) = (±17/√3, ±17/√3, ±17/√3), and
f(±17/√3, ±17/√3, ±17/√3) = (289/3)^3 <----Maximum
I hope this helps! </span><span>
</span>
Answer:
what? please give more details
Step-by-step explanation:
Answer:
43
Step-by-step explanation:
- 43.09 has 2 parts the integer part which is basically to the left and the decimal point which is to the right. to get this to the nearest integer or whole number you would have to round it off so you only have the integer part to do so the first digit in the fractional part is less than 5 then simply remove the fractional part to get the answer but in this case the de
If I counted correctly, the answer would be 52/150. You just need to simplify the fraction. I'll recount soon, and update if it changes.
