Scribd
Upload
242 views

Permutation & Combinnation

This document discusses various permutation and combination formulas: 1. The number of permutations of n objects taken r at a time is nPr = n!/(n-r)!. 2. The number of circular permutations of n objects taken all at a time is (n-1)!. 3. The number of combinations of n objects taken r at a time is nCr = n!/r!(n-r)!. 4. Formulas are also provided for permutations with similar objects and for selecting one or more objects from different types of objects.

Uploaded by

Keshav Agarwal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
242 views

Permutation & Combinnation

This document discusses various permutation and combination formulas: 1. The number of permutations of n objects taken r at a time is nPr = n!/(n-r)!. 2. The number of circular permutations of n objects taken all at a time is (n-1)!. 3. The number of combinations of n objects taken r at a time is nCr = n!/r!(n-r)!. 4. Formulas are also provided for permutations with similar objects and for selecting one or more objects from different types of objects.

Uploaded by

Keshav Agarwal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PERMUTATION & COMBINNATION

1. Arrangement : number of permutations of n different things taken r at a


n
n!
time = P r = n (n  1) (n  2)... (n  r + 1) =
(n  r )!
2. Circular Permutation :
The number of circular permutations of n different things taken all at a
time is; (n – 1)!

3. Selection : Number of combinations of n different things taken r at a


n! n
Pr
time = nC r = =
r! (n  r )! r!
4. The number of permutations of 'n' things, taken all at a time, when 'p' of
them are similar & of one type, q of them are similar & of another type, 'r' of
them are similar & of a third type & the remaining n  (p + q + r) are all
n!
different is .
p! q! r !
5. Selection of one or more objects
(a) Number of ways in which atleast one object be selected out of 'n'
distinct objects is
n
C 1 + nC 2 + nC 3 +...............+ nC n = 2 n – 1
(b) Number of ways in which atleast one object may be selected out
of 'p' alike objects of one type 'q' alike objects of second type and
'r' alike of third type is
(p + 1) (q + 1) (r + 1) – 1
(c) Number of ways in which atleast one object may be selected
from 'n' objects where 'p' alike of one type 'q' alike of second type
and 'r' alike of third type and rest
n – (p + q + r) are different, is
(p + 1) (q + 1) (r + 1) 2 n – (p + q + r) – 1
6. Multinomial Theorem :
Coefficient of xr in expansion of (1  x)n = n+r1
C r (n  N)

7. Let N = p a. q b. rc...... where p, q, r...... are distinct primes & a, b, c..... are
natural numbers then :
(a) The total numbers of divisors of N including 1 & N is
= (a + 1) (b + 1) (c + 1)........
(b) The sum of these divisors is =
(p 0 + p 1 + p 2 +.... + p a) (q 0 + q 1 + q 2 +.... + q b) (r0 + r1 + r2 +.... + rc)........

Page # 28
be resolved as a product of two
factors is
1 (a  1)(b  1)(c  1).... if N is not a perfect square
= 12
2
(a  1)(b  1)(c  1)....1 if N is a perfect square
(d) Number of ways in which a composite number N can be resolved
into two factors which are relatively prime (or coprime) to each
other is equal to 2 n1 where n is the number of different prime
factors in N.
8. Dearrangement :
Number of ways in which 'n' letters can be put in 'n' corresponding
envelop es su ch t hat no lett er g oes to co rrec t en velop e is n !
 1 1 1 1 1
1     .......... ..  ( 1)n 
1! 2 ! 3 ! 4 ! n!

Page # 29

You might also like