PERMUTATION AND COMBINATION 1

EXERCISE - 4 : PREVIOUS YEAR JEE ADVANCED QUESTIONS

Objective Questions I [Only one correct option]  Total number of ways  5  9  5  225
1. The number of arrangements of the letters of the word 3. The letters of the word COCHIN are permuted and all the
BANANA in which the two N’s do not appear adjacently, permutations are arranged in an alphabetical order as in
is (2002) an English dictionary. The number of words that appear
(a) 40 (b) 60 before the word COCHIN is (2007)
(c) 80 (d) 100 (a) 360 (b) 192
Ans. (a) (c) 96 (d) 48
Sol. Total number of arrangements of word BANANA Ans. (c)
6! Sol. Arrange the letters of the word COCHIN as in the order
  60
3!2! of dictionary CCHINO . Consider the words starting
The number of arrangements of words BANANA in which from C.

5! There are 5! such words.Number of words with the two

two N  s appear adjacently =  20
3! C's occupying first and second place = 4!

Required number of arrangements = 60- 20 = 40 Number of words starting with CH, CI, CN is 4! Each.

2. If r, s, t are prime numbers and p, q are the positive integers Similarly,number of words before the first word starting
such that LCM of p, q is r2s4t2, then the number of ordered with CO=4 !+4 !+4 !+4 !=96
pairs (p, q ) is (2006) The word starting with CO found first in the dictionary
(a) 252 (b) 254 is COCHIN. There are 96 words before COCHIN .
(c) 225 (d) 224 4. The number of seven digit integers, with sum of the digits
Ans. (c) equal to 10 and formed by using the digits 1,2 and 3 only,
is (2009)
Sol. Since, r, s, t are prime numbers.
(a) 55 (b) 66
 Selection of p and q are as under
(c) 77 (d) 88
p q Number of ways Ans. (c)
r0 r2 1 way Sol. There are two possible cases
1 2
r r 1 way Case I Five 1 's, one 2 's, one 3 's
2 0 1 2
r r ,r ,r 3 ways
7!
Number of numbers   42
 Total number of ways to select, r  5 5!
Selection of s as under
Case II Four 1 s, three 2 s

p q Number of ways 7!
s0 s4 1 way Number of numbers   35
4!3!
s1 s4 1 way
 Total number of numbers  42  35  77
s2 s4 1 ways
5. The total number of ways in which 5 balls of different
s3 s4 1 ways
colours can be distributed among 3 persons so that each
s4 s 0 , s1 , s 2 , s3 , s 4 5 ways person gets atleast one ball is (2012)

 Total number of ways to select s  9

Similarly,the number of ways to select t  5
 2 PERMUTATION AND COMBINATION
(a) 75 (b) 150 Sol. Given that there is at most one boy in the group of 
(c) 210 (d) 243  the selection of members team has 2 possibilities.
Ans. (b)
They are  i  All four members are girls
Sol. Description of Situation Here, 5 distinct balls are distributed
amongst 3 persons so that each gets at least one ball. i.e. (ii) 3 girls and 1 boy
Distinct  Distinct
From (i) ,we can have 6 C4 ways  15 ways
So, we should make cases
From  ii  ,we can select 6 C3 4 C1  80 ways
A B C A B C
Case I  Case II 
1 1 3 1 2 2  we can select 4 members in 95 ways
Number of ways to distribute 5 balls Captain can be selected from the group of 4 members
in 4 C1  4 ways
 3!   3! 
  5 C1 .4 C1 .3 C3     5 C1 .4 C2 .2 C2  
 2!   2!   the number of ways of selecting team of 4 members
including selection of captain is 95  4  380
=60 + 90 = 150
8. Let S = {1, 2, 3,…..,9}. For k = 1, 2,…..,5, let Nk be the
6. Six cards and six envelopes are numbered 1,2,3,4,5,6 and
number of subsets of S, each containing five elements
cards are to be placed in envelopes so that each envelope
out of which exactly k are odd. Then
contains exactly one card and no card is placed in the
N1 + N2 + N3 + N4 + N5= (2017)
envelope bearing the same number and moreover the card
numbered 1 is always placed in envelope numbered 2. (a) 125 (b) 210
Then the number of ways it can be done is (2014) (c) 252 (d) 126
(a) 264 (b) 265 Ans. (d)
(c) 53 (d) 67
Sol. N1  5 C1 4 C4  5
Ans. (c)
Sol. Number of de-arrangements of 6 N 2  5 C2 4 C3  40
N 3  5 C3 4 C 2  60
 1 1 1 1 1 1
 6!1        N 4  5 C 4 4 C1  20
 1! 2! 3! 4! 5! 6! 
