Difference between revisions of "2020 AMC 8 Problems/Problem 23"
Sevenoptimus (talk | contribs) m (Fixed capitalisation, and removed unnecessary and irrelevant attribution) |
(→Solution 1 (Constructive Counting)) |
||
(84 intermediate revisions by 42 users not shown) | |||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Five different awards are to be given to three students. Each student will receive at least one | + | Five different awards are to be given to three students. Each student will receive at least one award. In how many different ways can the awards be distributed? |
− | award. In how many different ways can the awards be distributed? | ||
<math>\textbf{(A) }120 \qquad \textbf{(B) }150 \qquad \textbf{(C) }180 \qquad \textbf{(D) }210 \qquad \textbf{(E) }240</math> | <math>\textbf{(A) }120 \qquad \textbf{(B) }150 \qquad \textbf{(C) }180 \qquad \textbf{(D) }210 \qquad \textbf{(E) }240</math> | ||
− | ==Solution 1 ( | + | ==Solution 1 (Constructive Counting)== |
− | + | Firstly, observe that it is not possible for a single student to receive <math>4</math> or <math>5</math> awards because this would mean that one of the other students receives no awards. Thus, each student must receive either <math>1</math>, <math>2</math>, or <math>3</math> awards. If a student receives <math>3</math> awards, then the other two students must each receive <math>1</math> award; if a student receives <math>2</math> awards, then another student must also receive <math>2</math> awards and the remaining student must receive <math>1</math> award. We consider each of these two cases in turn. | |
− | + | If a student receives three awards, there are <math>3</math> ways to choose which student this is, and <math>\binom{5}{3}</math> ways to give that student <math>3</math> out of the <math>5</math> awards. Next, there are <math>2</math> students left and <math>2</math> awards to give out, with each student getting one award. There are clearly just <math>2</math> ways to distribute these two awards out, giving <math>3\cdot\binom{5}{3}\cdot 2=60</math> ways to distribute the awards in this case. | |
− | |||
− | In the other case, | + | In the other case, two students receive <math>2</math> awards and one student recieves <math>1</math> award . We know there are <math>3</math> choices for which student gets <math>1</math> award. There are <math>\binom{3}{1}</math> ways to do this. Then, there are <math>\binom{5}{2}</math> ways to give the first student his two awards, leaving <math>3</math> awards yet to distribute. There are then <math>\binom{3}{2}</math> ways to give the second student his <math>2</math> awards. Finally, there is only <math>1</math> student and <math>1</math> award left, so there is only <math>1</math> way to distribute this award. This results in <math>\binom{5}{2}\cdot\binom{3}{2}\cdot 1\cdot 3 =90</math> ways to distribute the awards in this case. Adding the results of these two cases, we get <math>60+90=\boxed{\textbf{(B) }1}</math>. |
− | ==Solution | + | ==Solution 2 (Casework) == |
− | + | ||
+ | Upon inspection (specified in the above solution), there are two cases of the distribution of awards to the students: one student gets 3 awards and the other each get 1 award or one student gets 1 award and the other two get 2 awards. | ||
+ | |||
+ | |||
+ | In the first case, there are <math>\binom{3}{1} = 3</math> ways to choose the person who gets 3 awards. From here, there are <math>\binom{5}{3} = 10</math> ways to choose the 3 awards from the 5 total awards. Now, one person has <math>2</math> choices for awards and the other has <math>1</math> choice for the award. Thus, the total number of ways to choose awards in this case is <math>3 \cdot 10 \cdot 2 \cdot 1 = 60</math>. | ||
+ | |||
+ | |||
+ | In the other case, there are <math>\binom{3}{1} = 3</math> ways to choose the person who gets 1 award, and <math>5</math> choices for his/her award. Then, one person has <math>\binom{4}{2} = 6</math> ways to have his/her awards and the other person has <math>\dbinom{2}{2} = 1</math> ways to have his/her awards. This gives <math>3 \cdot 5 \cdot 6 \cdot 1 = 90</math> ways for this case. | ||
+ | |||
+ | Adding these craps together, we get <math>60 + 90 = 150</math> ways to distribute the awards, or choice <math>\boxed{\textbf{(B) }150}</math>. | ||
+ | |||
+ | ==Solution 3 (Complementary Counting)== | ||
+ | |||
+ | Without the restriction that each student receives at least one award, we could take each of the awards and choose one of the <math>3</math> students to give it to. This would be <math>3^5</math> ways to distribute the awards in total. Now we need to subtract the cases where at least one student doesn't receive an award. If a student doesn't receive an award, there are <math>3</math> choices for which student that is, so <math>2^5</math> ways of choosing a student to receive each of the awards; in total, <math>3\cdot32=96</math>. | ||
+ | |||
+ | However, if <math>2</math> students both don't receive an award, then this case would be counted twice among the <math>96</math>, so we need to add back in these cases. Said in other words, <math>2</math> students not receiving an award is equivalent to <math>1</math> student receiving <math>5</math> awards, and there are <math>3</math> choices for whom that student would be. To finish, the total number of ways to distribute the awards is <math>243 - 96+3</math>, or <math>\boxed{\textbf{(B) }150}</math>. | ||
+ | |||
+ | ==Video Solution by Math-X (First understand the problem!!!)== | ||
+ | https://youtu.be/UnVo6jZ3Wnk?si=aB0A9Rb1KMIxOcpQ&t=5070 | ||
+ | |||
+ | ~Math-X | ||
+ | |||
+ | ==Video Solution (🚀Under 3 min🚀)== | ||
+ | https://youtu.be/0CWA2KWvAXY | ||
==Video Solution== | ==Video Solution== | ||
+ | https://youtu.be/3mMfy_evxl4 | ||
+ | |||
+ | Please like and subscribe! | ||
+ | |||
+ | == Video Solution by OmegaLearn == | ||
+ | https://youtu.be/dFFjlxm43b0?t=899 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | |||
+ | ==Video Solution by SpreadTheMathLove== | ||
+ | https://www.youtube.com/watch?v=Dg_2wXNY3tE | ||
+ | |||
+ | ==Video Solution by WhyMath== | ||
https://youtu.be/HkFQe7ZxBb4 | https://youtu.be/HkFQe7ZxBb4 | ||
+ | |||
+ | ~WhyMath | ||
+ | |||
+ | ==Video Solutions by The Learning Royal== | ||
+ | https://youtu.be/tDChKU0pVN4 | ||
+ | |||
+ | https://youtu.be/RUg6QfV5yg4 | ||
+ | |||
+ | ==Video Solution by Interstigation== | ||
+ | https://youtu.be/YnwkBZTv5Fw?t=1443 | ||
+ | |||
+ | ~Interstigation | ||
+ | |||
+ | ==Video Solution by STEMbreezy== | ||
+ | https://youtu.be/wq8EUCe5oQU?t=243 | ||
+ | |||
+ | ~STEMbreezy | ||
==See also== | ==See also== | ||
{{AMC8 box|year=2020|num-b=22|num-a=24}} | {{AMC8 box|year=2020|num-b=22|num-a=24}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
+ | |||
+ | [[Category:Introductory Combinatorics Problems]] |
Latest revision as of 13:15, 25 November 2024
Contents
- 1 Problem
- 2 Solution 1 (Constructive Counting)
- 3 Solution 2 (Casework)
- 4 Solution 3 (Complementary Counting)
- 5 Video Solution by Math-X (First understand the problem!!!)
- 6 Video Solution (🚀Under 3 min🚀)
- 7 Video Solution
- 8 Video Solution by OmegaLearn
- 9 Video Solution by SpreadTheMathLove
- 10 Video Solution by WhyMath
- 11 Video Solutions by The Learning Royal
- 12 Video Solution by Interstigation
- 13 Video Solution by STEMbreezy
- 14 See also
Problem
Five different awards are to be given to three students. Each student will receive at least one award. In how many different ways can the awards be distributed?
Solution 1 (Constructive Counting)
Firstly, observe that it is not possible for a single student to receive or awards because this would mean that one of the other students receives no awards. Thus, each student must receive either , , or awards. If a student receives awards, then the other two students must each receive award; if a student receives awards, then another student must also receive awards and the remaining student must receive award. We consider each of these two cases in turn.
If a student receives three awards, there are ways to choose which student this is, and ways to give that student out of the awards. Next, there are students left and awards to give out, with each student getting one award. There are clearly just ways to distribute these two awards out, giving ways to distribute the awards in this case.
In the other case, two students receive awards and one student recieves award . We know there are choices for which student gets award. There are ways to do this. Then, there are ways to give the first student his two awards, leaving awards yet to distribute. There are then ways to give the second student his awards. Finally, there is only student and award left, so there is only way to distribute this award. This results in ways to distribute the awards in this case. Adding the results of these two cases, we get .
Solution 2 (Casework)
Upon inspection (specified in the above solution), there are two cases of the distribution of awards to the students: one student gets 3 awards and the other each get 1 award or one student gets 1 award and the other two get 2 awards.
In the first case, there are ways to choose the person who gets 3 awards. From here, there are ways to choose the 3 awards from the 5 total awards. Now, one person has choices for awards and the other has choice for the award. Thus, the total number of ways to choose awards in this case is .
In the other case, there are ways to choose the person who gets 1 award, and choices for his/her award. Then, one person has ways to have his/her awards and the other person has ways to have his/her awards. This gives ways for this case.
Adding these craps together, we get ways to distribute the awards, or choice .
Solution 3 (Complementary Counting)
Without the restriction that each student receives at least one award, we could take each of the awards and choose one of the students to give it to. This would be ways to distribute the awards in total. Now we need to subtract the cases where at least one student doesn't receive an award. If a student doesn't receive an award, there are choices for which student that is, so ways of choosing a student to receive each of the awards; in total, .
However, if students both don't receive an award, then this case would be counted twice among the , so we need to add back in these cases. Said in other words, students not receiving an award is equivalent to student receiving awards, and there are choices for whom that student would be. To finish, the total number of ways to distribute the awards is , or .
Video Solution by Math-X (First understand the problem!!!)
https://youtu.be/UnVo6jZ3Wnk?si=aB0A9Rb1KMIxOcpQ&t=5070
~Math-X
Video Solution (🚀Under 3 min🚀)
Video Solution
Please like and subscribe!
Video Solution by OmegaLearn
https://youtu.be/dFFjlxm43b0?t=899
~ pi_is_3.14
Video Solution by SpreadTheMathLove
https://www.youtube.com/watch?v=Dg_2wXNY3tE
Video Solution by WhyMath
~WhyMath
Video Solutions by The Learning Royal
Video Solution by Interstigation
https://youtu.be/YnwkBZTv5Fw?t=1443
~Interstigation
Video Solution by STEMbreezy
https://youtu.be/wq8EUCe5oQU?t=243
~STEMbreezy
See also
2020 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.