Poker Hands A poker hand consists of 5 cards from a standard deck of 52. Find the number of different poker hands of the specified type. two pairs (two of one denomination, two of another denomination, and one of a third)
Poker Hands A poker hand consists of 5 cards from a standard deck of 52. Find the number of different poker hands of the specified type. two pairs (two of one denomination, two of another denomination, and one of a third)
Poker Hands A poker hand consists of 5 cards from a standard deck of 52. Find the number of different poker hands of the specified type. two pairs (two of one denomination, two of another denomination, and one of a third)
Transcribed Image Text:Tutorial Exercise
Poker Hands A poker hand consists of 5 cards from a standard deck of 52. Find the number of different
poker hands of the specified type.
two pairs (two of one denomination, two of another denomination, and one of a third)
For those unfamiliar with playing cards, here is a short description. A standard deck consists of 52 playing
cards. Each card is in one of 13 denominations: ace (A), 2, 3, 4, 5, 6, 7, 8, 9, 10, jack (J), queen (Q), and
king (K), and in one of four suits: hearts (V), diamonds (), clubs (), and spades (). Thus, for
instance, the jack of spades, J, refers to the denomination of jack in the suit of spades. The entire deck of
cards is as shown below.
AV 20 3V 4V 5V 60 7♥ 8♥ 9♥ 10♥ JV Q♥ _K♥
6+ 7+ 8+ 9+ 10+ J+ Q• K•
A* 24 34 44 54 64 74 84 94 104 JA Q4 KA
JA Q4 KA
A
2+ 3+ 4+ 5+
A4
24 34
44 54
74 84
94
104
Step 1
Recall that the entire deck of cards is as follows.
10 JV Q♥ K♥
J• Q• K•
A* 24 34 44 54 64 74 84 94 104 JA Q4 KA
104 JA Q4 KA
AV 2v 3V 4♥ 5V 6♥ 7♥ 8♥ 9♥
A
2. 3+
4+ 5+
6. 7+ 8• 94 10+
A+
24 34
44
54 64
74 84 94
The goal is to determine the number of different five-card poker hands that consists of two pairs. In other
words, we need to find the number of ways to pick 2 cards of one denomination, 2 cards of another
denomination, and a final card that belongs to neither of the first two denominations.
Our decision algorithm is a sequence of four steps.
Step 1: Select 2 denominations for the pairs.
Step 2: Select 2 cards from one selected denomination.
Step 3: Select 2 cards from the other selected denomination.
Step 4: Select 1 card that belongs to neither of the previously selected denominations.
We begin with Step 1. There are 13 possible denominations and we will pick 2 of them. Because the order that
we make this selection does not matter, we will use combinations to find the number of ways to pick 2
denominations out of 13.
Therefore, in each case we will be using combinations to count the number of ways to take n items taken r at
a time, which is calculated using the following formula.
n!
C(n, r) =
rl(n - r)!
Here we haven = 13 and r = 2. Substitute these values into the formula and simplify.
nl
C(n, r) =
rl(n - r)!
13 V
13 !
C(13, 2) =
2!(13 - 2)!
78
78
In other words, there are 78 v
78 possible ways to pick 2 of the 13 denominations for the pairs.
Step 2
We now move on to Steps 2 and 3.
Step 1: Select 2 denominations for the pairs (78 possible ways).
Step 2: Select 2 cards from one selected denomination.
Step 3: Select 2 cards from the other selected denomination.
Step 4: Select 1 card that belongs to neither of the previously selected denominations.
| cards of each denomination.
ways to pick 2 cards from one of the selected
The two denominations have now been selected. There are
Therefore, there are C
denominations.
Similarly, there are also
ways to pick 2 cards from the other selected denomination.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, statistics and related others by exploring similar questions and additional content below.