N 5  5 C5  1
= 360-120 +30- 6 +1
 N1  N 2  N 3  N 4  N 5  126
= 265
9. Consider 4 boxes, where each box contains 3 red balls
Out of these de-arrangements, there are five ways in which
and 2 blue balls. Assume that all 20 balls are distinct. In
card numbered 1 is going wrong.
how many different ways can 10 balls be chosen from
So, when it is going in envelope numbered 2, these 4 boxes so that from each box at least one red ball
and one blue ball are chosen? (2022)
265
Total number of ways   53ways (a) 21816 (b) 85536
5
(c) 12096 (d) 156816
7. A debate club consists of 6 girls and 4 boys. A team of 4
Ans. (a)
members is to be selected from this club including the
selection of a captain (from among these 4 members) for Sol.
the team. If the team has to include at most one boy, then
the number of ways of selecting the team is (2016)
(a)  (b)  Case-I : when exactly one box provides four balls (3R 1B
or 2R 2B)
(c) 2 (d) 
C 4  3 C1  2 C1   4
5 3
nsa Number of ways in this case
 PERMUTATION AND COMBINATION 3

Case-II : when exactly two boxes provide three balls (2R

m (n + p)! n!
1B or 1R 2B) each Ci × ×
p ! n ! (n  p + i )!( p  i )!
 C3  1  C1  2 C1   6
5 2 3 2
Number of ways in this case
Required number of ways = 21816 m Ci . n+ p
Cp . n Cp-i { m Ci . n Cp-i = m+ n
Cp }
Language ambiguity : If we consider at least one red ball n+p
and exactly one blue ball, then required number of ways is f ( m, n, p ) = Cp . m+n Cp
9504. None of the option is correct.
f ( m, n, p ) m +n
Objective Questions II [One or more than one correct option] n+p
= Cp
Cp
10. For non-negative integers s and r, let
Now
 s!
s  if r  s, m+n
=
   r !( s  r )! f ( m, n, p )
r  if  s g ( m, n ) =  n+p
Cp
 0 p=0

For positive integers m and n, let m+n

g (m, n)=  m+n Cp
m+n
f ( m, n, p) p=0
g (m, n)  
P=0 n+ p
where for any nonnegative
  g (m, n) = 2m+n
 p 
(A) g(m,n) = g(n,m)
integer p,
(B) g(m,n + 1)= 2m+n+1
 m  n + i  p + n 
p
f (m, n, p ) =     
i =0  i  p  p  i  g (m + 1, n) = 2m +1+n

Then which of the following statements is/are TRUE? ( D) g (2m, 2n) = 22m+2n
(2020)
(a) g ( m, n) = g ( n, m) for all positive integers m,n  (2m  n )2

(b) g ( m, n + 1) = g ( m + 1, n) for all positive integers m,n = ( g (m, n))2

(c) g (2m, 2n) = 2 g (m, n) for all positive integers m,n 11. Let S1   i, j, k  : i, j, k  1, 2,...,10 ,

(d) g (2m, 2n) = ( g (m, n)) 2 for all positive integers m,n
S2   i, j :1  i  j  2  10, i, j  1, 2, ....,10 ,
Ans. (a,b,d)
Sol. Solving S3   i, j, k, l  :1  i  j  k  l, i, j, k, l  1, 2,..., 10

And S4   i, j, k, l  : i, j, k and l are distinct elements

p
f ( m, n, p) =  m Ci n+i
Cp . p+n Cp-i
in 1, 2, ..., 10.
i =0

m n+i p+n
Ci . Cp . C p-i
If the total number of elements in the set Sr is

m (n + i )! (n + p )! n r , r  1, 2, 3, 4. then which of the following statement

Ci . ×
p !(n  p + i )! ( p  i )!( n + i)! is (are) TRUE? (2021)
(a) n1 = 1000 (b) n2 = 44
m (n + p)! 1
Ci × × n4
p! (n  p + i )!( p  i)! (c) n3 = 220 (d)  420
12
Ans. (a,b,d)
 4 PERMUTATION AND COMBINATION

