← Mathematics syllabus

Mathematics · Module 1

16 lessons · 300 problems

Sets & Inequalities — full chapter

Learn each idea, drill it with Basic → Intermediate → Advanced problems, and finish with mixed practice. Every problem shows its thinking right after you answer.

16

lessons

300

practice problems

18

key formulas

0

answered · 0 correct

After this chapter you can

  • Read and write sets in roster, set-builder, and descriptive form.
  • Count subsets (2n2^n) and proper subsets (2n−12^n-1).
  • Compute union, intersection, difference, complement, and Cartesian products.
  • Apply De Morgan's laws and inclusion–exclusion (2-set and 3-set).
  • Solve linear, compound, absolute-value, quadratic, polynomial, and rational inequalities.
  • Run sign charts and always exclude denominator zeros.
  • Translate “at least / at most / only / neither” into exact math.

How to study this chapter

  1. Read the concept in simple words.
  2. Write down the exact notation.
  3. Work one easy example by hand.
  4. Memorize the general formula or method.
  5. Solve one exam-style example.
  6. Name the trap for this type out loud.
  7. Solve 2–5 questions: Basic → Intermediate → Advanced.
  8. Finish with mixed practice — identify the method yourself first.
  9. Ask: what type is this? → what rule? → fastest safe method? → boundaries checked?

Lessons

Lesson 1 of 16

Set Basics

Learn the idea

A **set** is a well-defined collection of distinct objects, called **elements**. Write x∈Ax \in A when xx belongs to AA, and x∉Ax \notin A when it does not.
Never confuse the two: x∈Ax \in A says xx is an *element* of AA, while {x}⊆A\{x\} \subseteq A says the *set containing* xx is a subset of AA.

Key rules to memorize

  1. Finite sets list elements: A={2,4,6,8}A = \{2, 4, 6, 8\}, so ∣A∣=4|A| = 4.
  2. Special sets: empty ∅\varnothing, singleton {5}\{5\}, infinite N={1,2,3,…}\mathbb{N} = \{1, 2, 3, \ldots\}.
  3. Sets are equal iff they hold exactly the same elements — order and repetition don't matter: {1,2,3}={3,2,1}\{1, 2, 3\} = \{3, 2, 1\}.

Worked example

Let A={1,2,3,4}A = \{1, 2, 3, 4\}. Which are true: 3∈A3 \in A, 5∈A5 \in A, {3}⊆A\{3\} \subseteq A?

  1. 33 is listed in AA, so 3∈A3 \in A is true.
  2. 55 is not listed, so 5∈A5 \in A is false.
  3. The set {3}\{3\} has its only member in AA, so {3}⊆A\{3\} \subseteq A is true.

3∈A3 \in A ✓ · 5∈A5 \in A ✗ · {3}⊆A\{3\} \subseteq A ✓

Classic trap

Trap: {0}\{0\} is NOT empty — it holds one element. {x∈R:x2+1=0}\{x \in \mathbb{R} : x^2+1 = 0\} is empty because no real xx works.

Lesson 2 of 16

Set Representation

Learn the idea

Every set can be written three ways. **Roster form** lists elements: A={2,4,6,8}A = \{2, 4, 6, 8\}. **Set-builder form** gives a rule: A={x∈Z:x is even and 2≤x≤8}A = \{x \in \mathbb{Z} : x \text{ is even and } 2 \le x \le 8\}. **Descriptive form** uses words.
The exam loves converting between forms — read the rule, list the elements, and check endpoints.

Key rules to memorize

  1. Number sets: N\mathbb{N} naturals, Z\mathbb{Z} integers, Q\mathbb{Q} rationals, R\mathbb{R} reals, with N⊆Z⊆Q⊆R\mathbb{N} \subseteq \mathbb{Z} \subseteq \mathbb{Q} \subseteq \mathbb{R}.
  2. Watch whether N\mathbb{N} starts at 0 or 1 — follow the question's convention.

Worked example

Write A={x∈Z:x is even and 2≤x≤8}A = \{x \in \mathbb{Z} : x \text{ is even and } 2 \le x \le 8\} in roster form.

  1. Even integers from 22 to 88: test 2,3,4,5,6,7,82, 3, 4, 5, 6, 7, 8.
  2. Keep the evens, endpoints included.

A={2,4,6,8}A = \{2, 4, 6, 8\}

