Chapter 7

Logic, Sets,
and
Counting

Section 4:
Permutations and
Combinations

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 1
 Factorials
 Two additional counting devices (permutations vs
Combinations) that are useful in more complicated
counting problems.
o They are two different ways to take a set of items or
options and create subsets. For example, if you have ten
people, how many subsets of three can you make?
 Permutations: order of outcomes matters.
 Combinations: order does not matter.
 Both devices use factorials
o The factors in the following product continue to decrease
by 1 until a factor of 1 is reached: 5⋅4⋅3⋅2⋅1=5!
 Products of this type are so common in counting problems
that it is convenient to express them using a concise
notation called factorial notation.
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 2
 Factorial
Definition Factorial

 For a natural number n,

o n! = n(n – 1)(n – 2)⋅ ⋯⋅ 2⋅ 1 (4! = 4⋅ 3⋅ 2⋅ 1 = 24)

o 0! = 1

o n! = n(n – 1)!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 3
 Example 1 Computing Factorials
 Compute each of the following:
o (A) 5! = 5⋅4⋅3⋅2⋅1 = 120
o (B) 7! 7 6 !
 7
6! 6!
o (C) 8! 8 7 6 5 !
 8 7 6 336
5! 5!

o (D) 52! 52 51 50 49 48 47!

 2,598,960
5!47! 5 4 3 2 1 47!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 4
 Permutations
 A particular (horizontal or vertical) arrangement of a set
of paintings on a wall is called a permutation of the set of
paintings.

 Definition Permutation of a Set of Objects

o A permutation of a set of distinct objects is an

arrangement of the objects in a specific order without
repetition.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 5
 Permutations
 Suppose that 4 pictures are to be arranged from left to right
on one wall of an art gallery.
o How many permutations (ordered arrangements) are
possible?

 There are 4 ways to select the first picture.

o After the first picture is selected, there are 3 ways to select
the second picture.
o After the first 2 pictures are selected, there are 2 ways to
select the third picture.
o After the first 3 pictures are selected, there is only 1 way to
choose the fourth picture.
 The multiplication principle gives
4⋅3⋅2⋅1 = 4! = 24 ways to arrange the pictures.
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 6
 Theorem 1 Number of Permutations
of n Objects

 The number of permutations of n distinct objects without

repetition, denoted by nPn is

n Pn = n(n – 1)⋅ ⋯⋅ 2⋅ 1 = n!

 Example: The number of permutations of 7 objects is

7 P7 = 7⋅ 6⋅ 5⋅ 4⋅ 3⋅ 2⋅ 1 = 7! = 5,040

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 7
 Permutations
 Suppose the previously mentioned art gallery decides to
use only 2 of the 4 paintings and arrange them on the wall
from left to right.
 In this case we have a particular arrangement of 2
paintings out of 4.
 This is called a permutation of 4 objects taken 2 at a time.

 There are 4 choices for the painting on the left.

 Thereafter, there are 3 choices for the painting on the right.
 The multiplication principle gives the total as
4⋅ 3 = 12.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 8
Definition Permutations of n Objects
Taken r at a Time

 A permutation of a set of n distinct objects taken r at a

time without repetition is an arrangement of r of the n
objects in a specific order.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 9
Theorem 2 Number of Permutations of
n Objects Taken r at a Time
 The number of permutations of n distinct objects taken r at
a time without repetition, denoted by is
n!
n Pr n ( n  1)( n  2)  ( n  r  1)  0 r n
n  r !
The symbols n Pr , Prn , and P( n, r ) are used interchangeably.

 Example: The number of permutations of 7 objects taken 4

at a time is
7P4 = 7⋅ 6⋅ 5⋅ 4 = 840.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 10
 Example 2 Permutations
 Given the set {A, B, C}, how many permutations are
possible for this set of 3 objects taken 2 at a time? Answer
the question
o (A) Using a tree diagram
o (B) Using the multiplication principle
o (C) Using the two formulas for nPr

 Solution (A) Tree Diagram

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 11
 Example 2 Permutations
 Given the set {A, B, C}, how many permutations are
possible for this set of 3 objects taken 2 at a time? Answer
the question
o (A) Using a tree diagram
o (B) Using the multiplication principle
o (C) Using the two formulas for nPr
 Solution (B) Multiplication principle:
O1: Fill the first position N1: 3 ways
O2: Fill the first position N2: 2 ways
There are
3⋅2 = 6 permutations of 3 objects taken 2 at a time

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 12
 Example 2 Permutations
 Given the set {A, B, C}, how many permutations are
