1

Uday (2025)
Permutations and Combinations
Practice Sheet

Single Correct Type Questions: (1 to 15) 6. Sum of all the numbers that can be formed using all
1. In a 12 storey house 10 people enter the lift cabin. It the digits 2, 3, 3, 4, 4, 4, is:
is known that they will leave the lift in pre-decided (1) 22222200 (2) 11111100
groups of 2, 3 and 5 people at different storeis. The (3) 55555500 (4) 20333280
number of ways they can do so if the lift does not
7. The number of words which can be formed from the
stop upto the second storey is –
letters of the word "MAXIMUM", if two consonants
(1) 820 (2) 720
cannot occur together, is
(3) 1430 (4) 640 (1) 4! (2) 3! × 4!
(3) 7! (4) None of these
2. Out of seven consonants & four vowels, the number
of words of six letters, formed by taking four 8. The number of words that can be formed by using
consonants & two vowels, is (Assume each ordered the letters of the word ‘MATHEMATICS’ that start
group of letter is a word) as well as end with T, is
(1) 210 (2) 462 (1) 80720 (2) 90720
(3) 151200 (4) 332640 (3) 20860 (4) 37528

9. The number of ways in which the number 94864 can

3. Out of 16 players of a cricket team, 4 are bowlers
be resolved as a product of two factors is -
and 2 are wicket keepers. A team of 11 players is to
(1) 27 (2) 23
be chosen so as to contain at least 3 bowlers and at (3) 29 (4) 31
least 1 wicketkeeper. The number of ways in which
the team be selected, is 10. The total number of proper divisors of 38808 is
(1) 2400 (2) 2472 (1) 60 (2) 59
(3) 2500 (4) 960 (3) 286 (4) 70

p q r s
4. The number of permutations which can be formed 11. The number of divisors of a b c d where a, b, c, d
out of the letters of the word "SERIES" taking three are primes & p, q, r, s  N, excluding 1 and the
letters together, is: number itself, is:
(1) 120 (2) 60 (1) p q r s
(3) 42 (4) none (2) (p + 1) (q + 1) (r + 1) (s + 1)  4
(3) p q r s  2
5. If all the letters of the word "QUEUE" are arranged (4) (p + 1) (q + 1) (r + 1) (s + 1)  2
in all possible manner as they are in a dictionary,
12. How many divisors of 21600 are divisible by 10 but
then the rank of the word QUEUE is:
th th not by 15?
(1) 15 (2) 16 (1) 10 (2) 30
th th
(3) 17 (4) 18 (3) 40 (4) none
 2

5 7 3 2
13. The sum of the divisors of 2 . 3 . 5 . 7 , is 19. The value of C is given by -
6 8
(1) 2 . 3 . 5 . 7
4 3 6 8 4 3
(2) 2 . 3 . 5 . 7 – 2 . 3 . 5 . 7 n (n  3) (n  4) n (n  4) (n  5)
(1) (2)
6 8 4 3 2 2
(3) 2 . 3 . 5 . 7 – 1 (4) none of these
n (n  5) (n  6)
(3) (4) None of these
2
14. The number of ways in which 6 red roses and 3
white roses (all roses different) can form a garland
20. If n = 10 then the value of C + D is-
so that all the white roses come together, is
(1) 240 (2) 360
(1) 2170 (2) 2165
(3) 2160 (4) 2155 (3) 420 (4) 540

15. Number of ways in which 2 Indians, 3 Americans, 3 Match the Column Type Questions (21 to 22)
Italians and 4 Frenchmen can be seated on a circle,
if the people of the same nationality sit together, is: 21. The value of n if
2 2 3 Column-I Column-II
(1) 2. (4 !) (3 !) (2) 2. (3 !) . 4 !
3 (A) n + 4Cn + 1 – n + 3Cn = 15 (n + 2) (P) 6
(3) 2. (3 !) (4 !) (4) none (B) (11)n P4 = (20)(n – 2 P4) (Q) 10
(C) 2nC3 = 11nC3 (R) 16
One or More Than One Type Questions (16 to 18)
(D) 14Cn – 2, 14Cn – 1, 14Cn are in A.P. (S) 27
16. There are n lines in a plane. no two of which are
parallel and no three of concurrent. Let plane be (1) A  S; B  R; C  P; D  P, Q
divided in Un parts. Then (2) A  R; B  S; C  P; D  Q
(1) U4 = 11 (2) U3 = 7 (3) A  R; B  P; C  Q; D  S
(3) U2 = 3 (4) Un = Un – 1 + 4 (4) A  S; B  R; C  P; D  Q

