There are 13 ordinals (Ace through King) in a standard deck of cards. #C_(n,k)=((n),(k))=(n!)/((k!)(n-k)!)# with #n='population', k='picks'#įirst let's calculate the denominator (picking 5 random cards from a pack of 52 cards):
These will be combination problems (we don't care about the order of the cards dealt): When working with the probability of poker hands, we need to know the number of ways a hand can be dealt (this is the denominator) and the numerator is the number of ways to have a certain hand.
