Amy and Blake are each dealt two cards from a standard deck . Given no additional information, the probability that Blake is dealt a pair is 5 1 3 = 1 7 1 since his second card needs to match his first card.
Given that Amy is dealt a pair, what is the probability that Blake has a pair?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
As there are ( 2 4 ) = 6 pairs within each of the 1 3 denominations, there are a total of 1 3 ∗ 6 = 7 8 different pairs that can be drawn. As Amy has a pair of some denomination, there are just 2 cards, and hence just one pair, left within this denomination, and so there are still 1 2 ∗ 6 + 1 = 7 3 pairs left to be drawn out of the 5 0 remaining cards. Thus the probability that Blake draws a pair given that Amy has drawn a pair is
( 2 5 0 ) 7 3 = 2 5 ∗ 4 9 7 3 ≈ 1 6 . 7 8 1 > 1 7 1 .
So, somewhat counterintuitively, Blake's chance of having drawn a pair is greater than Amy's, given that Amy did in fact draw a pair.
Great! Without doing the explicit probability calculation, you can determine it's greater than 1/17 by comparing this to the case where Amy does not have a pair. Do you see how?
Log in to reply
I point this out because you wouldn't have a calculator in a card game, so simpler math can be very valuable.
If Amy has not been dealt a pair, then the two cards she does draw eliminates 3 + 3 = 6 of the possible pairs, so Blake's chances of having a pair then becomes
( 2 5 0 ) 7 2 = 2 5 ∗ 4 9 7 2 ≈ 1 7 . 0 1 4 1 < 1 7 1 .
This results in an even narrower difference that the previous calculation, (albeit in the reverse direction), so I'm not clear yet how it offers any intuitive help to consider this case first. I'll give it some more thought, though.
Log in to reply
You're pretty much there. When Amy has a pair, 5 pairs are removed. When she doesn't, 6 pairs are removed. A weighted average across these two cases must equal the overall probability of Blake having a pair, which we know is 1 7 1 . Therefore...
Log in to reply
@Eli Ross – Great observation about the number of positive outcomes. It may initially be counter intuitive (and I admit I answered this problem wrongly) that drawing a pair makes it more likely that the next 2 cards forms a pair. However, it is because the first 2 cards are a pair, that allows for more pair possibilities in the next cards.
To stretch this example to the extreme (though it's not a perfect extension), if we are given that the first 50 cards always form pairs, then we're very certain that the last 2 cards form a pair.
Log in to reply
@Calvin Lin – If Clarissa joins in the game and we know that Amy and Blake have drawn pairs, then my calculation for the probability that Clarissa also draws a pair is 3 4 3 1 2 1 0 ≈ 1 6 . 3 4 1 . It would be quite complicated to develop a general formula, but as you note, we know the endpoint is that P(26th player has pair | previous 25 players have pairs) = 1.
Log in to reply
@Brian Charlesworth – The question isn't perfectly stated because the answer would depend on which pairs Amy and Blake drew. If the pairs had the same numerical value, then the probability would be higher. Using Eli's observation, if the pairs have the same numerical value then we're removing 6 pairs. If the pairs have different numerical values, then we're removing 10 pairs.
Log in to reply
@Calvin Lin – I factored in to my calculation that we don't know which pairs Amy and Blake drew, just that they drew pairs. So the calculation is
7 3 1 × ( 2 4 8 ) 7 2 + 7 3 7 2 × ( 2 4 8 ) 6 8 .
Once we know Amy's pair there are 7 3 pairs that Blake can obtain; in one of these cases Blake's pair has the same denomination as Amy's, and in the other 7 2 it is a different denomination.
Edit: I wasn't the one who downvoted your reply; I don't know why anyone would have done that, @Calvin Lin .
@Eli Ross – ... Therefore the probabilities of the two scenarios must straddle 1/17. Since I don't trust my "intuition" anymore, which would indicate (correctly, this time) that if we don't know the result of Amy's draw then Blake's draw essentially becomes an independent event, I still had to convince myself using the calculations above that in this scenario P(Blake pair) = P(Blake pair and Amy pair) + P(Blake pair and no Amy pair) = 1/17.
@Eli Ross – Nice, I didn't think of doing it like that.
I worked it out by considering a different scenario:
If you draw two cards from a standard deck, what is the probability of getting a pair given that the first card is not a red ace?
The answer to that is still the original 1 / 1 7 .
Now split it into two sub-scenarios:
S1. Neither card is a red ace
S2. The second card is a red ace and the first card is not
The crux of the matter is to see that P(pair:S2) < 1 / 1 7 (why?), from which it follows that P(pair:S1) > 1 / 1 7 as desired.
Amy has already been dealt a pair. The probability that the first card dealt to Blake shall be of the same type is 2 5 1 . Only 1 out of 49 left cards could form a pair for Blake : 2 5 1 ∗ 4 9 1
The probability that the first card dealt to Blake shall NOT be of the same type is 2 5 2 4 . Only 3 out of 49 cards could form a pair for Blake: 2 5 2 4 ∗ 4 9 3
And all in all: 24/25 3/49+1/25 1/49=73/(25*49) So all in all we have: 2 5 1 ∗ 4 9 1 + 2 5 2 4 ∗ 4 9 3 = 2 5 ∗ 4 9 7 3 = ≈ 0 . 0 5 9 5 9 > ≈ 0 . 0 5 8 8 = 1 7 1
So the answer is: G r e a t e r t h a n 1 / 1 7 .
What is the probability to have a pair?
In total there are ( 2 5 2 ) ways to get 2 cards.
There are 4 cards of each rank and 13 different suits, so there are ( 2 4 ) ∗ 1 3 ways to get a pair.
P ( P a i r B l a k e ) = P ( P a i r A m y ) = ( 2 5 2 ) ( 2 4 ) ∗ 1 3 = 1 7 1 ≈ 0 . 0 5 8 8
Given that Amy is dealt a pair, what is the probability that Blake has a pair?
If we know that Amy has a pair there are ( 2 5 0 ) ways to get 2 cards with ( 2 4 ) ∗ 1 2 ways to get a pair of a different rank and ( 2 2 ) ways to get a pair of the same rank.
P ( P a i r B l a k e ∣ P a i r A m y ) = ( 2 5 0 ) ( 2 4 ) ∗ 1 2 + ( 2 2 ) = 1 2 2 5 7 1 ≈ 0 . 0 5 9 6
Solution:
1 7 1 ≈ 0 . 0 5 8 8 < 1 2 2 5 7 1 ≈ 0 . 0 5 9 6
Consider the events: A:<<Amy was dealt a pair>> and B:<<Blake was dealt a pair>>
Given that Amy is dealt a pair, the probability that Blake has a pair=p(B|A)= p ( A ) p ( A a n d B ) = p ( A ) p ( A ∣ B ) . p ( B ) = p ( A ) p ( A ∣ B ) x 1 7 1 , with p(A|B)>p(A), so probability required > 1 7 1 .
Remove 2 more aces, and you've removed all aces. It's as if you started with only 12 different values, instead of 13. The fewer values, the more likely to get a pair.
Problem Loading...
Note Loading...
Set Loading...
Just for the sake of keeping track let's assume Amy has already drawn a pair of 4s. So we have 50 cards left: having 2 4s and rest 12x4 cards.
Now its Blake's turn & we have 2 cases,
1. Blake draws a 4 first, then again a 4
The probability of this is 5 0 2 × 4 9 1
2. Blake draws anything except a 4 & then again the same number to form a pair
The probability of this is 5 0 4 8 × 4 9 3
So the total probability is 4 9 × 5 0 1 4 4 + 2 = 1 6 . 7 8 1