possible for this set of 3 objects taken 2 at a time? Answer
the question
o (A) Using a tree diagram
o (B) Using the multiplication principle
o (C) Using the two formulas for nPr

 Solution (C) Using the two formulas

3! 3 2 1
P 3 2 6
3 2 or 3 P2   6
(3  2)! 1

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 13
 Example 3 Permutations
 Find the number of permutations of 13 objects taken 8 at a
time. Compute the final answer using a calculator.

 Solution We use the factorial formula n!

n Pr 
n  r !
13! 13!
13 P8   51,891,840
13  8! 5!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 14
 Combinations
 Suppose that an art museum owns 8 paintings from an
artist and another museum wants to borrow 3 of the
paintings for a special show.
o In selecting the three paintings that will be loaned, the
order would not matter, only the choice of the group
of 3 pictures.
o The selection of paintings is choosing a 3-element
subset from the group of 8 paintings.
 This example illustrates what is called a combination of 8
objects taken 3 at a time.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 15
 Definition Combinations
Combination of n Objects Taken r at a Time

 A combination of a set of n distinct objects taken r at a

time without repetition is an r-element subset of the set of
n objects.
 The arrangement of the elements in the subset does not
matter.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 16
 Return to Example 2 Permutations
 In this example we found the number of permutations of 3
letters selected from the set {A, B, C}, taken 2 at a time
using the tree diagram

 Each of the 6 permutations {(A, B), (A, C), (B, C), (B, A),
(C, A), and (C, B)} are distinguished by the letters selected
and the order of the selection.
 When the order does not matter, only the letters selected
matter and the combinations are {A, B}, {A, C}, and {B, C}.
 Hence, there are 3 combinations of 3 objects taken 2 at a
time.
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 17
 Combinations vs Permutations
 Because permutations are distinguished by order and
object selection and combinations are distinguished only
by object selection, we expect fewer combinations than
permutations.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 18
 Theorem 3
Theorem 3 Number of Combinations of n Objects Taken r
at a Time
 The number of combinations of n distinct objects taken r
at a time without repetition is given by

 n  n Pr n!
n Cr     0 r n
 r  r ! r !n  r !

 n n
The symbols, n Cr ,   , Cr , Cn ,r , and C ( n, r ) are used interchangeably.
r

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 19
 Selecting 3 Paintings Out of 8
 In the earlier example, 3 paintings were to be selected out
of 8 for loan.
 Because this selection does not distinguish because of
order, this is a combination.
8! 8! 8 7 6 5!
8 C3  = = 56
3!8  3! 3!5! 3 2 1 5!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 20
 Example 4 Permutations and
Combinations
 From a committee of 10 people,
o (A) In how many ways can we choose a chairperson, a
vice-chairperson, and a secretary, assuming that one
person cannot hold more than one position?
o (B) In how many ways can we choose a subcommittee of 3
people?

 Solution (A) In this selection, the order of the choices

distinguish one group from the other.
o These selections are permutations.
10! 10!
10 P3   720 ways
10  3! 7!
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 21
 Example 4 Permutations and
Combinations
 From a committee of 10 people,
o (A) In how many ways can we choose a chairperson, a
vice-chairperson, and a secretary, assuming that one
person cannot hold more than one position?
o (B) In how many ways can we choose a subcommittee of 3
people?

 Solution (B) In this selection, the order of the choices does

not distinguish one group from the other.
o These selections are combinations.
10! 10!
10 C3   120 ways
3!10  3! 3!7!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 22
 Example 5 Combinations

 Question: Find the number of combinations of 13 objects

taken 8 at a time. Compute the answer using a calculator.
o Compare with the number of permutations of 13
objects taken 8 at a time.

Solution
13! 13!
13 C8   1, 287
8!13  8 ! 8!5!
13! 13!
13 P8   51,891,840
13  8! 5!
 The number of permutations is substantially larger.
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 23
 52-Card Standard Deck
Hearts Clubs

Spades Diamonds

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 24
 Application Standard 52-Card Deck
of Playing Cards
 A standard deck of 52 cards has four 13-card suits:
diamonds, hearts, clubs, and spades.
o Modern decks also usually include two Jokers.
 The diamonds and hearts are red, and the clubs and spades
are black.
 Each 13-card suit contains number cards from 2 to 10, a
Jack, a Queen, a King, and an Ace.
 The number or letter on the card indicates its rank.
 There are 13 ranks and 4 cards of each rank.
 The Jack, Queen, and King are called face cards. (The ace
is not a face card.)
 A hand of cards is an unordered subset of the deck.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 25
 Example 6 Counting Techniques
 Question: How many 5-card hands have 3 aces and 2
