WEBVTT

1
00:00:00.000 --> 00:00:04.540
Here is the problem: |2x plus 1| greater than or equal to 5.

2
00:00:04.990 --> 00:00:12.734
Solve an absolute value inequality by turning it into a compound inequality and finding the boundary points.

3
00:00:13.534 --> 00:00:22.358
Write the problem with the absolute value isolated. The absolute value is already alone on one side, so it can be split into cases.

4
00:00:22.808 --> 00:00:29.809
Split into two ("or") inequalities. The inside must be at least c units away from zero, on either side.

5
00:00:30.259 --> 00:00:34.891
Find the boundary points. The solution lies outside the endpoints.

6
00:00:35.341 --> 00:00:38.151
Write the solution set in interval notation.

7
00:00:38.951 --> 00:00:49.284
So the answer is x less than or equal to negative 3 or x greater than or equal to 2; interval notation: (−∞, negative 3] ∪ [2, ∞).

8
00:00:49.734 --> 00:01:00.334
An absolute value inequality compares a distance with c: "less than" keeps the inside within c of zero (one interval), "greater than" pushes it beyond c (two rays).

9
00:01:01.134 --> 00:01:11.478
Test point x equals negative 1 over 2 (between the endpoints): |0| equals 0, which is not greater than or equal to 5, so the middle region is excluded.