Make learning comfortable
Intermediate Counting and Probability / LEVEL 1 · DIFFICULTY 1/5
Sets and Distributions
Handle overlaps and constrained allocations.
Choose a node to explore its lesson.
STAGE IC 1.1 · 8 PRACTICE PROBLEMS · 2 NEW-CONTEXT APPLICATIONS
Three-Set Inclusion–Exclusion
Goal: Understand and apply three-set inclusion–exclusion.
Before you begin: Combinations, elementary probability, binomial coefficients and algebra.
Understand the idea
Adding three set sizes counts members with multiple memberships too often. Subtracting pair intersections fixes double memberships, but triple members then need one final restoration.
Choose and carry out a method
Add single-set counts, subtract all three pair-intersection counts, and add the triple intersection. Pair counts include triple members unless explicitly stated otherwise.
Check the reasoning
Track one member belonging to one, two or three sets. In every case its final contribution to the union must equal one.
, , ; pairwise intersections AB, AC, BC have sizes 5, 4, 3, and the triple intersection has size 1. Find |A∪B∪C|.
- Inclusion-exclusion alternates single, double and triple intersections.
- .
- The union has 46 members. Triple members must be added back after the pairwise subtraction.
46
, , ; pairwise intersections AB, AC, BC have sizes 6, 5, 4, and the triple intersection has size 2. Find |A∪B∪C|.
- Inclusion-exclusion alternates single, double and triple intersections.
- .
- The union has 47 members. Triple members must be added back after the pairwise subtraction.
47
Common pitfalls
Possible mix-up: Pair-intersection counts exclude triple members.
Standard intersection counts include them.
Possible mix-up: A correct numerical answer alone explains the method.
State the governing relationship and check the conditions described above.
Explain it to yourself
Verify the formula by tracking a member who belongs to all three sets.
Preview the eight practice prompts
, , ; pairwise intersections AB, AC, BC have sizes 8, 7, 6, and the triple intersection has size 4. Find |A∪B∪C|.
, , ; pairwise intersections AB, AC, BC have sizes 9, 8, 7, and the triple intersection has size 5. Find |A∪B∪C|.
, , ; pairwise intersections AB, AC, BC have sizes 10, 9, 8, and the triple intersection has size 6. Find |A∪B∪C|.
, , ; pairwise intersections AB, AC, BC have sizes 11, 10, 9, and the triple intersection has size 7. Find |A∪B∪C|.
, , ; pairwise intersections AB, AC, BC have sizes 12, 11, 10, and the triple intersection has size 8. Find |A∪B∪C|.
, , ; pairwise intersections AB, AC, BC have sizes 13, 12, 11, and the triple intersection has size 9. Find |A∪B∪C|.
Three clubs have 30, 28, and 26 members. Their pairwise overlaps (including triple members) are 14, 13, and 12; 10 members attend all three. How many distinct people attend at least one club?
Three clubs have 31, 29, and 27 members. Their pairwise overlaps (including triple members) are 15, 14, and 13; 11 members attend all three. How many distinct people attend at least one club?
STAGE IC 1.2 · 8 PRACTICE PROBLEMS · 2 NEW-CONTEXT APPLICATIONS
Stars and Bars
Useful preparation: Three-Set Inclusion–Exclusion
Goal: Understand and apply stars and bars.
Before you begin: Three-Set Inclusion–Exclusion
Understand the idea
Placing separators among identical objects encodes a distribution into labeled boxes. Empty boxes correspond to adjacent separators or a separator at an end.
Choose and carry out a method
To distribute N identical objects into three labeled boxes, arrange N stars and two bars. Choose the two bar positions among slots.
Check the reasoning
The boxes are labeled but the objects are identical. Positive counts would require placing one object in each box before using the formula.
How many nonnegative integer triples (x,y,z) satisfy ?
- Arrange stars for objects and separators for labeled groups.
- Place two separators among positions; adjacent separators allow an empty group.
- . The objects are identical, while the groups are distinguishable.
21
How many nonnegative integer triples (x,y,z) satisfy ?
- Arrange stars for objects and separators for labeled groups.
- Place two separators among positions; adjacent separators allow an empty group.
- . The objects are identical, while the groups are distinguishable.
28
Common pitfalls
Possible mix-up: Empty boxes are excluded automatically.
Adjacent or end bars represent zero objects and are allowed.
Possible mix-up: A correct numerical answer alone explains the method.
State the governing relationship and check the conditions described above.
Explain it to yourself
Show the star-and-bar string for a distribution containing an empty box.
Preview the eight practice prompts
How many nonnegative integer triples (x,y,z) satisfy ?
How many nonnegative integer triples (x,y,z) satisfy ?
How many nonnegative integer triples (x,y,z) satisfy ?
How many nonnegative integer triples (x,y,z) satisfy ?
How many nonnegative integer triples (x,y,z) satisfy ?
How many nonnegative integer triples (x,y,z) satisfy ?
14 identical beads are distributed among three labeled trays, possibly leaving some trays empty. How many distributions are possible?
15 identical beads are distributed among three labeled trays, possibly leaving some trays empty. How many distributions are possible?
STAGE IC 1.3 · 8 PRACTICE PROBLEMS · 2 NEW-CONTEXT APPLICATIONS
Upper Bounds by Subtraction
Useful preparation: Stars and Bars
Goal: Understand and apply upper bounds by subtraction.
Before you begin: Stars and Bars
Understand the idea
A simple upper bound can be handled by counting all nonnegative distributions and removing those that exceed it. Shifting the offending variable creates an unrestricted smaller problem.
Choose and carry out a method
For , subtract solutions with . Replace x by , then apply stars and bars to the reduced total.
Check the reasoning
The bad and good sets partition all solutions. With multiple bounds, overlaps among bad sets require inclusion–exclusion.
Count nonnegative integer solutions to with .
- Count unrestricted distributions, then subtract those violating the upper bound.
- For , set . Subtract C(4,2) from C(8,2).
- There are 22 allowed distributions. A shift by 3 would incorrectly exclude the boundary.
22
Count nonnegative integer solutions to with .
- Count unrestricted distributions, then subtract those violating the upper bound.
- For , set . Subtract C(5,2) from C(9,2).
- There are 26 allowed distributions. A shift by 3 would incorrectly exclude the boundary.
26
Common pitfalls
Possible mix-up: Subtract cases with .
The bound allows ; bad cases begin at .
Possible mix-up: A correct numerical answer alone explains the method.
State the governing relationship and check the conditions described above.
Explain it to yourself
Why does subtracting from x preserve a one-to-one correspondence?
Preview the eight practice prompts
Count nonnegative integer solutions to with .
Count nonnegative integer solutions to with .
Count nonnegative integer solutions to with .
Count nonnegative integer solutions to with .
Count nonnegative integer solutions to with .
Count nonnegative integer solutions to with .
15 identical counters are placed in three labeled cups, but the first cup holds at most 3. How many distributions are allowed?
16 identical counters are placed in three labeled cups, but the first cup holds at most 3. How many distributions are allowed?

