Probability: Bùi Thị Lệ Thủy/
Probability: Bùi Thị Lệ Thủy/
Probability: Bùi Thị Lệ Thủy/
PROBABILITY
Bùi Thị Lệ Thủy\
Chapter 1
COMBINATORIAL ANALYSIS
1. Introduction
2. The Basic Principle of Counting
3. Permutations
4. Combinations
5. Partitions
1. Introduction
• Many problems in probability theory can be solved simply by
counting the number of different ways that a certain event can occur.
• The mathematical theory of counting is formally known as
combinatorial analysis.
3. Permutations
Question: How many different ordered arrangements of the letters a, b,
and c are possible?
Answer: abc, acb, bac, bca, cab, cba
3. Permutations
Example 1.5: How many different batting orders are possible for a
baseball team consisting of 9 players?
3. Permutations
Example 1.6: A class in probability theory consists of 6 men and 4
women. An examination is given, and the students are ranked
according to their performance. Assume that no two students obtain
the same score.
(a) How many different rankings are possible?
(b) If the men are ranked just among themselves and the women just
among themselves, how many different rankings are possible?
3. Permutations
Example 1.7: Ms. Jones has 10 books that she is going to put on her
bookshelf. Of these, 4 are mathematics books, 3 are chemistry books, 2
are history books, and 1 is a language book. Ms. Jones wants to arrange
her books so that all the books dealing with the same subject are
together on the shelf. How many different arrangements are possible?
3. Permutations
Example 1.8: How many different letter arrangements can be formed
from the letters PEPPER?
3. Permutations
General Result
Suppose you have n objects. The number of different permutations of
these n objects of which n1 are alike, n2 are alike,..., nr are alike is given
by
𝑛! 𝑛
:= 𝑛 ,𝑛 ,…𝑛
𝑛1 !𝑛2 !…𝑛𝑟 ! 1 2 𝑟
3. Permutations
Example 1.9: A chess tournament has 10 competitors, of which 4 are
Russian, 3 are from the United States, 2 are from Great Britain, and 1 is
from Brazil. If the tournament result lists just the nationalities of the
players in the order in which they placed, how many outcomes are
possible?
3. Permutations
Example 1.10: How many different signals, each consisting of 9 flags
hung in a line, can be made from a set of 4 white flags, 3 red flags, and
2 blue flags if all flags of the same color are identical?
4. Combinations
• We are often interested in determining the number of different
groups of r objects that could be formed from a total of n objects.
• n(n - 1) · · · (n - r + 1) represents the number of different ways that a
group of r items could be selected from n items when the order of
selection is relevant, and as each group of r items will be counted r!
times in this count, it follows that the number of different groups of r
items that could be formed from a set of n items is
n(n − 1) · · · (n − r + 1) n!
=
r! (n − r)! r!
4. Combinations
Notation and terminology
𝑛
We define , for r ≤ 𝑛, by
𝑟
𝑛 n!
=
𝑟 (n − r)! r!
𝑛
and say that (read as "n choose r") represents the number of
𝑟
possible combinations of n objects taken r at a time.
4. Combinations
Example 1.11: Assume we have an horse race with 12 horses. What is
the possible number of combinations of 3 horses when the order
matters and when it does not?
4. Combinations
General Result
We want to determine the number of different groups of r objects
that could be formed from a total of n objects.
• When the order of selection is relevant, there are
n!
n(n − 1) · · · (n − r + 1) =
(n − r)!
• When the order of selection is irrelevant, there are
n! 𝑛
≔
(n − r)! r! 𝑟
4. Combinations
Example 1.12: A committee of 3 is to be formed from a group of 20
people. How many different committees are possible?
4. Combinations
Example 1.13: From a group of 5 women and 7 men, how many
different committees consisting of 2 women and 3 men can be formed?
What if 2 of the men are feuding and refuse to serve on the committee
together?
5. Partitions
• A set of n distinct items is to be divided into r distinct groups of
respective sizes n1, n2, . .. , nr, where 𝑟𝑖=1 𝑛𝑖 = 𝑛. There are
𝑛! 𝑛
∶= 𝑛 , 𝑛 , … 𝑛
𝑛1 !𝑛2 !…𝑛𝑟 ! 1 2 𝑟
possible divisions.
5. Partitions
Example 1.14: A police department in a small city consists of 10
officers. If the department policy is to have 5 of the officers patrolling
the streets, 2 of the officers working full time at the station, and 3 of
the officers on reserve at the station, how many different divisions of
the 10 officers into the 3 groups are possible?
5. Partitions
Example 1.15: Ten children are to be divided into an A team and a B
team of 5 each. The A team will play in one league and the B team in
another. How many different divisions are possible?
5. Partitions
Example 1.16: In order to play a game of basketball, 10 children at a
playground divide themselves into two teams of 5 each. How many
different divisions are possible?