2.4 Combinations – NOTE – Double check the answers

Learning Objectives

After completing this section, you should be able to:

  1. Distinguish between permutation and combination uses.
  2. Compute combinations.
  3. Apply combinations to solve applications.
A person is shown holding 5 playing cards. The hand of another player is shown near a pile of plastic chips.
Figure 7.8 Combinations help us count things like the number of possible card hands, when the order in which the cards were drawn doesn’t matter. (credit: “IMG_3177” by Zanaca/Flickr, CC BY 2.0)

In Permutations, we studied permutations, which we use to count the number of ways to generate an ordered list of a given length from a group of objects. An important property of permutations is that the order of the list matters: The results of a race and the selection of club officers are examples of lists where the order is important. In other situations, the order is not important. For example, in most card games where a player receives a hand of cards, the order in which the cards are received is irrelevant; in fact, players often rearrange the cards in a way that helps them keep the cards organized.

Combinations: When Order Doesn’t Matter

In situations in which the order of a list of objects doesn’t matter, the lists are no longer permutations. Instead, we call them combinations.

 

Example 1

For each of the following situations, decide whether the chosen subset is a permutation or a combination.

  1. A social club selects 3 members to form a committee. Each of the members has an equal share of responsibility.
  2. You are prompted to reset your email password; you select a password consisting of 10 characters without repeats.
  3. At a dog show, the judge must choose first-, second-, and third-place finishers from a group of 16 dogs.
  4. At a restaurant, the special of the day comes with the customer’s choice of 3 sides taken from a list of 6 possibilities.
Show/Hide Solution
  1. Since there is no distinction among the responsibilities of the 3 committee members, the order isn’t important. So, this is a combination.
  2. The order of the characters in a password matter, so this is a permutation.
  3. The order of finish matters in a dog show, so this is a permutation.
  4. A plate with mashed potatoes, peas, and broccoli is functionally the same as a plate with peas, broccoli, and mashed potatoes, so this is a combination.

 

Try It 1

Decide whether the following represent permutations or combinations:

  1. On Halloween, you give each kid who comes to your door 3 pieces of candy, taken randomly from a candy dish.
  2. Your class is going on a field trip, but there are too many people for one vehicle. Your instructor chooses half the class to take the first vehicle.
Show/Hide Solution
  1. The order isn’t important. So, this is a combination.
  2. The order matters, so it is permutation.

Counting Combinations

Permutations and combinations are certainly related, because they both involve choosing a subset of a large group. Let’s explore that connection, so that we can figure out how to use what we know about permutations to help us count combinations. We’ll take a basic example. How many ways can we select 3 letters from the group A, B, C, D, and E? If order matters, that number is _{5}P_{3}=60. That’s small enough that we can list them all out in the table below.

ABC ABD ABE ACB ACD ACE
ADB ADC ADE AEB AEC AED
BAC BAD BAE BCA BCD BCE
BDA BDC BDE BEA BEC BED
CAB CAD CAE CBA CBD CBE
CDA CDB CDE CEA CEB CED
DCA DAC DAE DBA DBC DBE
DCA DCB DCE DEA DEB DEC
EAB EAC EAD EBA EBC EBD
ECA ECB ECD EDA EDB EDC

Now, let’s look back at that list and color-code it so that groupings of the same 3 letters get the same color, as shown in Figure 7.9:

Color-coded table of possible combinations showing 10 groups of 6 permutations each
Figure 7.9

After color-coding, we see that the 60 cells can be seen as 10 groups (colors) of 6. That’s no coincidence! We’ve already seen how to compute the number of permutations using the formula. To compute the number of combinations, let’s count them another way using the Multiplication Rule for Counting. We’ll do this in two steps:

Step 1: Choose 3 letters (paying no attention to order).

Step 2: Put those letters in order.

