Skip to main content

Enumerative Combinatorics · Inclusion-exclusion, derangements, and surjections

Among thirty labeled projects, eighteen use method A, fourteen use method B, and twelve…

Problem

Enumerative Combinatorics practice problem

Among thirty labeled projects, eighteen use method AA, fourteen use method BB, and twelve use method CC. Eight use both AA and BB, seven use both AA and CC, and five use both BB and CC; each of these pair counts includes projects that also use the third method. Three use all three methods.

Count projects using at least one method, exactly one method, exactly two methods, and none. Derive the formulas by tracking how often a project with one, two, or three memberships is counted. Verify that the seven nonempty membership regions have nonnegative sizes consistent with all the data.

Hint

Hint

Track the contribution of one project according to how many methods it uses.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Enumerative Combinatorics sample problem: Try the free sample problem.

More Enumerative Combinatorics practice problems