3.permutations and Combinations

Lt-22 MATHEMATICS
PERMUTATION AND COMBINATION
I Fundamental Principles of Counting: Multiplication Principle (Multiplication Rule)

If an event can occur in ‘m’ different ways following which another event can occur in ‘n’ different ways,
then the total number of occurrence of the events in given order is m×n.
Multiplication principle can be extended to any number of events
Addition Principle (Addition Rule)
If an event can occur in ‘m’ different ways and an another event can occur in ‘n’ different ways, then the
total number of occurence of event one or event two can be in m+n difference ways
Addition principle can also be extended to any number of events
Note: ‘and’ represents multiplication and ‘or’ represents addition
II Factorial
Factorial of a natural number n in represented by n! or and in equal to the product of first ‘n’ natural
numbers
ie, n! = n(n–1) (n–2) (n–3)..3.2.1
Note:
1) 0! is defined as 1
2) n! = n(n–1)!=n(n–1)(n–2)! so on
III Permutation (Arrangement)
Result: The number of ways of arranging n distinct objects taken ‘r’ at a time without repetition is
denoted by nPr or P(n,r) and in equal to n. n  1 .  n  2  . n  3 ...(n  r  1)
n!
nPr  ,0  r  n
  r !
n
Note:
1) nP0=1
2) nPn=n!
3) nPn=nPn-1=n!
Result: Number of arrangements of n distinct objects taken ‘r’ at a time if repetition is allowed is nr
1
Brilliant STUDY CENTRE
Result: Number of arrangements of n objects in which p items are alike of type 1, q objects are alike
n!
of type 2 and r items are alike of type 3 is
p!q!r!
Result: Number of arrangements of n distinct objects in which ‘r’ particular objects should comes in
n!
an order (not necessarily together) is
r!
Combinations (Selections)
Result: Relation between permutation and combination is nPr=r!.nCr
Result: Number of selections of ‘n’ distinct objects taken ‘r’ at a time in denoted as nCr or C(n, r) or  
n
r
nPr
and nCr=
r!
n!
ie, nC r  r! n  r !
Note:
1) nC0=1
2) nC1=n
3) nCn=1
Result: nCr=nCn–r
Result: nCr=nCs  either r=s or r+s=n
Result: Pascal’s rule
nCr+nCr–1=n+1Cr
n n 1 nCr n
Result: nCr= . C r or n 1

r Cr 1 r
Circular Permutation
nPn n!
Result: Number of circular arrangements of ‘n’ distinct objects taken all at a time is    n  1!
n n
nPr
Result: Number of circular arrangement of ‘n’ distinct objects taken ‘r’ at a time is
r
Restricted combination
Number of selections of ‘n’ distinct objects taken ‘r’ at a time so that,
1) ‘m’ particular objects are always included is n–mCr–m
2) ‘m’ particular objects are always excluded is n–mCr
2
Lt-22 MATHEMATICS
Restricted Permutation
Number of arrangements of ‘n’ distinct objects taken ‘r’ at a time so that,
1) ‘m’ particular objects are always excluded in n–mPr
2) ‘m’ particular objects are always included in n–mCr-m ×r! or n–mPr–m×rPm
Result: nPr+r.nPr–1=n+1Pr
Combinatories in Geometry
1) Maximum intersections of ‘n’ non-parallel lines is a plane in nC2
2) Maximum intersections of ‘n’ non-concentric circles in a plane is nP2
3) Maximum number of straight lines formed using ‘n’ non collinear points in a plane is nC2
4) Maximum number of straight lines formed using ‘n’ points in a plane so that ‘m’ are
collinear is nC2–mC2+1
5) Maximum number of triangles formed using ‘n’ non-collinear points in a plane in nC3
6) Maximum number of triangles formed using ‘n’ points out of which ‘m’ are collinear is nC3–mC3
n  n  3
7) Number of diagonals of an ‘n’ sided polygon is nC2–n or
2
8) Maximum number of quadrilateral formed using ‘n’ non-collinear points in a plane is nC4
9) Maximum number of quadrilaterals formed using ‘n’ points out of which ‘m’ are collinear
is n–mC4 +n–mC3.mC1+n–mC2.mC2
10) A set of ‘n’ parallel lines in interested with another set of ‘m’ parallel lines, then the number of
parallelogram thus formed in nC2×mC2
Result: Number of selections of atleast one (one or more) object taken from n distinct objects is 2n–1
Result: Number of ways of selecting ‘r’ items from p identical item is 1
Result: Number of ways of selecting items (zero or more)from p identical items is p+1
Result: Number of ways of selecting atleast one object form a collection which has ‘p’ identical items
of type I, ‘q’ identical items of type q, r identical items of type is (p+1)(q+1)(r+1)–1
Grouping (Groups of unequal size)
1. Number of ways of dividing (m+n) distinct items into two groups each containing ‘m’ and ‘n’ items is
m+nCm or m+nCn and its distribution among 2 is m+nCn×2!
2. Number of ways of dividing m+n+p items into 3 groups each containing m,n and p items respectively
 m  n  p !  m  n  p !  3!
in m+n+pCm×n+pCn or and its distribution among 3 is
m!n!p! m!n!p!
Grouping (Groups of equal size)

1. Number of ways of division (parcels) of 2m distinct items into 2 equal groups each containing m items
2mCm  2m !  2m !
each in or and its distribution among 2 is
2! m!m!2! m!m!
3
Brilliant STUDY CENTRE
2. Number of ways of divisions (parcels) of 3m distinct items into 3 equal groups each containing m
3mCm .2mCm  3m !  3m !
items each in or and its distribution among 3 is
3! m!m!m!3! m!m!m!
Grouping (Groups of equal and unequal size)
1. Number of ways of dividing (m+2n+3p) distinct items into groups of ‘m’ items 2 equal groups of ‘n’
 m  2n  3p !
items and 3 equal groups of ‘p’ items in and its distribution among 6 is
m! n! .  p! .2!3!
2 3
 m  2n  3p !  6!
m! n!  p! 2!3!
2 3
Derangement (De arrangement)

Number of derangement of n distinct items in denoted by Dn and is equal to
 1 1 1  1 
n
D n  n!1     ...  
 1! 2! 3! n! 
Note: D1=0, D2=1, D3=2, D4=9, D5=44, D6=265 etc

Result: Distribution of n identical objects among r persons/groups/boxes etc if blank groups are
allowed or Number of non-negative integer solutions of the equation x1+x2+x3+...+xr=n is n+r–1Cr–1
Result: Distribution of n identical objects among r persons/ groups/boxes etc if blank groups not
allowed or number of positive integer solutions of the equation x1+x2+x3+...+xr=n is n–1Cr–1
Result: Number of ways of distributing ‘n’ different items among ‘r’ persons. So that each receives
atleast one item in rn–rC1(r–1)n+rC2(r–2)n+...+(–1)r–1 rCr–1

3.permutations and Combinations

Uploaded by

Copyright:

Available Formats

3.permutations and Combinations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

3.permutations and Combinations

Uploaded by

Copyright:

Available Formats

Lt-22 MATHEMATICS

PERMUTATION AND COMBINATION

I Fundamental Principles of Counting: Multiplication Principle (Multiplication Rule)

Grouping (Groups of equal size)

Derangement (De arrangement)

Note: D1=0, D2=1, D3=2, D4=9, D5=44, D6=265 etc

You might also like