Classic trap

Trap: set-builder conditions like 2≤x≤82 \le x \le 8 include both endpoints — don't drop them when listing.

Lesson 3 of 16

Subsets and Power Sets

Learn the idea

A⊆BA \subseteq B means every element of AA is in BB. Every set is a subset of itself, and ∅⊆A\varnothing \subseteq A always. A **proper** subset excludes equality: A⊆BA \subseteq B and A≠BA \ne B.
Counting is mechanical: an nn-element set has 2n2^n subsets and 2n−12^n - 1 proper subsets, because each element is either in or out.

Key rules to memorize

  1. Subsets: 2n\boxed{2^n}. Proper subsets: 2n−1\boxed{2^n - 1}.
  2. Power set P(A)\mathcal{P}(A) collects all subsets: if A={1,2}A = \{1, 2\} then P(A)={∅,{1},{2},{1,2}}\mathcal{P}(A) = \{\varnothing, \{1\}, \{2\}, \{1, 2\}\}, so ∣P(A)∣=2∣A∣|\mathcal{P}(A)| = 2^{|A|}.
  3. Subsets containing one fixed element: fix it in, choose freely from the rest → 2n−12^{n-1}.
  4. Exactly-kk subsets: choose which kk → C(n,k)C(n,k); e.g. an 8-element set has C(8,3)=56C(8,3) = 56 three-element subsets.

Worked example

Set AA has 44 elements. How many subsets and proper subsets?

  1. Each element is in or out: 24=162^4 = 16 subsets.
  2. Proper drops the set itself: 16−1=1516 - 1 = 15.

1616 subsets · 1515 proper

Classic trap

Trap: {1,3}⊈{1,2}\{1, 3\} \not\subseteq \{1, 2\} — one outsider breaks a subset. Always check every element.

Lesson 4 of 16

Set Operations

Learn the idea

Three operations do all the work. **Union** A∪BA \cup B collects elements in either set (OR). **Intersection** A∩BA \cap B keeps only common elements (AND). **Difference** A−BA - B keeps elements of AA outside BB.
With A={1,2,3,4}A = \{1, 2, 3, 4\} and B={3,4,5,6}B = \{3, 4, 5, 6\}: A∪B={1,2,3,4,5,6}A \cup B = \{1, 2, 3, 4, 5, 6\}, A∩B={3,4}A \cap B = \{3, 4\}, A−B={1,2}A - B = \{1, 2\}.

Key rules to memorize

  1. Complement Ac=U−AA^c = U - A needs the universal set UU: with U={1,…,6}U = \{1, \ldots, 6\} and A={1,2,3}A = \{1, 2, 3\}, Ac={4,5,6}A^c = \{4, 5, 6\}.
  2. Sizes follow: ∣A−B∣=∣A∣−∣A∩B∣|A - B| = |A| - |A \cap B| and ∣Ac∣=∣U∣−∣A∣|A^c| = |U| - |A|.
  3. Cardinality: ∣A∣|A| counts elements; Cartesian product ∣A×B∣=∣A∣⋅∣B∣|A \times B| = |A| \cdot |B|.

Worked example

With A={1,2,3,4}A = \{1, 2, 3, 4\}, B={3,4,5,6}B = \{3, 4, 5, 6\}, find A∪BA \cup B, A∩BA \cap B, A−BA - B.

  1. Union combines once: {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\}.
  2. Intersection keeps commons: {3,4}\{3, 4\}.
  3. Difference drops BB's items from AA: {1,2}\{1, 2\}.

∪={1,2,3,4,5,6}\cup = \{1,2,3,4,5,6\} · ∩={3,4}\cap = \{3,4\} · −={1,2}- = \{1,2\}

Classic trap

Trap: A−B≠B−AA - B \ne B - A in general, and you cannot find a complement without knowing UU.

Lesson 5 of 16

Set Laws

Learn the idea

Union and intersection are commutative and associative, and they distribute over each other: A∩(B∪C)=(A∩B)∪(A∩C)A \cap (B \cup C) = (A \cap B) \cup (A \cap C).
Identity and domination laws handle the edge cases: A∪∅=AA \cup \varnothing = A, A∩U=AA \cap U = A, A∪U=UA \cup U = U, A∩∅=∅A \cap \varnothing = \varnothing.

Key rules to memorize

  1. Complement laws: A∪Ac=UA \cup A^c = U, A∩Ac=∅A \cap A^c = \varnothing, (Ac)c=A(A^c)^c = A.
  2. Commutative: A∪B=B∪AA \cup B = B \cup A, A∩B=B∩AA \cap B = B \cap A.
  3. Associative: (A∪B)∪C=A∪(B∪C)(A \cup B) \cup C = A \cup (B \cup C), same for ∩\cap.
  4. Distributive: A∩(B∪C)=(A∩B)∪(A∩C)A \cap (B \cup C) = (A \cap B) \cup (A \cap C) and A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup C).
  5. Identity: A∪∅=AA \cup \varnothing = A, A∩U=AA \cap U = A. Domination: A∪U=UA \cup U = U, A∩∅=∅A \cap \varnothing = \varnothing.
  6. Idempotent: A∪A=AA \cup A = A, A∩A=AA \cap A = A.
  7. De Morgan (boxed): (A∪B)c=Ac∩Bc(A \cup B)^c = A^c \cap B^c, (A∩B)c=Ac∪Bc(A \cap B)^c = A^c \cup B^c — NOT-OR becomes AND-NOT.
  8. If A⊆BA \subseteq B then A∩B=AA \cap B = A and A∪B=BA \cup B = B — instant simplifications.

Worked example

Simplify (A∪B)c(A \cup B)^c.

  1. De Morgan: complement flips ∪\cup to ∩\cap.
  2. Push the complement inside both sets.

Ac∩BcA^c \cap B^c

Classic trap

Trap: distribution looks like algebra but isn't: A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup C), with union outside AND inside.

Lesson 6 of 16

Venn Diagrams

Learn the idea

Translate wording before counting. AA or BB → A∪BA \cup B. AA and BB → A∩BA \cap B. AA but not BB → A−BA - B. Neither → (A∪B)c(A \cup B)^c.
Fill the diagram inside-out: both/all-three first, then only-regions, then the outside.

Key rules to memorize

  1. Only A = A−BA - B; exactly one of A, B = A-only + B-only.
  2. Exactly two of A, B, C = pairwise-only regions; all three = triple intersection.
  3. Neither A nor B = total − ∣A∪B∣|A \cup B|.
  4. “At least one” → union; “both” → intersection.
  5. “Or” is inclusive unless the question says “but not both”.

Worked example

40 students: 25 like math, 20 like physics, 12 both. How many like neither?

  1. At least one: 25+20−12=3325 + 20 - 12 = 33.
  2. Neither: 40−33=740 - 33 = 7.

77 students

Classic trap

Trap: “only A” is A−BA - B, not AA — subtract the overlap before answering.

Lesson 7 of 16

Inclusion-Exclusion

Learn the idea

Adding ∣A∣+∣B∣|A| + |B| counts the overlap twice, so subtract it once: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|
Three sets extend the same idea — add singles, subtract pairs, add back the triple: ∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣B∩C∣−∣C∩A∣+∣A∩B∩C∣|A \cup B \cup C| = |A|+|B|+|C| - |A\cap B|-|B\cap C|-|C\cap A| + |A\cap B\cap C|

Key rules to memorize

  1. A-only region: ∣A∣−∣A∩B∣−∣A∩C∣+∣A∩B∩C∣|A| - |A \cap B| - |A \cap C| + |A \cap B \cap C|.
  2. Disjoint sets: overlap is 0, so ∣A∪B∣=∣A∣+∣B∣|A \cup B| = |A| + |B|.
  3. Max union =∣A∣+∣B∣= |A| + |B| (disjoint); min union =max⁡(∣A∣,∣B∣)= \max(|A|, |B|) (one inside the other).

Worked example

∣A∣=30|A| = 30, ∣B∣=25|B| = 25, ∣A∩B∣=10|A \cap B| = 10. Find ∣A∪B∣|A \cup B|.

  1. Adding counts the overlap twice.
  2. Subtract it once: 30+25−10=4530 + 25 - 10 = 45.

4545

Classic trap

Trap: forgetting to add back the triple intersection — pairs subtract it three times but it was added three times, so net needs +1.

Lesson 8 of 16

Cartesian Products

Learn the idea

