Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2018 AIME I Problems/Problem 3"

m (→‎Solution)
(→‎Solution: Created clearer solution to problem.)
Line 3: Line 3:
  
 
==Solution==
 
==Solution==
−
Light work
 
  
 +
Our probability will be <math>\dfrac{\text{number of 'happy' configurations of cards}}{\text{total number of configurations of cards}}.</math>
  
−
You have <math>2+4\cdot 2</math> cases total.
+
First of all, we have <math>10</math> choices for the first card, <math>9</math> choices for the second card, <math>8</math> choices for the third card, <math>7</math> choices for the fourth card, and <math>6</math> choices for the last card. This gives a total of <math>10\cdot 9\cdot 8\cdot 7\cdot 6</math> possible ways for five cards to be chosen.
  
−
The two are all red and all green. Then, you have 4 of one, 1 of other. 3 of one, 2 of other. 2 of one, 3 of other. 1 of one, 4 of other. Then flip the order, so times two.
+
Finding the number of configurations that make Kathy happy is a more difficult task, however, and we will resort to casework to do it.
  
−
Obviously the denominator is <math>10\cdot 9\cdot 8\cdot 7\cdot 6</math>, since we are choosing a card without replacement.
+
First, let's look at the appearances of the "happy configurations" that Kathy likes. Based on the premise of the problem, we can realize that there are ten cases for the appearance of the configurations: \begin{align*}\text{RRRRR}, \\ \text{GGGGG}, \\ \text{RRRRG}, \\ \text{GGGGR}, \\ \text{RRRGG}, \\ \text{GGGRR}, \\ \text{RRGGG}, \\ \text{GGRRR}, \\ \text{RGGGG}, \\ \text{GRRRR}.\end{align*} But this doesn't mean there are 10 "happy configurations" in total-- remember that we've been treating these cards as distinguishable, so we must continue to do so.
  
−
Then, we have for the numerator for the two of all red and green: <cmath>5\cdot 4\cdot 3\cdot 2\cdot 1.</cmath>
+
To lighten the load of 10 cases on the human brain, we can note that in the eyes of what we will soon do, <math>RRRRR</math> and <math>GGGGG</math> are effectively equivalent, and therefore may be treated in the same case. We will have to multiply by 2 at the end, though.
  
−
For the 4 and 1, we have: <cmath>5\cdot 4\cdot 3\cdot 2\cdot 5.</cmath>
+
Similarly, we can equate <math>RRRRG,</math> <math>GGGGR,</math> <math>RGGGG,</math> and <math>GRRRR,</math> as well as <math>RRRGG,</math> <math>GGGRR,</math> <math>RRGGG,</math> and <math>GGRRR,</math> so that we just have three cases. We can approach each of these cases with constructive counting.
  
−
For the 3 and 2, we have: <cmath>5\cdot 4\cdot 3\cdot 5\cdot 4.</cmath>
+
Case 1: <math>RRRRR</math>-type.
  
−
For the 2 and 3, we have: <cmath>5\cdot 4\cdot 5\cdot 4\cdot 3.</cmath>
+
For this case, there are <math>5</math> available choices for the first card, <math>4</math> available choices for the second card, <math>3</math> for the third card, <math>2</math> for the fourth card, and <math>1</math> for the last card. This leads to a total of <math>5\cdot 4\cdot 3\cdot 2\cdot 1=120</math> configurations for this case. There are <math>2</math> cases of this type.
 +
 +
Case 2: <math>RRRRG</math>-type.
  
