Learn & Understand

Combinations vs Permutations: Why a Poker Hand Is C(52,5)

The companion calculator computes the total number of possible poker hands, the famous 2,598,960 for five cards from a 52-card deck. That figure is the denominator behind every published poker probability, and it comes from one of the most useful ideas in mathematics: the combination. Understanding why a poker hand is counted with combinations rather than permutations, and how the formula works, unlocks a tool that reaches far beyond cards.

Order Does Not Matter for a Hand

The central question in counting hands is whether the order of the cards matters, and for a poker hand it does not. If you are dealt the ace, king, queen, jack, and ten of spades, you hold a royal flush regardless of which card arrived first. The hand is defined by its set of cards, not the sequence of the deal. This single fact determines which counting tool to use.

A poker hand is a selection, a set of five cards, so it is counted with combinations. If order did matter, you would use permutations and get a much larger number.

Why Combinations Are Smaller

The reason combinations give a smaller count than permutations is that many different ordered sequences correspond to the same unordered set. Five specific cards can be arranged in many different deal orders, but they all make the identical hand. To count sets rather than sequences, you count the sequences and then divide out the orderings you overcounted. Specifically, any group of five items can be arranged in 5 factorial (120) different orders, so if you counted ordered deals, you would have counted each hand 120 times.

The nCr Formula

This gives the combination formula, written C(n, k) or n-choose-k, the number of ways to choose k items from n when order does not matter. It takes the number of ordered ways to pick k from n and divides by k factorial to remove the duplicate orderings.

For a poker hand, C(52, 5) chooses 5 cards from 52 without regard to order, and it evaluates to 2,598,960. The division by 5 factorial is exactly the step that collapses all the different deal orders of the same five cards into a single hand. That is why the count is what it is, not larger.

Why This Number Is Everywhere

Every standard poker probability is a smaller combination count divided by this total. The number of flushes, full houses, or straights is itself counted with combinations, and dividing by 2,598,960 turns each into a probability. So this one figure underpins the entire table of poker odds. But its reach is far wider: the same n-choose-k reasoning counts lottery odds, the ways to form a committee, the coefficients in the binomial theorem, and countless probability problems. The combination is one of the most broadly useful tools in all of mathematics, and poker is simply a vivid place to meet it.

A Connection to Pascal's Triangle

The combination numbers have a beautiful structure: arrange them in a triangle where each entry is the sum of the two above it, and you get Pascal's triangle, whose rows are exactly the n-choose-k values. This is not a coincidence but a reflection of how combinations build on one another, and it is one of many places the same counting idea surfaces in a different guise.

Using the Total Well

Take the calculator's total number of hands as the exact count of possible selections, computed with combinations because a poker hand is a set, not a sequence. Understand that the formula divides out the redundant orderings, which is why the number is far smaller than if order mattered. And carry the tool beyond poker: n-choose-k counts selections wherever order is irrelevant, from card hands to lotteries to committees, making it one of the most useful ideas you can learn.