A×BA \times B holds ordered pairs (a,b)(a, b) with a∈A,b∈Ba \in A, b \in B. Counting is multiplication: ∣A×B∣=∣A∣⋅∣B∣|A \times B| = |A| \cdot |B|
Order matters: (a,b)≠(b,a)(a, b) \ne (b, a) unless the coordinates are equal.

Key rules to memorize

  1. Example: ∣A∣=4,∣B∣=3|A| = 4, |B| = 3 gives 4×3=124 \times 3 = 12 ordered pairs.

Worked example

∣A∣=4|A| = 4, ∣B∣=3|B| = 3. How many pairs in A×BA \times B?

  1. Each of the 44 A-items pairs with each of the 33 B-items.
  2. Multiply: 4×3=124 \times 3 = 12.

1212 ordered pairs

Classic trap

Trap: ∣A×B∣|A \times B| multiplies (mnmn), it is not m+nm + n — don't confuse pairs with unions.

Lesson 9 of 16

Inequality Basics

Learn the idea

Solve like an equation — isolate xx — with one extra rule: multiplying or dividing by a **negative** flips the sign: −2x>6⇒x<−3-2x > 6 \Rightarrow x < -3.
Adding or subtracting never flips anything.

Key rules to memorize

  1. Interval notation: x>2⇒(2,∞)x > 2 \Rightarrow (2, \infty), x≤5⇒(−∞,5]x \le 5 \Rightarrow (-\infty, 5]. Infinity always takes a round bracket.
  2. 2<x+1≤72 < x + 1 \le 7 is an AND: subtract 1 everywhere → 1<x≤61 < x \le 6.

Worked example

Solve −2x>6-2x > 6.

  1. Divide by −2-2 — negative, so flip the sign.
  2. Get x<−3x < -3.

x<−3x < -3

Classic trap

Trap: decide AND vs OR first. x>2x > 2 and x<7x < 7 combine to 2<x<72 < x < 7; “or” stays two separate intervals.

Lesson 10 of 16

Compound Inequalities

Learn the idea

AND means both must hold (one merged interval); OR means at least one holds (separate intervals). Example: −4≤2x+2<8-4 \le 2x + 2 < 8 → subtract 2, divide by 2 → −3≤x<3-3 \le x < 3.
Word codes: at least ≥\ge, at most ≤\le, no more than ≤\le, no less than ≥\ge.

Key rules to memorize

  1. “At least 10” is x≥10x \ge 10, not x>10x > 10. “At most 10” is x≤10x \le 10.

Worked example

Solve −4≤2x+2<8-4 \le 2x + 2 < 8.

  1. Subtract 22 everywhere: −6≤2x<6-6 \le 2x < 6.
  2. Divide by 22 (positive, no flip): −3≤x<3-3 \le x < 3.

−3≤x<3-3 \le x < 3

Classic trap

Trap: never auto-merge two inequalities — check whether the wording is AND or OR before combining.

Lesson 11 of 16

Absolute Value

Learn the idea

∣x∣|x| is distance from zero, never negative. ∣x∣=a|x| = a (with a>0a > 0) splits: x=ax = a or x=−ax = -a; shifted, ∣x−c∣=a|x - c| = a gives x=c±ax = c \pm a.
Inequalities follow one memory rule: **< means AND, > means OR**. ∣x∣<a  ⟺  −a<x<a|x| < a \iff -a < x < a, while ∣x∣>a  ⟺  x<−a|x| > a \iff x < -a or x>ax > a.

Key rules to memorize

  1. Equations first: ∣x∣=a⇒x=±a|x| = a \Rightarrow x = \pm a; shifted ∣x−c∣=a⇒x=c±a|x - c| = a \Rightarrow x = c \pm a (distance aa from cc).
  2. ∣x−3∣≤5  ⟺  −5≤x−3≤5  ⟺  −2≤x≤8|x - 3| \le 5 \iff -5 \le x - 3 \le 5 \iff -2 \le x \le 8.
  3. Two absolute values (∣2x−3∣<∣x+1∣|2x-3| < |x+1|): square both sides, then run a sign chart — here 23<x<4\frac23 < x < 4.
  4. Sums like ∣x−2∣+∣x+2∣≤6|x-2| + |x+2| \le 6: split at the critical points −2,2-2, 2 into three regions, drop each ∣⋅∣|·| with the correct sign per region, and solve — here −3≤x≤3-3 \le x \le 3. Shortcut: read it as distance — points whose distances to 22 and −2-2 total at most 6.