−
For the 1 and 4, we have: <cmath>5\cdot 5\cdot 4\cdot 3\cdot 2.</cmath>
+
For this case, there are <math>5</math> available choices for the first card, <math>4</math> available choices for the second card, <math>3</math> for the third card, <math>2</math> for the fourth card, and <math>5</math> choices for the last card (not <math>1</math>, because we're doing a new color). This leads to a total of <math>5\cdot 4\cdot 3\cdot 2\cdot 5=600</math> configurations for this case. There are <math>4</math> cases of this type.
  
−
Adding up and remembering to double the last four cases, since they can be reversed, we get, after simplifying: <math>\dfrac{31}{126}.</math>
+
Case 3: <math>RRRGG</math>-type.
  
−
To finish, we add <math>31+126=\boxed{157}</math>.
+
For this case, there are <math>5</math> available choices for the first card, <math>4</math> available choices for the second card, <math>3</math> for the third card, <math>5</math> for the fourth card, and <math>4</math> choices for the last card. This leads to a total of <math>5\cdot 4\cdot 3\cdot 5\cdot 4=1200</math> configurations for this case. There are <math>4</math> cases of this type.
 +
 
 +
Adding the cases up gives <math>2\cdot 120+4\cdot 600+4\cdot 1200=7440</math> "happy" configurations in total.
 +
 
 +
This means that the probability that Kathy is happy will be <math>\dfrac{7440}{10\cdot 9\cdot 8\cdot 7\cdot 6},</math> which simplifies to <math>\dfrac{31}{126}.</math>
 +
 
 +
So the answer is <math>31+126=\boxed{157.}</math>
  
 
==See Also==
 
==See Also==
 
{{AIME box|year=2018|n=I|num-b=2|num-a=4}}
 
{{AIME box|year=2018|n=I|num-b=2|num-a=4}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 00:46, 8 March 2018

Question

Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders $RRGGG, GGGGR,$ or $RRRRR$ will make Kathy happy, but $RRRGR$ will not. The probability that Kathy will be happy is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

Our probability will be $\dfrac{\text{number of 'happy' configurations of cards}}{\text{total number of configurations of cards}}.$

First of all, we have $10$ choices for the first card, $9$ choices for the second card, $8$ choices for the third card, $7$ choices for the fourth card, and $6$ choices for the last card. This gives a total of $10\cdot 9\cdot 8\cdot 7\cdot 6$ possible ways for five cards to be chosen.

Finding the number of configurations that make Kathy happy is a more difficult task, however, and we will resort to casework to do it.

First, let's look at the appearances of the "happy configurations" that Kathy likes. Based on the premise of the problem, we can realize that there are ten cases for the appearance of the configurations: \begin{align*}\text{RRRRR}, \\ \text{GGGGG}, \\ \text{RRRRG}, \\ \text{GGGGR}, \\ \text{RRRGG}, \\ \text{GGGRR}, \\ \text{RRGGG}, \\ \text{GGRRR}, \\ \text{RGGGG}, \\ \text{GRRRR}.\end{align*} But this doesn't mean there are 10 "happy configurations" in total-- remember that we've been treating these cards as distinguishable, so we must continue to do so.

To lighten the load of 10 cases on the human brain, we can note that in the eyes of what we will soon do, $RRRRR$ and $GGGGG$ are effectively equivalent, and therefore may be treated in the same case. We will have to multiply by 2 at the end, though.

Similarly, we can equate $RRRRG,$ $GGGGR,$ $RGGGG,$ and $GRRRR,$ as well as $RRRGG,$ $GGGRR,$ $RRGGG,$ and $GGRRR,$ so that we just have three cases. We can approach each of these cases with constructive counting.

Case 1: $RRRRR$-type.

For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $2$ for the fourth card, and $1$ for the last card. This leads to a total of $5\cdot 4\cdot 3\cdot 2\cdot 1=120$ configurations for this case. There are $2$ cases of this type.

Case 2: $RRRRG$-type.

For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $2$ for the fourth card, and $5$ choices for the last card (not $1$, because we're doing a new color). This leads to a total of $5\cdot 4\cdot 3\cdot 2\cdot 5=600$ configurations for this case. There are $4$ cases of this type.

Case 3: $RRRGG$-type.

For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $5$ for the fourth card, and $4$ choices for the last card. This leads to a total of $5\cdot 4\cdot 3\cdot 5\cdot 4=1200$ configurations for this case. There are $4$ cases of this type.

Adding the cases up gives $2\cdot 120+4\cdot 600+4\cdot 1200=7440$ "happy" configurations in total.

This means that the probability that Kathy is happy will be $\dfrac{7440}{10\cdot 9\cdot 8\cdot 7\cdot 6},$ which simplifies to $\dfrac{31}{126}.$

So the answer is $31+126=\boxed{157.}$

See Also

2018 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2018_AIME_I_Problems/Problem_3&oldid=92990"