The Moves That Recur
Over a region symmetric under , ; average the two. Over a region symmetric under , odd parts vanish.
The Putnam almost never wants a double integral computed by brute force. The integrand is chosen so that a symmetry of the region turns it into something trivial: averages with its mirror to . Whenever the region is a square, a disk, or a simplex, list its symmetries FIRST and apply each to the integrand.
With , (Jacobian ), or polar coordinates, or , : choose the substitution that makes the integrand a function of one new variable.
A Jacobian is not a nuisance factor — it is the reason the trick works. The polar is what makes computable; the from , is what turns into a one-variable integral. The other classic: over the triangle , of equals , because the level sets have length proportional to .
To extremize on : solve together with . On a compact region also test the boundary; on an unbounded one, argue that blows up (or decays) away from the candidates.
The Putnam version usually has symmetric and , so the candidates are points with several equal coordinates — but the maximum is not always at the fully symmetric point. Compute at every candidate. For a sum with fixed, the extremes are "all equal" and "one variable takes everything", and Lagrange tells you which is which.
A line integral around a closed curve equals a double integral of a curl; the flux of through any surface enclosing the origin is ; the area of a region is .
These appear on the Putnam as identities to recognize, not theorems to apply mechanically. The area formula turns "area of a polygon with vertices…" into the shoelace formula; the flux fact makes a hideous surface integral equal or depending only on whether the surface encloses the origin.
Forgetting the Jacobian entirely, or applying Lagrange multipliers where (the method finds nothing there) or on a region with a boundary you never tested.
Compute .
Show the answerHide the answer
Average with the mirror: . No polar coordinates needed.
Double Integrals by Substitution, Worked
If the integrand depends on and only through some combinations , , integrate in : with . Choose so that the integrand AND the boundary of the region become simple; for a quadratic form, complete the square or rotate to its eigenvectors.
The Jacobian determinant measures how the map from to stretches area (see "Why It Works" below): a tiny rectangle becomes a parallelogram of area . For a linear substitution is a constant, so it simply scales the answer — which is why forgetting it gives an answer off by a fixed factor. Before computing, list what the substitution does to each edge of the region; a substitution that simplifies the integrand but scrambles the region has not helped.
Find the area of the region ().
Step 1 — substitute , . The region becomes the unit disk .
Step 2 — the Jacobian is .
Step 3 — area . For it is the circle's .
How to find it. A linear map that sends a hard region to an easy one multiplies every area by : that single number is all the integral needs.
Evaluate , where is the triangle , , .
Step 1 — the exponent is with , . Inverting, , , and .
Step 2 — the region: is , is , and is . So becomes , .
Step 3 — integrate in first: .
Step 4 — then .
How to find it. The integrand is constant on rays through the origin (dashed), so one new variable should measure the ray () and the other the distance along it (). Integrating over at fixed sweeps across the rays, where the exponential integrates in closed form.
Evaluate .
Step 1 — complete the square: .
Step 2 — substitute , . Then , so , and the plane maps onto the plane.
Step 3 — (polar coordinates, or the square of the Gaussian integral).
Step 4 — the answer is . In general for positive definite ; here , .
How to find it. A quadratic form with a cross term is a circle in disguise. Completing the square (or diagonalizing : eigenvalues and along ) turns it into a sum of squares, and the Jacobian records the determinant.
"The area of : substitute , ; the region becomes the unit disk, so the area is ." The true area is . The substitution changed the region but the was copied across as ; it is . A linear substitution that stretches one direction by doubles every area, and the Jacobian is the only place that fact enters the computation.
Evaluate over the square .
Show the answerHide the answer
Let , . Since , becomes the square , , and . So the integral is .
Constrained Extrema, Worked
At an extremum of on the curve (or surface) , at a point where : for some . On a region, the extremum is at an interior critical point () or on the boundary. Collect every candidate — including points where — and compare the values.
If had a component along the constraint set at a point , moving from along the set in that direction would increase and moving the other way would decrease it, so would not be an extremum. Hence is perpendicular to the set, and so is ; in the plane, perpendicular to the same curve means parallel. Geometrically, the level curve of through an extremum is TANGENT to the constraint. The method produces candidates, not answers: it says nothing about points where , and it does not say which candidate is the maximum — on a compact set the extreme value theorem guarantees both extremes exist, and comparing the values finishes the problem.
Find the largest and smallest values of on the ellipse .
Step 1 — the ellipse is compact, so both extremes exist, and on it.
Step 2 — gives and . If then , not on the ellipse; so and , i.e. and .
Step 3 — on the ellipse, , so the candidates are with all four sign choices.
Step 4 — at and , and at the other two. Maximum , minimum . (Check by AM–GM: .)
How to find it. Picture the level curves growing until they last touch the ellipse; the touching points are where Lagrange's condition holds, and symmetry (, ) predicts four of them.
Find the maximum and minimum of on the closed disk .
Step 1 — the disk is compact and continuous: both extremes exist.
Step 2 — interior: forces , where .
Step 3 — boundary: on , for . at , with ; at the ends .
Step 4 — compare all candidates: (interior), , . The maximum is at and the minimum is at .
How to find it. On a region the boundary is a separate problem one dimension lower; parametrizing it (here by ) often beats Lagrange. The interior critical points of a polynomial like are usually degenerate and rarely win.
Real numbers satisfy and . Find the largest and smallest possible values of .
Step 1 — find the range of one variable. Given , the other two have and . They are real iff the discriminant of is : , i.e. .
Step 2 — the target in terms of : .
Step 3 — , so the candidates on are , with .
Step 4 — the maximum is (at and permutations) and the minimum is (at and permutations). In both, two variables are equal — as Lagrange with two constraints predicts — but which equal pair wins is decided only by computing: the configuration with the larger lone variable wins the maximum.
How to find it. With the sum and the pairwise sum fixed, the three numbers are the roots of , and is the only free parameter; the cubic has three real roots exactly on an interval of , whose ends are where two roots merge. Reducing to one variable makes that interval visible.
Minimize on the curve . The curve lies in and passes through the origin, so the minimum is , at . Lagrange with : requires and ; the first forces (hence on the curve) or , and both contradict the second. The system has NO solution, and concluding "no minimum" would be wrong. The minimum sits at the cusp, where — exactly the kind of point the method cannot see and must be checked separately.
Find the maximum of for positive with .
Show the answerHide the answer
Lagrange: . Dividing, and , so . Then gives , , and . It is the maximum: on the boundary of the region (some variable ) the product tends to , and the only interior candidate is this one. (AM–GM confirms it: gives .)
Why It Works
A change of variables sends a tiny rectangle to a tiny parallelogram spanned by the vectors and . The area of that parallelogram is the absolute value of the determinant times . Summing over all tiny rectangles — which is what an integral does — the determinant appears as the scale factor between the two coordinate systems. In polar coordinates the parallelogram is (nearly) an rectangle, which is why .