Combinatorics · Distributions · Binomial coefficients · Multinomial coefficients · Overcounting
Problem 4, 2004
In how many ways can \(m\) distinct birds be placed into \(n\) distinct cages so that every cage contains at least one bird and at most two birds?
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Serbian Municipal Competition 2004, high school grade I, category A, problem 4. Organized by the Mathematical Society of Serbia (DMS). Source