Difference between revisions of "2012 AMC 12B Problems/Problem 16"
Mathpro12345 (talk | contribs) (→Solution 4: Another Different Way of Looking at Solution 1 & 3) |
m (→Solution 4) |
||
(3 intermediate revisions by 2 users not shown) | |||
Line 17: | Line 17: | ||
'''Case 2''': To find the number of ways for <math>(a,b,c) = (2,1,1)</math>, observe there are <math>\binom{4}{2} = 6</math> choices of songs for the first pair of girls. There remain 2 choices of songs for the next pair (who only like one song). The last song is given to the last pair of girls. But observe that we let any three pairs of the girls like two songs, so we multiply by 3. In this case there are <math>6\cdot2\cdot3=36</math> ways for the girls to like the songs. | '''Case 2''': To find the number of ways for <math>(a,b,c) = (2,1,1)</math>, observe there are <math>\binom{4}{2} = 6</math> choices of songs for the first pair of girls. There remain 2 choices of songs for the next pair (who only like one song). The last song is given to the last pair of girls. But observe that we let any three pairs of the girls like two songs, so we multiply by 3. In this case there are <math>6\cdot2\cdot3=36</math> ways for the girls to like the songs. | ||
− | That gives a total of <math>96 + 36 = | + | That gives a total of <math>96 + 36 = 132</math> ways for the girls to like the songs, so the answer is <math>\boxed{(\textrm{\textbf{B}})}</math>. |
=== Solution 2=== | === Solution 2=== | ||
Line 60: | Line 60: | ||
~ Nafer | ~ Nafer | ||
+ | |||
+ | ===Solution 4=== | ||
+ | This is a bipartite graph problem, with the girls as left vertices and songs as right vertices. An edge connecting left vertex and right vertex means that a girl like a song. | ||
+ | |||
+ | Condition 1: "No song is liked by all three", means that the degree of right vertices is at most 2. | ||
+ | |||
+ | Condition 2: "for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third", means that for any pair of left vertices, there is at least a right vertex connecting to them. | ||
+ | |||
+ | To meet condition 2, there are at least 3 right vertices with 2 edges connecting to left vertices. There are 2 cases: | ||
+ | |||
+ | Case 1: there are only 3 such right vertices. There are <math>\binom{4}{3}</math> such vertices, with <math>3!</math> ways of connections to the left vertices, total arrangements are <math>\binom{4}{3}\cdot3! = 24</math>. The fourth right vertex either has no edge to the 3 left vertices, or 1 edge to 1 of the 3 left vertices. So there are <math>24\cdot(1+3) = 96</math> ways. | ||
+ | |||
+ | Case 2: there are 4 such right vertices, 2 of them have edges to the same pair of left vertices. There are <math>\binom{4}{2}</math> such vertices, with <math>3!</math> ways of connections. So there are <math>\binom{4}{2}\cdot3! = 36</math> ways. | ||
+ | |||
+ | Total ways are <math>96+36=132</math>. | ||
+ | |||
+ | Another way is to overcount then subtract overlap ways. Similar to previous case 1, the fourth right vertex could have all possible connection to the left vertices except connecting to all 3, so it is <math>2^3-1=7</math> ways, so the total ways are <math>\binom{4}{3}\cdot3!\cdot7 = 24\cdot7 = 168</math>. But this overcounts the case 2 with 36 ways. So total ways are <math>168-36=132</math>. | ||
+ | |||
+ | -junche | ||
==Video Solutions:== | ==Video Solutions:== |
Latest revision as of 03:21, 24 September 2021
- The following problem is from both the 2012 AMC 12B #16 and 2012 AMC 10B #24, so both problems redirect to this page.
Contents
Problem
Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
Solutions
Solution 1
Let the ordered triple denote that songs are liked by Amy and Beth, songs by Beth and Jo, and songs by Jo and Amy. We claim that the only possible triples are .
To show this, observe these are all valid conditions. Second, note that none of can be bigger than 3. Suppose otherwise, that . Without loss of generality, say that Amy and Beth like songs 1, 2, and 3. Then because there is at least one song liked by each pair of girls, we require either or to be at least 1. In fact, we require either or to equal 1, otherwise there will be a song liked by all three. Suppose . Then we must have since no song is liked by all three girls, a contradiction.
Case 1: How many ways are there for to equal ? There are 4 choices for which song is liked by Amy and Beth, 3 choices for which song is liked by Beth and Jo, and 2 choices for which song is liked by Jo and Amy. The fourth song can be liked by only one of the girls, or none of the girls, for a total of 4 choices. So in ways.
Case 2: To find the number of ways for , observe there are choices of songs for the first pair of girls. There remain 2 choices of songs for the next pair (who only like one song). The last song is given to the last pair of girls. But observe that we let any three pairs of the girls like two songs, so we multiply by 3. In this case there are ways for the girls to like the songs.
That gives a total of ways for the girls to like the songs, so the answer is .
Solution 2
Let , and denote a song that is liked by Amy and Beth (but not Jo), Beth and Jo (but not Amy), and Amy and Jo (but not Beth), respectively. Similarly, let and denote a song that is liked by only Amy, only Beth, only Jo, and none of them, respectively. Since we know that there is at least , and , they must be songs out of the that Amy, Beth, and Jo listened to. The fourth song can be of any type , and (there is no because no song is liked by all three, as stated in the problem.) Therefore, we must find the number of ways to rearrange , and a song from the set .
Case 1: Fourth song =
Note that in Case 1, all four of the choices for the fourth song are different from the first three songs.
Number of ways to rearrange = rearrangements for each choice choices = .
Case 2: Fourth song =
Note that in Case , all three of the choices for the fourth song repeat somewhere in the first three songs.
Number of ways to rearrange = rearrangements for each choice choices = .
.
Solution 3
There are ways to choose the three songs that are liked by the three pairs of girls.
There are ways to determine how the three songs are liked, or which song is liked by which pair of girls.
In total, there are possibilities for the first songs.
There are cases for the 4th song, call it song D.
Case : D is disliked by all girls there is only possibility.
Case : D is liked by exactly girl there are possibility.
Case : D is liked by exactly girls there are pairs of girls to choose from. However, there's overlap when the other song liked by the same pair of girl is counted as the 4th song at some point, in which case D would be counted as one of the first songs liked by the same girls.
Counting the overlaps, there are ways to choose the pair with overlaps and ways to choose what the other pairs like independently. In total, there are overlapped possibilities.
Finally, there are ways for the songs to be likely by the girls.
~ Nafer
Solution 4
This is a bipartite graph problem, with the girls as left vertices and songs as right vertices. An edge connecting left vertex and right vertex means that a girl like a song.
Condition 1: "No song is liked by all three", means that the degree of right vertices is at most 2.
Condition 2: "for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third", means that for any pair of left vertices, there is at least a right vertex connecting to them.
To meet condition 2, there are at least 3 right vertices with 2 edges connecting to left vertices. There are 2 cases:
Case 1: there are only 3 such right vertices. There are such vertices, with ways of connections to the left vertices, total arrangements are . The fourth right vertex either has no edge to the 3 left vertices, or 1 edge to 1 of the 3 left vertices. So there are ways.
Case 2: there are 4 such right vertices, 2 of them have edges to the same pair of left vertices. There are such vertices, with ways of connections. So there are ways.
Total ways are .
Another way is to overcount then subtract overlap ways. Similar to previous case 1, the fourth right vertex could have all possible connection to the left vertices except connecting to all 3, so it is ways, so the total ways are . But this overcounts the case 2 with 36 ways. So total ways are .
-junche
Video Solutions:
Video Solution by Richard Rusczyk
https://artofproblemsolving.com/videos/amc/2012amc10b/272
~dolphin7
See Also
2012 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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 |
2012 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.