Linear Inequalities
A linear inequality is solved exactly like a linear equation, with one rule that changes everything: when you multiply or divide both sides by a negative number, you must reverse the inequality sign. So −2x > 6 becomes x < −3, not x > −3. Adding or subtracting any number, or multiplying by a positive number, leaves the direction unchanged. CAT often phrases these as systems: "find all integers x satisfying 3 < 2x − 1 ≤ 9", where you solve the compound inequality to get 2 < x ≤ 5 and then count integer solutions {3, 4, 5}. The fast habit is to isolate x while watching every multiplication for a hidden negative. With two variables, treat each constraint as a boundary line and reason about the feasible region — the same logic that underlies linear programming.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Core rules & linear
| Sign-flip rule | Multiply/divide both sides by a negative ⇒ reverse the inequality |
|---|---|
| Adding a constant | a > b ⇒ a + c > b + c (direction unchanged) |
| Multiply by positive k | a > b, k > 0 ⇒ ka > kb |
| Reciprocal (same sign) | 0 < a < b ⇒ 1/a > 1/b |
| Transitivity | a > b and b > c ⇒ a > c |
CAT power-tools
| Modulus less-than | |x| < a ⇔ −a < x < a (a > 0) |
|---|---|
| Modulus greater-than | |x| > a ⇔ x < −a or x > a (a > 0) |
| Quadratic sign | a(x−p)(x−q) with a > 0: negative between roots, positive outside |
| AM-GM (n positives) | (a₁+…+aₙ)/n ≥ (a₁…aₙ)^(1/n), equality when all equal |
| AM-GM corollary | For x > 0, x + 1/x ≥ 2; x + k/x ≥ 2√k |