Worked examples — Absolute value equations and inequalities
This page is the "throw everything at it" workout for Absolute value equations and inequalities. Before we solve, we map out every kind of case the topic can throw at you, then hit each one with a full worked example. If you have never seen the bars before, read the parent note first — but every symbol used here is re-explained the moment it appears.
The scenario matrix
Here is the complete list of situations. Each worked example is tagged with the cell(s) it covers, so you can see the whole surface is painted.
| Cell | Scenario | Where the trap hides |
|---|---|---|
| A | , (plain equation) | forgetting the negative branch |
| B | with or (degenerate) | → no solution; → one solution |
| C | extraneous roots, RHS-sign check | |
| D | (less-than, "between", AND) | writing OR instead of AND |
| E | (greater-than, "outside", OR) | writing AND instead of OR |
| F | Degenerate inequality: , , | empty set / all reals |
| G | Sum of two absolute values constant (critical points) | missing an empty region |
| H | Word problem (tolerance / distance) | translating words → |
| I | Exam twist: | two clean cases, not four |
Now the examples.
Forecast: guess how many answers before reading. (Two — distance has a left and a right hit.)
- Read it as distance. says "the number is exactly away from ." Why this step? Anchoring to distance tells us there are two positions: and .
- Branch 1 (inside is positive): . Why this step? If , the bars change nothing, so the inside literally equals .
- Branch 2 (inside is negative): . Why this step? If , the bars flip its sign; a flipped number equal to means the original was .
Verify: ✓ and ✓. Answer: .
Forecast: one of these has zero answers and one has exactly one. Which is which?
- (a) Look at the right side. It is , negative. Why this step? A distance can never be negative, so no can make the left side negative.
- (a) Conclusion: no solution. The solution set is (the empty set). Why this step? We stop early — there is nothing to solve once the RHS is impossible.
- (b) Right side is . Distance from zero means the inside is : . Why this step? Only one point is units from — itself. So the two branches collapse into one.
- (b) Solve: .
Verify: (a) impossible confirmed. (b) ✓. Answer: (a) no solution; (b) (a single, "doubled" root).
Forecast: the right side contains , so it can be negative. Predict: at least one candidate will be thrown out.
- Gatekeeper condition. Since the left side is a distance (), we need , i.e. . Why this step? Any answer with is instantly impossible — a distance can't equal a negative.
- Branch 1 (assume ): . Why this step? If the inside is , the bars vanish and the inside equals the RHS directly.
- Test Branch 1 twice. Global gatekeeper: ? No — reject. Branch assumption: ? No — also fails. Reject (extraneous on both counts). Why this step? A valid root must pass both the RHS-sign gate and the branch's own sign assumption; fails both.
- Branch 2 (assume ): . Why this step? If the inside is negative, the bars flip its sign, so we set equal to the negative of the RHS.
- Test Branch 2 twice. Global gatekeeper: ? Yes. Branch assumption: ? Yes. Both conditions hold — keep . Why this step? Only a root that respects both the gatekeeper and the sign assumption it was derived under is genuine.
Verify: and . Equal ✓. Answer: only.
Forecast: "less than" packs the answer into ONE stretch of the line. Predict a single interval.
- Unfold with the between-rule. . Here : Why this step? Being at most from zero means sitting inside — both a lower and an upper wall must hold, so it's an AND.
- Subtract from all three parts: . Why this step? We isolate the -term; whatever we do to the middle we do to both outer pieces.
- Divide all three parts by (positive, so no flip): . Why this step? Dividing by a positive number keeps the inequality directions the same.
The figure below draws this answer on the number line. Read it like this: the thick red bar is the solution set; the two solid red dots at and are filled because the endpoints are included (). Anything off the red bar fails the inequality.

Verify: endpoints: ✓; ✓; a point outside, : , correctly excluded ✓. Answer: .
Forecast: "greater than" spills the answer into TWO far pieces. Predict a union of two rays.
- Unfold with the outside-rule. . Here . Why this step? Being more than from zero means fleeing the interval — you can escape to the right or to the left, so it's an OR.
- Right piece: . Why this step? This is the escape to the positive side.
- Left piece: . Why this step? This is the escape to the negative side.
The figure below shows the two escape rays. Read it like this: the two red arrows shoot outward forever; the hollow (unfilled) red circles at and mean those exact points are excluded (strict ). The clear middle band is the forbidden gap.

Verify: test (right region): ✓; test (left region): ✓; test (the gap): , correctly excluded ✓. Answer: .
Forecast: one is empty, one is everything, and one is everything except a single point. Match them up first.
- (a) Can a distance be strictly below ? Never. Why this step? is always, so nothing beats . Solution: .
- (b) Is a distance always ? Yes, for every real number. Why this step? The statement is automatically true, so all reals work: .
- (c) Distance is except at the one spot where it equals , namely . Why this step? Only gives distance ; every other point gives a strictly positive distance.
Verify: (a) gives ; no other point smaller — empty ✓. (b) : ✓. (c) excluded, : ✓. Answer: (a) ; (b) all real ; (c) all , i.e. .
Forecast: two "corners" at and split the line into three zones. Predict that only the two outer zones can pay the bill of (the middle keeps the sum fixed at the gap width ).
- Find critical points. Insides vanish at and . Why this step? These are exactly where each piecewise bar switches its sign-rule.
The figure below marks these corners and labels the three regions. Read it like this: the two red dots are the corners where a bar changes its rule; the middle region is annotated "no sol" because the equation collapses to there; the black squares are the two genuine solutions.

- Region 1, (both insides negative): , . Equation: . Why this step? Flip both bars because each inside is negative here. Check ✓.
- Region 2, (first , second ): . False. Why this step? In the middle the two flips cancel; the sum is stuck at the gap width , never . No solution here.
- Region 3, (both positive): . Check ✓. Why this step? No flips needed; both bars open straight.
Verify: : ✓. : ✓. Answer: .
Forecast: "differs by at most" is a between statement — expect a single closed interval centred at .
- Translate "difference" into bars. The difference between and target is ; its size is . Why this step? Distance on a line is the absolute value of the gap; the words "differs by" mean exactly this size.
- Translate "at most ". . Why this step? "At most" is ; a bound on distance is a less-than-or-equal absolute-value inequality.
- Unfold (between-rule): . Why this step? Same AND-logic as Example 4.
- Add to all parts: . Why this step? Recentre on the true length by undoing the "."
Verify: midpoint : ✓ (accepted); edge : ✓; a reject : , correctly failed ✓. Units: all in mm, consistent ✓. Answer: mm.
Forecast: two absolute values equal to each other. It looks like four cases, but it collapses to two clean lines. Predict two roots.
- Key idea: means the two quantities are the same size, so or . Why this step? Equal distances from zero means the numbers are either identical or exact mirror images. The other two sign combinations are duplicates of these.
- Case : . Why this step? Same size, same sign.
- Case : . Why this step? Same size, opposite sign.
Verify: : and ✓. : and ✓. Answer: .
Recall check
Recall Why does
use AND but use OR? Less-than traps you inside one interval (need both walls) ::: AND / between; greater-than lets you flee to either far side ::: OR / two regions.
Recall When is
unsolvable, and when does it give exactly one root? Unsolvable when (distance can't be negative) ::: one root when (the two branches merge).
Recall In Example 3, why was
thrown out? It failed both the RHS gatekeeper () and its branch assumption () ::: so it was extraneous.