Probability & Statistics for Scientist and Engineers

Dr. M. M. Bhatti

College of Mathematics and Systems Science, Shandong University of Science and

Technology, Qingdao, China
[email protected], [email protected]

March 21, 2023

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 1 / 25

Outline

1 Introduction
Permutations
Combinations
Binomial Coefficient
Probability using combinational analysis

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 2 / 25

Permutations
Problem 1.24
Evaluate (a) 8 P3 , (b) 6 P4 , (c) 15 P1 , (d) 3 P3 .

(a) 8 P3 = 8 · 7 · 6 = 336
(b) 6 P4 = 6 · 5 · 4 · 3 = 360
(c) 15 P1 = 15
(d) 3 P3 = 3 · 2 · 1 = 6

Problem 1.22
It is required to seat 5 men and 4 women in a row so that the women occupy
the even places. How many such arrangements are possible?

The men may be seated in 5 P5 ways, and the women in 4 P4 ways. Each
arrangement of the men may be associated with each arrangement of the
women. Hence,
Number of arrangements = 5 P5 · 4 P4 = 5!4! = (120)(24) = 2880 (1)
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 3 / 25
Permutations
Problem 1.25
How many 4-digit numbers can be formed with the 10 digits 0, 1, 2, 3, . . . , 9
if (a) repetitions are allowed, (b) repetitions are not allowed, (c) the last
digit must be zero and repetitions are not allowed?

(a) The first digit can be any one of 9 (since 0 is not allowed). The second,
third, and fourth digits can be any one of 10. Then 9·10·10·10 = 9000
numbers can be formed.
(b) The first digit can be any one of 9 (any one but 0).
The second digit can be any one of 9 (any but that used for the first
digit).
The third digit can be any one of 8 (any but those used for the first
two digits).
The fourth digit can be any one of 7 (any but those used for the first
three digits).
Then 9 · 9 · 8 · 7 = 4536 numbers can be formed.
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 4 / 25
Permutations

(c) The first digit can be chosen in 9 ways, the second in 8 ways, and the
third in 7 ways. Then 9 · 8 · 7 = 504 numbers can be formed.

Problem 1.26
Four different mathematics books, six different physics books, and two dif-
ferent chemistry books are to be arranged on a shelf. How many different
arrangements are possible if (a) the books in each particular subject must
all stand together, (b) only the mathematics books must stand together?

(a) The mathematics books can be arranged among themselves in 4 P4 = 4!

ways, the physics books in 6 P6 = 6! ways, the chemistry books in
2 P2 = 2! ways, and the three groups in 3 P3 = 3! ways. Therefore,

Number of arrangements = 4!6!2!3! = 207, 360 (2)

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 5 / 25

Permutations

(b) Consider the four mathematics books as one big book. Then we have
9 books which can be arranged in 9 P9 = 9! ways. In all of these ways
the mathematics books are together. But the mathematics books can
be arranged among themselves in 4 P4 = 4! ways. Hence,

Number of arrangements = 9!4! = 8, 709, 120 (3)

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 6 / 25

Permutations

Problem 1.27
In how many ways can 7 people be seated at a round table if (a) they can
sit anywhere, (b) 2 particular people must not sit next to each other?

(a) Let 1 of them be seated anywhere. Then the remaining 6 people can be
seated in 6! = 720 ways, which is the total number of ways of arranging
the 7 people in a circle.
(b) Consider the 2 particular people as 1 person. Then there are 6 people
altogether and they can be arranged in 5! ways. But the 2 people
considered as 1 can be arranged in 2! ways. Therefore, the number of
ways of arranging 7 people at a round table with 2 particular people
sitting together = 5!2! = 240.
Then using (a), the total number of ways in which 7 people can be
seated at a round table so that the 2 particular people do not sit
together = 720 − 240 = 480 ways.
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 7 / 25
Combinations

In a permutation we are interested in the order of arrangement of the objects.

For example, abc is a different permutation from bca. In many problems,
however, we are interested only in selecting or choosing objects without
regard to order. Such selections are called combinations. For example, abc
and bca are the same combination.
The total number of combinations of r objects selected from n (also called
the combinations of n things taken r at a time) is denoted by n Cr or nr ,

we have
 
n n!
= n Cr = (4)
r r!(n − r)!

It can also be written

 
n n(n − 1) · · · (n − r + 1) n Pr
= = (5)
r r! r!

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 8 / 25

Combinations

   
n n
= (6)
r n−r
or

n Cr = n Cn−r (7)

Example 1.18
The number of ways in which 3 cards can be chosen or selected from a
total of 8 different cards is
 
8 8·7·6
C
8 3 = = = 56 (8)
3 3!

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 9 / 25

Combinations
Example 1.19
In how many ways can 10 objects be split into two groups containing 4
and 6 objects, respectively?

