KEMBAR78
Lecture-14 Permutations and Combinations Lecture | PDF
Scribd
Upload
51 views25 pages

Lecture-14 Permutations and Combinations Lecture

Uploaded by

berywam snap
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views25 pages

Lecture-14 Permutations and Combinations Lecture

Uploaded by

berywam snap
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

STATISTICS IS THE GRAMMAR OF SCIENCE

PREPARED BY

FAST NUCES ISLAMABAD


MT-2005 PROBABILITY AND STATISTICS PERMUTATIONS AND COMBINATIONS

THE BASIC COUNTING PRINCIPLE

If task A can be performed in m ways, followed by task B which can be performed in n


ways, then task A followed by task B can be performed in m  n  ways.

FACTORIAL FUNCTION Let n be a positive integer then factorial of n read as n factorial


is denoted by n! and is given by

n! n  n  1 n  2 ...... 3  2  1


For example
 1! = 1
 2! = 21 = 2
 3! = 3 2  1 = 6
Note that

 n! n n  1!
 0! = 1

RESULTS

1. The number of ways of arranging n unlike objects in a line is given by n !.

2. The number of ways of arranging n objects in a line, of which p are alike,


n!
is given by .
p!

3. The number of ways of arranging n objects in a line, of which p of one type are
alike, q of a second type are alike, r of a third type are alike, and so on, is given
by
n!
p ! q ! r !...

4. The number of ways of arranging n unlike objects in a ring, when clockwise and
anticlockwise arrangements are different is given by

n  1!.

5. The number of ways of arranging n unlike objects in a ring, when clockwise and
anticlockwise arrangements are the same, is given by
n  1!
2

PREPARED BY HAZBER SAMSON SCIENCES AND HUMANITIES DPT FAST ISLAMABAD


CamScanner
CamScanner
CamScanner
MT-2005 PROBABILITY AND STATISTICS PERMUTATIONS AND COMBINATIONS

PERMUTATION A permutation is an arrangement of objects in a definite order.


The number of permutations of n different objects taken r at a time is denoted by
n
Pr or P(n, r) and is given by
n!
n
Pr 
n  r !
For example

 5
P3  60
 8
P2  56
Note that

 n
Pn  n!
 n
Pn1  n !
 n
P1  n
 n
P0 1

COMBINATION A combination is an arrangement of objects without regard for the order


in which they are arranged.
The number of combinations of n different objects taken r at a time is denoted by
n
Cr or C (n, r ) and is given by

n!
n
Cr 
r ! n  r !
For example

 5
C3 10
 8
C2  28

Note that

 n
C n 1
 n
Cn1  n
 n
C1  n
 n
C 0 1
 n
Cr  nCn  r

RELATION BETWEEN PERMUTATIONS AND COMBINATIONS

n
Pr  nC r  r !

PREPARED BY HAZBER SAMSON SCIENCES AND HUMANITIES DPT FAST ISLAMABAD


CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner
CamScanner

You might also like