PrevNext

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on GitHub.

Visualize!

Managing information is hard! There are many problems which concern a number of certain things that match certain criteria, which can simply be a mess to solve algebraically. Luckily, Venn diagrams allow us to organize our counting and effectively solve such types of problems.

Sets

Throughout this module, you should know a little bit of set notation. To give a refresher:

A set is a collection of distinct objects, called its elements, written inside curly braces like A={1,2,3}A = \{1, 2, 3\}. Order doesn't matter and repeats don't count.

  1. x∈Ax \in A means "xx is an element of AA"; x∉Ax \notin A means it isn't.
  2. ∣A∣|A| is the cardinality — the number of elements in AA.
  3. ∅\varnothing is the empty set, with ∣∅∣=0|\varnothing| = 0.
  4. A⊆BA \subseteq B means every element of AA is also in BB (AA is a subset of BB).
  5. UU is the universal set: everything under consideration in the problem.
  6. A∪BA \cup B (union) is everything in AA or BB; A∩BA \cap B (intersection) is everything in both.
  7. A‾\overline{A} (complement) is everything in UU not in AA, so ∣A‾∣=∣U∣−∣A∣|\overline{A}| = |U| - |A|.
  8. A two-circle Venn diagram has four regions: only AA, only BB, both AA and BB, and neither.
  9. ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B| (inclusion-exclusion for two sets).

Use Cases

In roughly 90% of problems involving several types of criteria (people who take a certain amount of subjects, a deck of cards, etc.), Venn diagrams help in effectively and efficiently solving the problem. However, there is the occasional problem that can be solved quite intuitively without needing a Venn diagram to visualize.

The key steps you should take are:

  1. Initialize categories as circles (usually named with letters: A, B, C, ...)
  2. Overlap the categories (sometimes two categories shouldn't be overlapped if the problem explicitly states that; however, in your diagram it is still fine to overlap them as long as you remember that the overlap may have length 0)
  3. Use conditions given in the problem to label areas (areas being regions in the diagram where a certain number of categories have that property, i.e., a region of overlap)

Techniques

Here are a couple of useful techniques that are nice to know for pattern recognition:

Inclusion-Exclusion

For two sets,

∣A∪B∣=∣A∣+∣B∣−∣A∩B∣,|A \cup B| = |A| + |B| - |A \cap B|,

and for three,

∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C∣.|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|.

The pattern continues for more sets: add all single sets, subtract all pairwise intersections, add all triples, subtract all quadruples, and so on, alternating signs. This is also known as the Principle of Inclusion-Exclusion or PIE.

Complementary Counting

Often "at least one" is annoying to count directly, but "none" is easy. Since every element is either in A∪BA \cup B or outside it,

∣A∪B∣=∣U∣−∣A‾∩B‾∣.|A \cup B| = |U| - |\overline{A} \cap \overline{B}|.

Whenever a problem gives you the "neither" count (or asks for it), use this!

Watch the Wording

A few phrases that trip people up:

  • "∣A∣|A|" usually means everyone in AA, including those also in BB — not the "only AA" region.
  • "exactly one of AA, BB" means ∣A∣+∣B∣−2∣A∩B∣|A| + |B| - 2|A \cap B|, since the overlap is removed from both ∣A∣|A| and ∣B∣|B| — that is, twice.
  • "at least two of AA, BB, CC" means add the three pairwise overlaps but subtract 2∣A∩B∩C∣2|A \cap B \cap C|, since the triple region was counted three times.

Demonstration

Like most concepts, Venn diagrams are best explained through example problems. Consider this one:

(2002 AMC 8) At Euler Middle School, 198198 students voted on two issues in a school referendum with the following results: 149149 voted in favor of the first issue and 119119 voted in favor of the second issue. If there were exactly 2929 students who voted against both issues, how many students voted in favor of both issues?

This is the inclusion-exclusion formula run backwards: we are handed the two totals and the "neither" count, and asked for the overlap.

First, the number of students who voted in favor of at least one issue is everyone except the 2929 who opposed both:

∣A∪B∣=198−29=169.|A \cup B| = 198 - 29 = 169.

Now apply ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B| and solve for the overlap:

∣A∩B∣=∣A∣+∣B∣−∣A∪B∣=149+119−169=99.|A \cap B| = |A| + |B| - |A \cup B| = 149 + 119 - 169 = \boxed{99}.

It helps to see where every student lands. Once the overlap is 9999, the "only Issue 1" region is 149−99=50149 - 99 = 50 and the "only Issue 2" region is 119−99=20119 - 99 = 20. As a check, all four regions sum back to the total: 50+99+20+29=19850 + 99 + 20 + 29 = 198.

U = 198 studentsIssue 1 149 in favor Issue 2 119 in favor 50 only Issue 1 99 both 20 only Issue 2 29 neither

Practice Problems

StatusSourceProblem NameDifficultyTags
AMC 8Medium
Show TagsCounting, Sets
AMC 8Medium
Show TagsFractions, Overlap, Sets
AMC 8Medium
Show TagsSet Theory, Venn Diagrams

Module Progress:

Join the Discord Community!

Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.

PrevNext