Permutation Reso Sheet

PSCMBGB200310
PART - I : SUBJECTIVE QUESTIONS
Hkkx- I : fo"k;kRed iz'u SUBJECTIVE QUESTIONS

Section (A) : Problem based on Problems, Arrangements of given objects/Selection of
given object (PCAD/PCSD)
[k.M(A):nhxbZoLrqvksadspquko]foU;klijvk/kkfjrleL;k,
A-1.
How many 3 digit even numbers can be formed using the digits 1, 2, 3, 4, 5 (repetition allowed)?
vadks1, 2, 3, 4, 5dhlgk;rkls 3vadksdhfdruh le la[;k, cukbZ tkldrh gSa ;fn vadks dh iqujko`fk gks ldrh
gSA
Sol.
Ans. 50
Total even numbers
(numbers whose unit digit is 2)
2
5
= 25
(numbers whose unit digit is 4)
4
5 5
on adding = 50
Hindi.
= 25
dqy le la[;k,
(la[;k, ftuds bdkbZ dk vad 2 gS)
2
5
= 25
(la[;k, ftuds bdkbZ dk vad 4 gSA)
4
5
= 25
tksM+usij=50
A-2.
There are 10 buses operating between places A and B. In how many ways a person can go from place
A to place B and return to place A, if he returns in a different bus?
nks LFkkuksa AvkSj B dschp 10 cls lapkfyr gksrh gSaA ,d O;fDr LFkku A ls LFkku B ij tkdj okil LFkku Aij
fdrus rjhdksa ls vk ldrk gS ;fn og okilh esa nwljh cl dk mi;ksx djsaA

Sol.
A-3.
Ans. 90
10 9 = 90
The digits from 0 to 9 are written on slips of paper and placed in a box. Four of the slips are drawn at
random and placed in the order. How many out comes are possible?
dkxt dh ifpZ;ksa ij 0 ls 9 rd vad fy[kdj ,d cDls esa Mky nh tkrh gSA cDls esa ls ;kn`fPNd :i ls 4 ifpZ;k
fudkydj els j[kh tkrh gSaA lEHkkforurhtksa dh la[;k fdruh gksxh \

Sol.
A-4.
Sol.
Ans.
10P
4
10
P4
Find the number of 6 digit numbers that ends with 21 (eg. 537621), without repetition of digits.
vadksdh fcukiqujko`fkds6 vadksdhfdruhla[;k, cukbZtkldrhgS]tks21lslekIrgksrh gS\(eg.537621)
Ans. 7. 7P3
Total number of 6 digit number that ends with 2, 1
6 vadksadhdqyla[;k;satks21 lslekIrgksrhgSA
RESONANCE
PERMUTATION & COMBINATION - 1
i.e.
Hence total number of ways is
7 7 6 5 = 7 7P 3
dqy rjhdksa dh la[;k = 7 7 6 5 = 7 7P3
A-5.
Sol.
A-6.
A coin is tossed n times, then find the number of possible outcomes.

,d flDds dks n ckj mNkyus ij izkIrurhtksa dh la[;k fdruh gksxh\
Ans. 2n
When a coin is tossed one times the number of out comes in 2.
When a coin is tossed two times the number of out comes in 22.
When a coin is tossed n-times the number of out comes in 2n.
tc ,d flDds dks ,d ckj mNkyk tk;s rks dqy 2 fLFkfr;k lEHko gS
tc,d flDdsdks nksckjmNkyktk;s rksdqy 22 fLFkfr;klEHko gS
tc ,d flDds dks n-ckj mNkyk tk;s rks dqy 2n fLFkfr;k lEHko gS
(i)
If
1
1
x
+
=
, find 'x'.
9!
10 !
11!
1
;fn 9 ! + 10 ! = 11! gks] rks 'x' dk eku Kkr dhft,A

(ii)
Ans.
Sol.
A-7.
If nP5 = 42. nP3, find 'n'.

;fn nP5 = 42. nP3, gks] rks 'n' dk eku Kkr dhft,A
(i)
121.
(ii)
10
(i)
10
1
x
10 ! 10 ! 11!
11
x
10! 11.10!
(ii)
n!
n!
= 42 .
(n 5)!
(n 3)!
(n 3) (n 4) = 7 6
x = 121
76
n = 10
How many words can be formed by using all the letters of the word 'MONDAY' if each word start with a
consonant.
'MONDAY' 'kCn ds lHkh v{kjksa dk mi;ksx djrs gq, fdrus 'kCn cuk, tk ldrs gSa tcfd izR;sd 'kCn ,d O;atu
(consonant)lsizkjEHkgksrkgSA
Ans. 480
Sol.
Hence total number of ways.
= 425 = 4 120 = 480
vr% dqy rjhdksa dh la[;k = 425 = 4 120 = 480

A-8.
Sol.
Find the number of natural numbers from 1 to 1000 having none of their digits repeated.
1 ls1000 rd,slhizkd`rla[;kvksadhla[;kKkrdhft,ftuesa,dHkhvaddhiqujko`fkughagksrhgSA
Ans. 738
Number of one digit numbers = 9
Number of 2 digits numbers = 9 9 = 81
Number of 3 digits numbers = 9 9 8 = 648
RESONANCE
total numbers = 9 + 81 + 648 = 738

Hindi.
,d vad dh la[;kvksa dh la[;k = 9

2 vadksa dh la[;kvksa dh la[;k= 9 9 = 81
3 vadksa dh la[;kvksa dh la[;k= 9 9 8 = 648
dqy la[;k, = 9 + 81 + 648 = 738
A-9.
(i)
(ii)
(iii)
Sol.
Ans.
(i)
If nC3 = nC5, find the value of nC2.

;fn nC3 = nC5 gks]rks nC2 dk eku Kkr dhft,A
If 2nC3 : nC3 = 11 : 1, find 'n'.
;fn 2nC3 : nC3 = 11 : 1 gks] rks 'n' dk eku Kkr dhft,A
If n 1Cr : nCr : n + 1Cr = 6 : 9 : 13, find n & r.
;fn n 1Cr : nCr : n + 1Cr = 6 : 9 : 13 gks] rks n vkSj r ds eku Kkr dhft,A
(i)
28
(ii)
6
(iii)
n = 12, r = 4.
Hence pwafdnC3 = nC5
n!
n!
= 5! (n 5 )!
3! n 3
5 4 3! n 5 ! = 3! (n 3) (n 4) (n 5)!
(n 3) (n 4) = 5 4
n3=5
n=8
Hence vr
(ii)
2n C
% nC2 = 8C2 =
87
= 28
1 2
: nC3 = 11 : 1
2n!
3! n! 3
11
=
3! (2n 3)!
n!
1
2n! (n 3)!
11
n! (2n 3 )! = 1
2. (2n 1) . 2 (n 1) = 11 (n 1) (n 2)
8n 4 = 11 n 22
3n = 18
(iii)
n1C
n 1
: nC r :
Cr
Cr
nr 6
n
9
n+1C
(n 1)!
(n r 1)!. (8 )! 6
(n)!
9
(n r )!. (r )!
2n = 3n 3r
n = 3r
Cr
9
=
n 1
Cr
13
n!
9
(n r ) !
(n 1) n!
13
(n 1 r ) (n r )!
RESONANCE
n=6
= 6 : 9 : 13
again iqu%
(n 1)!
6
(n r 1)!. (8)!
n(n 1)!
9
(n r )!. (n r 1)!
n!
9
r ! (n r )!
(n 1)!
13
r ! (n 1 r )!
2r 1 9
3r 1 13
3r 1 r
9
3r 1
13
26 r + 13 = 27 r + 9
r=4
n = 12
2r 1 9
3r 1 13
r=4
Section (B) : Problem based on Selection as well as arrangement of

objects/Rank of word (PCSR/PCSI)
[k.M(B):nhxbZ oLrqvksadspquko],oamudsfoU;klijvk/kkfjrleL;k,]fn;sx;s'kCndhojh;rkij
vk/kkfjrleL;k,
B-1.
Find the number of words those can be formed by using all letters of the word 'DAUGHTER', if all the
vowels must not be together.
'DAUGHTER' 'kCn ds lHkh v{kjksa dk mi;ksx djrs gq;s fdrus 'kCn cuk, tk ldrs gSa tcfd lHkh Loj (vowles)
,dlkFkuvk;sa\
Sol.
Hindi.
Ans. 36000
Total number of ways is if there is number condition is
8 ! = 40320
Again if all vowels are together i.e.
A E U DGHTR.
so total number of ways = 6 ! 3 ! = 4320
Hence total number of ways if all vowels all do not together is
40320 4320 = 36000 ways
dqyrjhdksadhla[;ktcfddksbZizfrcU/kughafn;kx;kgks
8 ! = 40320
;fnlHkhLoj,dlkFkgks
A E U DGHTR.
dqy rjhdksa dh la[;k = 6 ! 3 ! = 4320

vr% dqy rjhdksa dh la[;k tcfd lHkh Loj ,d lkFk u vk;saA
40320 4320 = 36000 ways
B-2.
A number lock has 4 dials, each dial has the digits 0, 1, 2, ........, 9. What is the maximum unsuccessful
attempts to open the lock?
,d la[;kRed rkys ds 4 Mk;y gSaA izR;sd Mk;y esa 0, 1, 2, ........, 9 rd vad gSaA rkys dks [kksyus ds vf/kdre
vlQy iz;klksa dh la[;k fdruhgksxh \

Sol.
Hindi.
Ans. 9999
Total unsuccessful attempts to open the lock is
= (total attempt successful attempt)
= 10 10 10 10 1 = 10000 1 = 9999
rkys dks [kksyus dh dqy vlQy iz;kl

= (dqy iz;kl & lQy iz;kl)
= 10 10 10 10 1 = 10000 1 = 9999
B-3.
If all the letters of the word 'AGAIN' are arranged in all possible ways & put in dictionary order, what is
the 50 th word?
;fn'AGAIN''kCndslHkhv{kjksadkslHkhlEHkorjhdksalsO;ofLFkrdj'kCndks"kdseesaj[kktk;s]rks50ok'kCn
dkSulkgksxk\
Ans.
Sol.
NAAIG
= 24 ways rjhds
= 12 ways rjhds
RESONANCE
= 12 ways rjhds
and
here ;gka
B-4.
50th
NAAIG
How many different permutations are possible using all the letters of the word MISSISSIPPI, if no two
's are together?
'kCn MISSISSIPPI ds lHkh v{kjksa dk mi;ksx djrs gq;s dqy fdrus 'kCn cuk, tk ldrs gSa] ;fn dksbZ Hkh nks
lkFk&lkFkughavk;sa\
Sol.
Ans. 7350
Total no. of M are = 1
Total no. of are = 4
Total no. of P are = 2
Total no. of S are = 4
First we arrange all the words other than 's are
7!
765
105
2! 4!
1 2
Now, there are 8 places which can be fulfilled by I's i.e. the number of ways is 8C4
105 8 7 6 5
Total required no. = 105 8C4 =
1 2 3 4
= 105 70 = 7350
Hindi. M dh dqy la[;k = 1
dh dqy la[;k= 4
P dh dqy la[;k= 2
S dh dqy la[;k= 4
igysgeIdksNksM+djlHkhv{kjksadksO;ofLFkrdjrsgSaA
7!
765
105
2! 4!
1 2
vc8 LFkkucpsaxsatksfd}kjkHkjstkldrsgSabldsrjhdksadhla[;k8C4
dqy vHkh"V 'kCnksa dh la[;k = 105 8C4 =
105 8 7 6 5
1 2 3 4
= 105 70 = 7350
B-5.
Six persons meet in a room and each shakes hands with all the others. Find the total number of hand
shakes that took place.
6 O;fDr,ddejsesafeyrsgSvkSj,dnwljslsgkFkfeykrsgSa]rksgkFkfeyusdhizf;kdhdqyla[;kfdruhgksxh\
Ans. 15.
Sol.
gkFk feykus dh izf;k dh dqy la[;k = 6C2 =
B-6.
In how many ways we can select a committee of 6 persons from 6 boys and 3 girls, if atleast two boys
& atleast two girls must be there in the committee?
6 yM+dksvkSj3 yM+fd;ksaesals6 O;fDr;ksadh,dlfefrfdrusrjhdksalscukbZtkldrhgS;fnlfefresadels
65
= 15
1 2
de nks yM+ds vkSj de ls de nks yM+fd;ksa dks vo'; 'kkfey fd;k tk;sA
Sol.
Ans. 65
case-I If select 4 boys and 2 girls
RESONANCE
Sol.
6C 3C = 15 3 = 45
4
2
case-II If select 3 boys and 3 girls
6C 3C = 20 1 = 20
4
3
Hence total number of ways
= 45 + 20 = 65
fLFkfr-I ;fn 4 yM+ds o 2 yM+fd;ka pquh tk;s
6C 3C = 15 3 = 45
4
2
fLFkfr-II ;fn 3 yM+ds o 3 yM+fd;ka pquh tk;s
6C 3C = 20 1 = 20
4
3
vr% dqy rjhdksa dh la[;k = 45 + 20 = 65
B-7.
In how many ways 11 players can be selected from 15 players, if only 6 of these players can bowl and
the 11 players must include atleast 4 bowlers?
15 f[kykfM+;ksaesals11f[kykfM+;ksadh,dVhefdrusrjhdksalspquhtkldrhgS;fnbuf[kykfM+;ksaesalsdsoy
6 f[kykM+hxsanckthdjldrsgSavkSj11 f[kykfM+;ksaesadelsde4 xsancktvo';'kkfeyfd;stk;saA
Ans. 1170
Sol.
Total No. of bowlers = 6
Now, (i) If 4 bowlers are including the no. of ways
selecting 11 players out of 15 players
= 6C4 9C7 = 15 36 = 540
(ii) If 5 bowlers are selected
= 6C5 9C6 = 6 84 = 504
(iii) If all 6 bowlers are selected
= 6C6 9C5 = 1 126 = 126
Hence total no. of ways = 540 + 504 + 126 = 1170
Hindi. dqy xsanckt = 6
(i) ;fn4xsanckt'kkfeyfd;stk;srks15f[kykfM+;ksaesals11 f[kykfM+;ksadsp;udsrjhds
= 6C4 9C7 = 15 36 = 540
(ii) ;fn5 xsanckt p;fur fd;s tkrs gSaA
= 6C5 9C6 = 6 84 = 504
(iii) ;fn 6 xsanckt p;fur fd;s tkrs gSaA
= 6C6 9C5 = 1 126 = 126
vr% dqy rjhds = 540 + 504 + 126 = 1170
B-8.
In a question paper there are two parts part A and part B each consisting of 5 questions. In how many
ways a student can answer 6 questions, by selecting atleast two from each part?
,diz'ui=kesanksHkkxgSHkkxAvkSjHkkxBrFkkizR;sdHkkxesa5iz'ugSaA,dNk=k6iz'uksadsmkjfdrusrjhdksa
ls ns ldrk gS ;fn mls izR;sd Hkkx esa ls de ls de nks iz'u vo'; p;u djus gSA
Sol.
Ans. 200
Total no. of selected question
Part A
Part B
2
4
3
3
4
2
Number of ways
5
C2 5C4 = 10 5 = 50
5
C3 5C3 = 10 10 = 100
5
C4 5C2 = 5 10 = 50
Total no. of ways = 200
Hindi.
dqyp;furiz'uksadhla[;k
HkkxA
HkkxB
2
3
4
4
3
2
rjhdksadhla[;k
5
C2 5C4 = 10 5 = 50
C3 5C3 = 10 10 = 100
5
C4 5C2 = 5 10 = 50
5
dqy rjhds = 200

B-9.
How many four digit natural numbers not exceeding the number 4321 can be formed using the digits 1,
RESONANCE
2, 3, 4, if repetition is allowed?
vad1,2,3,4 dhlgk;rklspkjvadksadhfdruhizkd`r la[;k, cukbZ tk ldrh gS tks4321 ls cM+hugha gks] tcfd

vadksdhiqujko`fkgksldrhgSaA
Sol.
Ans. 229
Total no. of ways
= 64
= 64
= 64
= 16
= 16
= 4
=1
Adding = 229
Hindi.
adqyrjhds
= 64
= 64
= 64
= 16
= 16
= 4
=1
atksM+usij=229
B-10.
A committee of 6 is to be chosen from 10 persons with the condition that if a particular person 'A' is
chosen, then another particular person B must be chosen.
10 O;fDr;ksaesals6 dh,dlfefrfdrusrjhdksalscukbZtkldrhgS;fn,dfo'ks"kO;fDr'A' dkspquktkrkgS]
rksnwljsfo'ks"kO;fDr'B' dksvo';pquukgksxk\
Ans. 154
RESONANCE
If A is not chosen, then number of selections = 9C6

If A is chosen, then B is also chosen, then number of selection = 8C4
number of ways = 9C6 + 8C4 = 154

Hindi. ;fnA dk p;u u gks] rks p;uksa dh la[;k = 9C6
;fn Adk p;u gks] rks Bdk Hkh p;u djuk gS] rks p;uksa dh la[;k= 8C4
dqy rjhds = 9C6 + 8C4 = 154

Sol.
B-11.
In how many ways a team of 5 can be chosen from 4 girls & 7 boys, if the team has atleast 3 girls.
4 yM+fd;ksa vkSj 7 yM+dksesa ls 5 dh,d Vhe fdrus rjhdksals pquhtkldrh gS;fnVhe esa dels de 3 yM+fd;k
vo';gks\
Sol.
Sol.
B-12.
Ans.
(i)
91
If 3 girls and 2 boys are selected
= 4C3 7C2 = 4 21 = 84
(ii)
If 4 girls and 1 boys are selected
= 4C 4 7C 1 = 1 7 = 7
Hence total number of ways = 84 + 7 = 91
(i)
;fn 3 yM+fd;ksa o 2 yM+dksa dk p;u fd;k tk;s = 4C3 7C2 = 4 21 = 84
(ii)
;fn 4 yM+fd;ksa o 1 yM+ds dk p;u fd;k tk;s = 4C4 7C1 = 1 7 = 7
vr% dqy rjhdksa dh la[;k = 84 + 7 = 91
In how many ways we can select 5 cards from a deck of 52 cards, if each selection must include
atleast one king.
52 ikksadh ,d xM~Mh esa ls 5 iks fdrusrjhdksals pqustk ldrsgSa;fnizR;sd p;u esa delsde,d ckn'kkg
vo'; vk;s\
Sol.
Sol.
B-13.
Ans. 886656
Total number of ways
= 4C1 48 C4 + 4C2 48 C3 + 4C3 48C2 + 4C4 48C1
= 4 194580 + 6 17276 + 4 1128
= 778320 + 103776 + 4512 + 1 48
= 886656
dqy rjhdksa dh la[;k = 4C1 48C4 + 4C2 48C3 + 4C3 48C2 + 4C4 48C1
= 4 194580 + 6 17276 + 4 1128
= 778320 + 103776 + 4512 + 1 48
= 886656
Find number of ways of selection of atleast one vowel and one consonant from the word TRIPLE
TRIPLE 'kCn ds v{kjksa esa ls de ls de ,d Loj rFkk ,d O;atu dk p;u fdrus izdkj ls dj ldrs gS\
Sol.
Ans. 45
Total number of ways out of 4 consonant and 2 vowels is
2C { 4C + 4C + 4C + 4C } + 2C { 4C + 4C + 4C + 4C }
1
1
2
3
4
2
1
2
3
4
= 2 {4 + 6 + 4 + 1} + 1 [4 + 6 + 4 + 1]
= 2 15 +15 = 45
Section (C) : Problem base on distinct and identical objects/devisors (PCTS/PCDV)

[k.M(C):nhxbZoLrqvksadsle:irFkkfHkUu&fHkUugksuslslEcfU/krleL;k
C-1_.
Let N = 24500, then find

(i)
The number of ways by which N can be resolved into two factors.
(ii)
The number of ways by which 5N can be resolved into two factors.
(iii)
The number of ways by which N can be resolved into two coprime factors.
ekuk N = 24500 rks Kkr djks:

(i)
murjhdksadhla[;k]ftuesaNdksnksxq.ku[k.Mksaesafo;ksftrfd;ktkldrkgS
(ii)
murjhdksadhla[;k]ftuesa5N dksnksxq.ku[k.Mksaesafo;ksftrfd;ktkldrkgS
RESONANCE
Sol.
(iii)
murjhdksadhla[;k]ftuesaN dksnkslg&vHkkT;xq.ku[k.Mksaesafo;ksftrfd;ktkldrkgS
Ans.
(i)
(i)
18
(ii)
N = 22 . 53 . 72
23
(iii)
3.4.3
18
2
(ii)
5N = 2 2 . 5 4 . 7 2
3.5.3 1
23
2
(iii)
C-2.
N = 22 . 53 . 72
23 1 = 4
Find number of ways in which one or more letter be selected from the letters AAAABBCCCDEF.
v{kjksa AAAABBCCCDEF esa ls ,d ;k vf/kd v{kjksa dk p;u fdrus izdkj ls fd;k tk ldrk gS\
Sol.
Ans. 479.
Total number of ways of selecting = 5 3 4 2 3 = 480.
But in the above count also includes that way in which no letter is selected, Since we are supposed to find
the number of ways in which at least one letter is selected, therefore the required numbers of ways
= 480 1 = 479.
Hindi.
p;u ds dqy rjhds = 5 3 4 23 = 480.

ijUrqmijksDrrjhdksaesaogrjhdkHkh'kkfeygSftlesadksbZHkhv{kjp;uesaughavk;kgSA
pwfd gesa os rjhds Kkr djus gS ftlesa de ls de ,d v{kj p;fur gqvk gSA
vr% dqy vHkh"V rjhds = 480 1 = 479.
C-3.
Find number of divisiors of 1980.

(i)
How many of them are multiple of 11 ? find their sum
(ii)
How many of them are divisible by 4 but not by 15.
1980 ds Hkktdksa dh la[;k Kkr dhft,] muesa ls fdrus 11 ds xq.kt gS\
(i)
(ii)
buesa lsfdrus 11 ds xq.ktgS] budk;ksx Hkh Kkr dhft,A

buesalsfdrus4 lsHkkT;ysfdu15 lsughaA
Ans.
Sol.
Sol.
36,
(i)
18, 11.(20 + 21 + 22) (30 + 3 + 32) (5 + 5)
(ii)
3.2 + 1.1.2 = 8
2
2
1980 = 2 . 3 . 5 . 11,
number of divisiors of 1980 = 36
(i)
3.3.2 = 18
sum = 11.(1 + 2 + 22)
. (1 + 3 + 32)
. (1 + 5)
(ii)
3.2 + 1.1.2 = 8
1980 = 22 . 32 . 5 . 11,
1980 ds Hkktdksa dh la[;k = 36
(i)
3.3.2 = 18
Hkktdksa dk ;ksx = 11.(1 + 2 + 22)
. (1 + 3 + 32)
. (1 + 5)
(ii)
3.2 + 1.1.2 = 8
Section (D) : Problem based on circular arrangement / Multinomial theorem (PCMT/PCCA)

[k.M (D):o`kh; ep; rFkk cgqinh; izes; ij vk/kkfjr leL;k,
RESONANCE
D-1.
There are 3 white, 4 blue and 1 red flowers. All of them are taken out one by one and arranged in a row
in the order. How many different arrangements are possible (flowers of same colurs are similar)?
3 lQsn] 4 uhys vkSj 1 yky Qwy esa ls ,d ds ckn ,d Qwy dks fudkydj mUgsa ,d iafDr esa O;ofLFkr fd;k tkrk
gSaA,slhfdruhfofHkUuO;oLFkk,lEHkogSa\lekujaxdsQwylekugSaA
Sol.
Ans. 280
Total number of possible arrangements are
8!
= 280
3! 4!
8!
dqy lEHko foU;klksa dh la[;k = 3! 4! = 280

D-2.
In how many ways 5 persons can sit at a round table, if two of the persons do not sit together?
,dxksyestdspkjksavksj5O;fDrfdrusrjhdksalscSBldrsgSa;fnbuesalsnksfo'ks"kO;fDr,dlkFkughacSBrs
g
Sa
A
Sol.
Ans. 12
First find if all the person are sitting in a round table is 4! = 24 ways
if two of the person are sitting together i.e.
3! 2! = 12 ways
Hence required number of ways = 24 12 = 12 ways
Sol.
;fnlHkhO;fDrxksyestdspkjksarjQcSBrsgSa]rksrjhdksadhdqyla[;k4! = 24rjhds
;fnnksfo'ks"kO;fDr,dlkFkcSBrsgSa]rksrjhdksadhla[;k=3! 2! =12rjhds
vr% vHkh"V rjhdksa dh la[;k = 24 12 = 12 rjhds
D-3.
In how many ways four men and three women may sit around a round table if all the women are
together?
pkjiq:"krFkkrhuefgyk,sa,dxksyestdspkjksavkSjfdrusizdkjlscSBldrsgSa]tcfdlHkhefgyk,salkFkesa
cSBsA
Sol.
Sol.
D-4.
Ans. 144
Total number of women are sit together then total number of person is 5 hence required ways = 4! 3!
= 24 6 = 144
lHkhefgykvksadks,dlkFkcSBkrsgq,O;fDr;ksadksxksyestdhpkjksvkSjcSBusdsdqyrjhds=4! 3!
= 24 6 = 144
Seven persons including A, B, C are seated on a circular table. How many arrangements are possible
if B is always between A and C?
A, B, C lfgr lkr O;fDr ,d xksy eSt ds pkjksa vkSj fdrus izdkj ls cSB ldrs gSa tcfd B lnSo ArFkkC ds
e/;cSBsA
Sol.
Sol.
Ans. 48
Here B is always between A and C so i.e. either ABC or CBA
so total required number of ways is 4! 2! = 24 2 = 48 ways
;fn B lnSo Ao C ds lkFk cSBrk gS rks ;k rks ABC ;k CBA
vr% dqy vHkh"V rjhdksa dh la[;k 4! 2! = 24 2 = 48 rjhds

D-5_.
In how many ways four '+' and five '' sign can be arranged in a circles so that no two '+' sign are
together.
pkj'+'rFkkikap'' fpUg~ksadks,do`kdspkjksavkSjfdrusizdkjlsO;ofLFkrfd;ktkldrkgS;fndksbZHkhnks
'+'fpUg~lkFkugksaA
Sol.
Sol.
Ans. 1
By simple diagram it is obvious that there is only one way.
ljy fp=k dh lgk;rk ls ;g Li"V gS fd ,slk ,d gh rjhdk lEHko gSA
RESONANCE
D-6.
In how many ways fifteen different items may be given to A, B, C such that A gets 3, B gets 5 and
remaining goes to C.
15 fofHkUuoLrqvksadks A, BrFkkCesafdrusizdkjlsckVktkldrkgS]tcfd Adks 3, Bdks 5rFkk'ks"koLrq,sa
CdksnsrsgksA
Ans. 360360
No. of ways 3 item can be given to A is 15C3
then no. of ways 5 item can be given to B is 12C5
Rest are given to C is 7C7
Hence total no. of ways if all item is given is
15
C3 12C5 7C7
= 455 792 1 = 360360
Hindi. A dks 3 oLrq, nsus ds dqy rjhds = 15C3
Sol.
rc B dks 5 oLrq,nsus dqy rjhds = 12C5

vr%'ks"kcphgqbZoLrq,C dks7C7rjhdslsnhtkldrhgSA
;fnlHkhoLrq,nhx;hgks]rksdqyrjhds
15
D-7.
C3 12C5 7C7
= 455 792 1 = 360360
Find number of ways of distributing 8 different items equally among two children.
8 fofHkUuoLrqvksadksnkscPpksaesaleku:ilsfdrusizdkjlsckVldrsgSA
Ans. 70
Total no. of ways = First distribute 4 items from 8
to a child, then remaining 4 item to other
= 8C 4 4C 4
= 70 1 = 70
Hindi. dqyrjhds= igys4oLrqvksadks8esals,dcPpsdksnsrsgaS]bldsi'pkr~cphgqbZ
Sol.
4oLrq,nwljscPPksdksnsrsgSaA
= 8C 4 4C 4
= 70 1 = 70
D-8.
Find number of negative integral solution of equation x + y + z = 12
lehdj.k x + y + z = 12 ds _.kkRed iw.kkd gyksa dh la[;k Kkr dhft,A

Ans. 55
Sol.
Here
10 x, y, z 1
Using multinomial theorem
Find the coefficient of x 12 in this expansion of
(x + x 2 + .......+ x 10)3
= x3 (1 + x + x 2 + .......+ x 9)3
= x3 (1 x10)3 . (1 x)3
11 10
= 11C9 =
= 55
2
Hindi. ;gk 10 x, y, z 1
cgqinh;xq.kuizes;dsiz;ksxls
(x + x2 + .......+ x10)3 ds izlkj esa x12 dk xq.kkad Kkr djus ij
D-9.
= x3 (1 + x + x 2 + .......+ x 9)3
= x3 (1 x10)3 . (1 x)3
11 10
= 11C9 =
= 55
2
In how many ways it is possible to divide six identical green, six identical blue and six identical red
among two persons such that each gets equal number of item?
N%,dlekugjh]N%,dlekuuhyhrFkkN%,d leku ykyoLrqvksadks nksO;fDr;ksaesafdrusizdkjlsckVldrs

gSa]tcfdizR;sdO;fDrlekula[;kesaoLrq,saizkIrdjrkgksA
Sol.
Ans. 37
x1 + x2 + x3 = 9
Coefficient of x9 in (1 + x + ...... + x 6)3
RESONANCE
Sol.
Coefficient of x9 in (1 x 7)3 (1 x)3

Coefficient of x9 in (1 3x 7) (1 x)3
= 9+31C2 3 . 2 + 3 1C2
= 55 18 = 37
x1 + x2 + x3 = 9
ds izlkj esa x9 dk xq.kkad (1 + x + ...... + x6)3
ds izlkj esa x9 dk xq.kkad (1 x7)3 (1 x)3

ds izlkj esa x9 dk xq.kkad (1 3x7) (1 x)3 = 9+31C2 3 . 2 + 3 1C2 = 55 18 = 37
D-10.
Find total number of positive integral solutions of 15 < x1 + x2 + x3 20.

15 < x1 + x2 + x3 20 ds dqy /kukRed iw.kkd gyksa dh la[;k Kkr dhft,A
Sol.
Ans. 685
x1 + x 2 + x 3 = 20 t
t = 0, 1, 2, 3, 4
4
Required value =
19 t
C2
t 0
Sol.
= 20C3 15C3
= 1140 455
= 685
x1 + x 2 + x 3 = 20 t
t = 0, 1, 2, 3, 4
4
vHkh"V eku =
19 t
t 0
C2 = 20C 15C = 1140 455 = 685

3
3
Section (E) : Problem based on geometry / Dearrangement / exponent of prime/ Principal

of exculusion/Grouping (PCGT/PCDA/PCGP)
[k.M (E): T;kfefr ij vk/kkfjr] vO;oLFkk ij] vHkkT; la[;k dh ?kkr] foHkktu dk fl)kUr@lewgdj.k
E-1_.
In how many ways 18 diffrent objects can be divided into 7groups such that four groups contains
3 objects each and three groups contains 2 objects each.
18 fofHkUuoLrqvksadks7lewgksaesafdrusizdkjlsfoHkkftrfd;ktkldrkgS;fnbuesals
4 lewgksaesalsizR;sdesa3,oa'ks"k3lewgksaesalsizR;sdesa2oLrq,gksa\
Ans.
18!
(3! ) . (2! )3 4! 2!
4
Sol.
18!
(3! ) . (2! )3 4! 2!
E-2.
(a)
(b)
(c)
In how many ways can five people be divided into three groups?
In how many ways can five people be distributed in three different rooms if no room must be empty?
In how many ways can five people be arranged in three different rooms if no room must be empty?
(a)
5O;fDr;ksasdks3lewgksaesafdrusizdkjlsfoHkkftrfd;ktkldrkgS\
(b)
5O;fDr;ksadks3fofHkUudejksaesafdrusizdkjlsckVktkldrkgS;fndksbZHkhdejk[kkyhujgs\
(c)
5O;fDr;ksadks3dejksaesafdrusizdkjlsO;ofLFkrfd;ktkldrkgS;fndksbZHkhdejk[kkyhujgs\
Sol.
Ans.
(a)
(a)
25
(b)
150.
(c)
720
five people can be divided into three groups in the following way ;
1, 1, 3 or
1, 2, 2
Hence, total number of ways
RESONANCE
(b)
1
1
5!
5!
2
2!
2!
3!
(2 ! )
= 10 + 15 = 25
The three different rooms can be filled in the following ways;
Room
People 1 1 3
or
Room
People 1 2 2
Number of ways = ways in which such groups can be formed ways in which the groups can be
arranged in the three different rooms
Case -
5! 1
Number of ways = 3 ! = 60
3 ! 2 !
Case -
5!
1
3 ! = 90
Number of ways =
2
2 !
(2 ! )
Hence, required number of ways = 60 + 90 = 150.

(c)
In this case, the positioning of the people amongst themselves is also to be taken into account.
Case -
Number of ways = 60 3 ! = 360
Case -
Number of ways = 90 2 ! 2 ! = 360
Hence, required number of ways = 360 + 360 = 720.
Hindi. (a)
5O;fDr;ksadks3lewgksaesafuEurjhdkslsfoHkkftrfd;ktkldrkgSA
1, 1, 3
;
k
1, 2, 2
vr%dqyrjhds
5!
5!
1
1
= 3! 2! +
2
2
!
(2 ! )
= 10 + 15 = 25
(b)
3 fofHkUudejksadksfuEuizdkjlsHkjktkldrkgSA
Room
People 1 1 3
or
Room
People 1 2 2
dqyrjhds=lewgksadkscukusdsrjhdslewgksadksrhudejksaesaO;ofLFkrdjusdsrjhds
5!
fLFkfr- dqy rjhds = 3 ! 2 ! 3 ! = 60
fLFkfr-
5!
1
dqy rjhds = (2 ! )2 2 ! 3 ! = 90
vr% vHkh"V rjhds = 60 + 90 = 150.

(c)
blfLFkfresaO;fDr;ksadksvkilesafLFkfrdksHkhx.kukesaysukgksxkA
fLFkfr-
dqy rjhds = 60 3 ! = 360
fLFkfr-
dqy rjhds = 90 2 ! 2 ! = 360
vr% vHkh"V rjhds = 360 + 360 = 720.
RESONANCE
E-3_.
Prove that :
fl) dhft, :
Sol.
Sol.
200!
(10! )20 19!
,d iw.kkd gSaA
Number of ways of distributing 200 objects into 20 groups each containing 10 objects
=
200!
20
(10! )20 .20!
200!
which must be an integer..
(10! )20 .19!
200 oLrqvksadks20lewgksaesa]izR;sdesa10oLrq,agS]ckaVusdsdqyrjhds=
E-4.
200!
is an integer
(10! )20 19!
200!
20
(10! )20 .20!
200!
tksfd,diw.kkZadla[;kgks
(10! )20 .19!
Find exponent of 3 in 20 !
20 ! esa 3 dk ?kkrkad Kkr dhft,A
Sol.
Ans. 8
Exponent of 3 in 20!
Sol.
20 20 20
3 32 35 + ........

=6+2+0=8
20! aesa3dk?kkrkad
20 20 20
3 32 35 + ........

=6+2+0=8
E-5.
Find number of zeros at the end of 45!.

45! dsvUresa'kwU;ksadhla[;kKkrdhft,A
Sol.
Ans. 10
Exponent of 2 in 45! is
45 45
45
45
45
45
2 + 2 + 3 + 4 + 5 + 6
2
2
2
2
2
= 22 + 11 + 5 + 2 + 1 + 0
Exponent of 5 in 45! is
= 41
45 45
45
5 + 2 + 3 = 9 + 1 + 0 = 10
5
5
So no. of zeros at the end of 45! is 10

Hindi. 45! esa2dk?kkrkad
45 45
45
45
45
45
2 + 2 + 3 + 4 + 5 + 6
2
2
2
2
2
= 22 + 11 + 5 + 2 + 1 + 0
45! esa5dk?kkarkd
RESONANCE
= 41
45 45
45
5 + 2 + 3 = 9 + 1 + 0 = 10
5
5
vr%45! dsvaresa'kwU;ksadhla[;k10gksxhA
E-6.
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
(a)
all letters are in the wrong envelopes?
(b)
at least three of them are in the wrong envelopes?
,dO;fDrvius5fe=kksadksi=kfy[krkgSvkSjlaxrfyQkQksijirsfy[krkgSA;si=kfyQkQksaesafdrusizdkjls
j[kstkldrsgSarkfd
(a)
lHkhi=kxyrfyQkQksaesagks\
(b)
de lsderhui=kxyr fyQkQksaesa gksa\
Sol.
Ans.
(a)
44
(b)
109
(a)
1
1
1
1
1
= 44
Required number of ways = 5 ! 1
1! 2 ! 3 ! 4 ! 5 !
(b)
Required number of ways = 5C2 D3 + 5C1 D4 + 5C0 D5
1
1
1
1
1
1
1
+ 5 4 ! 1
= 10 3 ! 1
1
!
2
!
3
!
1
!
2
!
3
!
4
!
1
1
1
1
1
= 109
+ 1 5 ! 1
1! 2 ! 3 ! 4 ! 5 !
Hindi. (a)
vHkh"Vrjhdksadhla[;k= 5 ! 1
(b)
1
1
1
1
1
= 44
1! 2 ! 3 ! 4 ! 5 !
vHkh"V rjhdksa dh la[;k= 5C2 D3 + 5C1 D4 + 5C0 D5
1
1
1
1
1
1
1
+ 5 4 ! 1
= 10 3 ! 1
1! 2 ! 3 !
1! 2 ! 3 ! 4 !
1
1
1
1
1
= 109
+ 1 5 ! 1
1
!
2
!
3
!
4
!
5
!
PART - II : OBJECTIVE QUESTIONS
Hkkx- II : oLrqfu"B iz'u OBJECTIVE QUESTIONS

* Marked Questions are having more than one correct option.
* fpfUgr iz'u ,d ls vf/kd lgh fodYi okys iz'u gS Section (A) : Problem based on Problems, Arrangements of given objects/Selection of
RESONANCE
Let Pm stand for mPm. Then the expression 1. P1 + 2. P2 + 3. P3 +...... + n. Pn =

(A*) (n + 1) ! 1
(B) (n + 1) ! + 1
(C) (n + 1) !
(D) none
m
;fn Pm dks Pm ls n'kkZ;k tkrk gks] rks O;atd 1. P1 + 2. P2 + 3. P3 +...... + n. Pn =
(A) (n + 1) ! 1
(B) (n + 1) ! + 1
(C) (n + 1) !
(D)buesalsdksbZugha
Sol.
Here T r = r. Pr = (r + 11) r !
= (r + 1) r! r! = (r + 1)! r!
Sn = (n+1)! 1
Hindi. ;gk Tr = r. Pr = (r + 11) r !
= (r + 1) r! r! = (r + 1)! r!
Sn = (n + 1)! 1
A-1.
A-2.
Sol.
Sol.
The number of signals that can be made with 3 flags each of different colour by hoisting 1 or 2 or 3
above the other, is:
fofHkUu jaxks ds 3 >.Mksa dk mi;ksx djds dqy fdrus ladsr cuk, tk ldrs gSa tcfd ,d >.Ms ds ij 1 ;k 2 ;k
3 >.Ms Qgjk;s tk ldrs gSa\
(A) 3
(B) 7
(C*) 15
(D) 16
Total number of signals can be made from 3 flags each of different colour by hoisting 1 or 2 or 3 above.
3p + 3p + 3p = 3 + 6 + 6 = 15
i.e.
1
2
3
fofHkUujaxksads3 >.Mksadksmi;ksxdjcuk;sx;sdqyladsrksadhla[;k]tcfd,d>.Msdsij1;k2;k3>.Ms
Qgjk;stkldrsgSaA
i.e.
A-3.
3p
+ 3p2 + 3p3 = 3 + 6 + 6 = 15
10 different letters of an alphabet are given. Words with 5 letters are formed from these given letters,
then the number of words which have atleast one letter repeated is:
(A*) 69760
(B) 30240
(C) 99748
(D) none
vaxzstho.kZekykds10v{kjfn;sx;sgSaAbuv{kjksadhlgk;rkls5v{kjokys'kCncuk;stkrsgS]rks,slsfdrus
'kCn gksxsaftuesadelsde,dv{kjdhiqujko`fkgksrhgS\
(A) 69760
(B) 30240
(C) 99748
(D)buesalsdksbZugha
Number of words which have at least one letter repeated = total words number of words
which have no letter repeated = 105 10 9 8 7 6 = 69760
Hindi. 'kCnksa dh la[;k ftuesa de ls de ,d v{kj dh iqujko`fk gks = dqy 'kCn mu 'kCnksa dh la[;k
ftuesa fdlh v{kj dh iqujko`fk uk gks= 105 10 9 8 7 6 = 69760
Sol.
A-4.
Sol.
The number of numbers from 1000 to 9999 (both inclusive) that do not have all 4 different digits, is:
1000 ls9999 dschp(nksuksa'kkfeygSa),slhfdruhla[;k,gksaxhftudspkjksavadvyx&vyxughagSa\
(A) 4048
(B*) 4464
(C) 4518
(D) 4536
There are four digit no which is atleast one is repeated i.e. (do not all are different) is
= 9000 4536 = 4464
Sol.
;fnpkjvadksadhogla[;k,aKkrdjuhgSftuesa de ls de ,d vad dhiqujko`fk gks jgh gS lHkh vad vyx&vyx

ughagS
= 9000 4536 = 4464

vk/kkfjrleL;k,
RESONANCE
B-1.
8 chairs are numbered from 1 to 8. Two women & 3 men wish to occupy one chair each. First the
women choose the chairs from amongst the chairs marked 1 to 4, then the men select the chairs from
among the remaining. The number of possible arrangements is:
vkBdqflZ;ksaij1 ls8rduEcjyxsgSaSA 2vkSjrsa vkSj3 vkneh izR;sd,d&,ddqlhZijcSBuk pkgrsgSaAigys

vkSjrsa1ls4 uEcjyxhgqbZdqflZ;ksaesalsdqflZ;kpqurhgSavkSjbldscknvknehcphgqbZdqflZ;ksaesalsdqflZ;kpqurs
gS]rkslaHkkforfoU;klksadhla[;kgksxh\
Sol.
Sol.
(A) 6C3. 4C4

(B) P2. 4P3
Total number of possible arrangements is
4
p 2 6p 3 .
(D*) 4P2. 6P3
dqylaHkofoU;kvksadhla[;k
4
B-2.
(C) 4C3. 4P3
p 2 6 p 3.
Number of words that can be made with the letters of the word "GENIUS" if each word neither begins
with G nor ends in S, is:
"GENIUS" 'kCndsv{kjksals,slsfdrus'kCncuk,tkldrsgSatksurksG ls'kq:gksrsgSavkSjughS ijlekIr
gksrsgSa\
Sol.
Sol.
B-3.
(A) 24
(B) 240
(C) 480
(D*) 504
First we have to find all the arrangements of the word GENIUS is
6 ! = 720
number of arrangement which in either started with G ends with S is
(5! + 5! 4!) = (120 + 120 24)= 216
Hence total number of arrangement which is neither started with G nor ends with S is.
(720 216) = 504
loZizFkege'kCnGENIUS dslHkhlaHkofoU;klksadhla[;kKkrdjsxsaA
6 ! = 720
mufoU;klksadhla[;ktks;krksGlsizkjEHkgksrksSijlekIrgks
(5! + 5! 4!) = (120 + 120 24)= 216
vr%mufoU;klksadhla[;ktksurks G lsizkjEHkgksrsgSavkSjughSijlkeIrgksrsgSa
(720 216) = 504
5 boys & 3 girls are sitting in a row of 8 seats. Number of ways in which they can be seated so that not
all the girls sit side by side, is:
5 yM+dsvkSj3yM+fd;k,diafDresafLFkr8 lhVksaijcSBsgq,gSaA;fnlHkhyM+fd;k,dlkFkughacSBs]rksoslHkh
fdrusrjhdksalscSBldrsgSa\
Sol.
Hindi.
(A*) 36000
(B) 9080
(C) 3960
Total no. of arrangement if all the girls do not seat
side by side is
= [all arrangement girls seat side by side]
= 8! (6! 3!) = 6! (56 6) = 6! 50
= 720 50 = 36000
(D) 11600
;fnlHkhyM+fd;k,dlkFkughacsBsarksdqyfoU;klksadhla[;k
= [dqy foU;kl tc lHkh yM+fd;ka lkFk&lkFk cSBs]
= 8! (6! 3!) = 6! (56 6) = 6! 50
= 720 50 = 36000
B-4.
The sum of all the numbers which can be formed by using the digits 1, 3, 5, 7 all at a time and which
have no digit repeated, is
vadks 1, 3, 5, 7 dk ,dlkFk mi;ksx djrs gq, cukbZ tk ldus okyh lHkh la[;kvksa dk ;ksx fdruk gksxk tcfd vadks
RESONANCE
dhiqujko`fkughagksldrhgSa\
(A) 16 4!
(B) 1111 3!
(C*) 16 1111 3!
If 1 be unit digit then total no. of number is 3! = 6
Similarly so on if 3, 5, or 7 be unit digit number
then total no. of no. is 3! = 6
Hence sum of all unit digit no. is = 6 (1+3+5+7)
= 6 16 = 96
Hence total sum is
= 96 103 + 96 102 + 96 101 + 96 100
= 96000 + 9600 + 960 + 96 = 106656
= 16 1111 3!
Hindi. ;fnbdkbZ dk vad 1 gks] rks dqy la[;kvksa dh la[;k = 3! = 6
(D) 16 1111 4!.
Sol.
blh izdkj ;fn 3, 5 ;k7 bdkbZ vad gks] rks dqy la[;kvksa dh la[;k = 3! = 6
vr% lHkh bdkbZ vadksa dh la[;kvksa dk ;ksx= 6 (1+3+5+7) = 6 16 = 96
vr% dqy ;ksx
= 96 103 + 96 102 + 96 101 + 96 100
= 96000 + 9600 + 960 + 96 = 106656
= 16 1111 3!
B-5.
The number of words that can be formed by using the letters of the word MATHEMATICS that start as
well as end with T, is
MATHEMATICS'kCndsv{kjksals,slsfdrus'kCncuk,tkldrsgSatksT lsizkjEHkgksrsgSavkSjT ijghlekIr
gksrsgS\
(A) 80720
(B*) 90720
(C) 20860
(D) 37528
Sol.
Total arrangement is
9!
2!. 2!
= 90720
Sol.
9!
dqy foU;klksa dh la[;k = 2!. 2! = 90720

B-6.
How many nine digit numbers can be formed using the digits 2, 2, 3, 3, 5, 5, 8, 8, 8 so that the odd
digits occupy even positions?
vadks 2, 2, 3, 3, 5, 5, 8, 8, 8 dh lgk;rk ls 9 vadks dh fdruh la[;k, cukbZ tk ldrh gSa] tcfd fo"ke vad le
LFkkuksaijvk;s?
Sol.
(A) 7560
Even place
(B) 180
(C) 16
(D*) 60
There are four even places and four odd digit number so total number of filling is
occupy is
5!
ways
3!. 2!
Hence total number of ways =

Sol.
4!
rest are also
2!. 2!
leLFkku
RESONANCE
4!
5!
= 60
2!. 2! 3!. 2!
4!
;gkapkjleLFkkugSopkjfo"kevadgSAvr%fo"kevadksadksleLFkkuksaijHkjusdsrjhds 2!. 2! gSrFkkvU;vadksa

5!
dks 3!. 2! rjhdksalsHkjktkldrkgSA

4!
5!
vr % dqy rjhdksa dh la[;k = 2!. 2! 3!. 2! = 60

B-7.
The number of permutations that can be formed by arranging all the letters of the word NINETEEN in
which no two Es occur together. is
'kCnNINETEENdslHkhv{kjksadksfdrusizdkjlsO;ofLFkrfd;ktkldrkgSarkfddksbZHkhnks'E' ,dlkFkugha
vk;s\
8!
(A) 3! 3!
Sol.
5!
(B)
3! 6 C 2
5!
(C*) 3 ! 6C3
8!
(D) 5 ! 6C3.
NINETEEN
N 3 :, T
E3
First we arrange the word of N, N, N, I and T
5!
.
3!
Now total 6 number of place which are arrange E is 6C3
then the number of ways =
Hence total number of ways =

Sol.
5! 6
. C3
3!
NINETEEN
N 3 :, T
E3
loZizFke ge N, N, N, I vkSjT dksO;ofLFkr djsxsaA
vr% rjhdksa dh la[;k =
5!
.
3!
vc 6 LFkkuksa ij E-3 dks j[kusds rjhds = 6C3

vr% dqy rjhdksa dh la[;k =
B-8.
5! 6
. C3
3!
Out of seven consonants & four vowels, the number of words of six letters, formed by taking four
consonants & two vowels, is (Assume each ordered group of letter is a word)
7 O;atuksarFkk4Lojksaesals4 O;aturFkk2 LojysdjN%v{kjksaokysfdrus'kCncuk;stkldrsgS\&
(ekuk v{kjksa dk izR;sd fer lewg ,d 'kCn gS)
Soll
(A) 210
(B) 462
(C*) 151200
(D) 332640
First we select 4 consonant out of 7 consonant and 2 vowel out of 4 vowel then arranging
Hence total number of ways = 7C4 4C2 6!
RESONANCE
Soll
= 210 720 = 151200

loZizFkege7O;atuksaesals4O;atupqusaxsarFkk4Lojksaesals3LojpqusaxsarFkkO;ofLFkrdjsxsaA
vr% dqy rjhdksa dh la[;k = 7C4 4C2 6! = 210 720 = 151200

B-9.
A box contains 2 white balls, 3 black balls & 4 red balls. In how many ways can three balls be drawn
from the box if atleast one black ball is to be included in draw (the balls of the same colour are
different).
(A) 60
(B*) 64
(C) 56
(D) none
,dlUnwdesa2fHkUulQsn]3fHkUudkyhvkSj4 fHkUuykyxsnsagSaAlUnwdesals3xsansadqyfdrusrjhdksalsfudkyh
tk ldrh gS tcfd izR;sd p;u esa de ls de ,d dkyh xsan vo'; lfEefyr gks\
(A) 60
(B) 64
(C) 56
(D)buesalsdksbZugha
Sol.
First we find 3 ball from 9 ball

3 = 84
Now number of ways if any one black ball not selected is 6C3 = 20
Here required no is 84 - 20 = 64
loZizFke9xsnksaesals3xsanspquusdsrjhds=9C3=84
9C
Sol.
vr%murjhdksadhla[;kftuesadksbZHkhdkyhxsanughapquhxbZgks=6C3 =20
vr% vHkh"V rjhdksa dh la[;k 84 20 = 64
B-10.
Passengers are to travel by a double decked bus which can accommodate 13 in the upper deck and 7
in the lower deck. The number of ways that they can be divided if 5 refuse to sit in the upper deck and
8 refuse to sit in the lower deck, is
,d nks eaftyk cl ds ijh eafty ij 13 rFkk fupyh eafty ij 7 O;fDr cSB ldrs gSaA ;fn bu 20 O;fDr;ksa esa
ls5 O;fDrijcSBuslseukdjrsgSarFkk8O;fDruhpsacSBuslseukdjrsgSa]rksbUgsfdrusizdkjlsfoHkkftr
fd;k tk ldrk gSa\
(A) 25
(B*) 21
(C) 18
Sol.
upperdeck - 13 seats 8 in upper deck.
lowerdeck - 7 seats 5 in lower deck
Remains passengers = 7
Now Remains 5 seats in upper deck and 2 seats
in lower deck
for upper deck number of ways = 7C5
for lower deck number of ways = 2C2
7 .6
So total number of ways = 7C5 2C2 =
= 21
2
Hindi. ijh eafty - 13 lhVsa ijh eafty esa 8 ;k=kh
(D) 15
fupyh eafty- 7 lhVsa fupyh eafty esa 5 ;k=kh

cpsgq,;k=kh=7
vr% 5 lhVs ijh eaftyesa rFkk 2 lhVs fupyh eafty esa cprh gSaA
ijh eafty ds fy;s lhVsa Hkjus ds rjhds = 7C5
uhpsdheaftyesalhVsaHkjusdsrjhds= 2C2
vr% dqy rjhds = 7C5 2C2 =
7 .6
= 21
2
B-11*. In an examination, a candidate is required to pass in all the four subjects he is studying. The number
of ways in which he can fail is
,dijh{kkesa],dijh{kkFkhZdksmulHkhpkjfo"k;ksaesaiklgksukvko';dgSaftUgsogi<+jgkgSaAogfdrusrjhdksalsQsy
gksldrkgSa\
(A) 4P1 + 4P2 + 4P3 + 4P4
(C*) 24 1
RESONANCE
(B) 44 1
(D*) 4C1 + 4C2 + 4C3 + 4C4
Sol.
Number of ways he can fail is either one or two, three or four subject then total of ways.
4
4
4
4
1 + C2 + C3 + C4 = 2 1
4C
Sol.
mldsvlQygksusdsrjhdksaesaog;krks,dfo"k;esa;knksfo"k;esa;krhufo"k;esa;kpkjfo"k;ksaesavlQygksldrk
gks] vr% dqy rjhdksa dh la[;k = 4C1 +4C2 + 4C3 +4C4 = 24 1
B-12*. In a cricket match against Pakistan, Azhar wants to bat before Jadeja and Jadeja wants to bat before
Ganguli. Number of possible batting orders with the above restrictions, if the remaining eight team
members are prepared to bat at any given place, is:
(A*)
11 !
3!
(B*) 11C3. 8 !
(C)
11 !
3
(D) none
ikfdLrkudsf[kykQ,dfdsVeSpesavtgj]tMstklsigyscSafVxdjukpkgrkgSvkSjtM+stk]xkaxqyhlsigyscSafVxdjuk
pkgrkgSA;fn'ks"kvkBf[kykM+hfdlhHkheijcYysckthdsfy,rS;kjgks]rkslEHkkforcYyscktheksadhla[;kgksxh
(A)
Sol.
11 !
3!
(B) 11C3. 8 !
11 !
3
(D)buesaslsdksbZugha
First we choose any three place out of 11 place

i.e. 11C3 ways and rest 8 places are arranged by 8!
ways.
Hence required no. is 11C3. 8! =
Hindi.
(C)
11 !
3
igysge11LFkkuksaesalsdksbZ3LFkkuksadkp;udjsxsa
vFkkZr~11C3 rFkk'ks"k 8LFkkuksadks8!fof/k;ksa}kjkO;ofLFkrfd;ktkrldrkgSA
vr% okafNr la[;k 11C3. 8! =
11 !
3
B-13*. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if the letter C are
separated from one another is:
v{kjksaAAAAA,BBB,CCC,D,EEvkSjFdks,diafDresaO;ofLFkrdjusdsrjhdksdhla[;kKkrdjksgSa ;fnv{kjc,d
nwljslsvyxjgs&
12!
(A*) 13C3. 5 ! 3 ! 2!
Sol.
13 !
(B) 5 ! 3 ! 3 ! 2 !
14 !
(C) 3 ! 3 ! 2 !
13 !
(D*) 11. 6 !
We have arrange all the letter except ccc is
12!
new there all 13 place where i can be placed 13C3
5!. 3!. 2!
12!
Hence required number of ways is = 5! 3! 2!
13 C
Hindi. ccc dksNksMdjlHkhv{kjksadksO;ofLFkrdjusdsrjhds=
= 11 .
13!
6!
12!
5!. 3!. 2!
u;s13 LFkkutgki dksO;ofLFkrfd;ktkrkgS]dsrjhds=13C3

12!
vr% vHkh"V rjhds = 5! 3! 2! 13C3 = 11 .
13!
6!
B-14*. The kindergarten teacher has 25 kids in her class. She takes 5 of them at a time, to zoological garden
as often as she can, without taking the same 5 kids more than once. Then the number of visits, the
teacher makes to the garden exceeds that of a kid by:
RESONANCE
,dulZjhd{kkdhf'kf{kdkdhd{kkesa25cPpsgSaAogmudks55dslewgesafpfM+;k?kjfn[kkusystkrhgSa]tcfdmUgha
5 cPpksadslewgesalsfdlhdksHkh,dlsvf/kdckjuystk;ktkrkgks]rksf'kf{kdkfdlh,dcPpsdsHkze.kksadhla[;k
lsfdruhT;knkckjHkze.kdjsxh&
Sol.
(A*) 25C5 24C4

(B*) 24C5
(C) 25C5 24C5
Total no. of visits that a teacher goes is = 25C5
(selection of 5 different kids each time & teacher goes
every time)
Number of visits of a boy = select one particular boy
& 4 from rest 24 = 24C4
So extra visits of a teacher from a boy is = 25C5 24C4 =
HINDI.
24
(D) 24C4
C5
25
f'kf{kdkdsHkze.kksadhla[;k= C5
(izR;sdckj5fHkUucPpsrFkkf'kf{kdkizR;sdckjesatkrhgS)
,d cPps ds Hkze.kksa dh la[;k =,d fof'k"B cPps dk p;u rFkk ckfd 24esa ls 4=24C4
vr% f'kf{kdk dk cPps ls vfrfjDr Hkze.k =25C5 24C4 = 24C5

C-1.
The number of divisors of apbqcrds where a, b, c, d are primes & p, q, r, s N, excluding 1 and the
number itself, is:
la[;kapbqcrds tgka, b, c, d vHkkT;la[;k,gSavkSjp, q, r, s N gSads1 vkSjLoa;dsvykokHkktdksadhla[;kgSa
Sol.
(A) p q r s
(C) p q r s 2
Total number of divisors is
(B) (p + 1) (q + 1) (r + 1) (s + 1) 4
(D*) (p + 1) (q + 1) (r + 1) (s + 1) 2
dqyHkktdksadhla[;k
(p + 1) (q + 1) (r + 1) (s + 1) 2
C-2_.
N is a least natural number having 24 divisors. Then the number of ways N can be resolved into two
factors is
(A*) 12
(B) 24
(C) 6
(D) None of these
N,d,slhlclsNksVhizkd`rla[;kgSftlds24HkktdgS]rksNdksfdrusizdkjlsnksxq.ku[k.Mksads:iesaifjofrZr
fd;k tk ldrk gS&

(A*) 12
Sol.
(B) 24
(C) 6
(D)buesalsdksbZugha
N = 2 .3 5 = 2 .3 .5
( + 1) ( + 1) ( + 1) = 4.3.2
N = 360 = 23 . 32 .5
4.3.2
12
2
C-3.
How many divisors of 21600 are divisible by 10 but not by 15?

(A*) 10
(B) 30
(C) 40
(D) none
21600 dsfdrusHkktd10 lsfoHkkftrgSaysfdu15 lsugha?

Sol.
(A) 10
(B) 30
(C) 40
Here 21600 = 25. 33. 52
(2 5) 24 33 5 1
Now numbers which are divisible by 10
= (4 + 1)(3 + 1)(1 + 1) = 40
(2 3 5) (24 32 51) now numbers which are
RESONANCE
divisible by both 10 and 15

= (4 +1)(2 +1)(1+1) = 30
So the numbers which are divisible by only 40 30 = 10
Hindi. ;gk 21600 = 25. 33. 52
= (2 5) 24 33 5 1
vcosHkktdtksfd10 lsHkkT;gS
= (4 + 1)(3 + 1)(1 + 1) = 40
21600 = (2 3 5) (24 3 2 5 1)
vc os Hkktd tks fd 10 o15 nksuksa ls HkkT; gSa = (4 +1)(2 +1)(1+1) = 30

vr% os la[;k;s tks fd dsoy 10 ls HkkT; gS 40 30 = 10
C-4.
The sum of the divisors of 25 . 37 . 53 . 72 , is

(A) 2 6 . 3 8 . 5 4 . 7 3
(C) 2 6 . 38 . 5 4 . 73 1
(B) 26 . 38 . 54 . 73 2 . 3 . 5 . 7
(D*) none of these
25 . 37 . 53 . 72 ds Hkktdksa dk ;ksxQy gSa &

(A) 2 6 . 3 8 . 5 4 . 7 3
(B) 26 . 38 . 54 . 73 2 . 3 . 5 . 7
(C) 2 6 . 38 . 5 4 . 73 1
(D)buesalsdksbZugha
Sol.
Since of the divisors of 25. 37 . 53 . 72
(20 + 21 + 22 + 2 3 + 24 + 25) (30 + 31 + ......+ 37) (50 + 51 + 52 + 53) (70 + 71 + 72 + 73)
Hindi. ds Hkktdksa dk ;ksx 25. 37 . 53 . 72
(20 + 21 + 22 + 2 3 + 24 + 25) (30 + 31 + ......+ 37) (50 + 51 + 52 + 53) (70 + 71 + 72 + 73)
C-5.
The number of ways in which the number 27720 can be split into two factors which are co-primes, is:
la[;k27720dksnkslgvHkkT;xq.ku[k.MksaesafdrusrjhdksalsfoHkkftrfd;ktkldrkgS\
(A) 15
(B*) 16
(C) 25
(D) 49
2 27720
2 13860
5 6930
2 1386
Sol.
3
3
7
693
231
77
11
23 3 2 . 5. 11
Hence number of co-prime factor
lgvHkkT;xq.ku[k.Mksadhla[;k
251 = 2 4 = 16

[k.M (D):o`kh; ep; rFkk cgqinh; izes; ij vk/kkfjr leL;k,
D-1.
The number of ways in which 8 different flowers can be strung to form a garland so that 4 particulars
flowers are never separated, is:
(A) 4 !. 4 !
(B)
8!
4!
(C*) 288
(D) none
8 fofHkUuQwyksals,dgkjfdrusrjhdksalscuk;ktkldrkgSa;fn4 fo'ks"kQwydHkhHkhvyxugksa\
(A) 4 !. 4 !
Sol.
(B)
8!
4!
(C) 288
(D)buesalsdksbZugha
First be find all 4 particulars flowers are together then the total number of ways is
RESONANCE
4! 4!
= ........ 288
2
Hindi. 4 fo'ks"kQwyksadkslkFkj[krsgq,gkjcukusdsrjhdksdhla[;k=
D-2.
4! 4!
= ........ 288
2
The number of ways in which 6 red roses and 3 white roses (all roses different) can form a garland so
that all the white roses come together, is
6 ykyxqykcksavkSj3 lQsnxqykcksalHkhxqykcvyx&vyxgSals,dekykfdrusrjhdksalscukbZtkldrhgSatcfd
lHkhlQsnxqykc,dlkFkjgsa\
Sol.
(A) 2170
(B) 2165
Total number of ways is
(C*) 2160
(D) 2155
dqyrjhdksadhla[;k
6! 3!
= 720 3 = 2160
2!
D-3.
The number of ways in which 4 boys & 4 girls can stand in a circle so that each boy and each girl is one
after the other, is:
4 yM+dsvkSj4yM+fd;k,do`kesafdrusrjhdksals[kM+sjgldrsgSarkfdizR;sdyM+dkvkSjyM+dh,dkUrjeesajgsa\
Sol.
(A*) 3 !. 4 !
(B) 4 !. 4 !
(C) 8 !
First we arrange all the boy so no. of ways of all
the boy can stand is 3! now we arrange all the girl
in 4 ! ways so total no. of ways is
(D) 7 !
= 4! 3!
Hindi.
igysgeyM+dksadksO;ofLFkrdjrsgSavr%lHkhyM+dksadks3! rjhdsls[kM+kfd;ktkldrkgSA
vc yM+fd;ksa dks 4 ! rjhds ls O;ofLFkr fd;k tk ldrk gS vr% dqy rjhds = 4! 3!
D-4.
The number of ways in which 5 beads, chosen from 8 different beads be threaded on to a ring, is:
(A*) 672
(B) 1344
(C) 336
(D) none
8 fofHkUueksfr;ksaesals5eksrhdkspqudj,dfjaxesafdrusrjhdksalsyxk;ktkldrkgSa\
Sol.
(A*) 672
(B) 1344
(C) 336
First we select 5 beads from 8 different beads to 8C5
Now total number of arrangement is
8C
(D)buesalsdksbZugha
4!
= 672
2!
Hindi. 8 fofHkUueksrh;ksaesals5eksrhpquusdsrjhds=8C5
vr%dqyfoU;klksadhla[;k
8C
4!
= 672
2!
RESONANCE
D-5.
Number of ways in which 3 persons throw a normal die to have a total score of 11, is
3 O;fDr ,d lk/kkj.k ikls dks fdrus rjhdksa ls Qsad ldrs gSa ;fn mudk dqy Ldksj 11 jgs\&
Sol.
Hindi.
(A*) 27
(B) 25
Find the co-efficient of x 11 in the expansion
(x + x 2 + x3 + .......+ x 6)3
= x3 (1 x6)3.(1x)3 is
= 10C8 3 . 4C2 = 45 18 = 27
(C) 29
(D) 18
cgqinh;izes;dkiz;ksxdjusij
(x + x2 + x3 + .......+ x6)3 ds izlkj esa x11 dk xq.kkad
= x3 (1 x6)3.(1x)3 ds izlkj esa x11 dk xq.kkad
= 10C8 3 . 4C2 = 45 18 = 27
D-6.
If chocolates of a particular brand are all identical then the number of ways in which we can choose
6 chocolates out of 8 different brands available in the market, is:.
(A*) 13C6
(B) 13C8
(C) 86
(D) none
;fnfdlhfo'ks"kczk.MdhlHkhpkdysVloZlegks]rkscktkjesamiyC/k8fofHkUuczk.Mksesals6pkdysVfdrusrjhdksals
pquhtkldrhgSa\
(A) 13C6
(B) 13C8
(C) 86
(D)buesalsdksbZugha
Sol.

Total no. of ways of choosing 6 chocolates out of
8 different brand is = 8 + 61C6 = 13C6
Hindi.
8 fofHkUuczk.Mksesals6 pkdysVpquusdsdqyrjhds= 8 + 61C6 = 13C6
D-7.
Number of positive integral solutions of x1 . x2 . x3 = 30, is

x1 . x2 . x3 = 30 ds/kukRediw.kkdgyksadhla[;kgksxh\
Sol.
(A) 25
(B) 26
Total number of positive integral solution of
(C*) 27
(D) 28
/kukRediw.kkdgyksadhdqyla[;k
x1 . x 2 . x3 = 80 = 2 3 5 is
3 3 3 = 27

E-1.
Number of ways in which 9 different toys be distributed among 4 children belonging to different age
groups in such a way that distribution among the 3 elder children is even and the youngest one is to
receive one toy more, is:
(A)
5 !2
8
(B)
9!
2
(C*)
9!
3 ! 2 !
(D) none
9 vyx&vyxf[kykSusfofHkUuvk;qoxZds4 cPpksaesafdrusrjhdksalsckaVstkldrsgS;fn3 cM+scPpksadkslela[;k
esaf[kykSusfeysvkSjlclsNksVscPpsdks,df[kYkkSukT;knkfeys\&
(A)
5 !2
8
RESONANCE
(B)
9!
2
(C)
9!
3 ! 2 !
Sol.
Here first three children receive 2 each and younger receives 3 toys
then total 3 toys
then total number of distribution is
9C . 7C . 5C . 3C
2
2
2
2
9!
9!
7!
5!
3!
.
.
.
=
2!. 7 ! 2!. 5 ! 2!. 3 ! 3!. 0!
3!.(2! )3
Hindi. 3cM+scPpksaesaizR;sddksnksf[kyksusrFkklclsNksVscPpsdks3 f[kyksusnsrsgSa
vr%ckaVusdsdqyrjhdksdhla[;k
9C
50
. 7C 2 . 5C 2 . 3C 2
9!
9!
7!
5!
3!
.
.
.
=
2!. 7 ! 2!. 5 ! 2!. 3 ! 3!. 0!
3!.(2! )3
E-2*_.
C36 is divisible by
50
C36 fdllsfoHkkftrgS&
(A*) 19
Sol.
(B*) 52
(C) 192
(D) 53
50 !
50
50
exp of 19 in 50 ! = + 2 = 2
14! 36!
19
19
36 36
Exp. of 19 in 36 ! = 2 = 1
19 19
50
C36 is divisible by 19 but not by 192
50 50
Exp. of 5 in 50 ! = = 12
5 25
14
Exp. of 5 in 14 ! = = 2
5
36 36
Exp. of 5 in 36 ! = = 8
5 25
Hindi. 50! esa 19 dk ?kkarkd
Ans. A & B
50!
50 50
= + 2 =2
14! 36! 19 19
36 36
36! esa 19 dk ?kkarkd = 2 = 1
19 19
50
C36, 19 lsHkkT;gSaijUrq 192 lsugha
50 50
50! esa 5 dk ?kkarkd= = 12
5 25
14
5
36 36
5 25
E-3*.
2n
Pn is equal to
RESONANCE
Ans. A & B
2n
Pn dkekugSa&
(B*) 2n [1 . 3 . 5 .....(2n 1)]
(D*) n! (2nCn)
(A*) (n + 1) ( n + 2) ..... (2n)

(C*) (2) . (6) . (10) .... (4n 2)
Sol.
2n!
n!
(i) (n + 1) (n + 2) ----- (2n)
Value of 2n pn is
and n ! . 2n Cn
1.2.3.4.5. 6.7.8.9.10 .11.....(2 n 2) (2n 1). 2n

1.2.3........n
=
(1.3.5.7.. ..(2n 1)) . (2.4.6.8.. .....2n)

1.2.3........n
(1.3.5.7....(2n 1)) . 2n (1.2.3.4.......)

1.2.3.4
n
= 2 (1.3.5.7. .....(2n 1)) = (2. 6. 10. 14 ..... (4n 2))
=
Hindi.
2np
n
dk eku
2n!
n!
gS
(i) (n + 1) (n + 2) ----- (2n)
vkSj n ! . 2nCn
1.2.3.4.5. 6.7.8.9.10 .11.....(2 n 2) (2n 1). 2n

1.2.3........n
=
(1.3.5.7.. ..(2n 1)) . (2.4.6.8.. .....2n)

1.2.3........n
(1.3.5.7....(2n 1)). 2n (1.2.3.4.......)

1.2.3.4
n
= 2 (1.3.5.7. .....(2n 1)) = (2. 6. 10. 14 ..... (4n 2))
=
E-4*.
There are 12 points in a plane of which 5 are collinear. The number of distinct quadrilaterals which can
be formed with vertices at these points is:
,dleryesa12fcUnqgSaftuesals5lajs[kh;gSaAbufcUnqvksadks'kh"kZekudjcuk;stkldusokysfHkUu&fHkUuprqHkqZtksadhla[;k
gksxh&
Sol.
(A*) 2. 7P3
(B) 7P3
Total number of required quadrilateral
(C) 10. 7C3
(D*) 420
dqyvHkh"VprqHkqZtksadhla[;k
7C
+ 7C 3 5C 1 + 7C 2 5C 2
7654 765
76 5 4
.5
1 2 3 4 1 2 3
1 2 1 2
= 35 + 175 + 210 = 420 = 2 .7p3
=
E-5*.
The number of ways in which 200 different things can be divided into groups of 100 pairs, is:
200fofHkUuoLrqvksadks100;qXeksaesafdrusrjhdksalsfoHkkftrfd;ktkldrkgSa\
(A)
200 !
2100
(C*)
200 !
2 (100) !
100
RESONANCE
101 102 103 200

2 2 2 .... 2
(B*)
(D*) (1. 3. 5...... 199)
200
Sol.
C2 . 198 C2 . 196 C2 ......2 C2

100 !
200 !
101 .102 .103 .....200
=
2100 .100 !
2100
100 102 103 100

.
.
.....
=
2 2 2 2
AndvkSj
1.2.3.4.5.6.7.8.....200
2100 .100 !
=
(1.3.5.7.....199 ) (2. 4. 6. 8......200)

2100 .100 !
(1.3.5......199 ). 2100 .100 !

= 1.3.5 .199
2100 .100 !
PART - I : SUBJECTIVE QUESTIONS
Hkkx- I : fo"k;kRed iz'u SUBJECTIVE QUESTIONS

Section (A) : Problem based on Problems, Arrangements of given objects/Selection of
1.
A family consists of a grandfather, m sons and daughters and 2n grand children. They are to be seated
in a row for dinner. The grand children wish to occupy the n seats at each end and the grandfather
refuses to have a grand children on either side of him. In how many ways can the family be made to sit?
,difjokjesa,dnknkth,mcsVs&csfV;kvkSj2niksrs&iksfr;kgSAosfMujdsfy,,diafDresacSBrsgSaAiksrs&iksfr;k
izR;sdfljsdhnlhVksaijcSBukpkgrsgSavkSjnknkthughapkgrsfdmudsfdlhHkhrjQdksbZiksrk;kiksrhcSBsA
fdrus rjhdksa ls ;g ifjokj fMuj ds fy, cSB ldrk gSa \
Sol.
Ans. (2n)! m! (m 1)
First we select n grand children from 2n grand children is
2nC
n
Now
arrangement of both group is n! n!
Now
Rest all (m + 1) place where we occupy the grandfather and m sons but grandfather refuse the
sit to either side of grand children so the out of m 1 seat one seat can be selected
Now
required number of sitting in
2n C n ! n ! (m 1) C . m !
n
1
12 n
n ! n ! (m 1)C1 . m !
n!n!
= 2n ! . m ! . (m 1)
Hindi. 2niksrs&iksfr;ksaesaniksrsiksrhpquusdsrjhds=2nCn
vc nksuks lewgksa dksO;ofLFkr djus ds rjhd = n! n!
vccpsgq,(m+1)LFkkuksaijmcsVs&csfV;karFkknknkthcsBsxsaijUrqnknkthdsnksuksarjQdksbZHkhiksrs&iksrhugha
cSBkuk gS vr% cph gqbZ(m 1) esa ls ,d lhV pquuh gSA
=
vr%cSBkusdsvHkh"Vrjhdksadhla[;k
2n C
n!n!
RESONANCE
(m 1) C
.m!
12 n
n ! n ! (m 1)C1 . m !
n!n!
= 2n ! . m ! . (m 1)
=

vk/kkfjrleL;k,
2.
How many five digits numbers divisible by 3 can be formed using the digits 0, 1, 2, 3, 4, 7 and 8 if, each
digit is to be used atmost one.
vadks 0, 1, 2, 3, 4, 7 vkSj 8 dk mi;ksx djrs gq, 3ls foHkkftr gksus okyh 5 vadks dh fdruh la[;k, cukbZ tk ldrh
gSa tcfd izR;sd vad dk mi;ksx vf/kdre 1 ckj gks\
Sol.
Ans. 744
Number divisible by 3 if sum of digits divisible
case-I
If 1 + 2 + 3 + 4 + 8 = 18
case-II
If 1 + 2 + 3 + 7 + 8 = 21
case-III
If 2 + 3 + 4 + 7 + 8 = 24
case-IV If 1 + 2 + 0 + 4 + 8 = 15
case-V
If 1 + 2 + 0 + 7 + 8 = 18
case-VI If 2 + 0 + 4 + 7 + 8 = 21
case-VII If 0 + 1 + 3 + 4 + 7 = 15
Number of ways = 120

Number of ways = 96
Number of ways = 96
Number of ways = 96
Number of ways = 96
___________________
total number
744
Hindi. dksbZHkhla[;k3lsfoHkkftrgksxh;fnvadksadk;ksx3lsHkkT;gksA
3.
If 1 + 2 + 3 + 4 + 8 = 18
fLFkfr-I
fLFkfr-II If 1 + 2 + 3 + 7 + 8 = 21
fLFkfr-III If 2 + 3 + 4 + 7 + 8 = 24
fLFkfr-IV If 1 + 2 + 0 + 4 + 8 = 15
fLFkfr-V If 1 + 2 + 0 + 7 + 8 = 18
fLFkfr-VI If 2 + 0 + 4 + 7 + 8 = 21
fLFkfr-VII If 0 + 1 + 3 + 4 + 7 = 15
rjhdksa dh la[;k = 120

rjhdksa dh la[;k= 120
rjhdksa dh la[;k= 120
rjhdksa dh la[;k=96
rjhdksa dh la[;k=96
rjhdksa dh la[;k=96
rjhdksa dh la[;k=96
dqyla[;k
___________________
744
In how many other ways can the letters of the word MULTIPLE be arranged ; (i) without changing the
order of the vowels ? (ii) keeping the position of each vowel fixed? (iii) without changing the relative
order/position of vowels & consonants?
'kCn ds v{kjksa dks fdrus vU; rjhdksa ls O;ofLFkr fd;k tk ldrk gSaA tcfd
(i) Lojksa dkevifjofrZrjgsA
(ii) izR;sd Loj dk LFkku fuf'pr jgsA
(iii) LojksavkSjO;atuksadklkis{ke@LFkkuvifjofrZrjgsA
MULTIPLE
Sol.
Ans. (i)
3359 (ii)
59
(iii)
359
(i)Without changing the order of the vowels of
MULTIPLE
So we choose the first three place in 8C3 ways
and the rest are arranged is
8!
5!
8!
3! 5! 2! = 3! 2! = 3360
RESONANCE
Hence required no. is 3360 1 = 3359

(ii) Keeping the position of each vowel fixed M_LT_PL_
5!
= 60
2
Number of ways =
other ways = 601 = 59

(iii) without changing the relative order/position of
vowels & consonants
so number of ways is =
5!
3! = 60 6 = 360
2!
Hence required number is = 3601 = 359

Hindi. (i) MULTIPLE esa Lojks dk e vifjofrZr jgs
vr%igysrhuLojkasdks8C3 rjhdslsO;ofLFkrdjsxsa rFkkckdhv{kjksadksO;ofLFkrdjsxsa

vr% dqy rjhds =
8!
5!
8!
=
= 3360
3! 5! 2! 3! 2!
vr% vU; rjhdks dh la[;k = 3360 1 = 3359

(ii) izR;sd Loj dk LFkku M_LT_PL_ fuf'pr j[kus ij
dqy rjhds=
5!
= 60
2
nwljs rjhds= 601 = 59

(iii) Lojksa oO;atuksdk lkis{ke@LFkku vifjofrZrj[kusij
rjhdksa dh la[;k =
5!
3! = 60 6 = 360
2!
vr% vU; rjhdksa dh la[;k = 360 1 = 359

4.
A bouquet from 11 different flowers is to be made so that it contains not less than three flowers. Find
number of different ways of selecting flowers to form the bouquet.
11 fofHkUuQwyksadhlgk;rkls,dxqynLrkcuk;ktkrkgStcfdblesarhulsdeQwyughagksAxqynLrksadkscukus
dsfy,Qwyksadkspquusdsrjhdksadhla[;kKkrdjksA
Ans. 1981
C3 + 11C4 + ....... + 11C11
= 211 11C0 11C1 11C2
= 1981
Sol.
11
5.
If = x1 x2 x 3 and = y1 y2 y3 be two three digit numbers, then find number of pairs of and that can
be formed so that can be subtracted from without borrowing.
;fn = x1 x2 x3 rFkk = y1 y2 y3 rhu vadksa dh nks la[;k, gks] rks o ds dqy ;qXeksa dh la[;k Kkr
dhft, ftlesa dks esa lsfcukgkflyfy;s ?kVk;k tk ldsA
Sol.
Ans. 45 . (55)2

= y1 y2 y3
x1 x2 x3
__________
Number of pairs
;qXeksa dh la[;k = (10 + 9 + 8 + + 1)2 . (9 + 8 + + 1)
= (55) .45
RESONANCE

6.
Show that the number of combinations of n letters together out of 3n letters of which n are a and n are
b and the rest unlike is, (n + 2). 2 n 1.
iznf'kZrdhft,fd3ni=kksaftuesalsni=k,aizdkjdsgSani=k,b izdkjdsgSarFkk'ks"ki=kfHkUugSaAesalsn
i=kksads (n+2).2n1 laxzgcuk;stkldrsgSaA
Sol.
a a a .......a b b b .......b all diff.

n times
n times
selection of n objects = coefficient of xn in (1 + x + .....+ x n)2 (1 + x)n

on solving = (n + 2). 2n1
a a a .......a b b b .......b all diff.

Hindi. n times
n times
n
n oLrqvksa dks pquus ds rjhdksa dh la[;k = (1 + x + .....+ xn)2 (1 + x)n
esa xn dk xq.kkad
gy djus ij = (n + 2). 2n1

[k.M (D):o`kh; ep; rFkk cgqifn; izes; ij vk/kkfjr leL;k,
7.
The integers from 1 to 1000 are written in order around a circle. Starting at 1, every fifteenth number is
marked (that is 1, 16, 31, .... etc.). This process in continued untill a number is reached which has
already been marked, then find number of unmarked numbers.
1 ls1000 rd ds iw.kkdksa dks o`k ij fy[kk tkrk gSA 1 ls izkjEHk djrs gq, izR;sd 15 oha la[;k fpfUgr~
(vFkkZr~ 1, 16, 31, .... bR;kfn) dh tkrh gSA ;g izf;k rc rd tkjh j[kh tkrh gS tc rd fd igys ls fpfUgr~ la[;k
izkIrughagkstkrh]rksvfpfUgrla[;kvksadhla[;k Kkrdhft,
Sol.
Hindi.
8.
Ans. 800
In one round, marked numbers are 1, 16, 31, ..., 991
In second round marked numbers are 6, 21, 36, ..., 996
In third round marked numbers are 11, 26, 41, ..., 986
the next number will be 1 which has already been marked
total marked numbers = 67 + 67 + 66 = 200
unmarked numbers = 1000 200 = 800
,d pDdj esa fpfUgr la[;k, 1, 16, 31, ..., 991

nwljs pDdj esa fpfUgr la[;k, 6, 21, 36, ..., 996
rhljs pDdj esa fpfUgr la[;k, 11, 26, 41, ..., 986
vxyhla[;k 1 gksxhtksfdigyslsghfpfUg~r gSA
dqy fpfUgr la[;k, = 67 + 67 + 66 = 200
dqy vfpfUgr la[;k,= 1000 200 = 800
67 numbers
67 numbers
66 numbers
67la[;k,
67la[;k,
66la[;k,
Find number of positive integral solutions of xyz = 21600

xyz = 21600 ds /kukRed iw.kkd gyksa dh la[;k Kkr dhft,A
Sol.
Ans. 1260
xyz = 21600
= 25 . 33 . 52
Here if
x+y+z=5
C2 = 21
x+y+z=3
C2 = 10
x+y+z=2
RESONANCE
C2 = 6
Hence required no. = 21 10 6 = 1260

Hindi. xyz = 21600
= 25 . 33 . 52
;gk;fn
x+y+z=5
C2 = 21
x+y+z=3
C2 = 10
x+y+z=2
C2 = 6
vr% vHkh"V la[;k = 21 10 6 = 1260

9.
The sides AB, BC & CA of a triangle ABC have 3, 4 & 5 interior points respectively on them. Find the
number of triangles that can be constructed using these interior points as vertices.
f=kHkqt ABC dh Hkqtkvksa AB, BC vkSj CAij e'k% 3, 4 vkSj 5 vH;kUrj fcUnq (interior points) fLFkr gSaA bu
vH;kUrjfcUnqvksadks'kh"kZekudjfdrusf=kHkqtcuk,tkldrsgSa\
Sol.
Ans. 205
Total number of triangle = Two points taken from AB and one point either BC or CA + similarly BC +
similarly A + one point each sides.
= 3C2 [4C1 + 5C1] + 4C2 [5C1 + 3C1] + 5C2 [3C1 + 4C1] + 3C14C15C1 = 205
Total (collinear points used)
= 12C3 (3C3 + 4C3 + 5C3)
= 220 15 = 205
Alternate
Total Collinear points used = 12 C3 (3C3 + 4C3 + 5C3) = 220 15 = 205
Hindi. f=kHkqtksa dh dqy la[;k = nksfcUnq AB ij ls rFkk,d fcUnq BC ;k CAls ysxsa + blh izdkj BC + blh izdkjCA
+ ,dfcUnqizR;sdHkqtkijls
= 3C2 [4C1 + 5C1] + 4C2 [5C1 + 3C1] + 5C2 [3C1 + 4C1] + 3C14C15C1 = 205
dqy(lajs[kh;fcUnqysdjcuk;sx;sf=kHkqt)
= 12C3 (3C3 + 4C3 + 5C3)
= 220 15 = 205
oSdYifd
dqy lajs[kh; ysdj cuk;s x;s f=kHkqt = 12C3 (3C3 + 4C3 + 5C3) = 220 15 = 205
10.
How many positive integers of n digits exist such that each digit is 1, 2, or 3? How many of these
contain all three of the digits 1, 2 and 3 atleast once ?
n vadksdsfdrus/kukRediw.kkdlEHkogSaftudkizR;sdvad1,2;k3gks\buesals,slhfdruhla[;k,gksxhftuesa
lHkh rhuksa vad 1, 2, 3 de ls de ,d ckj vk;s\

Sol.
Ans. 3n , 3 n 3.2n + 3
Total n-digit numbers using 1, 2 or 3 = 3n
total n-digit numbers using any two digits out of 1, 2 or 3 = 3C2 2 n 6 = 3 2 n 6
RESONANCE
total n-digit numbers using only one digit of 1, 2 or 3 = 3
the numbers containing all three of the digits

1, 2 and 3 at least once = 3 n (3 2 n 6) 3 = 3n 3 . 2n + 3
Hindi. 1, 2 ;k3 dk iz;ksx djds dqy n vad okyh la[;k,= 3n
1, 2 ;k3 esa ls fdUgh nks vadksa dk iz;ksx djds dqy n vad okyh la[;k,= 3C2 2n 6 = 3 2n 6
1, 2 ;k3 esa ls dsoy ,d vad dk iz;ksx djds cuh la[;k, = 3
1, 2 vkSj3 esa ls izR;sd vad dk de ls de ,d ckj iz;ksx djds cuh la[;k, = 3n (3 2n 6) 3

= 3n 3 . 2n + 3
11.
Find the number of ways in which 8 non-identical apples can be distributed among 3 boys such that
every boy should get atleast 1 apple & atmost 4 apples.
8 fofHkUu lsc 3 yM+dks esa fdrus izdkj ls ckaVs tk ldrs gSa tcfdizR;sd yM+ds dks de ls de ,d vkSj vf/kd ls
vf/kd4lscfeyrsgSa\
Sol.
Ans. 4620
8 - non identical
number of ways=
B1
B2
1
3
2
3
2
2
Here required number of ways
= 3! {8C1 . 7C3 .4C4 + 8C2 . 6C3 .
B3
4
3
4
3C
3+
8C
. 6C 2 . 4C 4}
8!
8!
6!
8!
6!
= 6
3 !. 4! 2!. 6! 3 !. 3! 2 !. 6! 2!. 4!
= 6[280 + 280 + 210]

= 6 770
= 4620
Hindi. 8fofHkUulsc
dqyrjhdksa dhla[;k=
B1
1
2
2
B2
3
3
2
B3
4
3
4
;gkvHkh"Vrjhdksadhla[;k
= 3! {8C1 . 7C3 .4C4 + 8C2 . 6C3 . 3C3 + 8C2 . 6C2 . 4C4}
8!
8!
6!
8!
6!
= 6
3
!
.
4
!
2
!
.
6
!
3
!
.
3
!
2
!
.
6
!
2
!. 4!
= 6[280 + 280 + 210]

= 6 770
= 4620
12.
There are ' n ' straight line in a plane, no two of which are parallel and no three pass through the same
point. Their points of intersection are joined. Show that the number of fresh lines thus introduced is,
1
8 n (n 1) (n 2) (n 3).
,dleryesa'n'ljyjs[kk,gSftuesalsdksbZHkhnkslekUrjughagSvkSjdksbZHkhrhujs[kk,lekufcUnqls
ughaxqtjrhgSaAmudsizfrPNsnfcUnqvksadksfeyk;ktkrkgSaAiznf'kZrdhft,fdblizdkjcuusokyhu;hljy
js[kkvksa dh la[;k 81 n (n 1) (n 2) (n 3) gSaA
Sol.
If 'n' straight line intersect each other then total
RESONANCE
number of intersection point is nC2 =
n(n 1)
2
Now, from these nC2 points we can make
n(n 1)
2 C
lines. (total old + new lines)

and number of old lines are
So fresh lines are
n(n 1)
2 C
n 1
C2 n
n 1
C2 n
= 1 n (n 1) (n 2) (n 3)
Hindi.
;fn'n' ljyjs[kk,,dnwljsdksizfrPNsndjrhgS]rksdqyizfrPNsnfcUnqvksadhla[;k nC2 =

vcnC2 fcUnqvksalsge
n(n 1)
2 C
n(n 1)
2
js[kk,cukldrsgS
(dqyiqjkuh+ u;hjs[kk;s)
RkFkkiqjkuhjs[kkvksadhla[;kn1C2 ngksxhA
vr% u;h cuh js[kkvksa dh la[;k
n(n 1)
2 C
n1C 2 n =
1
8 n (n 1) (n 2) (n 3)
PART - II : OBJECTIVE QUESTIONS
Hkkx- II : oLrqfu"B iz'u OBJECTIVE QUESTIONS

Single choice type
,dy fodYih izdkj

1.
A train is going from London to Cambridge stops at 12 intermediate stations. 75 persons enter the train
during the journey with 75 different tickets of the same class. Number of different sets of tickets they
may be holding is:
(A*) 78C3
(B) 91C75
(C) 84C75
(D) none
yUnulsdSfEczttkusokyh,dVsu12ek/;fedLVs'kuksaij:drhgSaA;k=kkdsnkSjkulekuJs.khds 75 fHkUufVdVysdj75
;k=khVsuesaizos'kdjrsgSa]rksbufVdVksadsfdrusvyx&vyxlewgcuk,tkldrsgSa:
(A) 78C3
(B) 91C75
(C) 84C75
(D)buesalsdksbZugha
Sol.
Total no. of different tickets is

12 + 11 + 10 + ......+ 1 = 78
Hence required no. = 78C75 = 78C3
Hindi.
dqyfHkUufVdVksadhla[;k
12 + 11 + 10 + ......+ 1 = 78
vr% vHkh"V la[;k = 78C75 = 78C3

2.
In a unique hockey series between India & Pakistan, they decide to play on till a team wins 5 matches.
The number of ways in which the series can be won by India, if no match ends in a draw is:
(A*) 126
(B) 252
(C) 225
(D) none
HkkjrvkSjikfdLrku,dgkWdhJ`a[kykrcrd[ksyrsgSatcrdfd,dVhe5 eSpughathrtkrhgSaA;fn,dHkheSpMkugha
gks]rksHkkjr;gJ`a[kykfdrusrjhdksalsthrldrkgSa\
(A) 126
(B) 252
(C) 225
(D)buesalsdksbZugha
Sol.
Case - when all 5 match win the india then total

no. of ways = 5C5
RESONANCE
Case - when 6 th match win the india then total

no. of ways = 5C4
Case - when 7 th match win the india then total
no. of ways = 6C4
Case - V when 8th match win the india then total
no. of ways = 7C4
Case - V when 9th match win the india then total
no. of ways = 8C4
Hence required no. of ways
= 1 + 5 + 6C 4 + 7C 4 + 8C 4
= 1 + 5 + 15 + 35 + 70 = 126
Hindi.
fLFkfr- tclHkh5 eSpHkkjrthrtkrkgSrksdqyrjhds= 5C5

fLFkfr- tc6 okaeSpHkkjrthrrkgS]rksdqyrjhds= 5C4
fLFkfr- tc7 okaeSpHkkjrthrrkgS]rksdqyrjhds= 6C4
fLFkfr- V tc8 okaeSpHkkjrthrrkgS]rksdqyrjhds= 7C4
fLFkfr- V tc9 okaeSpHkkjrthrrkgS]rksdqyrjhds= 8C4
vr%vHkh"Vrjhds
= 1 + 5 + 6C 4 + 7C 4 + 8C 4
= 1 + 5 + 15 + 35 + 70 = 126
3.
12 guests at a dinner party are to be seated along a circular table. Supposing that the master and
mistress of the house have fixed seats opposite to one another and that there are two specified guests
who must always be placed next to one another. The number of ways in which the company can be
placed, is:
(A*) 20. 10 !
(B) 22. 10 !
(C) 44. 10 !
(D) none
,djkf=kHkkstesa12 esgekuksadks,dxksyestijfcBk;ktkrkgSAekukfdekfydvkSjekyfduvkeus&lkeusfuf'prlhVksaij
cSBrsgSvkSjnksfo'ks"kesgekulnSolkFk&lkFkcSBrsgks]rkslEiw.kZlewgdksfdrusrjhdksalsfcBk;ktkldrkgSa\
(A) 20. 10 !
(B) 22. 10 !
(C) 44. 10 !
(D)buesalsdksbZugha
Sol.
First we seat first two specified person in

210 = 20 ways and remaining 10 person can be
arranged in 10! ways.
So total no. of ways is = 21010! = 20. 10 !

Hindi.
igysgenksfo'ks"kesgekuksadkscSBkrsgSatksfd210=20rjhdslscSBldrsgSarFkkckdhcps10O;fDr10! rjhdksalsO;ofLFkr
gksldrsgSaA
vr% dqy rjhds = 21010! = 20. 10 !

4.
Six persons A, B, C, D, E and F are to be seated at a circular table. The number of ways this can be
done if A must have either B or C on his right and B must have either C or D on his right, is:
N%O;fDr;ksaA,B, C,D,EvkSjF dks,dxksyestdspkjksavksjfdrusrjhdksalscSBk;ktkldrkgSa;fnAdsnka;hvksjlnSo

B ;kCcSBrsgSavkSjB dsnka;hvksjlnSoC;kD cSBrsgSaA
Sol.
(A) 36
(B) 12
Case- If B is right on A
RESONANCE
(C) 24
(D*) 18
Subcase - C is right on B
then no. of ways = (4 1)! = 6
Subcase- If D is right on B
then no. of ways = (4 1)! = 6
Case- If C is right on A
D must be right on B
= (4 1)! = 3! = 6
Hence total no. of ways is 6 + 6 + 6 = 18
Hindi.
fLFkfr- ;fnB,Adsnka;hvksjgS
(a)
C,Bdsnka;hvksjgks]rks
dqy rjhds = (4 1)! = 6
;fnD,Bdsnka;hvksjgks]rks
dqy rjhds = (4 1)! = 6
fLFkfr- ;fnC,Adsnka;hvksjgks
D, B dsnka;hvksjgksukpkfg,
(b)
= (4 1)! = 3! = 6
vr% dqy rjhds 6 + 6 + 6 = 18

5.
Out of 16 players of a cricket team, 4 are bowlers and 2 are wicket keepers. A team of 11 players is to
be chosen so as to contain at least 3 bowlers and at least 1 wicketkeeper. The number of ways in
which the team be selected, is
,dfdsVVheds16 f[kykfM+;ksaesa4xsancktvkSj2fodsVdhijgSA11 f[kykfM+;ksadh,dVhefdrusrjhdkslscuk;htkldrh

gSa]ftlesadelsde3 xsancktvkSjdelsde,dfodsV&dhijgks\
(A) 2400
(B*) 2472
(C) 2500
Sol.
Number of bowlers = 4
Number of wicketkeeper = 2
Let total number required selection
4C . 2C . 10 C + 4C . 2C . 10 C +4C . 2 C . 10 C + 4C . 2C . 10 C
3
1
7
4
1
6
3
2
6
4
2
5
960 + 420 + 840 + 252
= 2472
Hindi. xsanksadhl[;k=4
(D) 960
fodsVdhijksadhla[;k = 2
vHkh"Vpqukoksadhla[;k
4C
.2C1 .10 C7 + 4C4 .2C1 .10 C6 +4C3 . 2C2 .10 C6 + 4C4 . 2C2 .10 C5
960 + 420 + 840 + 252
= 2472
6.
The number of ways in which 15 identical apples & 10 identical oranges can be distributed among three
persons, each receiving none, one or more is:
(A) 5670
(B) 7200
(C*) 8976
(D) none of these
RESONANCE
15 le:ilscvkSj10 le:ilarjksdksrhuO;fDr;ksaesafdrusrjhdksalsckaVktkldrkgS;fnizR;sdO;fDrdks'kwU;],d;k
vf/kdfeysA
Sol.
(A) 5670
(B) 7200
Total no. of ways = 15 + 3 1C15 10 + 3 1C10
= 17C15 12C10
=
Hindi.
(D)buesalsdksbZugha
17 16 12 11
= 8976
2
2
dqy rjhds = 15 + 3 1C15 10 + 3 1C10
=
=
7.
(C) 8976
17
C15 12C10
17 16 12 11
= 8976
2
2
The number of permutations which can be formed out of the letters of the word "SERIES" taking three
letters together, is:
(A) 120
(B) 60
(C*) 42
(D) none
SERIES 'kCndsv{kjksaesals3 v{kjksadks,dlkFkysdjcuk,tkldusokysep;ksadhla[;kgS:
Sol.
(A) 120
(B) 60
SERIES
S - 2, E - 2 , R,
case-I when all letter distinct is
4C 13 = 4 6 = 24
3
case-II when 2 letters are same the
2C
. 3C 1
(C) 42
(D)buesalsdksbZugha
4!
= 2 . 3 . 3 = 18
2!
total number is 24 + 18 = 42
Hindi. SERIES
S - 2, E - 2 , R,
fLFkfr-I tclHkhv{kjfHkUugSaA
4C 13 = 4 6 = 24
3
fLFkfr-II tc2v{kjlekugSaA
2C
. 3C 1
4!
= 2 . 3 . 3 = 18
2!
dqy la[;k, 24 + 18 = 42
8.
Seven different coins are to be divided amongst three persons. If no two of the persons receive the
same number of coins but each receives atleast one coin & none is left over, then the number of ways
in which the division may be made is:
(A) 420
(B*) 630
(C) 710
(D) none
7fofHkUuflDdsrhuO;fDr;ksaesackaVstkrsgSaA;fnfdUghHkhnksO;fDr;ksadkslekula[;kesaflDdsughafeyrsgSaysfduizR;sd
dksdelsde,dflDdkfeyrkgSvkSjdksbZflDdk'ks"kughajgrkgS]rksbuflDdksadksfdrusrjhdksalsckaVktkldrkgSa:
(A) 420
(B) 630
(C) 710
(D)buesalsdksbZugha
Sol.
Coin dividing in any are possible i.e.

1, 2, 4
so the number of ways is
7C . 6C . 4C . 3! = 7 15 6 = 630
1
2
4
RESONANCE
Hindi.
flDdsfuEurjhdkslsckaVstkldrsgSavFkkZr~1,2,4
vr%dqyrjhdksadhla[;k
7C
9.
. 6C2 . 4C4 . 3! = 7 15 6 = 630
The streets of a city are arranged like the lines of a chess board. There are m streets running North to
South & 'n' streets running East to West. The number of ways in which a man can travel from NW to SE
corner going the shortest possible distance is:
,d'kgjdhxfy;ksadks'krjatdhfclkrdhjs[kkvksadhrjgO;ofLFkrfd;kx;kgSAmkjlsnf{k.kdhvksjtkusokyhm xfy;k
gSvkSjiwoZlsif'pedhvksjtkusokyhn xfy;kgSA,dO;fDrmkj&if'pedksuslsnf{k.k&iwoZdksusrdfdrusrjhdksalstk
ldrkgSatcfdogU;wurelEHkkfornwjhlstk;sA
(A)
Sol.
m2 n 2
(C)
( m n) !
m! . n!
(D*)
( m n 2) !
(m 1) ! . (n 1) !
( m n 2) !
( m 1) ! . ( n 1) !
gesa(n 1) xfy;kaiwoZdhvksjrFkk(m 1) xfy;kanf{k.kdhvksjr;djuhgS

vr% dqy pyh x;h xfy;ka = (m + n 2)
vr%dqyrjhds
=
10.
(m 1)2 . (n 1)2
Here we should go (n 1) steps to east and (m 1)

steps to south so total steps which we have to go
are (m + n 2) ways.
Hence total no. of ways
= m + n 2Cm1 . n 1Cn1 =
Hindi.
(B)
m+n2
Cm1 . n 1Cn1 =
(m n 2) !
( m 1) ! . ( n 1) !
The number of ways in which a mixed double tennis game can be arranged from amongst 9 married
couple if no husband & wife plays in the same game is:
9 fookfgr;qxyksadksfefJr;qxyVsfulfdrusizdkjlsf[kyk;ktkldrkgS;fndksbZHkhifrvkSjiRuh,dgh[ksy(game)
esaugha[ksyldrsgSa?
(A) 756
(B) 3024
(C*) 1512
(D) 6048
There are 9 married couple so first we select 2
man out of 9 and then we select 2 women out of
rest 7 then, we arranged them, so required no. is 9C2 7C2 2! = 36 21 2 = 1512
Hindi. 9 fookfgr;qxygSvr%igysge9 esals2 iq:"kksadkp;udjsaxsarFkkckdh7 efgykvksaesals2dkp;udjsaxsa
Sol.
rFkkbUgsaO;ofLFkrdjsxsa]vr%vHkh"Vla[;k
9
11.
C2 7C2 2! = 36 21 2 = 1512
The number of ways in which 5 X's can be placed in the squares of the figure so that no row remains
empty is:
fn;sx;sfp=kdsoxksesaikpX fdrusizdkjlsj[kstkldrsgSarkfddksbZHkhiafDr[kkyhujgs\
(A) 97
(B*) 44
(C) 100
Total number is 8C5 = 56
not required is 6C5 + 6C5 = 12
Hence required no of arrangement = 56 12 = 44
Hindi. dqy la[;k, 8C5 = 56
(D) 126
Sol.
RESONANCE
tksvko';dugha]mu rjhdksadhla[;k 6C5 + 6C5 = 12

vr%vHkh"VfoU;klksadhla[;k= 56 12 = 44
12.
In a conference 10 speakers are present. If S1 wants to speak before S2 & S2 wants to speak after
S3, then the number of ways all the 10 speakers can give their speeches with the above restriction if the
remaining seven speakers have no objection to speak at any number is :
,dlEesyuesa10 oDrkmifLFkrgSaA;fnoDrkS1 , S2 lsigyscksyukpkgrkgSvkSjS2 , S3dsckncksyukpkgrkgSvkSj;fn

'ks"klkroDrkfdlhHkhLFkkuijcksyldrsgSa]rkslHkh10oDrkviusHkk"k.kfdrusizdkjlsnsldrsgSa\
(A) 10C3
Sol.
(D*)
10 !
3
10 C
. 7.2 ! =
10!
3
loZizFkege10oDrkvksaesals3oDrkvksadkp;udjsxsarFkkmUgsafdlhHkhrjhdslsj[knsxsavccpsgq,soDrkvksadsfy,dksbZ
Hkhizfrca/kughagksxkA
vr%dqyrjhdksadhla[;k
=
13.
(C) 10P3
First we select 3 speaker out of 10 speaker and put in any way and rest are no restriction i.e. total
number of ways
=
Hindi.
(B) 10P8
10 C
. 7.2 ! =
10!
3
If all the letters of the word "QUEUE" are arranged in all possible manner as they are in a dictionary,
then the rank of the word QUEUE is:
;fn'kCn"QUEUE" dsv{kjksalsfufeZrlHkh'kCnksadks'kCndks"kdsekuqlkjO;ofLFkrfd;ktk;s]rks'kCnQUEUEdke
gS:
Sol.
(A) 15 th
(B) 16 th
Word QUEUE
E 2, Q , U - 2
(C*) 17th
(D) 18th
= 18
4!
2!
=3
3!
2!
=1
17 th rank
=1
14.
Two variants of a test paper are distributed among 12 students. Number of ways of seating of the
students in two rows so that the students sitting side by side do not have identical papers & those
sitting in the same column have the same paper is:
,diz'ui=kdsnksdksM12fo|kfFkZ;ksaesackVstkrsgSa]rksbufo|kfFkZ;ksadksnksiafDr;ksaesafdrusizdkjlsfcBk;ktkldrkgSfd
izR;sdiafDresaikl&iklcSBsfo|kfFkZ;ksadkslekuiz'u&i=kughafeysrFkkizR;sdLrEHkdslHkhfo|kfFkZ;ksadkslekuiz'ui=kfeysA
(A)
12!
6! 6!
RESONANCE
(B)
(12)!
2 5 . 6!
(C) (6 !)2. 2
(D*) 12 ! 2
Sol.
= total number of required possible is
12 C
15.
6!6!2!
12!
6 ! 6 ! 2 ! = 2 12 !
6! 6!
Sum of all the numbers that can be formed using all the digits 2, 3, 3, 4, 4, 4, is:
vadks2, 3, 3, 4, 4, 4 dks,dlkFkiz;qDrdjrsgq,fufeZrla[;kvksadk;ksxgksxk
(A*) 22222200
Sol.
(B) 11111100
=
(C) 55555500
(D) 20333280
5!
= 10
2! 3 !
5!
= 20
3!
5!
=
= 30
2! 2!
Hence sum of unit places is

2 10 + 3 20 + 4 30 = 200
Hence required sum is
= 200 (105 + 104 + 103 + 102 + 101 + 100)
= 200 (111111) = 22222200
Hindi.
5!
= 10
2! 3 !
5!
= 20
3!
5!
=
= 30
2! 2!
vr%bdkbZdsLFkkuijfLFkrvadksdk;ksx
2 10 + 3 20 + 4 30 = 200
vr%vHkh"V;ksx
= 200 (105 + 104 + 103 + 102 + 101 + 100)
= 200 (111111) = 22222200
16.
Six married couple are sitting in a room. Number of ways in which 4 people can be selected so that
there is exactly one married couple among the four is:
,ddejsesaN%fookfgr;qxycSBsgq,gSaAbuesalspkjO;fDrfdrusrjhdslspqustkldrsgS\rkfdbupkjksaesaBhd,dfookfgr
;qxyvk,A
(A*) 240
(B) 255
(C) 360
First we select one married couple out of 6 married couple i.e.
6C ways
1
total number of required case
6C 5C 4C 2 = 6 5 4 2 = 240
1
1
1
Hindi. loZizFkege6 fookfgr;qxyesals,dfookfgr,d;qxydkp;udjsxsa6C1
(D) 480
Sol.
vr%dqyvHkh"Vrjhdksadhla[;k
6C
17.
5C1 4C1 2 = 6 5 4 2 = 240
The number of ways selecting 8 books from a library which has 10 books each of Mathematics, Physics,
RESONANCE
Chemistry and English, if books of the same subject are alike, is:
,diqLrdky;esaxf.kr]HkkSfrdh]jlk;u'kkL=kvkSjvaxzsthizR;sddh10-10iqLrdsagSaA;fn,dfo"k;dhlHkhiqLrds,dleku
gks]rksiqLrdky;esals8 iqLrdsap;udjusdsdqyrjhdsagSa&
Sol.
Hindi.
(A) 13C4
(B) 13C3
total number of required selection is
8+3C = 11C = 11C
8
8
3
(D*) 11C3
cgqifn;izes;dsmi;ksxls
dqyvHkh"Vp;udsrjhdksadhla[;k
8+3C
18.
(C) 11C4
= 11C8 = 11C3
The number of integers which lie between 1 and 106 and which have the sum of the digits equal to 12 is:
1 vkSj106 dschpfdrusiw.kkdfLFkrgSaftudsvadksdk;ksx12 gSa:
(A) 8550
(B) 5382
(C*) 6062
Let
number be x 1 x 2 x 3 x 4 x 5 x 6
But
Here x1 + x 2 + .... x6 = 12
so
coefficient of x 12 in expansion (1 + x + x 2 + .... + x 9)6
= (1 x 10)6 . (1 x)6
17 C
6
7
12 C 1 . C2
= 6188 126 = 6062
Hindi. ekuk la[;k x1 x2 x3 x4 x5 x6 gSA
(D) 8055
Sol.
ijUrq ;gka x1 + x2 + .... x6 = 12

(1 + x + x2 + .... + x9)6 ds izlkj esa x12 dk xq.kkad
vr%
19.
= (1 x 10)6 . (1 x)6
17 C
6
7
12 C 1 . C2
= 6188 126 = 6062
In a shooting competition a man can score 0, 2 or 4 points for each shot. Then the number of different
ways in which he can score 14 points in 5 shots, is:
(A) 20
(B) 24
(C*) 30
(D) none
,dfu'kkusckthizfr;ksfxrkesa,dO;fDrizR;sdfu'kkusdsfy,0,2;k4vadizkIrdjldrkgSaAog5fu'kkuksaesa14vadfdrus
rjhdksalsizkIrdjldrkgSa\
(A) 20
(B) 24
(C) 30
(D)buesalsdksbZugha
Sol.
Find the coefficient of x14 in the expansion of

(x 0 + x2 + x 4)5 = (1 + x 2 + x4)5
1 x6
=
2
1 x
= (1 x6)5 (1 x2)5
= (1 5x 6 + 10x 12............) 1 5C1x 2 6C 2 x 4 7 C3 x 6 ........

= 11C7 5 . 8C4 + 10.5
=
11 10 9 8
8765
5.
+ 50
1 2 3 4
1 2 3 4
= 330 350 + 50 = 30
Hindi. (x0 + x2 + x4)5 = (1 + x2 + x4)5 ds izlkj esa x14 dk xq.kkad Kkr djus ij
1 x6
=
2
1 x
= (1 x6)5 (1 x2)5
ds izlkj esa x
= (1 5x6 + 10x12............) 1 5C1x 2 6C 2 x 4 7 C3 x 6 ........

= 11C7 5 . 8C4 + 10.5
=
14
dk xq.kkad
11 10 9 8
8765
5.
+ 50
1 2 3 4
1 2 3 4
RESONANCE
= 330 350 + 50 = 30
20.
Number of ways in which a pack of 52 playing cards be distributed equally among four players so that
each may have the Ace, King, Queen and Jack of the same suit, is:
(A)
36 !
9 !
36 ! . 4 !
(B*)
9 !
(C)
36 !
9 !4
(D) none
. 4!
rk'kds52ikksadks4O;fDr;ksaesaleku:ilsfdrusrjhdksalsckaVktkldrkgSatcfdizR;sdO;fDrdkslekuizdkj(same
suit) dsbDdk]ckn'kkg]csxevkSjxqykefeyrsgks&
(A)
Sol.
36 ! . 4 !
9 !
(C)
36 !
9 !4
(D)buesalsdksbZugha
. 4!
. 27 C9 . 18C9 . 9C9 . 4 ! =
36 !
4!
(9! )4
vHkh"Vrjhdksadhla[;k
36 C
21.
9 !
(B)
Required number of ways

36 C
Hindi.
36 !
. 27 C9 . 18C9 . 9C9 . 4 ! =
36 !
4!
(9! )4
A box contains 6 balls which may be all of different colours or three each of two colours or two each of
three different colours. The number of ways of selecting 3 balls from the box (if ball of same colour are
identical), is:
(A) 60
(B*) 31
(C) 30
(D) none
,dcDlsesa6 xsansftuesalslHkhvyx&vyxjaxdhgksldrhgSa;knksjaxdhrhu&rhuxsansgksldrhgS;krhujaxdhnks&nks
xsansgksldrhgSaA;fnlekujaxdhxsansloZlegks]rkscDlsesals3xsanspquusdsrjhdsgSa
(A) 60
(B) 31
(C) 30
(D)buesalsdksbZugha
Sol.
Case -I If all are different then no. of ways is

6
=
C3 = 20
Case-II If three each of two colours, then
combination is
2
1
0
3!
1
1
1
1!
= 3! + 1! = 7ways
Case-III If two each of three colours, then

combination is
3
0
2!
2
1
= 2! + 2! = 4 ways
2!
Hence required no.is = 20 + 7 + 4 = 31
6
Hindi. fLFkfr-I ;fnlHkhfHkUugks]rksdqyrjhds=
C3 = 20
fLFkfr-II ;fnnksjaxdhrhu&rhuxsansgks]rkspquusdsrjhds
2
1
1
1
0
1
3!
1!
= 3! + 1! = 7 rjhds
fLFkfr-III ;fnrhujaxksadhnks&nksxsansagks]rkspquusdsrjhds
3
2
0
1
2!
2!
= 2! + 2! = 4 rjhds
vr% vHkh"V la[;k = 20 + 7 + 4 = 31

22.
Number of ways in which 2 Indians, 3 Americans, 3 Italians and 4 Frenchmen can be seated on a
circle, if the people of the same nationality sit together, is:
(A) 2. (4 !)2 (3 !)2
(B*) 2. (3 !)3. 4 !
(C) 2. (3 !) (4 !)3
(D) none
RESONANCE
2 Hkkjrh;] 3 vesfjdu] 3 bVkfy;u vkSj 4 sUp ,d o`k esa fdrus rjhdks lscSB ldrs gSa ;fn leku jk"Vh;rk ds
O;fDr,dlkFkcSBukpkgrsgks\
(A) 2. (4 !)2 (3 !)2
(B) 2. (3 !)3. 4 !
(C) 2. (3 !) (4 !)3
Sol.
Indians - 2
Americans - 3
Italians - 3
Frenchmen - 4
total number arranging in row of same nationality are together
= 3 ! 2! 3! 3! 4 !
= 3 ! 2! 3! 3! 4 !
= 2 . (3!)3 . 4!
Hindi. Hkkjrh;- 2
(D)buesalsdksbZugha
vesfjdu- 3
bVkfy;u- 3
sUp- 4
lekujk"Vh;rkdsO;fDrdks,dlkFkj[kdj cSBkus ds rjhds
= 3 ! 2! 3! 3! 4 !
= 3 ! 2! 3! 3! 4 !
= 2 . (3!)3 . 4!
23.
Number of ways in which all the letters of the word " ALASKA " can be arranged in a circle distinguishing
between the clockwise and anticlockwise arrangement,, is:
(A) 60
(B) 40
(C*) 20
(D) none of these
"ALASKA"'kCndsv{kjksadks,do`kesafdrusrjhdksalsO;ofLFkrfd;ktkldrkgStcfdnf{k.kkorZvkSjokekorZ
e dks vyx&vyx ekuk tkrk gSa \

(A) 60
Sol.
(B) 40
(D)buesalsdksbZugha
(C) 20
ALAS KA
Total number of arrangement is
5!
5!
120
=
= 20
3!
6
120
= 20
dqy foU;klksa dh la[;k 3 ! =
6
24.
Let Pn denotes the number of ways of selecting 3 people out of ' n ' sitting in a row, if no two of them are
consecutive and Qn is the corresponding figure when they are in a circle. If Pn Qn = 6, then ' n ' is equal
to:
ekukfdPn ,diafDresacSBsgq,'n' O;fDr;ksaesals3 O;fDr;ksadsp;udjusdsdqyrjhdksadksiznf'kZrdjrkgStcfdmuesa

lsdksbZHkhnksekxrughagSvkSjQn mulaxrrjhdksadksiznf'kZrdjrkgStcfdos,do`kesacSBsgksA;fnPn Qn =6 gks]
rks'n'cjkcjgksxk&
(A) 8
Sol.
(B) 9
Here;gk
(C*) 10
(D) 12
Pn =
x1 + x2 + x3 + x4 = n 3
x 1 + y2 + y3 + x4 n 5
RESONANCE
x1 , x4 0
x2 , x3 1
pn =
n 5 + 4 1c
n 2c
y1 , y2 0
Qn =
x1 + x2 + x3 = n 3
y1 + y2 + y3 = n 6
Now vc Pn Qn = 6
(n 2) (n 3) (n 4) n(n 4) (n 5)
=6
1.2.3
1.2.3
n = 10
More than one choice type
cgqfodYihizdkj
25.
The number of non-negative integral solutions of x1 + x 2 + x3 + x 4 n (where n is a positive integer) is

x1 + x2 + x3 + x4 n (tgk n ,d /kukRed iw.kkd gSa) ds v_.kkRed iw.kkd gyksa dh la[;k gSa &
(A) n+3C3
(B*) n+4C4
Sol.
x1 + x2 + x3 + x4 n
x1 + x2 + x3 + x4 + y = n
(where y is known as pseudo variable)
Total no. of required solution is
= n + 5 1Cn = n+4Cn or n+4C4
Hindi. x 1 + x 2 + x 3 + x 4 n
x1 + x2 + x3 + x4 + y = n
(C) n+5C5
(D*) n+4Cn
(;gk y ,d Nn~e pj gS)
dqyvHkh"Vgyksadhla[;k
=
26.
n + 5 1
Cn =
n+4
Cn =
n+4
C4
A student has to answer 10 out of 13 questions in an examination. The number of ways in which he can
answer if he must answer atleast 3 of the first five questions is:
,dfo|kFkhZdks,dijh{kkesa13iz'uksaesals10iz'uksadsmkjnsusgSaAogfdrusrjhdksalsmkjnsldrkgS;fn
mls izFke 5 iz'uksa esa lsde ls de 3 ds mkj nsuk vko';d gks \
Sol.
27.
(A*) 276
(C*) 13C10 5C3
Total number of required possibilities
5C . 8C + 5C . 8C + 5C . 8C . 5 C
3
7
4
6
5
5
5
= 5C 3 . 8C 7 + 5C 4 . 8C 6 + 8C 6
= 13 C10 5C3 = 276
(B) 267
(D*) 5C3 . 8C7 + 5C4 . 8C6 + 8C5
You are given 8 balls of different colour (black, white,...). The number of ways in which these balls can
be arranged in a row so that the two balls of particular colour (say red & white) may never come
together is:
(A*) 8 ! 2.7 !
(B*) 6. 7 !
(C*) 2. 6 !. 7C2
(D) none
fofHkUujaxks(dkyh]lQsn]yky...)dh8xsanksdks,diafDresafdrusrjhdksalsO;ofLFkrfd;ktkldrkgS;fnfo'ks"k
jaxdhnksxsansekukfdykyvkSjlQsndHkhHkh,dlkFkuvk;sa\
RESONANCE
(A) 8 ! 2.7 !
Sol.
(B) 6. 7 !
(C) 2. 6 !. 7C2
(D)buesalsdksbZugha
Required number of possible is
dqyvHkh"VlaHkkoukvksadhla[;k
8 ! 2. 7 ! = 7 ! (8 2) = 6 . 7!
2 . 6 ! . 7C 2
28.
There are 10 seats in the first row of a theatre of which 4 are to be occupied. The number of ways of
arranging 4 persons so that no two persons sit side by side is:
,dflusek?kjdhizFkeiafDresa10lhVksaijpkjO;fDr;ksadksfdrusrjhdksalscSBk;ktkldrkgS]tcfddksbZHkh
nksO;fDrikl&iklucSBsa\
(A) 7C4
(B*) 4. 7P3
(C*) 7C3. 4 !
(D*) 840
Sol.
x1 + x2 + x3 + x4 + x5 = 6
x1 + y1 + y2 + y3 + x 5 = 3
but ijUrq x1, x5 0
x 2, x 3, x 4 1
y1, y2, y3 0
vr%vHkh"Vrjhdksadhla[;k
3 + 5 1C
=
29.
7p
. 4 ! = 7C 3 . 4 !
. 4 = 840
3
Number of ways in which 3 numbers in A.P. can be selected from 1, 2, 3,...... n is:
(A)
(n 2)(n 4)
if n is even
4
2
n 1
(C*)
if n is odd
(B)
n 2 4n 5
if n is odd
2
(D*)
n n 2
4
if n is even
la[;kvksa 1, 2, 3,...... n esals lekUrj Js<+h esa 3 la[;k, fdrus izdkj ls pquh tk ldrh gSa \
(A)
(n 2)(n 4)
4
2
n 1
(C)
Sol.
;fn n le gSa
;fnn fo"kegSa
(B)
(D)
n2 4n 5
;fnn fo"kegSa
2
n n 2
4
;fn n le gSa
Here given no. be 1,2,3,.........n

Let common difference = r
Total way of selection
= (1, 1 + r, 1+2r),(2, 2 + r, 2 + 2r), ..(n 2r, n r, n)
Total numbers are = (n 2r)
Here rmin. = 1 and rmax. = (n 1)/2
Case- I When n is odd
rmax =
(n 1)
& total no. of selection is
2
(n1) / 2
(n 2r )
r 1
RESONANCE
n 1 n 1
2
2
n(n 1)
2 2 n 1
=
=
2
2
2
Case - II when n is even = rmax =
n2
2
so total no. selection is
n2n
2
n(n 2)
(n 2r) =
2 2
2
r 1
2
(n2) / 2
n
n2
n(n 2)
n =
=
2
2
4
Hindi.
nh x;h la[;k, 1,2,3,.........n

ekuk fd lkoZvUrj = r
pquusdsdqyrjhds
= (1, 1 + r, 1+2r),(2, 2 + r, 2 + 2r), ..(n 2r, n r, n)
dqy la[;k, = (n 2r)
;gk rmin. = 1 rFkk rmax. = (n 1)/2

fLFkfr- I tc n fo"ke gks
rmax =
(n 1)
2
rFkk pquus ds dqy rjhds
(n1) / 2
(n 2r )
r 1
n 1 n 1
2
2
n(n 1)
2 2 n 1
=
=
2
2
2
fLFkfr - II tc n le gks= rmax =
n2
2
vr% pquus ds dqy rjhds

n2n
2
n(n 2)
2 2
(n 2r) =
2
2
r 1
(n2) / 2
n
n2
n(n 2)
n =
=
2
2
4
30.
The number of ways in which 10 students can be divided into three teams, one containing 4 and others
3 each, is
10fo|kfFkZ;ksadks3VheksaesafdrusizdkjlsfoHkkftrfd;ktkldrkgSa;fn,dVheesa4fo|kFkhZgSavkSj'ks"knksesa
izR;sdesa3fo|kFkhZgks\
(A)
Sol.
10 !
4!3!3!
(B*) 2100
(C*) 10C4 . 5C3
(D)
10 !
1
.
6!3!3! 2
Total required number of teams is
RESONANCE
10
=
=
Hindi.
10
10!
6!
C 4 . 6 C3 . 3 C 3
3
3 =
4! 6! 3 ! 3! 3!
3!
C4 . 5C2 = 2100
dqyvHkh"VVheksadhla[;k
10
=
=
10
10!
6!
C 4 . 6 C3 . 3 C 3
3
3 =
4! 6! 3 ! 3! 3!
3!
C4 . 5C2 = 2100
PART - I : MATCH THE COLUMN
Hkkx- I : dkWye dks lqesfyr dhft, (MATCH THE COLUMN)

1.
Consider the word "HONOLULU".

Column I
(A)
Number of words that can be formed using
the letters of the given word in which consonants
& vowels are alternate is
Column II
(p)
26
(B)
Number of words that can be formed without

changing the order of vowels is
(q)
144
(C)
Number of ways in which 4 letters can be

selected from the letters of the given word is
(r)
840
(D)
Number of words in which two O's are together

but U's are separated is
(s)
900
Ans.
(A) (q),
(B) (r),
(C) (p),
(D) (s)
ekuk'kCn"HONOLULU"gSA
LrEHk I
(A)
fn,x,'kCndsv{kjksadsmi;ksxlscuusokysmu'kCnksadhla[;kftuesa
O;atu,oaLoj,dkUrjeesavkrsgks]gS&
Sol.
LrEHk II
(p)
26
(B)
LojksadkefcukifjofrZrfd,cuusokys'kCnksdhla[;kgS&
(q)
144
(C)
fn,x,'kCnls4 v{kjksadkmi;ksxdjdscuk,tkusokys'kCnksdhla[;kgS&
(r)
840
(D)
'kCnksadhla[;kftleasnksO's lkFk&lkFkysfduU's vyx&vyxgks]gS&
(s)
900
(A)
4! 4!
2! 2! 2! 2! = 144
[P & C, E]
(B)
8C
4!
= 840
2!
[P & C, E]
(C)
Case-I
RESONANCE
2-alike + 2-alike = 3C2
[P & C, E]
Case-II
Case-III
(D)
Hindi. (A)
2-alike + 2 diff. = 3C1 4C2

All diff. = 5C4
= 3 + 18 + 5 = 26
5! 6
C2 = 900
2!
[P & C, E]
4! 4!
2! 2! 2! 2! = 144
[P & C, E]
4!
= 840
2!
[P & C, E]
(B)
8C
(C)
fLFkfr-I
fLFkfr-II
fLFkfr-III
2-leku + 2-leku = 3C2
[P & C, E]
2-leku+ 2 fHkUu= 3C1 4C2
lHkhfHkUu=5C4
= 3 + 18 + 5 = 26
(D)
2.
5! 6
C2 = 900
2!
[P & C, E]
Column I
Column II
(A)
The total number of selections of fruits which can be made

from, 3 bananas, 4 apples and 2 oranges is, it is given that
fruits of one kind are identical
(p)
Greater than 50
(B)
If 7 points out of 12 are in the same straight line, then

the number of triangles formed is
(q)
Greater than 100
(C)
The number of ways of selecting 10 balls from unlimited

number of red, black, white and green balls is, it is given
that balls of same colours are identical
(r)
Greater than 150
(D)
The total number of proper divisors of 38808 is
(s)
Greater than 200
Ans.
(A) (p),
(B) (p, q, r), (C) (p, q, r, s),
(D) (p)
LrEHk
LrEHk
(A)
3dsys]4lscvkSj2lUrjksaesalsQypquusdsdqyrjhds]
(p)
50lsT;knk
(B)
tcfd,dizdkjdslHkhQylekugSa]gksaxs&
;fndqy12fcUnqvksaesals7fcUnq,dghljyjs[kkijgS]rksbuls
cuusokysf=kHkqtksadhla[;kgS&
(q)
100lsT;knk
(r)
150lsT;knk
(D)
vlhferla[;kesamifLFkryky]dkyh]lQsnvkSjgjhxsnksaesals
10xsanspquusdsrjhdksadhla[;k]tcfdlekujaxdhlHkhxsnsa
loZlegaS]gksxh&
la[;k 38808 ds mfpr Hkktdksa(proper divisors) dh dqy la[;k gS &
Ans.
(A) (p),
(A)
(B)
Required number of ways = (2 + 1) (3 + 1) (4 + 1) 1 = 59.

The number of ways of selecting 3 points out of 12 points is 12C3 .
Three points out of 7 collinear points can be selected in 7C3 ways.
Hence, the number of triangles formed is 12C3 7C3 = 185.
(C)
Requied number of ways
(C)
(B) (p, q, r), (C) (p, q, r, s),
(s)
200lsT;knk
(D) (p)
Sol.
[P & C, T]
RESONANCE
= Coefficient of x10 in (1 + x + x2 + ......)4

= Coefficient of x10 in (1 x)4 = 10+41C41 = 13C3 = 286
(D)
Hindi
(A)
(B)
(C)
Factorizing the given number, we have

38808 = 23 . 32 . 72 . 11
The total number of divisors of this number is same as the number of ways of selecting some or all
of two 2s, two 3's, two 7s and one 11. Therefore, the total number of divisors
= (3 + 1) (2 + 1) (2 + 1) (1 + 1) = 72
Hence, the required number of divisors = 72 2 = 70
dqy vHkh"V rjhds = (2 + 1) (3 + 1) (4 + 1) 1 = 59.
12fcUnqvksaesals3fcUnqp;udjusdsrjhds=12C3 .
7lajs[kh;fcUnqvksaesals3fcUnq7C3rjhdslspqustkldrsgSaA
vr%cuusokysf=kHkqtksadhla[;k=12C3 7C3 =185.
vHkh"Vrjhds
= (1 + x + x2 + ......)4 esa x10 dk xq.kkad
= (1 x)4 esa x10 dk xq.kkad = 10+41C41 = 13C3 = 286
(D)
nhx;hla[;kdsxq.ku[kaMdjusij
38808 = 23 . 32 . 72 . 11
nhx;hla[;kdsHkktdksadhla[;koghagksxhtksfdnks 2s,nks3's,nks7srFkk,d11esalsdqN;klHkhdks
p;udjusdsrjhdsgks
= (3 + 1) (2 + 1) (2 + 1) (1 + 1) = 72
vRk% vHkh"V mfpr Hkktdksa dh la[;k =722=70
PART - II : COMPREHENSION
Hkkx- II : vuqPNsn (COMPREHENSION)

Comprehension # 1
There are 8 official and 4 non-official members, out of these 12 members a committee of 5 members is to be
formed, then answer the following questions.
3.
Sol.
4.
Sol.
5.
Sol.
Number of committees consisting of 3 official and 2 non-official members, are

(A) 363
(B*) 336
(C) 236
(D) 326
3 official out of 8 can be selected by 8C3 = 56 ways
2 non-official out of 4 can be selected in 4C2 = 6 ways
required number of committees are 56 6 = 336.

Number of committees consisting of at least two non-official members, are
(A*) 456
(B) 546
(C) 654
(D) 466
Two non-officials and 3 officials i.e.
4
C2 8C3 = 6 56 = 336.
Three non-official and 2 officials
4
C3 8C2 = 4 28 = 112.
Four non-officials and 1 official
4
C4 8 C1 = 1 8 = 8
Total 336 + 112 + 8 = 456.
Number of committees in which a particular official member is never included, are
(A) 264
(B) 642
(C) 266
(D*) 462
Required no. of ways
= 12 1C5 = 11C5 = 462
[P & C, E]
vuqPNsn # 1
RESONANCE
8ljdkjhvkSj4xSj&ljdkjhlnL;gS] bu12 lnL;ksa esa ls5 lnL;ksadh,dlfefrcukbZ tkrhgSA rksfuEufyf[kr
iz'uksadsmkjnhft,A
Sol.
3ljdkjhvkSj2xSj&ljdkjhlnL;ksadksysdjcukbZtkusokyhlfefr;ksadhla[;kgS&
(A) 363
(B*) 336
(C) 236
(D) 326
8
8esals3ljdkjhlnL;ksadks pquusdsrjhds= C3 =56
4esals2xSj&ljdkjhlnL;ksadkspquusadsrjhds =4C2 =6
lfefr cukus ds dqy rjhds = 56 6 = 336.
4.
delsdenksxSj&ljdkjhlnL;ksadksysdjcukbZtkusokyhlfefr;ksadhla[;kgS&
Sol.
nksxSj&ljdkjhrFkk3ljdkjhlnL;ksaokyhlfefr;k
3.
(A*) 456
(B) 546
(C) 654
[P & C, E]
(D) 466
= 4C2 8C3 = 6 56 = 336.

rhuxSj&ljdkjhrFkk2ljdkjhlnL;ksaokyhlfefr;k
= 4C3 8C2 = 4 28 = 112.
pkjxSj&ljdkjhrFkk1ljdkjhlnL;ksaokyhlfefr;k
= 4 C4 8 C1 = 1 8 = 8
vr% dqy lfefr;k = 336 + 112 + 8 = 456.
5.
,dfo'ks"kljdkjhlnL;dksdHkhlfEefyrughadjrsgq,cukbZtkusokyhlfefr;ksadhla[;kgS&
Sol.
vHkh"V rjhds = 12 1C5 = 11C5 = 462
(A) 264
(B) 642
(C) 266
(D*) 462
Comprehenssion # 2
Let n be the number of ways in which the letters of the word "RESONANCE" can be arranged so that vowels
appear at the even places and m be the number of ways in which "RESONANCE" can be arrange so that
letters R, S, O, A, appear in the order same as in the word RESONANCE, then answer the following
questions.
6.
Sol.
The value of n is
(A) 360
(B*) 720
In the word RESONANCE there are 9 letters.
Consonants (5), 1R, 1S, 1C and 2N
Vowels (4), 2E, 1O, 1A
total even places 4 ;
No. of ways arranging vowels in even places is
(C) 240
(D) 840
4!
= 12
2!
No. of ways arranging consonants in remaining odd places is
5!
= 60
2!
required number of arrangement = 12 60 = 720 = n

7.
Sol.
8.
Sol.
The value of m is
(A*) 3780
(B) 3870
(C) 3670
(D) 3760
9!
Required number of arrangements are 2! 2! 4 ! = 3780
The exponent of 5 in n! is
(A) 88
(B*) 178
Now exponents of 5 in 720
(C) 358
(D) None of these
720 720 720 720

=
5 52 53 54
= 144 + 28 + 5 + 1 = 178
vuqPNsn # 2
RESONANCE
ekukfd'kCn"RESONANCE"dsv{kjksadksO;ofLFkrdjusdsmurjhdksadhla[;kgSftuesaLojleLFkkuksaijvkrs
gS]ngSavkSj'kCn"RESONANCE"dsv{kjkasdksO;ofLFkrdjusdsmurjhdksadhla[;kgSftuesav{kjR,S,O,A,blh
eeasvkrsgSa]mgSrksfuEufyf[kriz'uksadsmkjnhft,&
6.
Sol.
n dk eku gS &
(A) 360
(B*) 720
'kCnRESONANCEesadqy 9v{kjgSA
O;atu(5), 1R, 1S, 1C vkSj2N
Loj (4), 2E, 1O, 1A
dqyleLFkkuksadhla[;k=4
(C) 240
(D) 840
4!
2!
LojksadksleLFkkuksaijO;ofLFkrdjusdsrjhdksadhla[;k = =12
5!
2!
'ks"kfo"keLFkkuksaijO;atuksadksO;ofLFkrdjusdsrjhdksdhla[;k= =60
7.
vr% vHkh"V rjhdks dh la[;k = n = 12 60 = 720

m dk eku gS &
(A*) 3780
(B) 3870
Sol.
vHkh"V rjhdks dh la[;k =m =
8.
n!esa5dk?kkrkadgS&
(A) 88
720esa5dk?kkrkad
Sol.
(C) 3670
(D) 3760
(C) 358
(D)buesalsdksbZugha
9!
= 3780
2! 2! 4 !
(B*) 178
720 720 720 720

=
5 52 53 54
= 144 + 28 + 5 + 1 = 178
PART - III : ASSERTION / REASONING
Hkkx - III : dFku@dkj.k (ASSERTION/REASONING)

9.
STATEMENT-1 :
(n 1)!
is divisible by 6 for some n N.
(n 1)!
[Rank Booster 08-09]
STATEMENT-2 : Product of three consecutive integers is divisible by 3!.

(A) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B*) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(C) Statement-1 is True, Statement-2 is False
(D) Statement-1 is False, Statement-2 is True
dFku-1 :
(n 1)!
, dqN n N ds fy, 6 ls foHkkftr gSA
(n 1)!
dFku-2: rhuekxriw.kkdksdkxq.kuQy3! lsfoHkkftrgksrkgSA

(A) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k gSA
(B*) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA
(C) dFku&1 lR; gS] dFku&2 vlR; gSA
(D) dFku&1 vlR; gS] dFku&2 lR; gSA
RESONANCE
Sol.
Statement-1 :
(n 1)!
= (n + 1) n is divisible by 6 for some n N like 2, 3 etc.
(n 1)!
[P & C, E]
Statement-2 : Product of three consecutive integers is always divisible by 3!.

both are true but statement-2 is NOT a correct explanation for statement-1.
Hindi
dFku -1 :
(n 1)!
= (n + 1) n, dqN n N ds fy, 6 ls foHkkftr gS] tSls 2, 3 ds fy,
(n 1)!
[P & C, E]
dFku-2 : rhuekxriw.kkdksdkxq.kuQylnSo3! lsfoHkkftrgksrkgSA

nksuksadFkulR;gSysfdudFku-2,dFku-1dksLi"VughadjrkgSA
10.
Statement -1 : The maximum number of points of intersection of 8 unequal circles is 56.

Statement -2 : The maximum number of points into which 4 unequal circles and 4 non coincident straight
lines intersect, is 50.
(B*) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
dFku-1:8vlekuo`kkssadsvf/kdreizfrPNsnfcUnqvksadhla[;k56gSA
dFku-2:4vlekuo`kksavkSj4vlaikrhljyjs[kkvksadsvf/kdreizfrPNsnfcUnqvksadhla[;k50 gSA
(B*) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA

(B)
Statement -1: Two circles intersect in 2 points.
Maximum number of points of intersection

= 2 number of selections of two circles from 8 circles.
= 2 8C2 = 2 28 = 56
Statement -2: 4 lines intersect each other in 4C2 = 6 points.
4 circles intersect each other in 2 4C2 = 12 points.
Further, one lines and one circle intersect in two points. So, 4 lines will intersect four circles in 32 points.
Maximum number of points = 6 + 12 + 32 = 50.

Hindi. (B)
dFku-1:nkso`kvf/kdre2fcUnqvksaijizfrPNsndjrsgSa
vf/kdreizfrPNsnhfcUnqvksadhla[;k
=2(8o`kksaesals2o`kksadksp;udjusdsrjhds)
= 2 8C2 = 2 28 = 56
dFku -2: 4js[kk,ijLij4C2 =6fcUnqvksaijizfrPNsndjrhgSA
4o`kijLij24C2 =12fcUnqvksaijizfrPNsndjrsagSA
iqu%,djs[kk,oa,do`k]2fcUnqvksaijizfrPNsndjrsgSa
vr%4js[kk,4o`kksadks32fcUnqvksaijizfrPNsndjsxhA
vf/kdre fcUnqvksa dh la[;k = 6+ 12 + 32 =50.

Sol.
11.
Statement -1 : If there are six letters L1, L2 , L3, L4, L5, L6 and their corresponding six envelopes E1, E2, E3,
E4, E5, E6. Letters having odd value can be put into odd value envelopes and even value
letters can be put into even value envelopes, so that no letter go into the right envelopes, the
number of arrangement will be equal to 4.
Statement -2 : If Pn number of ways in which n letter can be put in n corresponding envelopes such that no
1 1
( 1)n
....
letter goes to correct envelope, then Pn = n! 1! 2!

n!
(A*) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(B) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
RESONANCE

dFku-1 : ;fn 6 i=k L1, L2 , L3, L4, L5, L6 vkSj muds laxr 6 fyQkQs E1, E2, E3, E4, E5, E6 gSA fo"ke vadks okys i=k
i=kfo"ke vadokysfyQkQsesaghj[kstkldrsgSarFkklevadksaokysi=klevadokysfyQkQsesaghtkldrsgSa
rkfddksbZHkhi=klghfyQkQsesauj[kktk;srcfoU;klksadhla[;k4 gksxhA
dFku-2:;fnPn, ni=kksadksnlaxrfyQkQksaesaj[kusdsrjhdksdhla[;kgSrkfddksbZHkhi=klghfyQkQsesau
tk;s]rc
1 1
(1)n
Pn = n! 1 ....
n!
1! 2!
(A*) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k gSA
(B) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA
Sol.

(A)
L1 L3 L5
L2 L4 L6
E1 E3 E5
E2 E4 E6
1 1 1
Number of ways = 3 ! 1 1! 2 ! 3 ! . 3 !
Hindi. (A)
L1 L3 L5
E1 E3 E5
1 1 1
1 = 4
1! 2 ! 3 !
L2 L4 L6
E2 E4 E6
dqy rjhds = 3 ! 1 1! 2! 3 ! . 3 ! 1 1! 2! 3 ! = 4
12.
Statement -1 : The maximum value of K such that (50)k divides 100! is 2.

n
n
n
Statement -2 : If P is any prime number, then power of P in n! is equal to + 2 + 3 ....
P
P

P
where [ ] represents greatest integer function.
(D*) Statement-1 is False, Statement-2 is True
dFku-1: Kdk vf/kdre eku tcfd (50)k , 100! dks foHkkftr djsa] 2gSA
n
n n
+ .... ds cjkcj gksxh]
P2 P3
dFku-2: ;fn P,d vHkkT; la[;k gS rc n! esa Pdh ?kkr P +

tgk []egke iw.kkd QyugSA

(D*) dFku&1 vlR; gS] dFku&2 lR; gSA
Sol.
(D)
n
n
If power of P is l in n! then l = + 2 + .....
P

P
Power of 5 in 100! is
100
100
100
=
+ 2 + 3 = 20 + 4 + 0 = 24
5
5
5
Power of 2 in 100 ! is
100
100
100
100
100 100
=
+ 2 + 3 + 4 + 5 + 6 = 50 + 25 + 12 + 6 + 3 + 1 = 97
2
2
2
2
2 2
So power of 50 in 100 ! is 12.
RESONANCE
Maximum value of K is 12.

n
n
+ .....
P2
;fn n! esa Pdks ?kkr l gks] rks l = P +
Hindi. (D)
100! esa5dh?kkr
100
100
100
=
+ 2 + 3 = 20 + 4 + 0 = 24
5
5
5
100! esa2dh?kkr
100
100
100
100
100 100
=
+ 2 + 3 + 4 + 5 + 6 = 50 + 25 + 12 + 6 + 3 + 1 = 97
2
2
2
2
2 2
vr% 100! esa 50dh ?kkr 12gS

K dk vf/kdre eku 12 gSA
13.
Statement -1 : If a, b, c are positive integers such that a + b + c 8, then number of possible values of the
ordered triplets (a, b, c) is 56
Statement -2 : The number of ways in which n identical things can be distributed into r different groups
is n1Cr1
(C*) Statement-1 is True, Statement-2 is False
dFku-1 : ;fn a, b, c /kukRed iw.kkd bl izdkj gS fd a + b + c 8 rks fedf=kd (ordered triplets) (a, b, c) dh
laHkkforla[;k56gSA
dFku-2:nloZleoLrqvksadksrfofHkUuoxksZesaforfjrdjusdsrjhdsn1Cr1gksaxsaA
(C*) dFku&1 lR; gS] dFku&2 vlR; gSA
Sol.

a + b+ c = 8 t
0t5
5
7 t
C2 = 56
t 0
Ans. (C)
14.
Statement -1 : If N is number of positive integral solutions of x1 x2 x3 x4 = 770, then N is divisible by 4 distinct

primes.
Statement -2 : Prime numbers are 2, 3, 5, 7, 11, 13, .....
(D*) Statement-1 is False, Statement-2 is True
dFku-1: ;fnx1 x2 x3 x4 =770esa/kukRediw.kkdgyksadhla[;kNgks]rksNpkjfHkUuvHkkT;la[;kvksalsHkkT;gksxk
dFku-2 : vHkkT; la[;k, 2, 3, 5, 7, 11, 13, ..... gSA
Sol.
(D*) dFku&1 vlR; gS] dFku&2 lR; gSA

x 1 x 2 x 3 x4 = 2 5 7 11
N = 44
Ans. (D)
RESONANCE
PART - IV : TRUE / FALSE
Hkkx - IV : lR;@vlR; (TRUE / FALSE)

15.
Number of ways in which five vowels of English alphabets and ten decimal digits can be placed
in a row such that between any two vowels odd number of digits are placed and both end
places are occupied by vowels is 20 (10 !) (5 !)
vaxsztho.kZekykdsikpLojksarFkknln'keyovadksadks,diafDresablrjgO;ofLFkrfd;ktk,fdnksLojkasadse/;
fo"kela[;kesavadvk;sarFkknksuksafljksaijLojvk;sadsrjhdksadhla[;k20(10!)(5!)gksrhgSA
Ans. True (lR;)
Sol.
Ten digits can be partitioned into four parts as

1+1+3+5; 1+1+1+7;1+3+3+3
(each partitioning has odd number of digits)
The number of ways in which these can be placed in the four spaces =
4!
4!
4!
+
+
2!
3!
3 ! = 20 ways
also numbers of arrangements of vowels = 5 !
Number of arrangements of digits = 10 !
total ways = 20 (10 !) (5 !)
Hindi.
nl vadksa dks bl izdkjfoHkkftr fd;k tk ldrk gS

1 + 1 + 3 + 5 ; 1 + 1 + 1 + 7 ; 1 + 3 + 3 + 3 izR;sd Hkkx esa fo"ke la[;k esa vad gS
murjhdksadhla[;kftuesabudkspkjLFkkuksaijj[kktkldrkgS
=
4!
4!
4!
+
+
= 20
2!
3!
3!
lkFkghLojksadksO;ofLFkrdjusdsrjhds=5!
vadksadksO;ofLFkrdjusdsrjhds=10!
dqy rjhds = 20 (10 !) (5 !)
16.
In a 12 storey house 10 people enter the lift cabin. It is known that they will leave the lift in predecided groups of 2, 3 and 5 people at different storeis. The number of ways they can do so if
the lift does not stop up to the second storey is 720
,d 12 eaftyk edku dh fyV esa 10 O;fDr p<+rs gSa ;g lqfuf'pr dj fn;k x;k gS fd O;fDr fyV ls 2, 3 rFkk5
dslewgksaesavyx&vyxeaftyijmrjsaxsa]rks;gdk;Zdqy720 rjhdksalsfd;ktkldrkgS;fnfyVnwljheafty
rdugha:drhgksA
Ans. True (lR;)
Sol.
The number of ways = 10C3 3 ! = 720
Hindi. rjhdksa dh la[;k = 10C3 3 ! = 720
17.
2m white identical coins and 2n red identical coins are arranged in a straight line with (m + n) identical
coins on each side of a central mark. The number of ways of arranging the identical coins , so that the
arrangements are symmetrical with respect to the central mark, is 2m + 2nC2m
2m loZle lQsn flDdksa rFkk 2n loZle yky flDdks dks ,d dsUnzh; fpUg ds nksukas rjQ ,d ljy js[kk esa bl rjg
O;ofLFkr djrs gSa fd izR;sd rjQ (m + n) loZle flDds vk;sa] rks O;ofLFkr djus ds mu rjhdksa dh la[;k tcfd
O;oLFkkiudsUnzh;fpUgdsnksuksarjQlefergks]2m+2nC2mgksrhgSaA
Ans. False (vlR;)
Sol.
Arrangements will be one side

m+n
Cm
,drjQO;ofLFkrgksxsaA
Hindi.
RESONANCE
vr% rjhdksa dh la[;k=m+nCm

18.
Three ladies have each brought their one chlid for admission to a school. The principal wants to
interview the six persons one by one subject to the condition that no mother is interviewed
before her chlid. The number of ways in which interviews can be arranged is 90
rhuefgyk,izR;sdvius,dcPpsdksfo|ky;esaizos'kfnykusvkrhgSAiz/kkuk/;kidN%O;fDr;ksadk,ddsckn,d
lk{kkRdkjysukpkgrkgStcfdfdlhHkhekadkmldscPpslsigyslk{kkRdkjughafy;ktkrkgS]rkslk{kkRdkjysusdsdqy
rjhds90gSaA
Ans. True (lR;)
Sol.
Each lady and her child can be arranged in a fixed order only.
izR;sd efgyk rFkk mldk cPpk ,d fuf'pr e esa O;ofLFkr fd;s tk ldrs gSaA
Hindi.
19.
6!
The total no. of ways in which interview can be held = 2 ! 2 ! 2 ! = 90
vr% lk{kkRdkj ysus ds dqy rjhdksa dh la[;k =
6!
= 90
2! 2! 2!
The number of ways one can put three balls numbered 1, 2, 3 in three boxes labelled a, b, c
such that at the most one box is empty is equal to 24
rhuxsanksaftuij1,2,3la[;k,vafdrgSaArhuckWDlksaesa]ftuija,b,c yscyyxsgq,gSa]24rjhdksalsMkyk
tk ldrk gS tcfd vf/kdre 1 ckWDl [kkyh jgsA
Ans.
True (lR;)
Sol.
If none of the boxes is empty.

Number of ways = 3! = 6
If one of the boxes is empty
The number of ways in which 3 balls can be divided into the groups containing 1 and 2 balls
respectively = 3C1 = 3
Now the number of ways end selection can be put in boxes = 3! = 6
the number of ways in which one box remains empty = 6 3 = 18
total number of ways = 6 + 18 = 24

Hindi. tc dksbZ ckWDl [kkyh u gks] rksrjhdksa dhla[;k = 3! = 6
;fn,dckWDl[kkyhgksrks
murjhdksadhla[;kftuls3xsanksadkse'k%1rFkk2xasnksadslewgksaesackVktkrkgSA
= 3C 1 = 3
vcbuxsanksadksckWDlksaesaO;ofLFkrdjusdsrjhds=3! =6
mu rjhdksa dh la[;k tc ,d ckWDl [kkyh jg tk, = 6 3 = 18
rjhdksa dh dqy la[;k = 6 + 18 = 24
PART - V : FILL IN THE BLANKS
Hkkx-V :fjDr LFkkuksa dh iwfrZ dhft, (FILLINTHEBLANKS)

20.
Words are formed by arranging the letters of the word "STRANGE" in all possible manner. Let m be the
number of words in which vowels do not come together and 'n' be the number of words in which vowels
come together. Then the ratio of m: n is_________ .
'kCn"STRANGE"dsv{kjksadkslHkhlEHkorjhdksalsO;ofLFkrdj'kCncuk;stkrsgSaAekukfd'm' mu'kCnksadh
la[;kgSftuesaLoj,dlkFkughavkrsgSavkSj'n' mu'kCnksadhla[;kgSftuesaLoj,dlkFkvkrsgS]rksvuqikr
m: n ________ gSa
RESONANCE
Ans.
Sol.
21.
5: 2
5 ! 6C2 . 2! 5
6 ! 2!
2
A 5 digit number divisible by 3 is to be formed using the numerals 0, 1, 2, 3, 4 & 5 without repetition,
then the total number of ways in which this can be done is ________.
vadks 0, 1, 2, 3, 4 ,oa 5dh lgk;rk ls 5vadks dh ______ la[;k, cukbZ tk ldrh gSa] tks 3 ls foHkkftr gks tcfd
vadksdhiqujko`fkughagksldrhgSaA
Sol.
Ans. 216
When 0 is not being used = 5!
When 3 is not being used = 5! 4 !
Total number of ways = 5 ! + 5 ! 4 ! = 216
Hindi.
tc 0 dk mi;ksx ugha djsa = 5!

tc 3 dk mi;ksx ugha djsa= 5! 4 !
dqy rjhdksa dh la[;k = 5 ! + 5 ! 4 ! = 216
22.
There are m points on a straight line AB & n points on the line AC none of them being the point A.
Triangles are formed with these points as vertices, when
(i) A is excluded
(ii) A may be included. The ratio of number of triangles in the two cases is____.
,dljyjs[kkABijm fcUnqfLFkrgSrFkknwljhljyjs[kkACijnfcUnqfLFkrgSaAbuesafdlhesaHkhAlfEefyr
ughagSAbufcUnqvksadks'kh"kZekudjf=kHkqtcuk;stkrsgSa]tcfd
(i)A'kkfeyughagS
(ii)A'kkfeygksldrkgSaAnksuksafLFkfr;ksaesaf=kHkqtksadhla[;kdkvuqikr_____gSaA
Ans.
m n 2
m n
Sol.
23.
C2 . nC1 m C1 . nC2
mn2
m
n
m
n
mn
C2 . C1 C1 . C2 m.n
The number of ways in which the number 94864 can be resolved as a product of two factors is____.
la[;k94864 dks____ rjhdksalsnksxq.ku[k.Mksadsxq.kuQyds:iesaO;Drfd;ktkldrkgSaA

Ans.
23
5.3.3 1
= 23
2
Sol.
94864 = 2 4 . 7 2 . 112
24.
The number of ways in which an insect can move from left bottom corner of a chess board to the right
top corner, if it is given that it can move only upside or right, along the lines is ____.
number of ways rjhdksa dh la[;k=
;fn'krjatdscksMZij,ddhM+kjs[kkvksadsvuqfn'kdsoyijdh vksj ;knka;hvksjxfrdjldrkgSa]rks;g

dhM+kcka;hvksjdsfupysdksuslsnka;hvksjdsijhdksusrd____ rjhdksalsxfrdjldrkgSa\
Ans.
Sol.
16
C8
(8 8)!
= 16C8
818!
RESONANCE
25.
The number of three digit numbers of the form xyz such that x < y and z y is____.
xyz :i dh rhu vadks dh ____la[;k, gksxh tcfd x < y vkSj z y gks
Ans.
276
Sol.
=3
=8
x < y and z y
= 15
= 24
= 35
= 48
= 63
= 80
Total = 276
PART - I : IIT-JEE PROBLEMS (PREVIOUS YEARS)
Hkkx-I:IIT-JEEdsiz'uiwoZorhZo"kZ
* Marked Questions are having more than one correct option.
* fpfUgr iz'u ,d ls vf/kd lgh fodYi okys iz'u gS IIT-JEE - 2000
1.
Sol.
Hindi
How many different nine digit numbers can be formed from the number 223355888 by rearranging its digits so
that the odd digits occupy even positions?
[IIT-JEE-2000, Scr, (1, 0), 35]
la[;k223355888dsvadksdksysdj9vadks dh fdruh la[;k;sa cukbZ tk ldrhgS tcfd fo"ke vad le LFkkuksa ij
[IIT-JEE-2000,Scr, (1, 0), 35]
vk;sA
(A) 16
(B) 36
(C*) 60
(D) 180
4!
Four digits 3,3,5,5 can be arranged at four even places in 2! 2! = 6 ways and remaining digits 2,2,8,8,8 can
5!
be arranged at 5 odd places in 2! 3 ! = 10 ways. Number of possible arrangements is 610 = 60.
4!
pkjvad3,3,5,5dkspkjleLFkkuksaijj[kusdsrjhds 2! 2! =6gSa]vkSj'ks"kvadks2,2,8,8,8dksikpfo"keLFkkuksa
RESONANCE
5!
ij j[kus ds rjhds 2! 3 ! =10gSaA rc laHkkfor rjhdksa dh la[;k 610=60gSA

IIT-JEE - 2001
2.
Sol.
Let Tn denote the number of triangles which can be formed using the vertices of a regular polygon of n
sides. If Tn+1 Tn = 21, then n equals
[IIT-JEE-2001,Scr, (1, 0), 35]
ekukfd;fnTnmuf=kHkqtksdhla[;kdkscrkrkgStksnHkqtkvksaokys,dlecgqHkqtds'kh"kksdkstksM+uslscursgSa]
[IIT-JEE-2001,Scr, (1, 0), 35]
;fn Tn+1 Tn = 21gks] rks n=
(A) 5
(B*) 7
(C) 6
(D) 4
A regular polygon of n sides has n vertices number two of which are collinear.
so out of n points we have to select 3 sides
T n = nC 3
and
T n+1 = n+1 C3
According to questions
T n+1 T n = 2 !
= n+1C3 nC3 = 2 !
=
(n 1)n (n 1) n(n 1) (n 2)
= 21
6
6
= n (n 1) (n + 1 n + 2) = 21 6
21 6
= 42
3
n (n 1) = 7 6
n=7
= n (n 1) =
3.
Sol.
Let E = {1, 2, 3, 4} and F = {1, 2}. Then the number of onto functions from E to F is
[IIT-JEE-2001,Scr, (1, 0), 35]
ekuk E = {1, 2, 3, 4} rFkk F = {1, 2} gS] rks E ls F esa vkPNknd (onto) Qyuksa dh la[;k gS&
[IIT-JEE-2001,Scr, (1, 0), 35]
(A*) 14
(B) 16
(C) 12
(D) 8
Here E = (1, 2, 3, 4) and F = (1, 2)
Here number of onto function is
total number of solution - number of into function
= 24 2 = 16 2 = 14
IIT-JEE - 2002
4.
The number of arrangements of the letters of the word BANANA in which the two Ns do not appear adjacently
is
[IIT-JEE-2002,Scr, (3, 1), 90]
'kCn BANANAds v{kjksa dks ysdj fdrus 'kCn cuk;s tk ldrs gSa tcfd nksuksa N,d lkFk u vk;s
[IIT-JEE-2002,Scr, (3, 1), 90]
(A*) 40
(B) 60
(C) 80
(D) 100
Sol.
Total number of arrangement of word BANANA is
6!
= 60
2!. 3 !
and number of ways of two Ns together is
5!
= 20
3!
Here the required number of arrangement if two Ns are not together is
60 20 = 40
IIT-JEE - 2004
RESONANCE
n !
2
5.
Prove by permutation or otherwise
n !n
is an integer (n I+).
[IIT-JEE-2004, Main, (2, 0), 60]
n !
2
ep; ds mi;ksx ls ;k vU;Fkk fl) djks fd
+
n !n ,d iw.kkd gS (n I ).
[IIT-JEE-2004,Main, (2, 0), 60]
Sol.
Here n2 objects are distributed in n groups, each group containing n identical objects.
Number of ways of arrangements

=
n2
Cn .n
Cn .n
(n 2 )!
=
2n
Cn .n
n 2 n!
n! (n 2 n)! n! (n 2 2n)!
3n
...
Cn .n
2n
Cn ....n Cn
n!
(n 2 )!
Integer
n!.1 (n! )n
(as number of arrangements has to be integer) (n+)

Hindi
;gkn2oLrqvksadksnlewgksaesackVkx;kgS]izR;sdlewgesanlekuoLrq,sagSA
O;oLFkkvksadhla[;k
=
n2
Cn .n
(n 2 )!
=
Cn .n
2n
Cn .n
n 2 n!
2
n! (n n)! n! (n 2n)!
...
3n
Cn .n
2n
Cn ....n Cn
n!
(n 2 )!
n!.1 (n! )n iw.kkd
(tSlsfdO;oLFkkvksadhla[;kiw.kkdgksxh)(n+)
IIT-JEE - 2005
6.
A rectangle with sides 2m 1 and 2n 1 is divided into squares of unit length by drawing parallel lines as
shown in the diagram, then the number of rectangles possible with odd side lengths is
[IIT-JEE-2005,Scr, (3, 1), 84]
,dvk;rftldhHkqtk,2m1,oa2n1bdkbZgSdkslekUrjjs[kkvksa}kjkfp=kesafn[kk,vuqlkjbdkbZyEckbZ
dsoxksesackaVktkrkgS]rksmulEHkovk;rksadhla[;kftudhHkqtkvksadhyEckbZfo"kegSa]gksxh&
[IIT-JEE-2005,Scr, (3, 1), 84]
Sol.
(A) (m + n 1)2
(B) 4m+n1
(C*) m2 n2
Along horizontal side
one unit can be taken = (2m 1) ways
three unit can be taken = (2m 3) ways
five unit can be taken = (2m 5) ways
and so on
the number of ways of selecting a side horizontally is
RESONANCE
(D) m(m + 1)n(n + 1)
(2m 1) + (2m 3) + .....+ 3 + 1 = m 2

Similarly, the number of ways of selecting a side vertically is
(2n 1) + (2n 3) + .......+ 3 + 1 = n2
Hence required number of rectangle is m 2n2
7.
n 1 n+1
(2 n 2) where n > 1 and the runs scored in
If total number of runs scored in n matches is
4
the k th match are given by k. 2n+1k, where 1 k n, find n
[IIT-JEE-2005,Main, (2, 0), 60]
n 1
;fn n eSpksa esa cuus okys dqy ju 4 (2n+1 n 2) gks tgk n > 1 rFkk k osa eSp esa cuus okys ju
k. 2n+1k gks]
Ans. 7
tgk 1 k n. rks n dk eku Kkr djksA
n 1 n1
2 n2
T k = k.2n+1k and S n =
4
Sol.
Sn
Now,
[IIT-JEE-2005,Main, (2, 0), 60]
k.2n 1k = 2n+1
k.2
k 1
k 1
1
n
Sn 2n 1. 2 .1 n n 1
2
2
(sum of A.G.P.)
n 1 n1
2 n 2 = 2. [2n+1 2 n]
4
n 1
=2
4
n=7
Hindi.
n 1 n1
2 n2
Tk = k.2n+1k vkSj Sn =
4
vc
Sn
k.2n 1k = 2n+1
k.2
k 1
k 1
1
n
Sn 2n 1. 2 .1 n n 1
2
2
(A.G.P. dk ;ksx)
n 1 n1
2 n 2 = 2. [2n+1 2 n]
4
n 1
=2
4
n=7
IIT-JEE - 2006
RESONANCE
8.
Sol.
If r, s, t are prime numbers and p, q are the positive integers such that the LCM of p, q is r2 t4s2, then the
number of ordered pair (p, q) is
[IIT-JEE-2006, (3, 1), 184]
;fn r,s,tvHkkT; la[;k, gks rFkk p,q/kukRed iw.kkd bl izdkj gks fd prFkk qdk y-l-i- r2t4s2 gS] rks fer
[IIT-JEE-2006, (3, 1), 184]
;qXeksa(p,q)dhla[;kgksxh
(A) 252
(B) 254
(C*) 225
(D) 224
According to question L.C.M. of (p, q) = r2 t4 s2 . For locas (p, q) to contain r2 following are the possible
powers of r in P and Q (0, 2) ; (2, 2) , (1, 2) out of those all except (2, 2) can be interchanged for p & q.
Total ways for p, q to contain different powers of r are = 2 3 1 = 5
Similarly, different powers of t that can be given to P and q are (0, 4), (1, 4), (2, 4), (3, 4) and (4, 4)
out of which except (4, 4) all others can be interchanged for p and q
Total ways for p, q to contain different powers of t are 2 5 1 = 9
Similarly total ways for p,q to contain different power of s are 23 1 = 5
Here total required pairs of p,q can be
= 5 9 5 = 225
IIT-JEE - 2007
9.
The letters of the word COCHIN are permuted and all the permutations are arranged in an alphabetical order
as in an english dictionary. Then number of words that appear before the word COCHIN is
[IIT-JEE-2007,P-II, (3, 1), 81]
COCHIN'kCndsv{kjksalsfufeZrlHkh'kCnksadksvaxsth'kCndks"kdsekuqlkjO;ofLFkrfd;ktk;s]rks'kCnCOCHIN
dselsiwoZdqyfdrus'kCngSA
(A) 360
Sol.
(B) 192
COCHIN
C-2
H-1
I-1
Number of words
(C*) 96
(D) 48
[IIT-JEE-2007, P-II, (3, 1), 81]
N-1
O-1
= 24
= 24
= 24
= 24
_____
96
Before word of cochin is the number of words = 96

IIT-JEE - 2008
10.
Consider all possible permutations of the letters of the word ENDEANOEL. Match the Statements/
Expressions in Column I with the Statements / Expressions in Column II and indicate your answer by
darkening the appropriate bubbles in the 4 4 matrix given in the ORS.
[IIT-JEE-2008,P-II, (6, 0), 81]
(A)
(B)
Column I
Column II
The number of permutations containing the word ENDEA is

The number of permutations in which the letter E occurs in the first
and the last positions is
(p)
(q)
RESONANCE
5!
2 5!
(C)
The number of permutations in which none of the letters D, L, N occurs

(r)
7 5!
in the last five positions is
(D)
The number of permutations in which the letters A, E, O occur only
(s)
21 5!
in odd positions is
Ans.
(A) (p),
(B) (s),
(C) (q),
(D) (q)
'kCnENDEANOELdsv{kjksadslHkhlEHkkforep;yhft;sColumnIesafn;sx;sizdFku@O;atdksadkdkWyeColumn
IIesafn;sx;sdFkuksalslqesydjsavkSjviukmkj 44eSfVDldsmfprcqYyksa (bubbles)dksdkykdjdsn'kkZ,a
[IIT-JEE-2008, P-II, (6, 0), 81]
dkWyeI
dkWyeII
(A)
(B)
(C)
(D)
Ans.
Solution :
(A)
(B)
'kCnENDEAdkslfEefyrdjusokysep;ksadhla[;kgS
izFkevkSjvafrenksuksLFkkuksaijv{kjEokysep;ksadhla[;kgS
vafreikpLFkkuksaijD,LvkSjNesalsdksbZv{kjuvkusokysep;ksa
dhla[;kgS
dsoyfo"keLFkkuksaijghv{kj A,E,Ovkusokysep;ksadhla[;kgS
(A) (q),
(B) (s),
Hint :
(D)
5!
2 5!
7 5!
(s)
21 5!
(D) (q)
Consider 'ENDEA' as one letter so there are five things which are ENDEA , N, O, E, L
number of permutations = 5!
Hint : Number of arrangements of n objects in a line in which r objects always remain together
in a particular order are (n r + 1)!
E N D E A N O L E (first and last letters are f'ixed)
Number of permutations =
(C)
(C) (q),
(p)
(q)
(r)
7!
= 21 5!
2!
Number of permutations of n objects in which r are alike =
n!
r!
N, N, D, L will come at first four places and E, E, E, O, A will come at last five places
5!
4!
= 2 5!
3!
2!
number of permutations =
Hint :
n!
r!
A, E, E, E, O, occur at odd positions and N, N, D, L at even positions =

Hint :
5!
4!
= 2 5!
3!
2!
n!
r!
Hindi :
(A)
(B)
'ENDEA' dks ,d v{kj ekuus ij] vc ;gk ikp v{kj ENDEA , N, O, E, L gSA
ep;ksa dh la[;k=5!
Hint : noLrqvksadks,djs[kkesaO;ofLFkrdjusdsrjhdsftuesaroLrq,sages'kk,dfuf'preesalkFk
jgrh gS dh la[;k (nr+1)!gksrh gSA
E N D EAN O LE (izFke rFkk vfUre v{kj fu;r gSA)
ep;ksa dh la[;k =
Hint :
(C)
7!
= 21 5!
2!
noLrqvksaftuesar,dlekugS]dsep;ksadhla[;k=
n!
r!
N,N,D,LigyspkjLFkkuksaesavk;saxsrFkkE,E,E,O,AvfUreikpLFkkuksaesavk,saxsA
4! 5!
= 2 5!
2! 3!
ep;ksa dh la[;k =
Hint :
RESONANCE
n!
r!
(D)
A,E, E,E,Ofo"ke LFkkuksa ij vkrs gSa rFkk N,N,D,Lle LFkkuksa ij vkrs gSa =
Hint :
5! 4!
=25!
3! 2!
n!
r!
IIT-JEE 2009
11.
Sol.
The number of seven digit integers, with sum of the digits equal to 10 and formed by using the digits 1, 2 and
3 only, is
[IIT-JEE-2009, Paper-I, (3, 1), 240]
lkr&vadh;iw.kkZdksadhla[;k]ftudsvadksdk;ksx10gSvkSjtksdsoy1,2o3vadksalscuhgksa]oggS
(A) 55
(B) 66
(C*) 77
(D) 88
There are two possible cases
Case 1 : Five 1s, one 2s, one 3s
7!
= 42
5!
Case 2 : Four 1s, three 2s
Number of numbers =
Number of numbers =
7!
= 35
4! 3!
Total number of numbers = 42 + 35 = 77

Hindi.
nksfLFkfr;kalaHkogSA
fLFkfr1 : ikap ckj 1, ,d ckj 2, ,d ckj 3
la[;kvksa dh la[;k=
7!
=42
5!
fLFkfr2 : pkj ckj 1, rhu ckj 2

la[;kvksa dh la[;k=
7!
=35
4! 3!
dqy la[;kvksa dh la[;k=42+ 35=77

IIT-JEE 2010
12.
Sol.
Let S = {1, 2, 3, 4}. The total number of unordered pairs of disjoint subsets of S is equal to
ekukfd S={1,2,3,4}] rks Sds vfer rFkk vla;qDr leqPp; ;qXeksa dh dqy la[;k fuEu gS
(A) 25
(B) 34
(C) 42
(D*) 41
[IIT-JEE-2010, Paper-2, (5, 2), 79]
S = {1, 2, 3, 4}
Each element can be put in 3 ways either in subsets or we dont put in any subset.
So total number of unordered pairs =
Hindi
3 3 3 3 1
+ 1 = 41. [Both subsets can be empty also]
2
S = {1, 2, 3, 4}
fdlhmileqPp;esaizR;sdvo;odks3rjhds ls j[kk tk ldrk gS ;kfdlhmileqPp;esa ugha j[kktk ldrkgSA

blfy, vfer ;qXeksadh dqyla[;k =
3 3 3 3 1
+1= 41. [nksuksa mileqPp; [kkyh Hkh gks ldrs gS]
2
PART - II : AIEEE PROBLEMS (PREVIOUS YEARS)
Hkkx-II:AIEEEdsiz'uiwoZorhZo"kZ
1.
A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from
the first five questions. The number of choices available to him is[AIEEE 2003]
,dfo|kFkhZijh{kkesa13esals10iz'uksadstokcblrjgnsrkgSfdizFkeikpiz'uksaesalsdelsdepkjdstokc
nsRESONANCE
ukt:jhgSrksmldstokcnsusdsrjhdksadhla[;kgS&
&&
Sol.
2.
(1) 140
C 4 . 8C 6 + 5C 5 . 8C 5
= 140 + 56 = 196
(2*) 196
(3) 280
(4) 346
The number of ways in which 6 men and 5 women can dine at a round table, if no two women are to sit
together, is given by [AIEEE 2003]
,dxksyestijN%iq:"krFkk5efgyk,fdrusrjhdksalscSBldrsgS;fndksbZHkhnksefgyk,lkFkughacSBldrh
gks\
Sol.
3.
Sol.
4.
(1*) 6! 5!
6! 5!
(2) 30
(3) 5! 4!
(4) 7! 5!
How many ways are there to arrange the letters in the word GARDEN with the vowels in alphabetical order ?
[AIEEE 2004]
'kCnGARDENdsv{kjksadksfdrusrjhdksalsO;ofLFkrfd;ktkldrkgSftlesaLojo.kZekykdseesagS\
(1) 120
(2) 240
(3*) 360
(4) 480
6!
= 360
2!
The number of ways of distributing 8 identical balls in 3 distinct boxes, so that none of the boxes is
empty, is [AIEEE 2004]
8lekuxsanksdks3lekuckWDlesafdrusrjhdksalsforfjrfd;ktkldrkgStcfddksbZckWDl[kkyhukjgs\
(1) 5
(2*) 21
(3) 38
(4) 8C3
Sol.
(5 2)!
= 21
5 ! 2!
5.
If the letters of the word SACHIN are arranged in all possible ways and these words are written out as in
dictionary, then the word SACHIN appears at serial number [AIEEE 2005]
;fnSACHIN'kCndsv{kjksalscuusokyslHkhlEHkkfor'kCnksadksvaxzsth'kCndks'kdsvuqlkjeesafy[kktk,srks
bu'kCnksaesaSACHIN'kCndkekadgksxk&
Sol.
6.
(1) 602
ACHINS
A ......5 !
C ......5 !
H ......5 !
I ......5 !
N ......5 !
SACHIN
5 . 5 ! + 1 = 601
(2) 603
(3) 600
(4*) 601
The set S : = {1, 2, 3 ..........12} is to be partitioned into three sets A, B, C of equal size.
Thus,
A B C = S,
AB=BC=AC =
The number of ways to partition S is leqPPk; S: ={1,2,3..........12} dks rhu cjkcj leqPp;ksa A,B, oC esa foHkkftr djuk gS
[AIEEE 2007]
blizdkjdh
A B C = S,
AB=BC=AC =
rksSdksfoHkkftrdjusdsrjhdksadhla[;kgS&
(1) 12!/3! (4!)3
RESONANCE
(2) 12!/3!(3!)4
(3*) 12!/(4!)3
(4) 12!/(3!)4
Sol.
7.
12!
12 !
3! =
3
( 4! ) 3!
( 4! )3
In a shop there are five types of ice-creams available.. A child buys six ice-creams.
[AIEEE 2008]
Statement-1 : The number of different ways the child can buy the six ice-creams, is 10C5.
Statement-2 : The number of different ways the child can buy the six ice-creams is equal to the number
of different ways of arranging 6A' s and 4 B' s in a row.
(1) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(2) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(3) Statement-1 is True, Statement-2 is False
(4*) Statement-1 is False, Statement-2 is True
[AIEEE 2008]
,d nqdku esa5izdkjdh vkbZlhemiyC/k gS ,d cPpk6vkbZlhe[kjhnrk gS
Statement-1:cPpsads6vkbZlhe[kjhnusAdsrjhdksadhla[;k10C5gS
Statement-2:cPps ds 6vkbZlhe [kjhnus ds rjhdksa dh la[;k] 6A'so 4B'dks ,d iafDr esa O;ofLFkr djus ds
rjhdksadhla[;kdscjkcjgS
(1) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k gSA
(2) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA
(3) dFku&1 lR; gS] dFku&2 vlR; gSA
(4*) dFku&1 vlR; gS] dFku&2 lR; gSA
Sol.
x1 + x2 + x3 + x4 + x5 = 6
(6 4)!
= 10C4
6! 4!
Statement - 1 is false while statement-2
Ans. (4)
8.
How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two
S are adjacent ?
[AIEEE 2008]
MISSISSIPPI'kCndslHkhv{kjksadkslHkhlaHkkforrjhdksalsO;ofLFkrdjusijfdrusfHkUu'kCncuk,stkldrsgS
;fndksbZnksSlkFkughavk,s?
Sol.
(1) 8. 6C4 . 7C4

M
I
8
9.
C4 .
(2) 6. 7 8C4
I
I
(3) 6. 8. 7C4
P
(4*) 7. 6C4 . 8C4
7!
= 7. 6C4 . 8C4
4 !. 2 !
From 6 different novels and 3 different dictionaries, 4 novels and 1 dictionary are to be selected and
arranged in a row on the shelf so that the dictionary is always in the middle. Then the number of such
arrangements is[AIEEE 2009]
(1) atleast 500 but less than 750
(2) atleast 750 but less than 10000
(3*) atleast 1000
(4) less than 500
6fHkUumiU;klksao3fHkUu'kCndks'kksaesals4miU;klo1'kCndks'kpquukgSrFkkbUgsa,dvkyekjhesa,diafDresa
blizdkjO;ofLFkrfd;ktk;sfd'kCndks'klnSoe/;esajgs]rksbldsrjhdksadhla[;kgksxh&
(1) de ls de 500 ysfdu 750 ls de
(2) de ls de 750 ysfdu 10000 ls de
(3*) de ls de 1000
(4) 500 ls de
Sol.
6 different novels and 3 different dictionaries
Hindi
number of ways = 3C1 6C4 4! = 1080
N%fofHkUumiU;klksavkSj3fofHkUu'kCndks'kksa
foU;klksa dh la[;k =3C1 6C4 4! =1080
RESONANCE

Permutation Reso Sheet

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Permutation Reso Sheet

Hochgeladen von

Copyright:

Verfügbare Formate

PSCMBGB200310

PART - I : SUBJECTIVE QUESTIONS

Hkkx- I : fo"k;kRed iz'u SUBJECTIVE QUESTIONS

fdrus rjhdksa ls vk ldrk gS ;fn og okilh esa nwljh cl dk mi;ksx djsaA

fudkydj els j[kh tkrh gSaA lEHkkforurhtksa dh la[;k fdruh gksxh \

PERMUTATION & COMBINATION - 1

A coin is tossed n times, then find the number of possible outcomes.

;fn 9 ! + 10 ! = 11! gks] rks 'x' dk eku Kkr dhft,A

If nP5 = 42. nP3, find 'n'.

vr% dqy rjhdksa dh la[;k = 425 = 4 120 = 480

PERMUTATION & COMBINATION - 2

total numbers = 9 + 81 + 648 = 738

,d vad dh la[;kvksa dh la[;k = 9

If nC3 = nC5, find the value of nC2.

PERMUTATION & COMBINATION - 3

Section (B) : Problem based on Selection as well as arrangement of

dqy rjhdksa dh la[;k = 6 ! 3 ! = 4320

vlQy iz;klksa dh la[;k fdruhgksxh \

rkys dks [kksyus dh dqy vlQy iz;kl

PERMUTATION & COMBINATION - 4

gkFk feykus dh izf;k dh dqy la[;k = 6C2 =

PERMUTATION & COMBINATION - 5

dqy rjhds = 200

PERMUTATION & COMBINATION - 6

vad1,2,3,4 dhlgk;rklspkjvadksadhfdruhizkd`r la[;k, cukbZ tk ldrh gS tks4321 ls cM+hugha gks] tcfd

PERMUTATION & COMBINATION - 7

If A is not chosen, then number of selections = 9C6

number of ways = 9C6 + 8C4 = 154

dqy rjhds = 9C6 + 8C4 = 154

Section (C) : Problem base on distinct and identical objects/devisors (PCTS/PCDV)

Let N = 24500, then find

ekuk N = 24500 rks Kkr djks:

PERMUTATION & COMBINATION - 8

p;u ds dqy rjhds = 5 3 4 23 = 480.

Find number of divisiors of 1980.

buesa lsfdrus 11 ds xq.ktgS] budk;ksx Hkh Kkr dhft,A

Section (D) : Problem based on circular arrangement / Multinomial theorem (PCMT/PCCA)

PERMUTATION & COMBINATION - 9

dqy lEHko foU;klksa dh la[;k = 3! 4! = 280

vr% dqy vHkh"V rjhdksa dh la[;k 4! 2! = 24 2 = 48 rjhds

ljy fp=k dh lgk;rk ls ;g Li"V gS fd ,slk ,d gh rjhdk lEHko gSA

PERMUTATION & COMBINATION - 10

rc B dks 5 oLrq,nsus dqy rjhds = 12C5

= 455 792 1 = 360360

Find number of negative integral solution of equation x + y + z = 12

lehdj.k x + y + z = 12 ds _.kkRed iw.kkd gyksa dh la[;k Kkr dhft,A

N%,dlekugjh]N%,dlekuuhyhrFkkN%,d leku ykyoLrqvksadks nksO;fDr;ksaesafdrusizdkjlsckVldrs

PERMUTATION & COMBINATION - 11

Coefficient of x9 in (1 x 7)3 (1 x)3

ds izlkj esa x9 dk xq.kkad (1 x7)3 (1 x)3

Find total number of positive integral solutions of 15 < x1 + x2 + x3 20.

C2 = 20C 15C = 1140 455 = 685

Section (E) : Problem based on geometry / Dearrangement / exponent of prime/ Principal

PERMUTATION & COMBINATION - 12

Hence, required number of ways = 60 + 90 = 150.

fLFkfr- dqy rjhds = 3 ! 2 ! 3 ! = 60

vr% vHkh"V rjhds = 60 + 90 = 150.

PERMUTATION & COMBINATION - 13

Find number of zeros at the end of 45!.

So no. of zeros at the end of 45! is 10

PERMUTATION & COMBINATION - 14

Required number of ways = 5C2 D3 + 5C1 D4 + 5C0 D5

vHkh"V rjhdksa dh la[;k= 5C2 D3 + 5C1 D4 + 5C0 D5

PART - II : OBJECTIVE QUESTIONS