Difference between revisions of "2017 AMC 10A Problems/Problem 8"
m (→Solution) |
Mathischess (talk | contribs) |
||
(25 intermediate revisions by 17 users not shown) | |||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | At a gathering of 30 people, there are 20 people who all know each other and 10 people who know no one. People who know each other | + | At a gathering of <math>30</math> people, there are <math>20</math> people who all know each other and <math>10</math> people who know no one. People who know each other hug, and people who do not know each other shake hands. How many handshakes occur within the group? |
<math>\textbf{(A)}\ 240\qquad\textbf{(B)}\ 245\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 480\qquad\textbf{(E)}\ 490</math> | <math>\textbf{(A)}\ 240\qquad\textbf{(B)}\ 245\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 480\qquad\textbf{(E)}\ 490</math> | ||
− | ==Solution== | + | ==Solution 1== |
− | Each one of the ten people has to shake hands with all the <math>20</math> other people they don’t know. So <math>10\cdot20 = 200</math>. From there, we calculate how many handshakes occurred between the people who don’t know each other. This is simply counting how many ways to choose two people to shake hands, or <math>\binom{10}{2} = 45</math>. Thus the answer is <math>200 + 45 = \boxed{\textbf{(B)} 245}</math>. | + | Each one of the ten people has to shake hands with all the <math>20</math> other people they don’t know. So <math>10\cdot20 = 200</math>. From there, we calculate how many handshakes occurred between the people who don’t know each other. This is simply counting how many ways to choose two people to shake hands from <math>10</math>, or <math>\binom{10}{2} = 45</math>. Thus the answer is <math>200 + 45 = \boxed{\textbf{(B)}\ 245}</math>. |
+ | |||
+ | ==Solution 2== | ||
+ | We can also use complementary counting. First of all, <math>\dbinom{30}{2}=435</math> handshakes or hugs occur. Then, if we can find the number of hugs, then we can subtract it from <math>435</math> to find the handshakes. Hugs only happen between the <math>20</math> people who know each other, so there are <math>\dbinom{20}{2}=190</math> hugs. <math>435-190= \boxed{\textbf{(B)}\ 245}</math>. | ||
+ | |||
+ | ==Solution 3== | ||
+ | We can focus on how many handshakes the <math>10</math> people who don't know anybody get. | ||
+ | |||
+ | The first person gets <math>29</math> handshakes with other people not him/herself, the second person gets <math>28</math> handshakes with other people not him/herself and not the first person, ..., and the tenth receives <math>20</math> handshakes with other people not him/herself and not the first, second, ..., ninth person. We can write this as the sum of an arithmetic sequence: | ||
+ | |||
+ | <math>\frac{10(20+29)}{2}\implies 5(49)\implies 245.</math> | ||
+ | Therefore, the answer is <math>\boxed{\textbf{(B)}\ 245}</math> | ||
+ | |||
+ | |||
+ | ==Solution 4== | ||
+ | First, we can find out the number of handshakes that the <math>10</math> people who don't know anybody share with the <math>20</math> other people. This is simply <math>10 \cdot 20 = 200</math>. Next, we need to find out the number of handshakes that are shared within the <math>10</math> people who don't know anybody. Here, we can use the formula <math>\frac{n(n-1)}{2}</math>, where <math>n</math> is the number of people being counted. The reason we divide by <math>2</math> is because <math>n(n-1)</math> counts the case where the <math>1^{st}</math> person shakes hands with the <math>2^{nd}</math> person <math>and</math> the case where the <math>2^{nd}</math> shakes hands with the <math>1^{st}</math> (and these 2 cases are the same). Thus, plugging <math>n=10</math> gives us <math>\frac{10 \cdot 9}{2} \implies 45</math>. Adding up the 2 cases gives us <math>200+45=\boxed{\textbf{(B)}\ 245}</math> | ||
+ | |||
+ | |||
+ | == Video Solution == | ||
+ | https://youtu.be/3MiGotKnC_U?t=1627 | ||
+ | ~ ThePuzzlr | ||
+ | |||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/pxg7CroAt20 | ||
+ | |||
+ | https://youtu.be/cTtqZmui7D4 | ||
+ | |||
+ | ~savannahsolver | ||
+ | |||
+ | == Video Solution == | ||
+ | https://youtu.be/0W3VmFp55cM?t=3464 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2017|ab=A|num-b=7|num-a=9}} | {{AMC10 box|year=2017|ab=A|num-b=7|num-a=9}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
+ | |||
+ | [[Category:Introductory Combinatorics Problems]] |
Latest revision as of 11:47, 19 October 2021
Contents
Problem
At a gathering of people, there are people who all know each other and people who know no one. People who know each other hug, and people who do not know each other shake hands. How many handshakes occur within the group?
Solution 1
Each one of the ten people has to shake hands with all the other people they don’t know. So . From there, we calculate how many handshakes occurred between the people who don’t know each other. This is simply counting how many ways to choose two people to shake hands from , or . Thus the answer is .
Solution 2
We can also use complementary counting. First of all, handshakes or hugs occur. Then, if we can find the number of hugs, then we can subtract it from to find the handshakes. Hugs only happen between the people who know each other, so there are hugs. .
Solution 3
We can focus on how many handshakes the people who don't know anybody get.
The first person gets handshakes with other people not him/herself, the second person gets handshakes with other people not him/herself and not the first person, ..., and the tenth receives handshakes with other people not him/herself and not the first, second, ..., ninth person. We can write this as the sum of an arithmetic sequence:
Therefore, the answer is
Solution 4
First, we can find out the number of handshakes that the people who don't know anybody share with the other people. This is simply . Next, we need to find out the number of handshakes that are shared within the people who don't know anybody. Here, we can use the formula , where is the number of people being counted. The reason we divide by is because counts the case where the person shakes hands with the person the case where the shakes hands with the (and these 2 cases are the same). Thus, plugging gives us . Adding up the 2 cases gives us
Video Solution
https://youtu.be/3MiGotKnC_U?t=1627 ~ ThePuzzlr
Video Solution
~savannahsolver
Video Solution
https://youtu.be/0W3VmFp55cM?t=3464
~ pi_is_3.14
See Also
2017 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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 AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.