Worked example

Solve ∣x−3∣≤5|x - 3| \le 5.

  1. ≤\le means AND: −5≤x−3≤5-5 \le x - 3 \le 5.
  2. Add 33: −2≤x≤8-2 \le x \le 8.

−2≤x≤8-2 \le x \le 8

Classic trap

Trap: treating ∣x∣>a|x| > a as an AND (a single interval) — it is always two rays.

Lesson 12 of 16

Quadratic Inequalities

Learn the idea

Recipe: move everything to one side, factor, find zeros, sign-chart the intervals, then include/exclude endpoints by ≤/≥\le/\ge vs </></>.
For (x−a)(x−b)(x-a)(x-b) with a<ba < b and positive leading coefficient: outside the roots is positive, between is negative.

Key rules to memorize

  1. x2−5x+6≤0⇒(x−2)(x−3)≤0⇒2≤x≤3x^2 - 5x + 6 \le 0 \Rightarrow (x-2)(x-3) \le 0 \Rightarrow 2 \le x \le 3.
  2. x2−6x+9=(x−3)2≥0x^2 - 6x + 9 = (x-3)^2 \ge 0 always, so (x−3)2<0(x-3)^2 < 0 has no real solution.

Worked example

Solve x2−5x+6<0x^2 - 5x + 6 < 0.

  1. Factor: (x−2)(x−3)<0(x-2)(x-3) < 0, roots 2,32, 3.
  2. Upward parabola is negative between the roots.

2<x<32 < x < 3

Classic trap

Trap: including a root under a strict </></> sign, or forgetting that a repeated (even-multiplicity) root doesn't change sign.

Lesson 13 of 16

Polynomial Inequalities

Learn the idea

Same sign-chart engine, more factors: order all real zeros, test one point per interval, keep the intervals with the wanted sign.
Multiplicity decides: odd multiplicity flips the sign at the root, even multiplicity touches and keeps it.

Key rules to memorize

  1. (x+1)(x−2)(x−4)>0⇒(−1,2)∪(4,∞)(x+1)(x-2)(x-4) > 0 \Rightarrow (-1, 2) \cup (4, \infty).
  2. (x−1)2(x+2)<0(x-1)^2(x+2) < 0: (x−1)2≥0(x-1)^2 \ge 0 (zero only at x=1x = 1, excluded), so need x+2<0⇒x<−2x + 2 < 0 \Rightarrow x < -2.

Worked example

Solve (x+1)(x−2)(x−4)>0(x+1)(x-2)(x-4) > 0.

  1. Zeros in order: −1,2,4-1, 2, 4.
  2. Rightmost interval positive, signs alternate: (−1,2)(-1,2) and (4,∞)(4,\infty).

(−1,2)∪(4,∞)(-1,2) \cup (4,\infty)

Classic trap

Trap: expanding a factored polynomial — the factored form IS the sign chart input; expanding wastes time and invites errors.

Lesson 14 of 16

Rational Inequalities

Learn the idea

Collect numerator zeros AND denominator zeros, order them, sign-chart, then select. The golden rule: **denominator zeros are always excluded**, even under ≥/≤\ge/\le.
Example: x−1x+3>0\frac{x-1}{x+3} > 0 → critical x=1,x=−3x = 1, x = -3 (excluded) → x<−3x < -3 or x>1x > 1.

Key rules to memorize

  1. x−3x+2≥0⇒(−∞,−2)∪[3,∞)\frac{x-3}{x+2} \ge 0 \Rightarrow (-\infty, -2) \cup [3, \infty): numerator zero 33 included, denominator zero −2-2 excluded.
  2. 1(x−2)(x+3)≤0⇒−3<x<2\frac{1}{(x-2)(x+3)} \le 0 \Rightarrow -3 < x < 2: numerator never zero, both critical points excluded.

Worked example

Solve x−1x+3>0\frac{x-1}{x+3} > 0.

  1. Critical points: numerator zero x=1x = 1, denominator zero x=−3x = -3 (always excluded).
  2. Same sign holds outside: x<−3x < -3 or x>1x > 1.

x<−3x < -3 or x>1x > 1

Classic trap

Trap: cross-multiplying by a denominator of unknown sign, or simplifying away a factor and forgetting its zero stays excluded.

Lesson 15 of 16

Word Problems

