<meta http-equiv="refresh" content="1; url=/nojavascript/">

# Combinations

## Using lists and tree diagrams.

%
Progress
Practice Combinations
Progress
%
Define and Apply Combinations

A lottery system consists of 40 balls numbered 1 through 40. In the Big 5, five balls are selected from these 40 balls. You need to match all five numbers to win the cash prize. How many ways can 5 balls from a selection of 40 numbers be drawn?

### Guidance

Combinations of a subset of a larger set of objects refer to the number of ways we can choose items in any order. For comparison, look at the table below to see when order matters and when order doesn’t matter.

Combinations Permutations
• Ways to select the members of a committee from a larger population
• Ways to select specific officers in a club-president, vice president, treasurer, etc.
• Ways to select a set number of pizza toppings from a larger list of choices
• Ways to select and arrange scoops of ice cream on a cone
• Ways to select books from a reading list
• Ways to select and order in which to read books selected from a reading list.

The simplest way to describe the difference between a combination and a permutation is to say that in a combination the order doesn’t matter. The members of a committee could be selected in any order but the officers in a club are assigned a specific position and therefore the order does matter. Be careful of the use of these words in the real world as they are sometimes misused. For example, a locker combination. The ways to select and order the three numbers for a locker combination is not actually a combination, but a permutation since the order does matter.

#### Example A

How many ways can we choose three different flavors of ice cream from a selection of 15 flavors to place in a bowl?

Solution: First, does order matter in the bowl? When we created an ice cream cone with three scoops in an earlier concept the order did matter but here it does not. Let’s work from the example of the ice cream cone. We determined the number of permutations of a subset of three flavors from the total 15 flavors using the formula: $\frac{n!}{(n-r)!}=\frac{15!}{(15-3)!}=\frac{15!}{12!}=\frac{15\times14\times13\times{\color{red}\cancel{12!}}}{{\color{red}\cancel{12!}}}=2730$ . Now that order doesn’t matter, this number includes the $3!$ ways to arrange each combination of 3 flavors. We can divide 2,730 by $3!$ to determine the number of combinations: $\frac{2730}{3\times2\times1}=\frac{2730}{6}=455$ .

The notation and formula for combinations can be written as: $\dbinom{n}{r}={_nC}_r=C^n_r=\frac{n!}{r!(n-r)!}$ , where $n$ represents the number of elements in the set and $r$ represents the number of elements in the subset.

#### Example B

Evaluate the following expressions:

1. $\dbinom{8}{5}$

2. $_8C_0$

3. $_8C_8$

4. $C^{10}_7$

5. Explain why the answers to 2 and 3 are the same.

Solution: All of the notations in problems 1-4 indicate that we should use the formula for a combination. We can use the graphing calculator to evaluate these as well. Problems 2 and 3 are set up in the form of the calculator notation so we will use the calculator to evaluate those two and the formula for the other two.

1. $\dbinom{8}{5}=\frac{8!}{5!(8-5)!}=\frac{8\times7\times{\color{red}6}\times{\color{red}\cancel{5!}}}{{\color{red}\cancel{5!}}\times{\color{red}3}\times{\color{red}2}\times1}=\frac{8\times7}{1}=56$ .

2. Type in 8 on the TI-83 Graphing calculator, then MATH $\rightarrow$ PRB, select 3: $_nC_r$ . Now type in 0 and your screen should read 8 $_nC_r$ 0 before your press ENTER to get the answer 1.

3. Type in 8 on the TI-83 Graphing calculator, then MATH $\rightarrow$ PRB, select 3: $_nC_r$ . Now type in 8 and your screen should read 8 $_nC_r$ 8 before your press ENTER to get the answer 1.

4. $C^{10}_7=\frac{10!}{7!(10-7)!}=\frac{10\times9\times8\times{\color{red}\cancel{7!}}}{{\color{red}\cancel{7!}}\times3!}=\frac{10\times{\color{red}\cancel{3}}\times3\times4\times{\color{red}\cancel{2}}}{{\color{red}\cancel{3}}\times{\color{red}\cancel{2}}}=120$

