Combinatorics · Counting · Binomial coefficients · Casework · Distributions
Problem 2, 2009
A delegation of \(6\) people is to be chosen from a group of \(16\), consisting of \(4\) people from Serbia, \(4\) from Romania, \(4\) from Bulgaria and \(4\) from Macedonia.
(a) In how many ways can this be done so that every country is represented?
(b) In how many ways can this be done so that no country has more than two representatives?
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Serbian Municipal Competition 2009, high school grade I, category A, problem 2. Organized by the Mathematical Society of Serbia (DMS). Source