MAX/MIN PROBLEMS AND INEQUALITIES

Finding the maximum or minimum of a function: On the Putnam,

it’s important that your justification of a max or min is rigorous. For
instance, it is not enough to solve the equation f 0 (x) = 0 to find a
maximum of a function f . Here are some techniques:
• Suppose f : R → R is differentiable. If f 0 (x) > 0 for x < x0 and
f 0 (x) < 0 for x > x0 , then the maximum value of f is f (x0 ).
• Suppose f : [a, b] → R is continuous. Then f achieves both its
maximum and minimum on [a, b]. These must occur at points
x0 where either f 0 (x0 ) = 0, f 0 (x0 ) does not exist, or x0 = a or
b.
• You may be able to show directly for instance that f (x) ≤ M
for some M , and that f (x0 ) = M , in which case M is the
maximum.
Inequalities: Proving inequalities can be a tough and confusing busi-
ness. Recall some of the basic tools:
• If a ≥ b and b ≥ c, then a ≥ c, with equality if and only if
a = b = c.
• If a1 ≥ b1 and a2 ≥ b2 , then a1 + a2 ≥ b1 + b2 , with equality if
and only if a1 = b1 and a2 = b2 .
• If a1 ≥ b1 > 0 and a2 ≥ b2 > 0, then a1 a2 ≥ b1 b2 , with equality
if and only if a1 = b1 and a2 = b2 .
• If a ≥ b > 0, then 1b ≥ a1 .
• If a ≥ b > 0 and α > 0, then aα ≥ bα .
• a2 ≥ 0.
Here are some classical inequalities:
• Arithmetic-Geometric-Harmonic Mean Inequality: If a1 , a2 , . . . , an
are nonnegative, then
1 1 1
!−1
a1 + a2 + · · · + an + + · · · +
≥ (a1 a2 · · · an )1/n ≥ a1 a2 an
.
n n

• Jensen’s Inequality: If f is a convex function, i.e. f 00 ≥ 0, then

 
f (a1 ) + f (a2 ) + · · · + f (an ) a1 + a2 + · · · + an
≥f .
n n
 • Cauchy–Schwartz Inequality:
(a21 + · · · a2n )(b21 + · · · b2n ) ≥ (a1 b1 + · · · an bn )2 .
Or, more briefly, if ~a = (a1 , . . . , an ) ∈ Rn and ~b = (b1 , . . . , bn ) ∈
Rn , then
|~a||~b| ≥ ~a · ~b.
• Triangle Inequality:
q q p
a1 + · · · an + b21 + · · · b2n ≥ (a1 + b1 )2 + · · · (an + bn )2 .
2 2

Or, more briefly, if ~a = (a1 , . . . , an ) ∈ Rn and ~b = (b1 , . . . , bn ) ∈

Rn , then
|~a| + |~b| ≥ |~a + ~b|.
1 1
• Young’s Inequality: If p > 1 and p
+ q
= 1, and a, b ≥ 0, then
a p bq
ab ≤ + .
p q
• Hölder’s Inequality: If p > 1 and p1 + 1q = 1, and a1 , . . . , an , b1 , . . . , bn ≥
0, then
a1 b1 + a2 b2 + · · · + an bn ≤ (ap1 + · · · apn )1/p (bq1 + · · · bqn )1/q .
Problems:
(1) Prove the second inequality in the AGH mean inequality, as-
suming the first.
(2) x21 +x22 +· · ·+x2n ≥ (r1 x1 +· · · rn xn )2 holds for all real x1 , . . . , xn
if and only if r12 + · · · + rn2 ≤ 1.
(3) If in traveling from one town to another, Justin goes half the
distance at speed s1 and half at speed s2 . Kelly travels between
the same towns and travels half the time at speed s1 and half
at speed s2 . Who gets to the second town faster?
(4) (1986 A-1) Find, with explanation, the maximum value of f (x) =
x3 −3x on the set of all real numbers x satisfying x4 +36 ≤ 13x2
(5) Let f (x) = a1 sin x + a2 sin 2x + · · · + an sin nx, where the ak
are real numbers. Suppose that f (x) satisfies |f (x)| ≤ | sin x|
for all real x. Show that |a1 + 2a2 + · · · + nan | ≤ 1.
(6) Let yn = arctan n. Prove that for n = 1, 2, . . ., yn+1 −yn < n21+n .
(7) (2003 A-2) Let a1 , a2 , . . . , an and b1 , b2 , . . . , bn be nonnegative
real numbers. Show that
(a1 a2 · · · an )1/n + (b1 b2 · · · bn )1/n
≤ [(a1 + b1 )(a2 + b2 ) · · · (an + bn )]1/n .
 (8) (1973 B-4)
(a) On [0, 1], let f have a continuous derivative satisfying 0 <
f 0 (x) ≤ 1. Also suppose that f (0) = 0. Prove that
Z 1 2 Z 1
f (x) dx ≥ [f (x)]3 dx.
0 0
(b) Show an example in which equality occurs.
(9) (1977 B-5) Suppose that a1 , a2 , . . . , an are real (n > 1) and
n n
!2
X 1 X
A+ a2i < ai .
i=1
n − 1 i=1
Prove that A < 2ai aj for 1 ≤ i < j ≤ n.
(10) (1978 A-5) Let 0 < xi < π for i = 1, 2, . . . , n and set x =
x1 +x2 +···+xn
n
. Prove that
Yn  n
sin xi sin x
≤ .
i=1
xi x
(11) (1953 A-1) Show that
n
2 3/2 X √ 2 1
n < i < n3/2 +
3 i=1
3 2
for all positive integers n.
2
(12) (1980 B-1) For which real numbers c is (ex + e−x )/2 ≤ ecx for
all real x?
(13) (1983 A-2) The hands of an accurate clock have lengths 3 and
4. Find the distance between the tips of the hands when that
distance is increasing most rapidly.
(14) (1978 B-5) Find the largest A for which there exists a polyno-
mial P (x) = Ax4 + Bx3 + Cx2 + Dx + E with real coefficients
which satisfies 0 ≤ P (x) ≤ 1 for −1 ≤ x ≤ 1.

Some Tricks:
• Use logarithm to change products to sums
• Differentiate or integrate and use the fundamental theorem of
calculus
• Make choices, e.g. constants, for values in the classical inequal-
ities
• Use Taylor series
• Look for symmetries