Sol. Number of elements in S1  10  10  10  1000 Ans. (625)

Sol. For a number divisible by 4,
Number of elements in S2  9  8  7  6  5  4  3  2  44
we should have last two digits to be divisible by 4 hence
in our case all 5 digit numbers which ends with
Number of elements in S3  10 C4  210
12, 24,32, 44 or 52 .
Number of elements in S4  10 P4  210  4!  5040
So, 53  5  625
Numerical Value Type Questions
15. Five persons A,B,C,D and E are seated in a circular
12. Let n be the number of ways in which 5 boys and 5 girls arrangement. If each of them is given a hat of one of the
can stand in a queue in such a way that all the girls stand three colours red, blue and green, then the numbers of
consecutively in the queue. Let m be the number of ways ways of distributing the hats such that the person seated
in which 5 boys and 5 girls can stand in a queue in such in adjacent seats get different coloured hats is (2019)
a way that exactly four girls stand consecutively in the
Ans. (30.00)
m
queue. Then the value of is (2015) Sol. Maximum number of hats used of same colour are 2. They
n
can not be 3 otherwise atleast 2 hats of same colour are
Ans. (5) consecutive.
Sol. n  5! 6! [considering 5 girls as 1 unit] number of ways Now, Let hats used are R, R, G, G, B
to choose and arrange 4 girls  5C4  4! (Which can be selected in 3 ways. It can be RGGBB or RRGBB
also)
consider 4 girls as1unit  Now, numbers of ways of distributing blue hat (single one) in 5

1left girl as1unit  These should not be together person equal to 5

Arrange 5 boys in 5! ways 6 space can be filled in 6C2  2! Let blue hat goes to person A.

ways

total number of ways  m   5C4  4! 5! 6 C2  2!

m 5! 15  2  5!
  5
n 5! 6!
13. Words of length 10 are formed using the letters A, B, C, D,
E, F, G, H, I, J. Let x be the number of such words where no
letter is repeated; and let y be the number of such words
where exactly one letter is repeated twice and no other Now either position B & D are filled by green hats and C & E are
y filled by Red hats or B & D are filled by Red hats and C & E are
letter is repeated. Then,  (2017) filled by Green hats
9x
 2 ways are possible
Ans. (5)
Hence total number of ways = 3 × 5 × 2 = 30 ways
Sol. x  Arrangement of 10 letters at 10 places =10 !
16. An engineer is required to visit a factory for exactly four
y  One letter is selected and repeated twice days during the first 15 days of every month and it is
mandatory that no two visits take place on consecutive
 y  10 C1  9 C8 10!/ 2!  50  9  9! days. Then the number of all possible ways in which such
visits to the factory can be made by the engineer during
y 50  9  9! 1-15 June 2021 is _____. (2020)
  5
9x 9  10! Ans. (495.00)
14. The number of 5 digit numbers which are divisible by 4, Sol. Selection of 4 days out of 15 days such that no two of them
with digits from the set {1, 2, 3, 4, 5} and the repetition of are consecutive
digits is allowed, is _______. (2018)
= 15-4+1C4 = 12 C4
PERMUTATION AND COMBINATION 5

contianing the word ENDEA, is

12 × 11× 10 × 9
= = 11× 5 × 9 = 495 (B) The number of permutations in (q) 2 × 5!
4 × 3× 2
which the letter E occurs in the
17. In a hotel, four rooms are available. Six persons are to be
accommodated in these four rooms in such a way that first and the last positions, is
each of these rooms contains at least one person and at (C) The number of permutations in (r) 7 × 5!
most two persons. Then the number of all possible ways which none of the letters D, L, N
in which this can be done is _____ . (2020)
occurs in the last five positions, is
Ans. (1080.00)
(D) The number of permutations in (s) 21 × 5!
6! which the letters A, E, O occur
Sol. Required ways = × 4! = 1080
2!2!1!1!2!2! only in odd positions, is
18. The number of 4-digit integers in the closed interval [2022, The correct matching is :
4482] formed by using the digits 0, 2, 3, 4, 6, 7 is
(a) ( A-p; B-s; C-q; D-q )
____________. (2022)
(b) ( A-s; B-p; C-q; D-q )
Ans. (569.00)
(c) ( A-q; B-s; C-q; D-p )
Sol. (d) ( A-s; B-q; C-p; D-q )
Ans. (a)
Sol. A. If ENDEA is fixed word, then assume this as a single
letter.
Total number of letters  5
Total number of arrangements  5! .
B. if E is at first and last places, then total number of
permutations  7!/ 2!  21  5!
C. if D,L,N are not in last five positions
 D,L, N, N   E, E, E, A, O 

