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. Find the probability that Kathy will be happy.
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 all of them, since they can be reversed and the 5's can be red or green, we get, after simplifying: ![]()
Thus the answer is
.