Learn the idea

Translate first, solve second. “At least 40” → ≥40\ge 40; “no more than 20 and greater than 5” → (5,20](5, 20].
Two-variable y>2x+1y > 2x + 1 shades **above** the boundary; strict </></> uses a dashed (excluded) boundary, ≤/≥\le/\ge a solid one.

Key rules to memorize

  1. Rectangle width xx, length x+3x+3, area at least 40: x(x+3)≥40x(x+3) \ge 40 with x>0x > 0.
  2. “5 units from 2, at least”: ∣x−2∣≥5|x - 2| \ge 5.
  3. Full codebook: greater than >>, less than <<, at least ≥\ge, at most ≤\le, no more than ≤\le, no less than ≥\ge, minimum ≥\ge, maximum ≤\le, more than >>, fewer than <<.

Worked example

Width xx, length x+3x+3, area at least 4040, x>0x > 0. Set up the inequality.

  1. Area = width × length = x(x+3)x(x+3).
  2. “At least 40” → ≥40\ge 40.

x(x+3)≥40x(x+3) \ge 40

Classic trap

Trap: “at least” (≥\ge) vs “more than” (>>) — one boundary point decides the option.

Lesson 16 of 16

Two-Variable Inequalities

Learn the idea

A linear inequality in two variables like y>2x+1y > 2x + 1 describes a **region** of the coordinate plane, cut by its boundary line y=2x+1y = 2x + 1.
Shading rule: y>f(x)y > f(x) shades **above** the boundary; y<f(x)y < f(x) shades **below** it. Test with (0,0)(0,0) when unsure — if it satisfies the inequality, its side is shaded.

Key rules to memorize

  1. Strict </></> → dashed boundary (excluded); ≤/≥\le/\ge → solid boundary (included).
  2. Example: y>3x−2y > 3x - 2 is the region strictly above the line y=3x−2y = 3x - 2.
  3. Vertical/horizontal cases work the same way: x>1x > 1 is everything right of the line x=1x = 1.

Worked example

Where is the solution of y>2x+1y > 2x + 1? Is the boundary included?

  1. y>y > means the region above the line y=2x+1y = 2x + 1.
  2. Strict >> → dashed boundary (excluded).

Above the line, boundary excluded

Classic trap

Trap: shading the wrong side, or drawing a solid line for a strict inequality — always test one point.

Master formula sheet

Counting

  • Subsets of an nn-element set: 2n\boxed{2^n}
  • Proper subsets: 2n−1\boxed{2^n-1}
  • Power set size: ∣P(A)∣=2∣A∣|\mathcal{P}(A)| = 2^{|A|}
  • Subsets containing a fixed element: 2n−12^{n-1}
  • Cartesian product: ∣A×B∣=∣A∣⋅∣B∣|A \times B| = |A| \cdot |B|

Operations & laws

  • Complement: Ac=U−AA^c = U - A
  • De Morgan: (A∪B)c=Ac∩Bc(A \cup B)^c = A^c \cap B^c, (A∩B)c=Ac∪Bc(A \cap B)^c = A^c \cup B^c
  • Two-set union: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|
  • Three-set union: add singles, subtract pairs, add back the triple
  • If A⊆BA \subseteq B: A∩B=AA \cap B = A, A∪B=BA \cup B = B

Absolute value

  • ∣x∣<a  ⟺  −a<x<a|x| < a \iff -a < x < a (AND)
  • ∣x∣≤a  ⟺  −a≤x≤a|x| \le a \iff -a \le x \le a
  • ∣x∣>a  ⟺  x<−a or x>a|x| > a \iff x < -a \text{ or } x > a (OR)
  • ∣x∣≥a  ⟺  x≤−a or x≥a|x| \ge a \iff x \le -a \text{ or } x \ge a

Inequality engine

  • Negative multiply/divide flips: <↔>< \leftrightarrow >, ≤↔≥\le \leftrightarrow \ge
  • Quadratic (x−a)(x−b)(x-a)(x-b), a<ba<b: >0>0 outside, <0<0 between
  • Odd multiplicity flips sign; even multiplicity keeps it
  • Rational: numerator zeros + denominator zeros, sign chart, denominator always excluded

Traps & recognition

