Combinations in probability theory and other areas of mathematics refer to a sequence of outcomes where the order does not matter. For example, when you’re ordering a pizza, it doesn’t matter whether you order it with ham, mushrooms, and olives or olives, mushrooms, and ham. You’re getting the same pizza!

When calculating probabilities, you often need to calculate the number of possible combinations.

In this post, I’ll show you how to calculate the number of combinations with and without repetition and teach you the standard notation for combinations. I’ll also work through example problems so you can see the process in action. You’ll learn how to calculate the probability of winning the jackpot in the Powerball lottery!

## Comparing Combinations to Permutations

In probability theory, combinations and permutations are distinct concepts.

**Combinations**: The order of outcomes does not matter.**Permutations**: The order of outcomes does matter.

Let’s use three letters to illustrate both concepts: C, J, M.

Suppose we’re using these letters to signify people on a team, such as Carl, Jack, and Mary. As a combination of team members, C, J, M is equivalent to M, J, C. Either way, you have the same people on the team. Consequently, the order of the letters does not matter because you have the same team. These three letters form one combination.

However, if you’re using these letters for a short passcode, then the specific arrangement of letters matters. If the correct code is CJM, then MJC will not work. CJM is one possible permutation of these three letters. Using just these three letters, you can create 3^{3} = 27 possible permutations.

When you have at least two permutations, the number of permutations is greater than the number of combinations. Learn more about the differences between permutation vs combination.

In this post, I’m working only with combinations. To learn about permutations, read my post about Using Permutations to Calculate Probabilities.

## Combinations with Repetition

When the outcomes in a combination can repeat, you have repetition. With our pizza example, if you can choose a topping multiple times, such as double or triple ham, we have combinations with repetition. It’s also known as combinations with replacement.

To calculate the number of combinations with repetitions, use the following equation.

Where:

- n = the number of options.
- r = the size of each combination.

The exclamation mark (!) represents a factorial. In general, n! equals the product of all numbers up to n. For example, 3! = 3 * 2 * 1 = 6. The exception is 0! = 1, which simplifies equations.

Let’s work through an example of the number of combinations with repetition. Imagine we own a pizza restaurant and we have six toppings from which customers can choose. We have a special offer for pizzas with three toppings. How many potential combinations fall under our special? Because we’re allowing repetition, customers can get triple bacon pizzas if they want to risk a hospital visit!

To solve these types of problems, you need to determine the n and r for the equation. The number of possible outcomes equals the number of choices for toppings, which is six. The size of each combination is three because that’s what we’re allowing for our special. So, n = 6 and r = 3.

Using the standard notation for combinations of nCr, we’d write this as _{6}C_{3}.

Inputting those numbers into the equation:

_{6}C_{3 }= 56.

There are 56 combinations of three toppings when you have six topping choices and allow repeats.

## Combinations without Repetition

When the outcomes cannot repeat, you are working with combinations without repetition. These calculations use the following equation for permutations without repetition as a starting point.

In permutations, the order does matter. However, the order does *not* matter for combinations without repetition, which produces a lower number than the permutations. In the following equation, the first portion captures the number of permutations where the order matters. The second portion reduces that number because the order does not matter for combinations. The product of the two produces the final equation.

In the simplified form:

Where:

- n = the number of possible outcomes at the start.
- r = the size of each combination.

For example, imagine a process that draws five people to be on a team out of a pool of 30. The order in which the process draws team members does not matter. Suppose a team comprises A, B, C, D, E. That is equivalent to a team where the same people were drawn but in a different order. Additionally, because the process can select a person only once, there is no repetition.

In this example, n = 30 because we’re drawing from a pool of 30 candidates. R = 5 because the team can have only five members. Inputting those numbers into the equation:

Using the standard notation: _{30}C_{5 }= 142,506.

There are 142,506 combinations of five person teams when you draw from a pool of 30 individuals.

You can also use Pascal’s triangle to find the number of combinations without repetition.

The formula for combinations without repetition is a crucial part of the binomial distribution. To learn how, read my post, The Binomial Distribution.

## Using Combinations to Calculate Probabilities

In the previous examples, we calculated the number of combinations for different scenarios. However, we didn’t use them to calculate probabilities. In this context, a probability is the number of combinations considered to be an event divided by the total number of combinations.

When you’re given a probability problem using combinations, you need to determine several things to solve the problem.

- Set up a ratio to determine the probability.
- Determine whether the numerator and denominator require combinations, permutations, or a mix? For this post, we’ll stick with combinations.
- Are these combinations with or without repetitions?
- Both types of combinations require you to identify the n and r to enter into the equations.

Let’s work through an example probability calculation using combinations!

**Problem**: What is the probability of winning the basic game and the jackpot in the Powerball lottery?

**Related post**: Probability Fundamentals

### Probability of winning the basic game in the Powerball lottery

The classic example of probability using combinations without repetition is a lottery where machines randomly choose balls with numbers from a pool of balls. The order of the numbers does not matter. You just need to match the numbers. Because each ball can be drawn only once, it is without repetition.

For this example, we’ll look at the Powerball lottery, which is a lottery offered in 45 states in the United States. In the basic game, there are 69 white balls in a machine that randomly selects five of the balls. The following ratio defines the probability of winning:

The numerator is simple. There is one winning combination without repetition. You could use the equation to calculate _{5}C_{5}, which equals the number of combinations where you have five numbers in the winning combination, and there are five winning numbers from which to choose. But it makes sense intuitively. There’s just one winning combination.

For the denominator, you need to calculate _{69}C_{5}, which equals the number of combinations when you draw five numbers from a total of 69 numbers. Let’s enter these numbers into the equation:

_{69}C_{5} = 11,238,513

When you draw five numbers out of 69 without repetition, there are 11,238,513 combinations.

Using the standard notation, the probability of winning the basic game in Powerball is the following:

You have a 1 in 11,238,513 chance of winning the basic game in the Powerball lottery.

### The probability of winning the jackpot in Powerball

To win the jackpot in the Powerball, you need to win the basic game *and* match one red Powerball number. The Powerballs are 26 red balls in a separate machine that randomly draws one of them. Let’s calculate the probability of winning the jackpot!

For the numerator, there is again one winning combination for the Powerball. For the denominator, we need to calculate the number of combinations for _{26}C_{1} = 26. That’s not surprising. There are 26 combinations when you choose one number from 26 options! Thus, the chance of matching the Powerball is the following:

To include this in the probability calculations for the basic game, we need to use the multiplication rule for independent events and multiply the two ratios.

Using the standard notation for combinations, the probability of winning the jackpot in Powerball is the following:

You have a 1 in 292,201,338 chance of winning the jackpot in the Powerball lottery.

George says

Minor detail in light of your wonderful work!

Jim Frost says

Thanks, George!

George says

Hi Jim,

But shouldn’t the permutation with replacement be n^r (i.e., 3^3=27)? How do you get 9??

Best,

George

Jim Frost says

Hi George,

Thanks, that’s a great catch! You’re absolutely right. I’ve changed the text. Apparently, my brain slipped a gear! 🙂

Stalin Amirtharaj K says

We can create only 6 permutations out of three letters(CJM in this example) right? whereas it is mentioned as 9 permutations in this article

Jim Frost says

Hi, it’s 9 with repeats, and 6 without.