Back to Inclusion-Exclusion

Exercise 17

Avg difficulty 2.5

A professor is working with six undergraduate research students. He has 1212 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 students if each student must be assigned at least one topic?

Keller & Trotter, Applied Combinatorics, Inclusion-Exclusion — Exercises, Exercise 17

AI Tutor

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.