Formula sheet · Modern Math - Sets

Sets Formula Sheet

All QA formula sheets

Set theory in CAT appears as Venn diagram questions in both Quant and Logical Reasoning, often asking for maximum or minimum overlaps. Draw the diagram, fill the innermost region first and keep every region non-negative.

Two sets

FormulaWhen to use
\(n(A \cup B) = n(A) + n(B) - n(A \cap B)\)Number in at least one of the two sets.
Only A \(= n(A) - n(A \cap B)\)Members of A who are not in B, written \(n(A - B)\).
Exactly one \(= n(A) + n(B) - 2\,n(A \cap B)\)Members of one set but not both.
Neither \(= U - n(A \cup B)\)\(U\) is the total number in the universal set.
\((A \cup B)' = A' \cap B'\), \((A \cap B)' = A' \cup B'\)De Morgan's laws for "not A and not B" type statements.

Three sets

FormulaWhen to use
\(n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(A \cap C) + n(A \cap B \cap C)\)Number in at least one of three sets.
Let \(S_1 = n(A) + n(B) + n(C)\), \(S_2 = n(A \cap B) + n(B \cap C) + n(A \cap C)\), \(S_3 = n(A \cap B \cap C)\)Shorthand used in the rows below.
Exactly one \(= S_1 - 2S_2 + 3S_3\)Members of only one of the three sets.
Exactly two \(= S_2 - 3S_3\)Members of exactly two sets, not all three.
At least two \(= S_2 - 2S_3\)Members of two or three sets.
\(S_1 = E_1 + 2E_2 + 3E_3\) and \(n(A \cup B \cup C) = E_1 + E_2 + E_3\)\(E_k\) is the number in exactly \(k\) sets; each person is counted once per set they belong to.
Only A \(= n(A) - n(A \cap B) - n(A \cap C) + n(A \cap B \cap C)\)Members of A and neither of the other two.

Maximum, minimum and subsets

FormulaWhen to use
\(\max(0,\ n(A) + n(B) - U) \le n(A \cap B) \le \min(n(A), n(B))\)Range of the overlap of two sets inside a universe of size \(U\).
\(n(A \cap B \cap C) \ge n(A) + n(B) + n(C) - 2U\)Lower bound on the triple overlap; if the right side is negative, the bound is 0.
Number of subsets \(= 2^n\); proper subsets \(= 2^n - 1\); non-empty proper subsets \(= 2^n - 2\)A set with \(n\) elements, \(n \ge 1\) for the last count.
Venn regions \(= 2^k\) (including the outside region)\(k\) sets in general position: 4 regions for 2 sets, 8 for 3 sets.

Shortcuts and traps

  • Only versus exactly: "only A" means A and no other set; "exactly two" excludes those in all three.
  • At least one is the union: "at least one" equals \(n(A \cup B \cup C)\), not \(S_1\), which counts people more than once.
  • Fill from the centre: write the triple overlap first, then the exactly-two regions, then the only regions.
  • Check every region: when maximising or minimising, a value is valid only if no Venn region becomes negative.
  • Read "neither": if some people are in no set, the union is less than the total; subtract them before using the formulas.

Practise Modern Math - Sets →