5. In problem 2, we are looking at the ways to choose 0 items from 8 choices. There is only one way to do this. In problem 3 we are looking at the ways to choose 8 items from 8 choices. Well, the only way to do that is to choose all 8 items. So, there is only 1 way to choose zero items or all the items from a set.

#### Example C

How many ways can a team of five players be selected from a class of 20 students?

Solution: We can express this problem using the notation $\dbinom{20}{5}$ and then use the formula to evaluate.

$\dbinom{20}{5}=\frac{20!}{5!\times15!}=\frac{{\color{red}\cancel{20}}\times19\times{\color{red}\cancel{6}}\times3\times17\times16\times{\color{red}\cancel{15!}}}{{\color{red}\cancel{5\times4}}\times{\color{red}\cancel{3\times2}}\times{\color{red}\cancel{15!}}}=15,504.$

Intro Problem Revisit First, we need to determine whether order matters. The winning numbers 5, 10, 15, 20, and 25 are the same as the winning numbers 25, 5, 20, 10, 15, so order does not matter.

Therefore, we use the combinations formula $\dbinom{n}{r}=\frac{n!}{r!(n-r)!}$

$\frac{40!}{5!(40-5)!}\\\frac{40!}{5!35!}\\\frac {40\cdot39\cdot38\cdot37\cdot36\cdot35!}{5\cdot4\cdot3\cdot2\cdot1\cdot 35!}\\\frac{78,960,960}{120} = 258,008$

Therefore, there are 258,008 ways five winning balls can be drawn from the 40 numbers.

### Guided Practice

1. Evaluate the following using the formula for combinations of the calculator.

a. $\dbinom{7}{5}$

b. $_{20}C_{12}$

c. $C^{15}_7$

2. How many ways can a committee of three students be formed from a club of fifteen members?

3. How many three-topping pizzas can be made if there are 10 topping choices?

1. Using the calculator for each of these we get:

a. $7 \ _nC_r \ 5 = 21$

b. $20 \ _nC_r \ 12 = 125,970$

c. $15 \ _nC_r \ 7 = 6,435$

2. $\dbinom{15}{3}=\frac{15!}{3!(15-3)!}=\frac{{\color{red}\cancel{3}}\times5\times{\color{red}\cancel{2}}\times7\times13\times{\color{red}\cancel{12!}}}{{\color{red}\cancel{3\times2}}\times{\color{red}\cancel{12!}}}=455$ .

3. $C^{10}_3=10 \ _nC_r \ 3 = 120$ .

### Explore More

Evaluate the following combinations with or without a calculator.

1. $_{13}C_{10}$
2. $C^{10}_6$
3. $\dbinom{18}{10}$
4. Explain why $_9C_5={_9C}_4=126$ .
5. Decide whether the following situations are permutations and which are combinations.
1. Ways to arrange students in a row.
2. Ways to select a group of students.
3. Ways to organize books on a shelf.
4. Ways to select books to read from a larger collection.
5. Ways to select three different yogurt flavors from a collection of ten flavors.

In each scenario described below, use either a combination or permutation as appropriate to answer the question.

1. There are seven selections for appetizers on a caterer’s menu. How many ways can you select three of them?
2. You only have time for seven songs on your workout playlist. If you have 10 favorites, how many ways can you select seven of them for the list? Now, how many ways can you select them in a particular order?
3. How many ways can you select two teams of five players each from a group of ten players?
4. At the local frozen yogurt shop a sundae comes with your choice of three toppings. If there are 12 choices for toppings, how many combinations of toppings are possible?
5. How many ways can four people be selected from a group of 30 to serve on a committee? What if each of the four people was selected to fill a specific position on the committee?
6. A soccer team has 20 players, but only 11 play at any one time.
1. How many ways can the coach select a group of eleven players to start (disregard positions)?
2. Now, of the eleven players on the field, one is a goalie, four play defense, three play midfield and three play offense. How many ways are there to assign the eleven players to these positions?
3. Considering your answers to parts a and b, how many ways can the coach select eleven players and assign them positions on the field? Assume all players can play each position.

### Vocabulary Language: English

combination

combination

Combinations are distinct arrangements of a specified number of objects without regard to order of selection from a specified set.
Permutation

Permutation

A permutation is an arrangement of objects where order is important.