17. The value of 't' which satisfies (t – [|sinx|]) ! = 3! 5! 22. Consider all possible permutations of the letters of
7! is/are- the word ENDEANOEL.
(1) 9 (2) 10 Match the statement/Expressions on the left with the
(3) 11 (4) 12 Statements/Expressions on the right
Column-I Column-II
18. If N is the number of three digit numbers of the (A) The number of permutations (P) 5!
from a b c such that a < b < c containing the word ENDEA is
(1) N is an even number
(B) The number of permutations in (Q) 2 × 5!
(2) N is divisible by 7 which the letter E occurs in the
(3) N = 10C4 – 9C4 first and the last position is
(4) N is divisible by exactly by exactly three primes (C) The number of permutations in (R) 7 × 5!
which none of the letters D, L,
Passage Type Questions (19 to 20) N occurs in the last five positions is
There is a convex polygon of n sides (n > 8). The
(D) number of permutations in (S) 21 × 5!
Number of quadrilateral having three, two and one which the letters A, E, O occur
side common with polygon are represented by A, B only in odd position is
and C respectively, Also D represents the number of (1) A  P; B  Q; C  R; D  S
quadrilateral having vertices at the vertices of
(2) A  P; B  S; C  Q; D  Q
polygon and at least one side common with sides of
(3) A  R; B  P; C  Q; D  S
polygon, then answer the following questions:
(4) A  S; B  R; C  P; D  Q
 3

Integer Type Questions (23 to 25)

23. Exponent of 3 in 20 ! is -

24. Number of zeros at the end of 45! is -

25. A person writes letters to five friends and addresses

on the corresponding envelopes. In how many ways
can the letters be placed in the envelopes so that at
least four of them are in the wrong envelopes?
 4

Answer key
1. (2) 14. (3)
2. (3) 15. (2)
3. (2) 16. (1, 2)
4. (3) 17. (2, 3)
5. (3) 18. (1, 2, 3, 4)
6. (1) 19. (2)
7. (1) 20. (2)
8. (2) 21. (1)
9. (2) 22. (2)
10. (4) 23. (8)
11. (4) 24. (10)
12. (1) 25. (89)
13. (4)
 5

Hints and Solutions

1. (2) 6. (1)
10
The number of ways = C3 × 3 ! = 720 5!
= = 10
2!3!
2. (3) 5!
First we select 4 consonant out of 7 consonant and = = 20
3!
2 vowel out of 4 vowel then arranging
7 4 5!
Hence total number of ways = C4 × C2 × 6! = = 30
2!2!
= 210 × 720 = 151200
Hence sum of unit places is
3. (2) 2 × 10 + 3 × 20 + 4 × 30 = 200
Number of bowlers = 4 Hence required sum is
Number of wicketkeeper = 2 5 4 3 2 1 0
= 200 × (10 + 10 + 10 + 10 + 10 + 10 )
Total number of required selection
4 2 10 4 2 10 4 2 10 = 200 × (111111) = 22222200
= C3 . C1 . C7 + C4 . C1 . C6 + C 3 . C2 . C6 +
4 2 10
C4 . C 2 . C5 7. (1)
= 960 + 420 + 840 + 252 4!
Total number of ways = 3! × = 4!
= 2472 3!

4. (3)
8. (2)
SERIES
S - 2, E - 2 , R, 
case-I when all letter distinct is 9!
4 Total arrangement is
C3 × 3 ! = 4 × 6 = 24 2!.2!
case-II = 90720
when 2 letters are same
2 3 3! 9. (2)
C1 . C 1 × = 2 . 3 . 3 = 18
2! 4 2 2
94864 = 2 . 7 . 11
total number is 24 + 18 = 42 5.3.3 1
number of ways = = 23
2
5. (3)
Word QUEUE
E  2, Q, U - 2 10. (4)
= 12 Factorizing the given number, we have
3 2 2
4! 38808 = 2 . 3 . 7 . 11
The total number of divisors of this number is
2!
same as the number of ways of selecting some or
=3 all of three 2’s, two 3's, two 7’s and one 11.
3! Therefore, the total number of divisors
2! = (3 + 1) (2 + 1) (2 + 1) (1 + 1) = 72
=1 Hence, the required number of proper divisors
th = 72 – 2 = 70
=1 17 rank
 6

11. (4) 17. (2, 3)

Total number of requried divisors is (t – [ | sinx |]) ! = 3! 5! 7!
(p + 1) (q + 1) (r + 1) (s + 1) – 2 
If x = n + (n  I)
2
12. (1) then (t – 1)! = 3! 5! 7!  (t – 1) ! = 10 !
 t – 1 = 10  t = 11