The number of ways to choose 3 letters from this group of 5 (A, B, C, D, E) is the number of combinations we’re looking for; let’s call that number _{5}C_{3} (read “the number of combinations of 5 objects taken 3 at a time”). We can see from our chart that this is ten (the number of colors used). We can generalize our findings this way: remember that the number of permutations of n things taken r at a time is _{n}P_{r}=\frac{n!}{\left(n-r\right)!}. That number is also equal to _{n}C_{r}\times r!, and so it must be the case that \frac{n!}{\left(n-r\right)!}=_{n}C_{r}\times r!. Dividing both sides of that equation by r! gives us the formula below.

_{n}C_{r}=\frac{n!}{r!\left(n-r\right)!}

 

Example 2

Compute the following:

  1. _{8}C_{3}
  2. _{12}C_{5}
  3. _{15}C_{9}
Show/Hide Solution
  1. _{8}C_{3}=\frac{8!}{3!\left(8-3\right)!}=\frac{8\times7\times6\times5!}{3\times2\times1\times5!}=8\times7=56
  2. _{12}C_{5}=\frac{12!}{5!\left(12-5\right)!}=\frac{12\times11\times10\times9\times8\times7!}{5\times4\times3\times2\times1\times7!}=11\times9\times8=792
  3. _{15}C_{9}=\frac{15!}{9!\left(15-9\right)!}=\frac{15\times14\times13\times12\times11\times10\times9!}{9!\times6\times5\times4\times3\times2\times1}=\frac{14\times13\times11\times10}{4}=5,005

 

Try It 2

Compute the following:

  1. _{6}C_{4}
  2. _{10}C_{8}
  3. _{14}C_{5}
Show/Hide Solution
  1. 15
  2. 45
  3. 2002

 

Example 3

  1. In the card game Texas Hold’em (a variation of poker), players are dealt 2 cards from a standard deck to form their hands. How many different hands are possible?
  2. The board game Clue uses a deck of 21 cards. If 3 people are playing, each person gets 6 cards for their hand. How many different 6-card Clue hands are possible?
  3. Palmetto Cash 5 is a game offered by the South Carolina Education Lottery. Players choose 5 numbers from the whole numbers between 1 and 38 (inclusive); the player wins the jackpot of $100,000 if the randomizer selects those numbers in any order. How many different sets of winning numbers are possible?
Show/Hide Solution
  1. A standard deck has 52 cards, and a hand has 2 cards. Since the order doesn’t matter: _{52}C_{2}=\frac{52!}{2!\left(52-2\right)!}=\frac{52\times51\times50!}{2\times1\times50!}=\frac{52\times51}{2}=1,326
  2. Again, the order doesn’t matter: _{21}C_{6}=\frac{21!}{6!\left(21-6\right)!}=\frac{21\times20\times19\times18\times17\times16\times15!}{6\times5\times4\times3\times2\times1\times15!}=\frac{21\times19\times17\times16}{2}=54,264
  3. There are 38 numbers to choose from, and we must pick 5: _{38}C_{5}=\frac{38!}{5!\left(38-5\right)!}=\frac{38\times37\times36\times35\times34\times33!}{5\times4\times3\times2\times1\times33!}=501,492

 

Try It 3

  1. At a charity event with 58 people in attendance, 3 raffle winners are chosen. All receive the same prize, so order doesn’t matter. How many different groups of 3 winners can be chosen?
  2. A sorority with 42 members needs to choose a committee with 4 members, each with equal responsibility. How many committees are possible?
Show/Hide Solution
  1. 30856
  2. 111930

Checkpoint

The notation and nomenclature used for the number of combinations is not standard across all sources. You’ll sometimes see \binom{n}{r} instead of _{n}C_{r}. Sometimes you’ll hear that expression read as “n choose r” as shorthand for “the number of combinations of n objects taken r at a time.”

People in Mathematics

Early Eastern Mathematicians

Although combinations weren’t really studied in Europe until around the 13th century, mathematicians of the Middle and Far East had already been working on them for hundreds of years. The Indian mathematician known as Pingala had described them by the second century BCE; Varāhamihira (fl. sixth century) and Halayudha (fl. 10th century) extended Pingala’s work. In the ninth century, a Jain mathematician named Mahāvīra gave the formula for combinations that we use today.

