Inclusion-Exclusion
Counting integers divisible by none of several moduli, bounded integer solutions, surjective assignments, and derangements where nothing lands in its own place.
5 exercises
Exercise 1
A school has third graders. The third grade teachers have planned a special treat for the last day of school and brought ice cream for their students. There are three flavors: mint chip, chocolate, and strawberry. Suppose that students like (at least) mint chip, like chocolate, like strawberry, like mint chip and strawberry, like mint chip and chocolate, like chocolate and strawberry…
Exercise 5
How many positive integers less than or equal to are divisible by none of , , and ?
Exercise 7
How many nonnegative integer solutions are there to the equation with for ?
Exercise 17
A professor is working with six undergraduate research students. He has topics that he would like these students to begin investigating. Since he has been working with Katie for several terms, he wants to ensure that she is given the most challenging topic (and possibly others). Each topic must be assigned to a single student. Subject to this, in how many ways can he assign the topics to his stu…
Exercise 21
A careless payroll clerk is placing employees' paychecks into envelopes that have been pre-labeled. The envelopes are sealed before the clerk realizes he didn't match the names on the paychecks with the names on the envelopes. If there are seven employees, in how many ways could he have placed the paychecks into the envelopes so that exactly three employees receive the correct paycheck?
Adapted from Applied Combinatorics © 2006–2025 Mitchel T. Keller, William T. Trotter. Licensed under CC BY-SA 4.0. Source: Applied Combinatorics. Imported at revision 07286c4.