Wikipedia:Reference desk/Archives/Mathematics/2011 February 24

Mathematics desk
< February 23 << Jan | February | Mar >> February 25 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


February 24

edit

Partial differentiation quiz

edit

Hello all! Today I had my partial differentiation quiz. There was a problem that I didn't get. It went something like: "Using the partial and total derivatives, find the range (there might have been another term than range, the meaning was the range of z values) of the function z(x,y)=sin(x)+cos(y)-sin(x)cos(y)". I knew that the answer was {z: -3≤z≤1} from lower math reasoning (since sin and cos are bounded on R -1 to 1 and z is continuous) but I didn't know how to solve it using the method it was testing. I knew it had to be a maximization/minimization problem, but I got stuck on how to find the global maximums and minimums, especially since there are an infinite number of local minimums. How should I have solved this? Thanks. 72.128.95.0 (talk) 23:26, 24 February 2011 (UTC)[reply]

z is periodic in each direction with period  , of course, so it suffices to consider (say)  . To get the extrema, you look for places where the gradient is 0; the gradient is  . Both elements have to be 0 simultaneously, so you have  . Applying the restriction on the ranges, that yields   which simplifies to  . Those in turn yield  ,  , and  . Since z is bounded, we know that the range must be the interval between them. --Tardis (talk) 00:05, 25 February 2011 (UTC)[reply]
There is also a simpler way to do it. Make the change of variables a = sin(x), b = cos(y). Then the new problem is to find the extrema of
 
There are no critical points in the interior of the square, so it's enough to solve the optimization problem on the boundary. We can pretty much do this by inspection, giving   for the minimum and   for the maximum. Sławomir Biały (talk) 00:17, 25 February 2011 (UTC)[reply]