Back to Strings, Sets, and Binomial Coefficients

Exercise 19

Avg difficulty 2.5

A teacher has 450450 identical pieces of candy. He wants to distribute them to his class of 6565 students, although he is willing to take some leftover candy home. (He does not insist on taking any candy home, however.) The student who won a contest in the last class is to receive at least 1010 pieces of candy as a reward. Of the remaining students, 3434 of them insist on receiving at least one piece of candy, while the remaining 3030 students are willing to receive no candy.

  1. In how many ways can he distribute the candy?

  2. In how many ways can he distribute the candy if, in addition to the conditions above, one of his students is diabetic and can receive at most 77 pieces of candy? (This student is one of the 3434 who insist on receiving at least one piece of candy.)

Keller & Trotter, Applied Combinatorics, Strings, Sets, and Binomial Coefficients — Exercises, Exercise 19

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.