1 [UNIT − 7] Permutation and Combination
Unit 7
PERMUTATION AND COMBINATION
Factorial
The factorial notation was introduced by Christian Kramp (1760-1826) in 1808.
Let n be a positive integer. Then the product n ( n − 1)( n − 2 ) .....3.2.1 is denoted by
n! or n and read as n factorial. i.e.
n ! = n ( n − 1)( n − 2 ) .....3.2.1
n ! = n ( n − 1)! where 0! = 1
Note: Factorial of a negative integer or of a fraction is not defined.
Permutation
An ordered arrangement of a group of objects is called permutation.
A permutation of n different objects taken r (1 r n ) at a time is an arrangement of r
n!
objects. Generally denoted by n Pr or P ( n,r ) , where n
Pr =
( n − r )!
Important Results on Permutation
(i) n
Pn = n!
(ii) n
P1 = n
(iii) n
Pr = n . n−1Pr −1
(iv) n
Pr = n−1Pr + r . n−1Pr −1
(v) Number of permutations of n different objects taken all at a time is n Pn = n!
Permutation of Objects when Repetition is Allowed
The number of permutations of n different objects taken r at a time when each
object may be repeated any number of times is nr .
2 [UNIT − 7] Permutation and Combination
Permutation under Restrictions
(i) Number of permutations of n different objects when m particular objects are always
come together, is m! ( n − m + 1)!
(ii) Number of permutations of n different objects when m particular objects are never
come together, is n !− m! ( n − m + 1)!
Permutation of Objects not all Different
If there are n1 alike objects of one kind, n2 alike objects of second kind and n3 alike
objects of third kind, then the number of permutations of n objects taken all at a time is
n! n
given by: =
n1 ! n2 ! n3 ! n1 , n2 , n3
Circular Permutation
The permutation of things which can be represented by the points on a circle
are called Circular Permutation.
Important Results on Circular Permutation
(i) Number of circular permutations of n different objects, is ( n − 1)! .
(ii) Number of circular permutations of n different objects when observation can be
1
made from both sides, is ( n − 1)! .
2
(iii) Number of circular permutations of n different objects taken r at a time, when
n
P
clockwise and anti-clockwise order are taken as different, is r
r
(iv) Number of circular permutations of n different objects taken r at a time, when
n
P
clockwise and anti-clockwise order are not different, is r
2r
Combination
An arrangement of a group of objects in which order does not matter is called
combination.
A combination of n different objects taken r ( 0 r n ) at a time is denoted by
n n!
n
Cr or C ( n,r ) or , where nCr =
r ( n − r )! r !
Note: If r n then nCr = 0
3 [UNIT − 7] Permutation and Combination
Important Results on Combination
(i) n
C0 = nCn = 1
(ii) n
C1 = nCn−1 = n
n
Pr
(iii) n
Cr r ! = Pr
n
or n
Cr =
r!
(iv) n
Cr = nCn−r , where ( 0 r n ) (Complementary Combination)
(v) If nCx = nC y then either x = y or x + y = n
(vi) n
Cr + nCr −1 = n+1Cr , where (1 r n )
(vii) r .nCr = n.n−1Cr −1
(viii) The number of line segments formed by n points when no three of them are
collinear is equal to nC2
(ix) The number of line segments formed by n points when m of them are collinear is
equal to nC2 − mC2 + 1
n ( n − 3)
(x) The number of diagonals in n sided polygon is equal to nC2 − n or
2
n ( n − 1)( n − 2 )
(xi) The number of triangles in n sided polygon is equal to nC3 or
6
(xii) The number of triangles form by n points if m ( m 3) of these points are collinear
is equal to nC3 − mC3
Combinations under Restrictions
The number of combinations of n different objects taken r at a time when k
particular objects are always be
n−k
(i) excluded is Cr
n−k
(ii) included is Cr −k
4 [UNIT − 7] Permutation and Combination
MULTIPLE CHOICE QUESTIONS
1. The factorial notation was introduced by:
(a) Blaise Pascal (b) Pierre De Fermat
(c) Christian Kramp (d) Francesco Mourolico
2. Let n be a positive integer then:
(a) n! = n ( n − 1)! (b) n! = n ( n + 1)!
(c) n! = n ( n − 2 )! (d) n! = n ( n + 2 )!
3. n ( n − 1)( n − 2 )( n − 3) .....3.2.1 =
(a) n ! (b) ( n − 1)! (c) ( n + 1)! (d) None of these
4. The factorial form of 6.5.4 is equal to: (FSD 18)
6! 3! 1
(a) 3! (b) 6! (c) 6! (d) 6!
5. [Link] =
9! 5!
(a) 5! (b) 9! (c) 5! (d) 3!
6. Let n be a negative integer then n!
(a) equals n ( n − 1)! (b) equals n ( n + 1)!
(c) equals − n ! (d) does not exist
8 .7 .6
7. Factorial form of is:
3 .2 .1
8! 8! 8! 8!
(a) (b) (c) (d)
3! 3!6! 3!5! 3!4!
(n + 1) n(n − 1)
8. Factorial form of 3.2.1 is:
(n + 1)! (n − 2)! (n + 1)! (n + 1)(n − 2)!
(a) (b) (c) (d)
3! 3! 3! (n − 2)! 3!
3
9. !
2
3!
(a) equals (b) equals 1.5! (c) both a & b (d) does not exist
2!
10. 0! =
(a) 0 (b) 1 (c) −1 (d) None of these
5 [UNIT − 7] Permutation and Combination
8!
11. =
7!
8
(a) (b) 7 (c) 8 (d) None of these
7
9!
12. Value of 6! 3! is: (D.G.K 18)
(a) 84 (b) 48 (c) 24 (d) 42
15!
13. =
15!(15 − 15 )!
(a) 1 (b) 15 (c) 225 (d) Undefined
3!
14. = (MTN, RWP 15)(LHR 17)
0!
3
(a) 3 (b) 6 (c) (d)
0
15. 4! 0! 1! =
(a) 0 (b) 4 (c) 1 (d) 24
16. 6! + 0! = (BHP 16)
(a) 719 (b) 720 (c) 721 (d) 722
17. If n = 1 , then value of n n − 1 is: (RWP 16)
(a) Zero (b) −1 (c) 1 (d) 2
18. 12.11.10 =
12! 12! 12! 10!
(a) (b) (c) (d)
10! 11! 9! 9!
19. ( n + 2 )( n + 1) n =
n! ( n + 1)! ( n + 2 )! ( n + 2 )!
(a) (b) (c) (d)
( n − 1)! ( n − 1)! ( n − 1)! n!
20. n ( n − 1)( n − 2 ) .....( n − r + 1) = (BHP 17)(MTN 16)
n! n! n!
(a) n ! (b) (c) (d)
( n − r )! r! ( n − r + 1)!
21. An arrangement of a finite number of objects taken some or all at a time is called:
(a) Sequence (b) Permutation (c) Combination (d) None of these
22. n
Pr = (BHP 14)(FSD, GUJ 16)
n! n! n!
(a) n ! (b) (c) (d)
( n − r )! r! ( n − r ) !r !
n!
23. = (SHW 18)
(n − r)!
(a) nCr (b) n−1
Cr (c) n+1
Cr+1 (d) nPr
6 [UNIT − 7] Permutation and Combination
24. n different objects can be arranged taken all at a time in: (D.G.K 15)
(a) n ways (b) ( n + 1)! ways (c) ( n − 1)! ways (d) n ! ways
25. n
Pn =
(a) n ! (b) ( n + 1)! (c) 1 (d) None of these
26. 6
P4 =
(a) 36 (b) 360 (c) 6 (d) 4
4
27. P3 is equal to: (SRG 16)
(a) 4 P1 (b) 4 P2 (c) 4 P4 (d) 5 P4
28. The value of 15 P2 is:
(a) 210 (b) 10 (c) 15 (d) 2
10
29. The value of P2 is:
(a) 10 (b) 20 (c) 80 (d) 90
30. If P2 = 30 , what is the value of ‘n’ is:
n
(D.G.K 15)(LHR 16)
(a) 4 (b) 5 (c) 6 (d) 2
31. Number of signals given by 5 flags of different colors, using 3 flags at a time is:
(a) 5 (b) 3 (c) 120 (d) 60
32. The number of 3-digit numbers formed by using each one of the digits 2,3,5,7,9
only once is:
(a) 10 (b) 60 (c) 120 (d) 360
33. The number of words formed by the letters of the word PLANE using all letters is:
(a) 5 (b) 60 (c) 120 (d) 24
34. The number of permutations of the n objects of which there are n 1 like objects of the
one kind, n 2 like objects of the second kind and n 3 like objects of the third kind are:
n! n 1 !n 2 !n 3 ! n! n!
(a) (b) (c) (d)
n 1 !n 2 !n 3 ! n! n 1 !n 2 ! n 1 !n 3 !
35. The number of words that can be formed out of the letters of word PAKPATTAN is
9! 9! 9!
(a) (b) (c) (d) 9!.3!.2!.2!
3!.2!.1! 3!.22 ! 3!.2!.2!
36. The permutation of things which can be represented by the points on a circle are
called:
(a) Permutations (b) Combinations
(c) Circular Permutations (d) None of these
7 [UNIT − 7] Permutation and Combination
37. n different objects can be arranged in a circle in:
(a) n ! ways (b) ( n + 1)!ways (c) ( n − 1)! ways (d) None of these
38. Number of ways in which 3 persons can be seated at a round table are:
(a) 1 (b) 2 (c) 3 (d) 6
39. Five persons can be seated at a round table in: (D.G.K 16)
(a) 120 ways (b) 60 ways (c) 24 ways (d) 5 ways
40. 4 keys can be arranged on a circular key ring in:
(a) 24 ways (b) 12 ways (c) 6 ways (d) 3 ways
41. 5 keys can be arranged on a circular key ring in number of ways: (LHR 16)
(a) 5 (b) 12 (c) 24 (d) 120
42. Number of necklaces that can be made from 6 beads of different colors is:
(a) 720 (b) 120 (c) 60 (d) None of these
43. When selection of objects is made without paying regard to the order then it is
called:
(a) Permutation (b) Combination (c) Probability (d) None of these
n
44. Cr equals: ` (LHR 17)
n! n! ( n − r ) !r ! n!
(a) (b) (c) (d)
( n − r )! ( n − r ) !r ! n! r!
n
45. Cr also can be written as:
(a) P(n, r) (b) C(n, r) (c) P(r, n) (d) C(r, n)
n
46. Cr exists when:
(a) n r (b) n r (c) n r (d) None of these
47. n
Cr r ! equals: (FSD 14)(GUJ, SHW , D.G.K 16)
n +1 n −1
(a) Pr (b) Pr (c) n Pr (d) n Pr +1
n
48. Pr equals:
1 n
(a) n Cr (b) r ! n Cr (c) r nCr (d) Cr
r!
49. If r = n then n Cr is equal to: (BHP 16)
(a) 0 (b) 1 (c) n! (d) (n – 1)!
n
50. Cn equals: (RWP 16)
(a) n C0 (b) 1 (c) n (d) both a & b
n
51. C0 equals: (LHR 17, 18)
(a) 0 (b) 1 (c) n (d) 2
5
52. C2 is equal to:
(a) Zero (b) 10 (c) n! (d) n
8 [UNIT − 7] Permutation and Combination
4
53. C4 has the value equal to:
(a) 0 (b) 1 (c) 4 (d) None of these
54. n
Cn−r =
n −1 n +1
(a) Cn−r (b) n Cr −1 (c) Cr (d) n Cr
55. If n Cr = nCq , which of the following must be true? (GUJ 17)
(a) r q (b) r + q = n (c) r − q = n (d) q = 0
56. If C8 = C12 , then n is equal to:
n n
(MTN 17)(LHR 14, 18)
(a) 4 (b) 8 (c) 20 (d) 12
57. If C5 = C4 , then:
n n
(a) n = 4 (b) n = 1 (c) n = 9 (d) n = 8
n −1 n −1
58. Cr + Cr −1 equals:
(a) nCr (b) n−1
Cr+1 (c) n−1
Cr (d) nCr+1
59. n
Cr + nCr −1 = (FSD 18)
n +1 n +1
(a) nCr (b) nCr −1 (c) Cr −1 (d) Cr
60. n
Cr −1 + Cr −2 =
n
(MTN 18)
n n +1 n +1 n
(a) Cr (b) Cr −1 (c) Cr − 2 (d) Cr −2
61. Number of diagonals in 8 sided polygon is:
(a) 8 (b) 28 (c) 20 (d) None of these
62. Number of triangles in 5 sided polygon is:
(a) 5 (b) 10 (c) 20 (d) None of these
9 [UNIT − 7] Permutation and Combination
ANSWERS
(1) C (2) a (3) a (4) a (5) a
(6) D (7) c (8) c (9) d (10) b
(11) C (12) a (13) a (14) b (15) d
(16) C (17) c (18) c (19) c (20) b
(21) B (22) b (23) d (24) d (25) a
(26) B (27) c (28) a (29) d (30) c
(31) D (32) b (33) c (34) a (35) c
(36) C (37) c (38) b (39) c (40) d
(41) B (42) c (43) b (44) b (45) b
(46) C (47) c (48) b (49) b (50) d
(51) B (52) b (53) b (54) d (55) b
(56) C (57) c (58) a (59) d (60) b
(61) C (62) b
10 [UNIT − 7] Permutation and Combination
SOLUTIONS
1. (c) Christian Kramp
2. (a) n! = n ( n − 1)!
3. (a) n ( n − 1)( n − 2 )( n − 3) .....3.2.1 = n !
[Link]! 6!
4. (a) 6.5.4 = =
3! 3!
[Link].5! 9!
5. (a) [Link] = =
5! 5!
6. (d) Factorial of negative integer does not exist
8.7.6 [Link]! 8!
7. (c) = =
3.2.1 [Link]! 3!5!
( n + 1) n ( n − 1) = ( n + 1) n ( n − 1)( n − 2 )! = ( n + 1)!
8. (c)
3.2.1 3.2.1.( n − 2 )! 3!( n − 2 )!
9. (d) Factorial of fraction does not exist
10. (b) 0! = 1
8! 8.7!
11. (c) = =8
7! 7!
9! [Link]! 9.8.7
12. (a) = = = 84
6!3! 6!.3! 3.2.1
15! 15! 1 1
13. (a) = = = =1
15!(15 − 15 )! 15! 0! 0! 1
3! 6
14. (b) = =6
0! 1
15. (d) 4! 0!1! = 24(1)(1) = 24
16. (c) 6! + 0! = 720 + 1 = 721
17. (c) When n = 1 , then n n − 1 = 11 − 1 = 1. 0 = 1.1 = 1
[Link]! 12!
18. (c) 12.11.10 = =
9! 9!
( n + 2 )( n + 1) n ( n − 1)! = ( n + 2 )!
19. (c) ( n + 2 )( n + 1) n =
( n − 1)! ( n − 1)!
n ( n − 1)( n − 2 ) ..... ( n − r + 1)( n − r )! n!
20. (b) n ( n − 1)( n − 2 ) .....( n − r + 1) = =
( n − r )! ( n − r )!
21. (b) Permutation
n!
22. (b) n
Pr =
( n − r )!
11 [UNIT − 7] Permutation and Combination
n!
23. (d) = nP
( n − r )! r
n! n!
24. (d) n
Pn = = = n ! ways
( n − n )! 0!
n! n!
25. (a) n
Pn = = = n!
( n − n )! 0!
6! 720
26. (b) 6
P4 = = = 360
2! 2
27. (c) 4
P3 = 24 = 4 P4
15! 15.14.13!
28. (a) 15
P2 = = = 15(14) = 210
13! 13!
10! 10.9.8!
29. (d) 10
P2 = = = 10(9) = 90
8! 8!
30. (c) n
P2 = 30 = 6 P2 n = 6
31. (d) 5
P3 = 60
32. (b) 5
P3 = 60
33. (c) 5
P5 = 120
n!
34. (a)
n 1 !n 2 !n 3 !
35. (c) Here n = 9 , A repeats 3 times, P repeats 2 times and T repeats 2 times.
9!
So, No. of words =
3!.2!.2!
36. (c) Circular Permutations
37. (c) ( n − 1)! ways
38. (b) ( 3 − 1)! = 2! = 2
39. (c) ( 5 − 1)! = 4! = 24 ways
1 1 1
40. (d) ( n − 1)! = ( 4 − 1)! = ( 6 ) = 3 ways
2 2 2
1 1 1 1
41. (b) ( n − 1)! = (5 − 1)! = ( 4!) = ( 24 ) = 12 ways
2 2 2 2
1 1 1
42. (c) ( n − 1)! = ( 6 − 1)! = (120 ) = 60 ways
2 2 2
43. (b) Combination
n!
44. (b) n
Cr =
( n − r ) !r !
45. (b) n
Cr = C ( n, r )
12 [UNIT − 7] Permutation and Combination
46. (c) n
Cr exists when n r
47. (c) n
Cr r ! = n Pr
48. (b) n
Pr = r ! nCr
n! n!
49. (b) when r = n , n
Cr = n Cn = = =1
( n − n )!. n! 0!. n!
n! n!
50. (d) n
Cn = = =1
( n − n )!. n! 0!. n!
n! n!
51. (b) n
C0 = = =1
( n − 0 )!.0! n!0!
5! 5! 120
52. (b) 5
C2 = = = = 10
( 5 − 2 )!.2! 3!.2! 6 ( 2 )
4! 4!
53. (b) 4
C4 = = =1
( 4 − 4 )!.4! 0!.4!
54. (d) n
Cn−r = n Cr
55. (b) n
Cr = nCq nCn−r = nCq n − r = q n = r + q
56. (c) n
C8 = nC12 nCn −8 = nC12 n − 8 = 12 n = 20
57. (c) n
C5 = nC4 nCn −5 = nC4 n−5= 4 n =9
n −1 n −1
58. (a) Cr + Cr −1 = nCr
n +1
59. (d) n
Cr + nCr −1 = Cr
n +1
60. (b) n
Cr −1 + Cr − 2 =
n
Cr −1
61. (c) Number of diagonals = 8 C2 − 8 = 28 − 8 = 20
62. (b) Number of triangles = 5 C3 = 10