Why Count Hands as Combinations?
A five-card hand can be dealt in many different orders, but the order in which the cards arrive does not change which hand a player holds. For example, receiving the ace of hearts before the two of clubs gives the same two cards as receiving them in the reverse order. This makes combinations—the counts of selections where order does not matter—the natural tool for calculating hand probabilities.
To make a probability calculation, we need both a clear description of the possible hands and a count of the hands meeting the condition of interest. The key is to translate words such as “exactly three hearts” or “four of a kind” into choices of cards, ranks, and suits.
The Hand Model and Total Number of Hands
Assume a standard deck has 52 distinct cards: 13 ranks in each of four suits, with no jokers. A hand is formed by drawing five different cards from a thoroughly shuffled deck. We are interested in the five cards as an unordered set, not in their order of arrival.
The total number of hands is therefore
The combination formula divides by \(5!\) because the same five selected cards can be arranged in \(5!\) orders. Equivalently, every particular hand corresponds to the same number of possible deal orders, so all hands are equally likely. Thus a hand event has probability
Counting Hands With a Prescribed Suit Composition
A suit-composition description specifies how many cards come from each suit. For example, “exactly three hearts and two spades” assigns all five cards to those two suits. Choose the required number from each suit and multiply the counts: each choice of hearts can be paired with each choice of spades.
Worked Example: Exactly Three Hearts and Two Spades
Find the probability that a randomly dealt five-card hand contains exactly three hearts and two spades.
There are 13 hearts and 13 spades. Choose three of the hearts and two of the spades. Since the hand has five cards in total, and all five positions are accounted for, no other suits can appear.
Divide by the total number of five-card hands:
The probability is about 0.8583%. The multiplication counts every permitted choice of three hearts together with every permitted choice of two spades, and each resulting hand is counted once.
The same method works for other exact suit compositions. For example, to count hands with exactly four hearts and one card that is not a heart, choose four of the 13 hearts and one of the 39 non-hearts. The important point is that “exactly” restricts the choices in each group; the remaining cards must come from outside the specified group.
Counting Hands by Their Ranks
A rank pattern describes how the five cards are distributed among ranks. For instance, a hand with exactly one pair has two cards of one rank and three cards of three other, distinct ranks. The suits matter because they distinguish the four cards of a given rank, but they do not change the rank pattern itself.
Worked Example: Exactly One Pair
Count the five-card hands containing exactly one pair, with the other three cards all having different ranks from each other and from the pair.
First choose the rank of the pair, in 13 ways. Then choose two of its four suits. For the remaining three cards, choose three distinct ranks from the 12 ranks left. Each of those ranks can have any of four suits.
The factors have separate roles: choose the pair’s rank, choose its two suits, choose the three other ranks, and choose one suit for each of those three ranks. Because the three other ranks are selected together by a combination, their order does not create extra hands. The restrictions also ensure there is exactly one pair: the three remaining cards have distinct ranks and none matches the pair.
So about 42.26% of five-card hands have exactly one pair under this definition.
Worked Example: Four of a Kind
A four-of-a-kind hand has all four cards of one rank, plus one card of a different rank. Count these hands and find their probability.
Choose the rank appearing four times. All four cards of that rank must be included, so there is only one way to choose its suits. The fifth card can be any of the 48 cards in the other 12 ranks.
The fifth card cannot have the selected rank because all four cards of that rank are already in the hand. Each four-of-a-kind hand has a unique rank appearing four times, so it is counted exactly once.
This is about 0.02401% of all five-card hands.
Worked Example: A Full House
A full house consists of three cards of one rank and two cards of a different rank. Count the full houses and calculate their probability.
Choose the rank that appears three times, then choose three of its four suits. From the remaining 12 ranks, choose the rank that appears twice, then choose two of its four suits.
The rank choices are made in roles: one rank supplies three cards and the other supplies two. These roles distinguish the choices, so the count does not treat the triple rank and pair rank as interchangeable. Every full house has exactly one rank occurring three times and one occurring twice.
The probability is about 0.1441%.
A Reliable Translation From Words to Choices
For a hand description involving ranks or suits, write down what must be chosen and how many options each choice has. Multiply counts for choices that can be combined freely, and use a combination when selecting a group whose order does not matter. Then check that the restrictions in the description are enforced by the count.
State how many cards must come from each suit or how many cards must share each rank.
Use combinations for unordered selections, such as choosing suits from the four cards of a rank or cards from a suit.
Confirm that the count excludes hands that violate words such as “exactly,” and that one hand cannot be counted in two different ways within the calculation.
Divide the favorable-hand count by \(\binom{52}{5}=2,598,960\), then report the result in context.
Why the Combination Approach Works
The combination method rests on matching the objects counted in the numerator and denominator. The denominator counts unordered five-card hands. Therefore, the favorable count must also count unordered five-card hands—not five-card sequences, individual cards in a sequence, or different descriptions of the same hand.
For example, in the full-house calculation, choosing the triple rank first is not an arbitrary ordering of the five cards. It identifies a feature that every full house has uniquely: the rank occurring three times. Similarly, for exactly one pair, the pair rank is uniquely determined. These features allow the counting procedure to label each qualifying hand once, rather than creating extra counts from different orders of its cards.
The uniformity assumption matters as well. If the deck is not shuffled fairly, or if the cards are drawn under a mechanism that makes some hands more likely than others, then dividing the favorable count by the total count need not give the probability. The ratio is valid here because a fair shuffle makes every five-card subset equally likely.
Common Mistake: Counting Deal Orders
A frequent error is to multiply by the number of ways the five cards can arrive, even though the denominator already counts hands without order. For instance, multiplying the full-house count of 3,744 by \(5!\) and then dividing by 2,598,960 would compare ordered arrangements in the numerator with unordered hands in the denominator. The resulting ratio would be too large by a factor of \(5!\).
Check Your Understanding
For each question, identify the choices needed before calculating. Keep the sample space as unordered five-card hands.
- How many five-card hands contain exactly two diamonds and three clubs? Write the combination expression.
- For a hand containing exactly two aces, why must the other three cards be selected from the 48 non-aces?
- Describe the choices needed to count a hand with three cards of one rank and two cards of another rank.
- Why does a four-of-a-kind count multiply the number of possible four-of-a-kind ranks by 48?
- What would go wrong if a favorable-hand count were multiplied by \(5!\) but the denominator remained \(\binom{52}{5}\)?