15 classic traps

  1. Confusing ∈\in (element) with ⊆\subseteq (subset).
  2. Forgetting ∅\varnothing is a subset of every set.
  3. Counting repeated elements twice.
  4. Skipping the subtracted intersection in union counting.
  5. Dropping the added-back triple intersection for three sets.
  6. Treating A−BA-B and B−AB-A as the same.
  7. Finding a complement without fixing the universal set UU.
  8. Not flipping the sign after negative division/multiplication.
  9. Reading ∣x∣>a|x|>a as AND instead of OR.
  10. Including denominator zeros (never allowed).
  11. Including roots under strict </></> signs.
  12. Forgetting even-multiplicity roots keep their sign.
  13. Drawing solid boundaries for strict inequalities.
  14. Mixing up “at least” (≥\ge) with “more than” (>>.
  15. Expanding factored polynomials instead of sign-charting them.

Fast problem recognition

  • “How many subsets?”

    Use 2n2^n (proper: 2n−12^n-1).

  • “Common / both”

    Think A∩BA \cap B.

  • “Either / or / at least one”

    Think A∪BA \cup B + inclusion–exclusion.

  • “Not in / neither”

    Think complement / difference.

  • Linear inequality

    Isolate xx; watch negative division.

  • Absolute value

    < → AND interval; > → OR rays (or square both sides).

  • Quadratic / polynomial

    Roots + sign chart; check multiplicity.

  • Rational

    Numerator + denominator critical points; exclude denominator zeros.

Practice — 300 problems

0/0 correct

  1. Q1basic · membership
    If A={1,2,3,4}A=\{1,2,3,4\}, which statement is true?
  2. Q2basic · cardinality
    If A={a,b,c}A=\{a,b,c\}, then ∣A∣=|A|=
  3. Q3basic · empty-set
    Which is an empty set?
  4. Q4basic · subset
    How many subsets does a 5-element set have?
  5. Q5basic · subset
    How many proper subsets does a 5-element set have?
  6. Q6basic · intersection
    If A={1,2,3}A=\{1,2,3\} and B={3,4,5}B=\{3,4,5\}, then A∩B=A\cap B=
  7. Q7basic · union
    For the same A and B, A∪B=A\cup B=
  8. Q8basic · difference
    If A={1,2,3,4}A=\{1,2,3,4\} and B={2,4}B=\{2,4\}, then A−B=A-B=

Previous CSCA exam questions

Real questions from the Dec 2025, Jan 2026 and Apr 2026 papers that test this chapter — solved with the thinking shown. Answers solved by the app (the source papers publish no official key); items with source errors are marked and still teach the correct math.

14 exam questions · 0/0 correct

  1. Dec 2025 · Q1sets
    If sets A={1,2}A = \{1,2\}, B={1,2,3}B = \{1,2,3\}, then
  2. Dec 2025 · Q2sets
    If sets A=(−1,3)A = (-1,3), B=[2,4]B = [2,4], then A∩B=A \cap B =
  3. Dec 2025 · Q3inequalities
    The solution set of x2−5x+4<0x^2 - 5x + 4 < 0 is
  4. Dec 2025 · Q12inequalities
    The solution set of x−1x−2≤1\frac{x-1}{x-2} \le 1 is
  5. Jan 2026 · Q1sets
    A={6,7,8,9,10}A = \{6,7,8,9,10\}: which is correct?
  6. Jan 2026 · Q2sets
    A={x∣−2≤x≤2}A = \{x | -2 \le x \le 2\}, B={x∣x>0}B = \{x | x > 0\}: A∪B=A \cup B =
  7. Jan 2026 · Q3inequalities
    x2−x−2>0x^2 - x - 2 > 0: solution set is
  8. Jan 2026 · Q11inequalities
    2x+1x−2≤0\frac{2x+1}{x-2} \le 0: solution set is

Exam checklist

0/14 checked

Sets

Inequalities

One-minute memory sheet

  • Union = OR, Intersection = AND
  • Subsets =2n= 2^n, proper =2n−1= 2^n-1
  • ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|
  • Negative multiply/divide = flip the sign
  • ∣x∣<a⇒|x| < a \Rightarrow AND, ∣x∣>a⇒|x| > a \Rightarrow OR
  • Quadratic/polynomial = roots + sign chart
  • Rational = numerator + denominator zeros + sign chart
  • Denominator zero = ALWAYS excluded

Related guides

Last reviewed Sep 2026 · GetCSCA editors