In 10th-century Baghdad, a mathematician named Al-Karaji also knew formulas for combinations; though his work is now lost, it was known to (and repeated by) Persian mathematician Omar Khayyam, whose work survives. Khayyam is probably best remembered as a poet, with his Rubaiyat being his most famous work.

Meanwhile, in 11th-century China, Jia Xian also was working with combinations, as was his 13th-century successor Yang Hui.

It is not known whether the discoveries of any of these men were known in the other regions, or if the Indians, Persians, and Chinese all came to their discoveries independently. We do know that mathematical knowledge and sometimes texts did get passed along trade routes, so it can’t be ruled out.

 

Example 4

The student government at a university consists of 10 seniors, 8 juniors, 6 sophomores, and 4 first-years.

  1. How many ways are there to choose a committee of 8 people from this group?
  2. How many ways are to choose a committee of 8 people if the committee must consist of 2 people from each class?
Show/Hide Solution
  1. There are 28 people to choose from, and we need 8. So, the number of possible committees is _{28}C_{8}=3,108,105.
  2. Break the selection down into a 4-step process:
    Class Number of Ways to Choose
    senior _{10}C_{2}=45
    junior _{8}C_{2}=28
    sophomore _{6}C_{2}=15
    first-year _{4}C_{2}=6

    The Multiplication Rule for Counting tells us to multiply: 45\times28\times15\times6=113,400 possible committees.

 

Try It 4

How many ways are there to choose a hand of 6 cards from a standard deck with the constraint that 3 are ♠, 2 are ♡, and 1 is ♣?

Show/Hide Solution

_{12}C_{3} \times _{12}C_{2} \times _{12}C_{1} = 174240

Check Your Understanding

  1. Suppose you want to count the number of ways that you can arrange the apps on the home screen on your phone. Should you use permutations or combinations?
  2. Your little brother is packing up for a family vacation, but there’s only room for 3 of his toys. If you want to know how many possible groups of toys he can bring, should you use permutations or combinations?
  3. Compute _{12}C_{10}.
  4. Compute _{16}C_{3}.
  5. You’re planning a road trip with some friends. Though you have 6 friends you’d consider bringing along, you only have room for 3 other people in the car. How many different possibilities are there for your road trip squad?
  6. You’re packing for a trip, for which you need 3 shirts and 3 skirts. If you have 8 shirts and 5 skirts that would work for the trip, how many different ways are there to pack for the trip?

#TODO: PUT THE SHOW/ HIDE HERE

1. permutations (order matters).

2. combinations (order does not matter).

3. 66

4. 560

5. 20

6. 560

 

2.4 Exercise Set

For the following exercises, decide whether the situation describes a permutation or a combination.

  1. You’re packing for vacation, and you need to pick 5 shirts.
  2. You and your friends are about to play a game, and you need to decide who will have the first turn, second turn, and so on.
  3. You are watching your favorite reality show, and you want to know how many possibilities there are for the order of finish for the top three.
  4. You are going to be working in groups of 4 with your classmates, and you want to know how many possibilities there are for the composition of your group.

For the following exercises, express your answers as whole numbers.

  1. _{5}C_{3}
  2. _{8}C_{2}
  3. _{8}C_{6}
  4. _{12}C_{3}
  5. _{12}C_{5}
  6. _{14}C_{3}
  7. _{14}C_{10}
  8. _{15}C_{5}
  9. _{15}C_{13}
  10. _{18}C_{3}
  11. _{18}C_{6}
  12. In most variations of the card game poker, a hand consists of 5 cards, where the order doesn’t matter. How many different poker hands are there?
  13. A professor starts each class by choosing 3 students to present solutions to homework problems to the class. If there are 41 students in the class, in how many different ways can the professor make those selections?
  14. An election for at-large members of a school board has 7 candidates; 3 will be elected. How many different ways can those 3 seats be filled?
  15. There are 20 contestants on a reality TV show; at the end of the first episode, 10 are eliminated. How many different groups of eliminated contestants are possible?
  16. At a horse race, bettors can place a bet called an exacta box. For this bet, the player chooses 2 horses; if those horses finish first and second (in either order), the player wins. In a race with 12 horses in the field, how many possible exactas box bets are there?

