Professional Documents
Culture Documents
Lecture 08
Prof. Dr. M. Junaid Mughal
Last Class
Introduction to Probability
Counting Problems
Multiplication Theorem
Permutation
Todays Agenda
Definition:
A permutation is an arrangement of all or
part of a set of objects.
Example:
Consider the three letters a, b, and c. The
possible permutations are
{abc, acb, bac, bca, cab, cba}
n!
n Pr
n r !
Permutations
If we let a = b = x and c = d = y,
we can list only the following distinct
permutations:
{xxyy, xyxy, yxxy, yyxx, xyyx, yxyx}
Thus we have
4!/(2! 2!) = 6 distinct permutations.
Permutations
n n!
n1 , n2 , n3 ,, nr n1!n2!n3! nr !
where,
n1 n2 n3 nr n
Example
Only one!
No.
Combinations
Answer: Three
Combination
These would be
{ab, ac, ad, ba, be, bd, ca, cb, cd, da, db, dc}
Combination
n!
n Pr
n r !
Combination
{ab, ac, ad, ba, be, bd, ca, eb, cd, da, db, dc}
we know that r objects can be arranged in r!
order, (2! =2), therefore we have two sets of
same alphabets but different permutation
Combination
n!
n Cr
r ! n r !
Combinations
n!
n Cr
r ! n r !
Example
210
Example
50400
Example
Introduction to Probability
Counting Rules
Combinations
Axioms of probability
Examples
References