4 3 Permutations

PERMUTATIONS and COMBINATIONS
COUNTING
Dr. Felix P. Muga II

Mathematics Department
School of Science and Engineering
Ateneo de Manila University
Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 1 / 21

Introduction

Introduction
A permutation of a set of distinct objects is an ordered arrangement of

these objects.
An ordered arrangement of r elements of a set is called an
r -permutation.

Example
Let S = {1, 2, 3}. The arrangement of 3, 1, 2 is a permutation of S.

Example
Let S = {1, 2, 3}. The arrangement of 3, 1, 2 is a permutation of S.
The arrangement 3, 1 is a 2-permutation of S.

Theorem
The number of r -permutations of a set with n distinct elements is
P(n, r ) = n(n − 1)(n − 2) · · · (n − r + 1)

Theorem
The number of r -permutations of a set with n distinct elements is
P(n, r ) = n(n − 1)(n − 2) · · · (n − r + 1)
n!
P(n, r ) =
(n − r )!

Example
How many ways are there to select a first-prize winner, a second-prize
winner, and a third-prize winner from 100 different people who have
entered a contest?

Example
Suppose that there are 8 runners in a race. The winner receives a gold
medal, the second-place finisher a silver medal, and the third-place
finisher receives a bronze medal. How many different ways are there
to award these medals, if all possible outcomes of the race can occur
and there are no ties?

Example
Suppose that a saleswoman has to visit eight different cities. She must
begin her trip in a specified city, but she can visit the other seven cities
in any order she wishes. How many possible orders can the
saleswoman use when visiting these cities?

Example
How many permutations of the letters ABCDEFGH contain the strings
ABC?

Combinations
An r -combination of elements of a set is an unordered selection of r

elements from the set.

Combinations
An r -combination of elements of a set is an unordered selection of r

elements from the set.
An r -combination is simply a subset of the set with r elements.

Example
Let S be the set {1, 2, 3, 4}. Then {1, 3, 4} is a 3-combination of S.

Binomial Coefficient
C(n, r ) denotes the number of r -combinations of a set with n distinct

elements.
n

C(n, r ) = r and is called a binomial coefficient.

Example
C(4, 2) = 6, since the 2-combinations of {a, b, c, d} are the six subsets
{a, b}, {a, c}, {a, d},

{b, c}, {b, d}, {c, d}.

Theorem
The number of r -combinations of a set with n elements, where n is a
nonnegative integer and r is an integer with 0 ≤ r ≤ n, equals
n!
C(n, r ) = .
r !(n − r )!

Corollary
Let n and r be nonnegative integers with r ≤ n. Then
C(n, r ) = C(n, n − r ).

Example
How many ways are there to select three contestants from a
10-member programming team?

Example
How many ways are there to select three contestants from a
10-member programming team?
Solution.
10!
C(10, 3) = = 120.
3!7!

Example
How many bit strings of length 20 contains exactly twelve 1s?

Example
How many bit strings of length 20 contains exactly twelve 1s?
Solution.
20!
C(20, 12) = = 125, 970.
12!7!

Example
A club has 25 members.

Example
1 How many ways are there to choose four members of the club to
serve on an executive committee?

Example
Solution.
C(25, 4) = 12, 650.

Example
Solution.
C(25, 4) = 12, 650.
2 How many ways are there to choose a president, vice-president,
secretary and treasurer of the club?

Example
Solution.
C(25, 4) = 12, 650.
2 How many ways are there to choose a president, vice-president,
secretary and treasurer of the club?
Solution.
P(25, 4) = 303, 600.

Example
How many bit strings contain exactly eight 0s and ten 1s if every 0
must be immediately followed by a 1?

Example
How many bit strings contain exactly eight 0s and ten 1s if every 0
must be immediately followed by a 1?
Solution.
We have a set of 10 elements where 8 elements of the same kind
which is a 01 and 2 elements of the same kind which is a 1.
Hence, there are C(10, 8) = C(10, 2) = 45 strings satisfying the given
condition.

Example
How many bit strings of length 10 contain at least three 1s and at least three 0s?

Example
Solution.

Example
Solution.
Case 1. There are exactly three 1s and exactly seven 0s.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

Example
Solution.

C(10, 3) = C(10, 7) = 120.
Case 2. There are exactly four 1s and exactly six 0s.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.
Case 3. There are exactly five 1s and exactly five 0s.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

C(10, 5) = 252.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

C(10, 5) = 252.
Case 4. There are exactly six 1s and exactly four 0s.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

C(10, 5) = 252.

C(10, 6) = C(10, 4) = 210.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

C(10, 5) = 252.

C(10, 6) = C(10, 4) = 210.
Case 5. There are exactly seven 1s and exactly three 0s.

Example
Solution.

C(10, 3) = C(10, 7) = 120.

C(10, 4) = C(10, 6) = 210.

C(10, 5) = 252.

C(10, 6) = C(10, 4) = 210.
Case 5. There are exactly seven 1s and exactly three 0s.
C(10, 7) = C(10, 3) = 120.

Example

Example
Continuation.
There are 120 + 210 + 252 + 210 + 120 = 912 strings containing at least three 1s and
at least three 0s.

Example
Let S be a set with n distinct elements. How many subsets does S
have including the empty set and itself?

Example
Solution.

Example
Solution.
|P(S)| = 2n .

Example
Solution.
|P(S)| = 2n .
However, |P(S)| = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).

Example
Solution.
|P(S)| = 2n .
However, |P(S)| = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).
Thus, 2n = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).

4 3 Permutations

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

4 3 Permutations

Transféré par

Droits d'auteur :

Formats disponibles

PERMUTATIONS and COMBINATIONS

Dr. Felix P. Muga II

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 1 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 2 / 21

A permutation of a set of distinct objects is an ordered arrangement of

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 2 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 3 / 21

The arrangement 3, 1 is a 2-permutation of S.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 3 / 21

P(n, r ) = n(n − 1)(n − 2) · · · (n − r + 1)

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 4 / 21

P(n, r ) = n(n − 1)(n − 2) · · · (n − r + 1)

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 4 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 5 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 6 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 7 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 8 / 21

An r -combination of elements of a set is an unordered selection of r

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 9 / 21

An r -combination of elements of a set is an unordered selection of r

An r -combination is simply a subset of the set with r elements.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 9 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 10 / 21

C(n, r ) denotes the number of r -combinations of a set with n distinct

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 11 / 21

{a, b}, {a, c}, {a, d},

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 12 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 13 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 14 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 15 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 15 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 16 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 16 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 17 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 17 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 17 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 17 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 17 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 18 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 18 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Case 2. There are exactly four 1s and exactly six 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Case 2. There are exactly four 1s and exactly six 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Case 2. There are exactly four 1s and exactly six 0s.

Case 3. There are exactly five 1s and exactly five 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Case 2. There are exactly four 1s and exactly six 0s.

Case 3. There are exactly five 1s and exactly five 0s.

Felix P. Muga II () PERMUTATIONS and COMBINATIONS AMC 124 19 / 21

Case 1. There are exactly three 1s and exactly seven 0s.

Case 2. There are exactly four 1s and exactly six 0s.

Case 3. There are exactly five 1s and exactly five 0s.