Module 1.5 · Algebra
Inequalities and AM-GM
"What is the smallest possible value of…" is one of the most common question stems on the AMC 10 and 12. Calculus isn't expected. Instead, the go-to tool is the AM-GM inequality, together with the simple fact that squares are never negative. The skill is in arranging an expression so that the inequality fits, and in checking that equality can actually happen.
Squares are nonnegative
Every inequality in this module comes from one fact: for every real , with equality only when . For example, completing the square shows
with equality at . So the minimum value is .
The AM-GM inequality
Expand for : you get . The same idea extends to any number of terms.
AM-GM
For nonnegative numbers ,
with equality exactly when all the numbers are equal.
- If the product is fixed, the sum is smallest when the terms are equal.
- If the sum is fixed, the product is largest when the terms are equal.
Worked example: A classic minimum
Find the minimum of for .
The product is constant, so AM-GM gives . Equality needs , so , which is allowed. The minimum is .
Making the product constant
AM-GM only gives a useful bound when the product of the terms (or the sum, for a maximum) is a constant. If it isn't, rearrange: scale a term, or split a term into equal pieces.
Worked example: Scaling to match a constraint
Positive numbers satisfy . What is the largest possible value of ?
The fixed sum is , so apply AM-GM to and : , so and . Equality when , so , .
Worked example: Splitting a term
Find the minimum of for .
The product is not constant. Split into two equal halves so the 's cancel:
Equality needs , so . Check: . The minimum is .
Multiplying by 1 in disguise
When you have a constraint like and want to minimize , multiply by the constraint (which equals ):
Worked example: Using the constraint
Positive numbers satisfy . Find the minimum of .
Equality when , so . Then gives , , and .
Common mistake
An AM-GM bound is only the answer if equality can happen. For instance, for , but on the interval equality () is impossible, and the true minimum is . Always find the equality case and check it satisfies every condition in the problem.
Tip
A related tool is the Cauchy–Schwarz inequality: , with equality when . It's the quickest way to minimize given a linear condition on and .
Practice
What is the minimum value of for ?
Positive numbers satisfy . What is the largest possible value of ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
Real numbers satisfy . What is the smallest possible value of ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
Positive numbers satisfy . What is the smallest possible value of ?
What is the minimum value of for ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
Positive numbers satisfy . What is the smallest possible value of ?
An open-top rectangular box has a square base and a volume of cubic units. What is the smallest possible total area of its base and four sides?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
Positive numbers satisfy . What is the largest possible value of ?
Real contest practice
- 2000 AMC 12, Problem 12: a product with fixed sum is largest when the factors are equal.
- 2016 AMC 12B, Problem 14: minimize the sum of a geometric series, a one-variable optimization.