Social promotion distributions

It is the end of the school year, and a teacher is giving out awards to her 3 students. She has 6 distinct awards (for grades, attendance, generosity, etc.) to give out, and she will give each award to the student who is most deserving.

However, she knows that her students can be rather immature, and one of them might throw a fit if he or she doesn't get an award. She secretly decides to make sure that each student gets at least one award (even if he or she doesn't deserve it).

How many ways can the awards be distributed among the students if all of the awards are given?


The answer is 540.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Andy Hayes
May 10, 2016

Relevant wiki: Distinct Objects into Distinct Bins

This problem can be modeled as 6 6 distinct objects distributed into 3 3 distinct bins, with none of the bins left empty.

Let U U be the set of distributions of these objects, disregarding the restriction that each bin receives one object. U = 3 6 = 729 |U|=3^6=729 .

Let A A be the set of distributions of the 6 objects into the 2nd and 3rd bins, let B B be the set of distributions of the objects into the 1st and 3rd bins, and let C C be the distribution of the objects into the 1st and 2nd bins. Without loss of generality, A = B = C = 2 6 = 64 |A|=|B|=|C|=2^6=64

A B A\cap B is the set of distributions of the 6 objects into the 3rd bin. There is only one way to distribute all 6 objects into 1 bin, so A B = 1 |A\cap B|=1 . Without loss of generality, A B = A C = B C |A\cap B|=|A\cap C|=|B\cap C| .

It is not possible for all three bins to be empty, so A B C = 0 |A\cap B\cap C|=0 .

A B C A \cup B \cup C is the set of all distributions of the objects in which at least one of the bins is empty. A B C A \cup B \cup C can be found using the principle of inclusion and exclusion :

A B C = A + B + C A B A C B C + A B C |A\cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C| A B C = 64 + 64 + 64 1 1 1 + 0 = 189 |A\cup B \cup C| = 64+64+64-1-1-1+0=189

The problem asks for the size of the complement of this set, U A B C |U|-|A\cup B\cup C| . Therefore, there are 729 189 = 540 729-189=\boxed{540} ways to distribute the awards to the students.

Tejas Deshmukh
May 16, 2020

Answer : 3! S(6,3) = 6 x 90 = 540

(Watch my previous question answer and come here)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...