• Advanced
  • About 16 min

Inclusion–exclusion: counting at-least-one conditions on several sets

Use |A ∪ B ∪ C| = Σ|A| − Σ|A ∩ B| + |A ∩ B ∩ C| to count numbers divisible by at least one of several numbers, onto functions, and arrangements in which no two equal letters are adjacent.

If something looks wrong, please tell us.

This lesson is part of a premium course. It comes with Sikhora Learning membership. The course's free preview lessons are open to everyone.

Privacy · Terms · Refunds · Delivery