Question 1153490: There are 16 students giving final presentations in your history course.
(a) Three students present per day. How many presentation orders are possible for the first day?
(b) Presentation subjects are based on the units of the course. Unit B is covered by three students, Unit C is covered by five students, and Units A and D are each covered by four students. How many presentation orders are possible when presentations on the same unit are indistinguishable form each other?
Answer by ikleyn(52778) (Show Source):
You can put this solution on YOUR website! .
(a) "How many presentation orders are possible for the first day" = 16*15*14.
Any of 16 students can give 1-st presentation.
Any of remaining 15 students can give 2-nd presentation.
Any of remaining 14 students can give 3-rd presentation.
The total is the product of these factors.
(b) The number of orders in this case is
N = = 50450400.
This formula is standard for such kind of problems on arranging the set containing groups of indistinguishable elements.
The factorials in denominator serve to account multiplicities of indistinguishable elements in groups.
Probably, it would be more clear, if I retell it in other way.
We may think that each of 16 students simply carries the name of the unit "A", "B", "C" and "D",
instead of making real presentation.
Then the question is: how many 16-letter words do exist, written in 4-letter alphabet A, B, C and D, in a way that
letter A occurs 4 times; letter B occurs 3 times; letter C occurs 5 times, and letter D occurs 4 times.
Then the answer to this question is EXACTLY as I described it above.
Solved, answered and explained. And completed.
------------------
To see other similar solved problems, look into the lesson
- Arranging elements of sets containing indistinguishable elements
in this site.
Also, you have this free of charge online textbook in ALGEBRA-II in this site
- ALGEBRA-II - YOUR ONLINE TEXTBOOK.
The referred lessons are the part of this online textbook under the topic "Combinatorics: Combinations and permutations".
Save the link to this textbook together with its description
Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson
into your archive and use when it is needed.
|
|
|