Difference between revisions of "2012 AMC 12B Problems/Problem 16"
Flamedragon (talk | contribs) (→Solution Three: A Different Way of Looking at Solution One) |
(Latexed sol. 3) |
||
Line 29: | Line 29: | ||
== Solution 3: A Different Way of Looking at Solution 1== | == Solution 3: A Different Way of Looking at Solution 1== | ||
− | Let AB, BJ, and AJ 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 A, B, J, and N 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 1 AB, BJ, and AJ, they must be 3 songs out of the 4 that Amy, Beth, and Jo listened to. The fourth song can be of any type N, A, B, J, AB, BJ, and AJ (there is no ABJ because no song is liked by all three, as stated in the problem.) Therefore, we must find the number of ways to rearrange AB, BJ, AJ, and a song from the set {N, A, B, J, AB, BJ, AJ}. | + | Let <math>AB, BJ</math>, and <math>AJ</math> 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 <math>A, B, J,</math> and <math>N</math> 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 <math>1\: AB, BJ</math>, and <math>AJ</math>, they must be <math>3</math> songs out of the <math>4</math> that Amy, Beth, and Jo listened to. The fourth song can be of any type <math>N, A, B, J, AB, BJ</math>, and <math>AJ</math> (there is no <math>ABJ</math> because no song is liked by all three, as stated in the problem.) Therefore, we must find the number of ways to rearrange <math>AB, BJ, AJ</math>, and a song from the set <math>\{N, A, B, J, AB, BJ, AJ\}</math>. |
− | Case 1: Fourth song = N, A, B, J | + | Case 1: Fourth song = <math>N, A, B, J </math> |
Note that in Case 1, all four of the choices for the fourth song are different from the first three songs. | 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 = (4!) rearrangements for each choice * 4 choices = 96. | + | Number of ways to rearrange = <math>(4!)</math> rearrangements for each choice <math>*\: 4</math> choices = <math>96</math>. |
− | Case 2: Fourth song = AB, BJ, AJ | + | Case 2: Fourth song = <math>AB, BJ, AJ</math> |
− | Note that in Case 2, all three of the choices for the fourth song repeat somewhere in the first three songs. | + | Note that in Case <math>2</math>, all three of the choices for the fourth song repeat somewhere in the first three songs. |
− | Number of ways to rearrange = (4!/2!) rearrangements for each choice * 3 choices = 36. | + | Number of ways to rearrange = <math>(4!/2!)</math> rearrangements for each choice <math>*\: 3</math> choices = <math>36</math>. |
− | 96 + 36 = | + | <math>96 + 36 = \boxed{\textbf{(B)} \: 132}</math>. |
== See Also == | == See Also == |
Revision as of 17:25, 9 February 2014
- 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?
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 song, so the answer is .
Solution 2
We begin by noticing that there are four ways to assign a song liked by both Amy and Beth, three ways to assign a song liked by both Amy and Jo (because Jo may not like the song liked by both Amy and Beth), and two ways to assign a song liked by both Beth and Jo (because both Beth and Jo may not like the song liked by the previous pairs. Additionally, there are ways to assign song preferences for the fourth song. Multiplying, we obtain an answer of . However, in doing so, we have committed an egregious error. We have in fact over counted the cases in which the fourth song is liked by two girls but not the third.
We proceed again by ignoring the cases in which the fourth song is liked by two girls but not the third. There are of these cases. However, in doing so, we have committed yet another egregious error. The cases in which the fourth song is liked by two girls but not the third have not been accounted for!
In performing our past two calculations, we have, however, established that the answer has a lower bound of and an upper bound of . As is the only answer within these bounds, we conclude that the answer must be .
Solution 3: A Different Way of Looking at Solution 1
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 = .
.
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.