Next: About this document ...
Up: Inequalities
Previous: More inequalities
Problems
There are a lot of problems here.
Just do the ones that interest you.
- Prove that for any
,
and determine when equality holds.
- Prove
for all integers
.
- Prove that the sum of the legs of a right triangle never exceeds
times the hypotenuse of the triangle.
- Prove
for
.
- Prove that if
and
is an integer,
then
- Let
be the ellipsoid
for some
.
Find, in terms of
,
, and
,
the volume of the largest rectangular box that can fit inside
,
with faces parallel to the coordinate planes.
- Among all planes passing through a fixed point
with
and meeting the positive parts of the three coordinate axes,
find the one such that the tetrahedron bounded
by it and the coordinate planes has minimal area.
- Among all rectangular boxes with volume
,
find the one with smallest surface area.
- Now consider ``open boxes,'' with only five faces.
Again find the one with smallest surface area
with a given volume
.
- Let
be the tetrahedron
with vertices
,
,
, and
for some
.
Let
be the volume of
, and let
be the sum of the
lengths of the six edges of
.
Prove that
- Let
be the geometric mean
of the numbers
.
Prove that
- Suppose
and
.
Prove that
- Show that one can derive the AM-GM inequality for positive numbers
from Jensen's inequality with
.
- Prove
for
.
(Hint: the function
is convex on
.)
- Use Jensen's inequality to show that
among all convex
-gons inscribed in a fixed circle,
the regular
-gons have the largest perimeter.
- Given
with
,
prove
- Show that by taking some of the
to be equal in the
AM-GM inequality, one can deduce the weighted AM-GM inequality
at least in the case where the weights are nonnegative rational numbers.
(To deduce from this the general weighted AM-GM inequality,
one can then use a limit argument.)
Can one similarly deduce the weighted power mean inequality
and weighted Jensen's inequality from the unweighted versions?
- Prove that if
are sides of a triangle,
then
- Given
such that
,
prove
- What well-known inequality does one obtain by taking only the end
terms in Maclaurin's inequality?
- Prove
for
.
- Prove that if
, then
- Prove that if
are sides of a triangle, then
- Derive Chebychev's inequality from the rearrangement
inequality.
- Derive the 3-sequence Chebychev inequality
from the 2-sequence Chebychev inequality.
- Suppose that
and
.
Prove that
- Show that Jensen's inequality is a special case of
the Hardy-Littlewood-Polyà majorization inequality.
- What is the geometric meaning of Minkowski's inequality
when
and
?
- (IMO 1975/1) Let
(
) be real numbers
such that

and
Prove that if
is any permutation of
, then
- (USAMO 1977/5) Suppose
, and
.
Prove that
and determine when there is equality.
- (IMO 1964/2) Prove that if
are sides of a triangle,
then
- (USAMO 1981/5)
If
is a positive real number, and
is a positive integer,
prove that
where
denotes the greatest integer less
than or equal to
.
- Make your own inequality problems and give them to your friends
(or enemies, depending on the difficulty!)
Many of the problems above
were drawn from notes from the U.S. training session
for the International Mathematics Olympiad.
Others are from the USSR Olympiad Problem Book.
Many of the inequalities themselves are treated in
the book ``Inequalities'' by Hardy, Littlewood, and Polyà,
which is a good book for further reading.
©Berkeley Math Circle
Next: About this document ...
Up: Inequalities
Previous: More inequalities
Zvezdelina Stankova-Frenkel
2001-11-18