Calculating 2 Pair Probability in a Modified Deck of Cards

  • Thread starter Thread starter walk_w/o_aim
  • Start date Start date
  • Tags Tags
    hand Probabilities
walk_w/o_aim
Messages
27
Reaction score
0

Homework Statement



A standard deck of playing cards has all the red (heart, diamond) cards removed. Find the probability of obtaining a 2 pair when 5 cards are dealt.

Homework Equations



The combination formula:

<br /> \dbinom{n}{k} = \dfrac{n!}{k!(n-k)!}<br />

The Attempt at a Solution



The way I understood it was that there were 13 pairs of cards. In order to get a two pair, I need to choose 2 pairs from the 13, and choose 2 cards from each pair. For the fifth card, I just pick any pair from the remaining 11, and choose 1 of the pair. Then, that number of combinations I divide by the total number of ways I can pick 5 cards from 26. This is what I came up with:

<br /> P(2 pair) = \dfrac{\dbinom{13}{1} \dbinom{12}{1} \dbinom{11}{1} (\dbinom{2}{2})^2 \dbinom{2}{1}}{\dbinom{26}{5}}<br />

However, the actual answer is slightly different:

<br /> P(2 pair) = \dfrac{\dbinom{13}{2} \dbinom{11}{1} (\dbinom{2}{2})^2 \dbinom{2}{1}}{\dbinom{26}{5}}<br />

I can see why the actual answer makes sense, but I can't see why the answer I came up with does not. To me, they seem to be the exact same expression. Am I misunderstanding the meaning behind a combination here? Am I misunderstanding the meaning behind multiplying the number of combinations?

Some light shed on this problem would be much appreciated. Thank you.
 
Physics news on Phys.org
Your method counts "A","K" and "K","A" separately. But that's not right; these are combinations, so they are the same. Hence what you want to do is choose two different pairs out of 13, so (13 2). Note that you could just divide your answer by 2: (13 1)(12 1)/2 = (13 2).
 
Thanks, hgfalling. I got it now. Picking one at a time then multiplying the total number of combinations with each other makes the order matter -- I should have known that from the largest number n bits can represent or something similar. Thank you.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top