The following exercises are about the card game euchre, which uses a partial standard deck of cards: it only has the cards with ranks 9, 10, J, Q, K, and A (for a total of 24 cards).

  1. A euchre hand contains 5 cards. How many ways are there to receive a 5-card hand (where the order in which the cards are received doesn’t matter)?
  2. After all 4 players get their hands, the remaining 4 cards are placed face down in the center of the table. How many different groups of 4 cards are there from this deck?
  3. Euchre is played with partners. How many ways are there for 2 partners to receive 5-card hands? Hint: After the first person gets their cards, there are 52-5=47 cards left for the second person.
  4. _{20}C_{4}.

You and 5 of your friends are at an amusement park, and are about to ride a roller coaster. The cars have room for 6 people arranged in 3 rows of 2, so you and your friends will perfectly fill one car.

  1. How many ways are there to choose the 2 people in the front row?
  2. Assuming the front row has been selected, how many ways are there to choose the 2 people in the middle row?
  3. Assuming the first 2 rows have been selected, how many ways are there to choose the 2 people in the back row?
  4. How many different committees of 4 are possible, assuming all of the duties are shared equally?

The University Combinatorics Club has 18 members. Four of them will be selected to form a committee.

  1. Instead of sharing responsibility equally, one person will be chosen to be the committee chair. How many different committees are possible? Count these by selecting a chair first, then selecting the remaining 3 members of the committee from the remaining club members and use the Multiplication Rule for Counting. Show your work.
  2. Let’s count the number of committees with chairs a different way: First, choose 4 people for the committee (as in the first question), then choose 1 of the 4 to be chair. Show your work. Do you get the same number?

Powerball® is a multistate lottery game, which costs $2 to play. Players fill out a ticket by choosing 5 numbers between 1 and 69 (these are the white balls) and then a single number between 1 and 26 (this is the Powerball)

  1. How many different ways are there to choose the white balls? Players who match these 5 numbers exactly (but not the Powerball) win $1 million.
  2. How many ways are there to choose the Powerball? Players who correctly pick the Powerball win $4.
  3. How many ways are there to play the game altogether? Players who match all 5 white balls and the Powerball win (or share) the grand prize.
  4. You are in charge of programming for a music festival. The festival has a main stage, a secondary stage, and several smaller stages. There are 40 bands confirmed for the festival. Five of those will play the main stage, and 8 will play the secondary stage. How many ways are there for you to allocate bands to these 2 stages?

Answers

#TODO fix the numbering

      1. combination (order doesn’t matter).
      2. permutation (order matters).
      3. permutation (order matters).
      4. combination.
      5. 10
      6. 28
      7. 28
      8. 220
      9. 792
      10. 364
      11. 1001
      12. 3003
      13. 105
      14. 816
      15. 18564
      16. 4845
      17. 2598960
      18. 10660
      19. 35
      20. 184756
      21. 66
      22. 42504
      23. 10626
      24. 494236512
      25. 15
      26. 6
      27. 1
      28. 90
      29. 3060
      30. 12240
      31. 11238513
      32. 292201338
      33. 15,486,757,846,560

7. combination (order doesn’t matter).

8. permutation (order matters).

9. permutation (order matters).

10. combination.

11. 10

12. 28

13. 28

14. 220

15. 792

16. 364

17. 1001

18. 3003

19. 105

20. 816

21. 18564

22. 4845

22. 2598960

23. 10660

24. 35

25. 184756

26. 66

27. 42504

28. 10626

29. 494236512

30. 15

31. 6

32. 1

33. 90

34. 3060

35. 12240

36. 11238513

37. 292201338

38. 15,486,757,846,560

Attribution

Text Attribution

This text was adapted from Chapter 7.3 of Contemporary Mathematics, textbooks originally published by OpenStax.

License

Foundations of Mathematics 12 Copyright © by imazur. All Rights Reserved.

Share This Book