5 3 2
Here 21600 = 2 . 3 . 5
4 3 1 
(2 × 5) × 2 × 3 × 5 If x  n + (n  I) then
Now numbers which are divisible by 10 2
= (4 + 1)(3 + 1)(1 + 1) = 40 (t – 0) ! = 10 !  t = 10
4 2 1
(2 × 3 × 5) × (2 × 3 × 5 ) now numbers which are
18. (1, 2, 3, 4)
divisible by both 10 and 15
a b c a b c
= (4 +1)(2 +1)(1+1) = 30
So the numbers which are divisible by only 10 but If we fix 'a ' then we can choose b and c from the
not by 15 = 40 – 30 = 10 remaining digits ( order of b and c is field)
a b, c
8
1 C2
13. (4) 7
5 7 3 2 2 C2
sum of the divisors of 2 . 3 . 5 . 7 3 6
C2
0 1 2 3 4 5 0 1 7 0
(2 + 2 + 2 + 2 + 2 + 2 ) (3 + 3 + ......+ 3 ) (5 5
4 C2
1 2 3 0 1 2 3
+ 5 + 5 + 5 ) (7 + 7 + 7 + 7 ) . .
. .
14. (3) . .
2
6! 3! 7 C2
Total number of ways is = 720 × 3 = 2160 Then,
2!
N  8C2 7 C2 6 C2  ....  2C2
15. (2)  84
Indians - 2 (1) N is an even number
Americans - 3 (2) N is divisible by 7.
Italians - 3 (3) N = 10
C4 9 C4  84
Frenchmen - 4 (4) N = 84 = 22  3  7
number of ways of arranged in a row. while Divisible by exactly 3 primes
persons of same nationality are together is Note : We can not take a = 0, otherwise it will bot
= 3 ! × 2! × 3! × 3! × 4 ! be a 3-digit number.
3
= 2 . (3!) . 4!
19. (2)
16. (1, 2) Number of selection of 4 vertices of the polygon
The nth line will rise to n additional parts when Un out of which only two are consecutive
– 1 parts are already there. n (n  4) (n  5)
= n × n–4C2 = .
 Un = Un – 1 + n  Choice (4) is incorrect. 2
Again U0 = 1, U1 = 2
We easily get
U2 = 4, U3 = 7, U4 = 11
 7

20. (2) 169  (169) 2  4  9  400

And using results obtained in above solutions we n
2(9)
get
169  119
D=A+B+C n
n (n  4)( n  5)
18
 D = n + n(n – 5) + 25
2 n , n  16
n 9
= (n – 3) (n – 4)
2 (C) 2n
C3  11 n C3
C+D=
n
(n – 4) (n – 5) +
n
(n – 4) (n – 3) 2n(2n  1) (2n  2) n(n  1)(n  2)
2 2  11.
3 . 2. 1 3. 2. 1
n
= (n – 4) {2n – 8} 2(2n  1). 2(n  1)  11 (n  1)(n  2)
2
= 360 (If n = 10). 8n  4  11n  22
n6
21. (1) (D) If a, b, c are in A.P. then 2b  a  c
n 4 n 3
Cn 1  Cn  15(n  2)  2 14
Cn 1 14 Cn 2 14 Cn
n4 n 3
Cn  n 3Cn  15(n  2)
n 1 14! 14! 14!
2  
 n n n 1  (15  n)!(n  1)! (16  n)!(n  2)! n!(14  n)!
 Cr  r Cr 1 
 
n4  n 3 2 1 1
  1 Cn  15(n  2)  
 n 1  (15  n)(n  1) (16  n)(15  n) n(n  1)
 n  4  n 1  n 3 2n(16  n)  n(n  1)  (16  n)(15  n)
  C3  15(n  2)
 n 1  n 2  16n  60  0
3 (n  3)(n  2)(n  1) (n  6) (n  10)  0
  15(n  2)
n 1 3  2 1 n  6, n  10
n  5n  6  30n  60
2

n 2  25n  54  0 22. (2)

(n  27) (n  2)  0 (A) ENDEA, N, O, E, L are five different letter
then permutation = 5!
n  2 n  27
(B) If E is in the first and last position then
n 2
(B) 11 n p4  20 P4 (9  2)! 7  6  5!
  21 5!
n! (n  2)! 2! 2
11  20
(n  4)! (n  6)! 4!
(C) For first four letters 
n(n  1) 2!
11  20
(n  4) (n  5) 5!
For last five letters = 
3!
11n 2  11n  20(n 2  9n  20)
4!  5!
9n 2  169n  400  0 Hence  2  5!
2!  3!
5! 5!
(D) For A, E and O  and for others 
3! 3!
 8

4! 25. (89)
And for others  5 5
2! Required number of ways = C1 D4 + C0 D5
5! 4!
Hence   2  5!  1 1 1 1
3! 2! = 5 × 4 ! 1      + 1 × 5 !
 1! 2 ! 3 ! 4 ! 
23. (8)  1 1 1 1 1
1       = 89
Exponent of 3 in 20!  1! 2 ! 3 ! 4 ! 5 ! 
 20   20   20 
  3    32    33  + ........
     
=6+2+0=8

24. (10)
Exponent of 2 in 45! is
 45   45   45   45   45 
 2  +  22  +  3 +  4 +  5 +
    2  2  2 
 45 
 26 
 
= 22 + 11 + 5 + 2 + 1 + 0 = 41
Exponent of 5 in 45! is
 45   45   45 
 5  +  52  +  53  = 9 + 1 + 0 = 10
     
So no. of zeros at the end of 45! is 10

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if