4! 5!
Total number of permutations    2  5!
2! 3!

D. Total number of odd positions =5

5!
Permutations of AEEEO are
Number of 4 digit integers in [2022,4482] 3!
= 5 + 24 + 180 + 216 + 144 = 569
Total number of even positions  4
Match the Following
Each question has two columns. Four options are given 4!
 Number of permutations of N, N, D, L 
representing matching of elements from Column-I and 2!
Column-II. Only one of these four options corresponds
to a correct matching.For each question, choose the option 5! 4!
 Total number of permutations  
corresponding to the correct matching. 3! 2!
19. Consider all possible permutations of the letters of the  2  5!
word ENDEANOEL. (2008)
20. In a high school, a committee has to be formed from a
(A) The number of permutations (p) 5! group of 6 boys M1, M2, M3, M4, M5, M6 and 5 girls G1, G2,
G3, G4, G5.
(i) Let 1 be the total number of ways in which the
committee can be formed such that the committee has 5
members, having exactly 3 boys and 2 girls.
 6 PERMUTATION AND COMBINATION

(ii) Let  2 be the total number of ways in which the Using the following passage, solve Q.21 and Q.22
committee can be formed such that the committee has at Passage
least 2 members, and having an equal number of boys Let an denote the number of all n-digit positive integers
and girls. formed by the digits 0, 1 or both such that no consecutive
digits in them are 0. Let bn = The number of such n-digit
(iii) Let  3 be the total number of ways in which the
integers ending with digit 1 and cn = The number of such
committee can be formed such that the committee has 5 n-digit integers ending with digit 0. (2012)
members, at least 2 of them being girls.
21. Which of the following is correct ?
(iv) Let  4 be the total number of ways in which the (a) a17 = a16 + a15 (b) c17  c16 + c15
committee can be formed such that the committee has 4 (c) b17  b16 + c16 (d) a17 = c17 + b16
members, having at least 2 girls and such that both M1
and G1 are NOT in the committee together. (2018) Ans. (a)

Column A Column B Sol. a1  1  1

(A) The value of 1 is (P) 136
a2  10,11  2
(B) The value of  2 is (Q) 189
a3  101,110,111  3
(C) The value of  3 is (R) 192
and so on.
(D) The value of  4 is (S) 200
Thus we have, an  an 1  an  2 for n  3
(T) 381
(U) 461 so a17  a16  a15
The correct matching is : Also, we can observe,
(a) (A–S; B–U; C–T; D–Q) bn  bn 1  bn  2
(b) (A–U; B–S; C–T; D–Q)
and cn  cn 1  cn  2 for n  3
(c) (A–T; B–U; C–S; D–Q)
(d) (A–Q; B–T; C–U; D–S) we know, an  bn  cn
Ans. (a) hence option (b), (c), (d) are not true.
Sol. α1  6 C3  5 C2  20 10  200 22. The value of b6 is
(a) 7 (b) 8
α 2  C1 . C1  C2 . C2  C3 . C3  C4 . C4  C5 . C5
6 5 6 5 6 5 6 5 6 5
(c) 9 (d) 11
 30  150  200  75  6  461 Ans. (b)

α3  5 C2 .6 C3  5 C3 6 C2  5 C4 .6 C1  5 C5 Sol. b6  b5  b4

= 200 +150 +30 +1= 381   b4  b3   b4

α 4  1  4 C1 .5 C2  4 C2 .5 C1  4 C3   1   4 C 2 .5 C1  4 C3   2b4  b3

 2  b3  b2   b3
with G1 with M1
 3b3  2b2
  4 C 4  4 C 3 .5 C1  4 C 2 .5 C 2 
 3  b2  b1   2b2
neither M1 nor G1
 5 1  3 1 b2  1 and b1  1
 (40  30  4)  (34)  (1  20  60)
=8
 74  34  81  189