This is the same as the number of arrangements of 10 objects of which 4

objects are alike and 6 other objects are alike. Then
10! 10 · 9 · 8 · 7
= = 210 (9)
4!6! 4!
N.B: The problem is equivalent to finding the number of selections of 4 out
of 10 objects (or 6 out of 10 objects), the order of selection being immaterial.
In general, the number of selections of r out of n objects, called the number
of
combinations of n things taken r at a time is denoted by by n Cr or
n
r and is given by,
 
n n! n(n − 1) · · · (n − r + 1) n Pr
n Cr = = = = (10)
r r!(n − r)! r! r!
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 10 / 25
Combinations

Problem 1.28
Evaluate (a) 7 C4 , (b) 6 C5 , (c) 4 C4 .

7! 7·6·5·4 7·6·5
(a) 7 C4 = = = = 35
4!3! 4! 3·2·1
6! 6·5·4·3·2
(b) 6 C5 = = = 6 or 6 C5 = 6 C1 = 6
5!1! 5!
(c) 4 C4 is the number of selections of 4 objects taken 4 at a time, and
there is only one such selection. Then 4 C4 = 1. Note that formally
4!
4 C4 = = 1 if we define 0! = 1
4!0!
r!
Hint: n Cr = .
n!(n − r)!

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 11 / 25

Combinations

Problem 1.29
In how many ways can a committee of 5 people be chosen out of 9 people?

 
9 9! 9·8·7·6·5
= 9 C5 = = = 126 (11)
5 5!4! 5!

Problem 1.28
Out of 5 mathematicians and 7 physicists, a committee consisting of 2
mathematicians and 3 physicists is to be formed. In how many ways can
this be done if (a) any mathematician and any physicist can be included,
(b) one particular physicist must be on the committee, (c) two particular
mathematicians cannot be on the committee?

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 12 / 25

Combinations

(a) 2 mathematicians out of 5 can be selected in 5 C2 ways.

3 physicists out of 7 can be selected in 7 C3 ways.

Total number of possible selections = 5 C2 · 7 C3 = 10 · 35 = 350

(12)

(b) 2 mathematicians out of 5 can be selected in 5 C2 ways.

2 physicists out of 6 can be selected in 6 C2 ways.

Total number of possible selections = 5 C2 · 6 C2 = 10 · 15 = 150

(13)

(c) 2 mathematicians out of 5 can be selected in 3 C2 ways.

3 physicists out of 7 can be selected in 7 C3 ways.

Total number of possible selections = 3 C2 · 7 C3 = 3 · 35 = 105 (14)

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 13 / 25

Combinations
Problem 1.30
How many different salads can be made from lettuce, escarole, endive,
watercress, and chicory?

Each green can be dealt with in 2 ways, as it can be chosen or not chosen.
Since each of the 2 ways of dealing with a green is associated with 2 ways
of dealing with each of the other greens, the number of ways of dealing
with the 5 greens = 25 ways. But 25 ways includes the case in which no
greens is chosen. Hence,
Number of salads = 25 − 1 = 31 (15)
Another method: One can select either 1 out of 5 greens, 2 out of 5
greens,. . . , 5 out of 5 greens. Then the required number of salads is
5 C1 + 5 C2 + 5 C3 + 5 C4 + 5 C5 = 5 + 10 + 10 + 5 + 1 = 31 (16)
In general, for any positive integer n, n C1 + n C2 + n C3 + n C4 + · · · + n Cn =
2n − 1.
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 14 / 25
Combinations

Problem 1.31
From 7 consonants and 5 vowels, how many words can be formed consisting
of 4 different consonants and 3 different vowels? The words need not have
meaning.

The 4 different consonants can be selected in 7 C4 ways, the 3 different

vowels can be selected in 5 C3 ways, and the resulting 7 different letters (4
consonants, 3 vowels) can then be arranged among themselves in 7 C7 = 7!
ways. Then

Number of words = 7 C4 · 5 C3 · 7! = 35 · 10 · 5040 = 1, 764, 000 (17)

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 15 / 25

Binomial Coefficient

The numbers (see eq. 4) are often called binomial coefficients because
they arise in the binomial expansion
     
n n n n−1 n n−2 2 n n
(x + y) = x + x y+ x y + ··· + y (18)
1 2 n

Example 1.20
       
4 4 3 4 4 2 2 4 3 4 4
(x + y) = x + x y+ x y + xy + y
1 2 3 4
= x4 + 4x3 y + 6x2 y 2 + 4xy 3 + y 4 (19)

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 16 / 25

Binomial Coefficient

Example 1.21
Prove that
     
n n−1 n−1
= + (20)
r r r−1

We have
 
n n! n(n − 1)! (n − r + r)(n − 1)!
= = =
r r!(n − r)! r!(n − r)! r!(n − r)!
(n − r)(n − 1)! r(n − 1)!
= +
r!(n − r)! r!(n − r)!
   
