Chapter 13: Problem 15
Find both first partial derivatives. $$ z=\ln \frac{x+y}{x-y} $$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 13: Problem 15
Find both first partial derivatives. $$ z=\ln \frac{x+y}{x-y} $$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
A cargo container (in the shape of a rectangular solid) must have a volume of 480 cubic feet. The bottom will cost \(\$ 5\) per square foot to construct and the sides and the top will cost \(\$ 3\) per square foot to construct. Use Lagrange multipliers to find the dimensions of the container of this size that has minimum cost.
Find the least squares regression line for the points. Use the regression capabilities of a graphing utility to verify your results. Use the graphing utility to plot the points and graph the regression line. $$ (1,0),(3,3),(5,6) $$
Find the point on the surface where the tangent plane is horizontal. Use a computer algebra system to graph the surface and the horizontal tangent plane. Describe the surface where the tangent plane is horizontal.\(z=3 x^{2}+2 y^{2}-3 x+4 y-5\)
Use Lagrange multipliers to find the indicated extrema, assuming that \(x, y\), and \(z\) are positive. Maximize \(f(x, y, z)=x y z\) Constraint: \(x+y+z-6=0\)
(a) Use Lagrange multipliers to prove that the product of three positive numbers \(x, y\), and \(z\), whose sum has the constant value \(S\), is a maximum when the three numbers are equal. Use this result to prove that \(\sqrt[3]{x y z} \leq \frac{x+y+z}{3}\). (b) Generalize the result of part (a) to prove that the product \(x_{1} x_{2} x_{3} \cdot \cdots x_{n}\) is a maximum when \(x_{1}=x_{2}=x_{3}=\) \(\cdots=x_{n}, \sum_{i=1}^{n} x_{i}=S\), and all \(x_{i} \geq 0 .\) Then prove that $$ \sqrt[n]{x_{1} x_{2} x_{3} \cdot \cdots x_{n}} \leq \frac{x_{1}+x_{2}+x_{3}+\cdots \cdot+x_{n}}{n}. $$ This shows that the geometric mean is never greater than the arithmetic mean.
What do you think about this solution?
We value your feedback to improve our textbook solutions.