SOLID STATE PRESS
← Back to catalog
The Inclusion-Exclusion Principle cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

The Inclusion-Exclusion Principle

Venn Diagrams, Derangements, and the Art of Counting Overlaps — A TLDR Primer

Counting problems seem straightforward until sets start overlapping — then students double-count, miss cases, and lose points on exams they felt ready for. If inclusion-exclusion has ever left you staring at a Venn diagram wondering which pieces to add and which to subtract, this guide is for you.

**TLDR: The Inclusion-Exclusion Principle** covers exactly what the name says, nothing more, nothing less. Starting from the two-set formula and building to the general n-set case, the book walks through why the alternating add-subtract pattern guarantees every element is counted exactly once. Along the way you'll work through divisibility problems, derangements (the classic hat-check puzzle), and onto-function counting — the problems that appear most often in discrete math courses and competition prep.

This is a combinatorics study guide for high school students and college freshmen who need a focused, fast explanation, not a 600-page textbook. Every section leads with the key idea, backs it with worked examples, and flags the misconceptions that cost students marks. It's also a practical reference for tutors or parents helping kids through a discrete math or precalculus unit.

If you want to walk into your next exam knowing exactly when and how to apply inclusion-exclusion, start here.

What you'll learn
  • State and apply the inclusion-exclusion principle for two, three, and n sets
  • Translate word problems about 'at least one' and 'none of' conditions into set-counting problems
  • Use inclusion-exclusion to count integers with divisibility conditions and to compute derangements
  • Recognize when inclusion-exclusion is the right tool versus simpler counting methods
What's inside
  1. 1. Why Counting Overlaps Is Tricky
    Motivates the principle with the classic double-counting trap and introduces set notation the reader needs.
  2. 2. Two and Three Sets: The Core Formula
    Derives and applies the inclusion-exclusion formula for two and three sets using Venn diagrams and worked examples.
  3. 3. The General Inclusion-Exclusion Principle
    Generalizes to n sets, explains the alternating-sign pattern, and shows why each element gets counted exactly once.
  4. 4. Counting with Divisibility and the Complement Trick
    Applies inclusion-exclusion to count integers divisible by at least one of several primes, and uses the complement to count those divisible by none.
  5. 5. Derangements and Other Classic Applications
    Uses inclusion-exclusion to derive the derangement formula and tackle hat-check, surjection-counting, and onto-function problems.
  6. 6. When to Use It and When Not To
    Gives a practical decision guide, common pitfalls, and connects inclusion-exclusion to probability and future topics.
Published by Solid State Press
The Inclusion-Exclusion Principle cover
TLDR STUDY GUIDES

The Inclusion-Exclusion Principle

Venn Diagrams, Derangements, and the Art of Counting Overlaps — A TLDR Primer
Solid State Press

The Inclusion-Exclusion Principle

Venn Diagrams, Derangements, and the Art of Counting Overlaps — A TLDR Primer

Copyright © 2026 Solid State Press.

Published by Solid State Press.

All rights reserved. No part of this book may be reproduced or transmitted in any form without prior written permission, except for brief quotations in critical reviews and educational use.

Part of the TLDR Study Guides series.

Contents

  1. 1 Why Counting Overlaps Is Tricky
  2. 2 Two and Three Sets: The Core Formula
  3. 3 The General Inclusion-Exclusion Principle
  4. 4 Counting with Divisibility and the Complement Trick
  5. 5 Derangements and Other Classic Applications
  6. 6 When to Use It and When Not To
Chapter 1

Why Counting Overlaps Is Tricky

Suppose your school ran two after-school clubs last semester — a Math club and a Science club — and the administration wants to know how many students participated in at least one of them. A helpful student counts 30 members in Math club and 25 members in Science club, then reports 55 total. The principal posts the number. Later, someone notices the school only has 40 students. What went wrong?

The student counted everyone who belonged to both clubs twice — once in each list. This is the double-counting trap, and it shows up constantly whenever you try to combine overlapping groups. The fix is the central idea of this entire book: subtract the overlap once, so every person gets counted exactly once.

Before we can be precise about that fix, we need the right language.

The vocabulary you need

A set is any collection of distinct objects. Those objects are called its elements. Sets are usually named with capital letters: $A$, $B$, $S$, and so on. You write $x \in A$ to say "$x$ is an element of $A$," and $x \notin A$ to say it is not.

The cardinality of a set is just its size — the number of elements it contains. It's written $|A|$. If $A = \{1, 3, 5, 7\}$, then $|A| = 4$.

Two operations connect sets to each other:

  • The union $A \cup B$ is the set of everything that belongs to $A$, or $B$, or both. "Or" in mathematics is always inclusive — it includes the case where something is in both.
  • The intersection $A \cap B$ is the set of everything that belongs to both $A$ and $B$ simultaneously.

In the club example, $A$ is the set of Math club members and $B$ is the set of Science club members. The union $A \cup B$ is every student in at least one club. The intersection $A \cap B$ is every student in both.

About This Book

If you are staring down a combinatorics unit in Precalculus, Discrete Math, or an AP math course and the problems involving overlapping groups are not clicking, this book is for you. It is also for the college freshman meeting counting arguments for the first time and for tutors who need a clean, fast reference.

This guide covers the full arc of the inclusion-exclusion principle: from Venn diagram counting problems with solutions built out step by step, through the general formula for any number of sets, to divisibility applications and derangements and combinatorics practice on classic permutation problems. Think of it as a discrete math primer for beginners who want depth without padding — about 15 focused pages.

Read it straight through the first time. Work each example before reading the solution. The inclusion-exclusion principle explained simply is the goal of every section, so the ideas build on each other; skipping ahead will cost you. Finish with the problem set to confirm what you have actually learned.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon