2018 AIME I Problems/Problem 3

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 \( \dfrac{m}{n}\), where \(m\) and \(n\) are relatively prime positive integers. Find \(m + n\).

Solution

Light work

You have cases total.

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.

Obviously the denominator is , since we are choosing a card without replacement.

Then, we have for the numerator for the two of all red and green:

For the 4 and 1, we have:

For the 3 and 2, we have:

For the 2 and 3, we have:

For the 1 and 4, we have:

Adding up and remembering to double the last four cases, since they can be reversed, we get, after simplifying: \dfrac{31}{126}.$$ (Error compiling LaTeX. Unknown error_msg)

To finish, we add .