WEBVTT

1
00:00:00.000 --> 00:00:03.204
Here is the problem: |x plus 4| greater than 1.

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

3
00:00:12.151 --> 00:00:20.916
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:21.366 --> 00:00:28.436
Split into two ("or") inequalities. The inside must be at least c units away from zero, on either side.

5
00:00:28.887 --> 00:00:33.566
Find the boundary points. The solution lies outside the endpoints.

6
00:00:34.016 --> 00:00:36.733
Write the solution set in interval notation.

7
00:00:37.533 --> 00:00:47.715
So the answer is x less than negative 5 or x greater than negative 3; interval notation: (−∞, negative 5) ∪ (negative 3, ∞).

8
00:00:48.165 --> 00:00:58.997
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:00:59.797 --> 00:01:08.644
Test point x equals negative 4 (between the endpoints): |0| equals 0, which is not greater than 1, so the middle region is excluded.