Absolute Value & Inequalities
|x| equations, piecewise definitions, inequality solving, AM-GM, optimization by inequality
Absolute Value & InequalitiesAMC 10 Step by Step
Name: Date: October 28, 2026
Algebra · 25 problems have this as their main idea
25
primary-topic problems (1.9% of all)
33
more as a secondary topic
Where it appears
16
P1-10
6
P11-15
3
P16-20
0
P21-25
What you need to know
- Absolute value is distance. is how far is from on the number line. Example: , since and are both away from .
- Three cases (for a positive number ). means or . means . means or . Example: holds for and , but not for .
- Several absolute values. A breakpoint is an that makes one of the insides . Between breakpoints each inside keeps one sign, so each absolute value can be dropped (with a or in front). The graph is straight pieces that bend only at breakpoints. Example: is for , for , and for .
- Largest and smallest values. If such an expression has a smallest or largest value, it happens at a breakpoint. If is limited to an interval, also check the ends. Example: is smallest, , at the breakpoints and (and between them).
- AM-GM. For and zero or positive, the average is at least the geometric mean: , with equality only when . So a sum with a fixed product is smallest, and a product with a fixed sum is largest, when the terms are equal. Example: for , , reached at .
- Inequality rules. Multiplying both sides by a negative number reverses the inequality: becomes . Squaring is safe only when both sides are zero or positive: , but .
How AMC 10 tests it
- Problems 4–10: solve or and give the sum or the number of solutions.
- Problems 8–14: the region is a diamond; find its area or count its lattice points (points with integer coordinates).
- Problems 10–16: find the smallest value of (it is at the median) or of (AM-GM).
- Problems 12–18: count the integers that satisfy a chain such as , by bounding carefully.
Standard approaches
- Read one or two absolute values as distances on a number line; often you can see the answer. Example: at and .
- Otherwise, split into cases at the breakpoints. Solve each piece, and check that each solution lies in its own interval.
- When and both appear, graph the first quadrant, then reflect across both axes.
- For a largest or smallest value, try AM-GM first (check that equality can happen), then complete the square.
- To count integers, get the variable alone and find the exact endpoints. Let the wording ("less than" or "at most") decide if each endpoint counts.
Worked example
What is the area of the region of the plane consisting of all points with ?
(A) (B) (C) (D) (E)
Start with the wedge on the right where . There and are zero or positive, so we can drop the absolute values:
This piece is the triangle with corners , and . Its area is (base , height ).
By symmetry, the other three wedges (, , ) give three matching triangles. The total area is .
Another way: always equals twice the larger of and . So the region is the square where and , with area .
The answer is .
Pitfalls
- Keeping a case solution that lies outside its case. Example: in , the case gives , which is not ; throw it out.
- Solving as . That mixes up "or" with "and".
- Using AM-GM on numbers that may be negative ( gives , less than ), or not checking that equality can happen.
- Multiplying an inequality by a variable whose sign you don't know, without splitting into cases. Example: does not mean , because works too.
Traps that recur
- Reporting the area of one quadrant's diamond (2) without multiplying by 4 for the four quadrants. (2023 AMC 10B #13)
- Assuming the parabola crosses the inner diamond's edges in extra points, or miscounting the tangency-type contacts at the vertices (0,3), (3,0), (-3,0). (2021 AMC Fall 10A #14)
- Forgetting the 100 integers where P(n) = 0 and answering 5000, or choosing the gaps with even k instead of odd k. (2020 AMC 10A #17)
- Removing the outer absolute value as |x| - |y| = 1 only, missing the branch |y| - |x| = 1 that produces the third solution (0, 1). (2018 AMC 10A #12)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.
← PreviousPage 2 of 2