kings?
 Solution: This solution involves both the multiplication
principle and combinations.
 Consider the selection as involving 2 operations:
o O1: Choose 3 aces out of 4 possible N1: 4C3
ways
o O2: Choose 2 kings out of 4 possible N2: 4C2
ways 4! 4!
 4 6 24
3!4principle,
Using the multiplication  3! 2!4we !
 2have
C3⋅ 4C2 =
 How 4many 5-card hands have 3 hearts and 2 spades?
13C3⋅ 13C2 = 22,308
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 26
 Example 7 Counting Techniques
 Serial numbers for a product are made using 2 letters
followed by 3 numbers. If the letters are taken from the
first 8 letters of the alphabet with no repeats and the
numbers are taken from the 10 digits (0–9) with no
repeats, how many serial numbers are possible?
 Solution The solution involves both the multiplication
principle and permutations.
o Selecting a serial number has two operations, each a
permutation (choose the letters then choose the numbers):
O1: Choose 2 letters out of 8 available N1: 8P2
O2: Choose 3 numbers out of 10 available N2: 10P3

 The multiplication principle gives 8P2⋅ 10P3 = 40,320.

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 27
 Example 8 Counting Techniques
 A company has 7 senior and 5 junior officers. It wants to
form an ad hoc legislative committee. In how many ways can
a 4-officer committee be formed so that it is composed of
o (A) Any 4 officers?
 Solution There are 12 officers in the
company.
 Choosing 4 officers for the committee
is an unordered selection of 4 from the
12 without repetition.
 Each such committee is a combination.

12! 12!
12 C4   495
4!12  4 ! 4!8!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 28
 Example 8 Counting Techniques
 A company has 7 senior and 5 junior officers. It wants to
form an ad hoc legislative committee. In how many ways can
a 4-officer committee be formed so that it is composed of
o (B) 4 senior officers?
 Solution There are 7 senior officers in
the company.
 Choosing 4 officers for the committee
is an unordered selection of 4 from the
7 senior officers without repetition.
 Each such committee is a combination.

7! 7!
7 C4   35
4!7  4 ! 4!3!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 29
 Example 8 Counting Techniques
 A company has 7 senior and 5 junior officers. It wants to
form an ad hoc legislative committee. In how many ways can
a 4-officer committee be formed so that it is composed of
o (C) 3 senior officers and 1 junior officer?

 Solution The 3 senior officers can be selected in 7C3 ways.

The 1 junior officer can be selected in 5C1 ways.

7! 5! 7! 5! 7!5!
7 C3 5 C1      175
3!7  3! 1!5  1! 3!4! 1!4! 3!4!1!4!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 30
 Example 8 Counting Techniques
 A company has 7 senior and 5 junior officers. It wants to
form an ad hoc legislative committee. In how many ways can
a 4-officer committee be formed so that it is composed of
o (D) 2 senior officers and 2 junior officer?

 Solution The 2 senior officers can be selected in 7C2 ways.

The 2 junior officer can be selected in 5C2 ways.

7! 5! 7! 5! 7!5!
7 C2 5 C2      210
2!7  2 ! 2!5  2 ! 2!5! 2!3! 2!5!2!3!

Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 31
 Example 8 Counting Techniques
 A company has 7 senior and 5 junior officers. It wants to
form an ad hoc legislative committee. In how many ways can
a 4-officer committee be formed so that it is composed of
o (E) At least 2 senior officers?
 Solution A committee having at least 2 senior officers can
have exactly 2 senior officers (with 2 junior officers),
exactly 3 senior officers (with 1 junior officer), or exactly
4 senior officers (with 0 junior officers).
 These three committees are disjoint.
 The number of committees with at least 2 senior officers
is the sum of each of these types (exactly 2, exactly 3,
exactly 4),
 7C2⋅ 5C2+ 7C3⋅ 5C1 + 7C4⋅ 5C0 = 210 + 175 + 35 = 420
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 32
 Example 9 Counting Techniques
 From a standard 52-card deck, how many 3-card hands
have all cards from the same suit?

 Solution There are 13 cards in each suit, so the number of

3-card hands having all hearts, for example, is
13! 13!
13 C3   286
3!13  3! 3!10!

 Similarly, there are 286 3-card hands having all diamonds,

286 having all clubs, and 286 having all spades.
 Hence, the total number of 3-card hands having all cards
from the same suit is
4⋅ 13C3 = 4⋅ 286 = 1,144
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 33