(n − 1)! (n − 1)! n−1 n−1
= + = + (21)
r!(n − r − 1)! (r − 1)!(n − r)! r r−1

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 17 / 25

Binomial Coefficient

The result has the following interesting application. If we write out the
coefficients in the binomial expansion of (x + y)n for n = 0, 1, 2, . . . , we
obtain the following arrangement, called Pascal’s triangle:

An entry in any line can be obtained by adding the two entries in the
preceding line that are to its immediate left and right. Therefore, 10 =
4 + 6, 15 = 10 + 5, etc.
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 18 / 25
Binomial Coefficient
Example 1.21
Find the constant term in the expansion of

1 12
 
2
x + (22)
x

According to the binomial theorem,

12   12  
1 12 X 12
   12−k X
2 2 k 1 12 3k−12
x + = (x ) = x (23)
x k x k
k=0 k=0

Hint: Binomial theorem is (x + y)n = nk=0 nk xn−k y k .

P

The constant term corresponds to the one for which 3k−12 = 0, i.e., k = 4,
and is therefore given by
 
12 12 · 11 · 10 · 9
= = 495 (24)
4 4·3·2·1
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 19 / 25
Probability using combinational analysis
Problem 1.32
A box contains 8 red, 3 white, and 9 blue balls. If 3 balls are drawn at random
without replacement, determine the probability that (a) all 3 are red, (b) all 3 are
white, (c) 2 are red and 1 is white, (d) at least 1 is white, (e) 1 of each color is
drawn, (f) the balls are drawn in the order red, white, blue.

(a) Let R1 , R2 , R3 denote the events, “red ball on 1st draw,” “red ball on 2nd
draw,” “red ball on 3rd draw,” respectively. Then R1 ∩ R2 ∩ R3 denotes the
event “all 3 balls drawn are red.” We therefore have

P (R1 ∩ R2 ∩ R3 ) = P (R1 )P (R2 |R1 )P (R3 |R1 ∩ R2 )

   
8 7 6
=
20 19 18
14
= (25)
285
Another method: Required probability = (number of selections of 3 out of 8 red
balls)/(number of selections of 3 out of 20 balls) = 8 C3 /20 C3 .
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 20 / 25
Probability using combinational analysis

(b) Using the second method indicated in part (a),

3 C3 1
P (all 3 are white) = = (26)
20 C3 1140
(c) P (2 are red and 1 is white)
(selections of 2 out of 8 red balls)(selections of 1 out of 3 white balls)
= (27)
number of selections of 3 out of 20 balls

(8 C2 )(3 C1 ) 7
= = (28)
C
20 3 95

17 C3 34
(d) P (none is white) = = . Then
20 C3 57
34 23
P (at least 1 is white) = 1 − = (29)
57 57
Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 21 / 25
Probability using combinational analysis

(8 C1 )(3 C1 )(9 C1 ) 18
(e) P (1 of each color is drawn) = =
20 C3 95
(f) P (balls drawn in order red, white, blue) =
1
P (1 of each color is drawn)
3!
 
1 18 3
= = , using (e) (30)
6 95 95

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 22 / 25

Probability using combinational analysis

Problem 1.33
In the game of poker 5 cards are drawn from a pack of 52 well-shuffled
cards. Find the probability that (a) 4 are aces, (b) 4 are aces and 1 is a
king, (c) 3 are tens and 2 are jacks, (d) a nine, ten, jack, queen, king are
obtained in any order, (e) 3 are of any one suit and 2 are of another, (f) at
least 1 ace is obtained

(4 C4 )(48 C1 ) 1
(a) P (4 aces) = =
C
52 5 54, 145
(4 C4 )(4 C1 ) 1
(b) P (4 aces and 1 king) = =
52 C5 649, 740
(4 C3 )(4 C2 ) 1
(c) P (3 are tens and 2 are jacks) = =
52 C5 108, 290

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 23 / 25

Probability using combinational analysis

(d) P (nine, ten, jack, queen, king in any order) =

(4 C1 )(4 C1 )(4 C1 )(4 C1 )(4 C1 ) 64
=
C
52 5 162, 435
(4 · 13 C3 )(3 · 13 C2 ) 429
(e) P (3 of any one suit, 2 of another) = =
52 C5 4165
since there are 4 ways of choosing the first suit and 3 ways of
choosing the second suit.
48 C5 35, 673
(f) P (no ace) = = . Then
52 C5 54, 145
35, 673 18, 472
P (at least one ace) = 1 − = .
54, 145 54, 145

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 24 / 25

Thank you for your kind attention!

Dr. M. M. Bhatti (SDUST) Chapter 1: Lecture # 6 March 21, 2023 25 / 25