Reso Test

IITIANS CAREER
MATHEMATICS
TARGET : JEE (ADVANCED) 2018

 

INFORM ATIO
E E ST
DPP DAILY PRACTICE PROBLEMS
Course : VIJETA & VIJAY (ADP & ADR) Date : 14.04.2018

NO. 2
TEST INFORMATION
DATE : 20.04.2018 CUMULATIVE TEST (CT) - 1
Syllabus : Permutation & Combination, Probability, Quadratic Equation, Sequence & Series and
Binomial Theorem, Indefinite Integration, Definite Integration & Its Application, Differential Equation
DPP Syllabus: Permutation & Combination, Probability
ANSWER KEY
1. (C) 2. (B) 3. (C) 4. (B) 5. (C) 6. (B) 7. (A)
8. (C) 9. (C) 10. (D) 11. (B) 12. (B) 13. (A) 14. (C)
15. (C) 16. (A) 17. (B) 18. (A) 19. (B) 20. (D) 21. (A)
22. (B) 23. (D) 24. (A) 25. (A) 26. (A) 27. (B) 28. (B)
29. (A) 30. (ABC) 31*. (ABCD) 32*. (AC) 33*. (AC) 34*. (AD) 35*. (AB)
36. 2 37. 5 38. 3 39. 5 40. 4
Total Marks: 126 Max. Time: 120 min.

Comprehension ('–1' negative marking) Q.1 to Q.8 (3 marks 3 min.) [24, 24]
Single choice Objective ('-1' negative marking) Q.9 to Q.29 (3 marks 3 min.) [63, 63]
Multiple choice objective ('-1' negative marking) Q.30 to Q.35 (4 marks 3 min.) [24, 18]
Single Integer Questions ('-1' negative marking) Q.36 to Q. 40 (3 marks 3 min.) [15, 15]
Comprehension #1 (Q.1 to 3)
y
(0,n) B
.
.
.
.
(0,2)
(0,1)
x
A (1,0) (2,0).... (n,0)
(0,0)
The given grid is a map of roads from A  B. There are 'n + 1' vertical and ' n + 1' horizontal lines. Let
2 people A and B are standing at A (0, 0) and B (n, n) at t = 0 and they start walking towards each
other without turning backwards. Then answer the following questions:
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
PAGE NO.-1
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
IITIANS CAREER
vuqPNsn # 1 (iz0 la0 1 ls 3)
y
(0,n) B
.
.
.
.
(0,2)
(0,1)
(1,0) (2,0)....
x
A (n,0)
(0,0)
nh xbZ fxzM esa A ls B. rd lM+d eku fp=k gSA blesa 'n + 1' m/okZ/kj rFkk ' n + 1' {ksfrt js[kk,a gSA ekuk nks
O;fDr] A vkSj B [kM+s gq, gSA tgka t = 0 ij A (0, 0) vkSj B (n, n) gS rFkk os ,d nqljs dh vkSj fcuk fdlh ihNs dh
vksj eqM+rs gq, pyuk vkjEHk djrs gSA rc fuEu iz'ukksa ds mÙkj nhft,A
1. The correct statement from the following is:

(A) If n = 8 and both A and B travel at the same speed and given that they meet, then the line on which
they meet is x + 2y = 12.
(B) If B travels thrice as fast as A, and given that they meet, then they must meet on the line
3(x+y) = n
(C*) If B travels thrice as fast as A, and they meet at a integral point, then 'n' must be even.
(D) If B travels thrice as fast as A, and they meet at a integral point, then 'n' must be odd.
fuEu esa ls dkSulk dFku lgh gS&
(A) ;fn n = 8 rFkk nksuks A vkSj B leku pky ls ;k=kk djrs gS rFkk os ,d nqljs ls js[kk x + 2y = 12 ij feyrs gSA
(B) ;fn B, A dh rqyuk esa rhu xquk rsth ls pyrk gSA rc os fn;s x;s fcUnq ij feyrs tks js[kk 3(x+y) = n ij gSA
(C*);fn B, A dh rqyuk esa rhu xquk rsth ls pyrk gS rFkk os iw.kkZad fcUnq ij feyrs gS rc n le gksxkA
(D) ;fn B, A dh rqyuk esa rhu xquk rsth ls pyrk gS rFkk os iw.kkZad fcUnq ij feyrs gS rc n fo"ke gksxkA
Sol.
n–x B
n–y
(x,y)
A x
Suppose they meet at (x,y). When traveling at same speed, A  x steps  horizontal ,y steps  vertical
 B takes (n – x) and (n – y) steps.
As they meet and speed of A(SA) = speed of B(SB)
x  y nx ny
 = x+y=n
SA SB
For n = 8, meet on x + y = 8
Now, If SB = 3 SA
xy n x ny n
 =  x +y =
SA 3SA 2
 They can only meet if 'n' even
Hindi.
n–x B
n–y
(x,y)
A x
PAGE NO.-2
IITIANS CAREER
ekuk fd os (x,y). fcUnq ij feyrs gS tc os leku pky ls xfr djrs gS] rc A  x dne  {kSfrt] y dne 
m/okZ/kj
 B, (n – x) dne vkSj (n – y) dne pyrk gSA
pwafd os feyrs gS rFkk A(SA) dh pky = B(SB) dh pky
x  y nx ny
 = x+y=n
SA SB
For n = 8, ds fy, x + y = 8 ij feyrs gSA
vc ;fn SB = 3 SA
xy n x ny n
 =  x +y =  os dsoy fey ldrs ;fn 'n' le gks
SA 3SA 2
2. The number of routes on which they meet while travelling at the same speed are equal to :
iFkksa dh la[;k gksxh tcfd os leku pky ij ;k=kk djrs gq, feyrs gSA
1.3.5.......(2n  1)2n
(A) S  C02  C12  C22  .......  C22n (B*)
n!
(11)(12)(13)......(20)
(C) 80, if n = 4 (D) if n = 20
(1)(2)(3)...........(10)
Sol. If they meet at P(x,y).
No. of Routes for A to P = x+yCx
No. of Routes for B to P = 2n–x–yCn–x
As they travel at same speed and meet, they must meet on : x + y = n
n
 No. of Routes they meet on = 
x 0
xy
Cx 2n–x–yC
n–x
n
= 
x 0
n
Cx n
Cn x
= C02 + C12 +........+ Cn2 = 2nCn

Hindi. ;fn os P(x,y) ij feyrs gSA
A ls P ds fy, iFkksa dh la[;k = x+yCx
B ls P ds fy, iFkksa dh la[;k = 2n–x–yCn–x
pwafd os leku pky ls pyrs gS vkSj : x + y = n ij feyrs gSA
n
 iFkksa dh la[;k tc os feyrs gS =  x 0
xy
Cx 2n–x–yC
n–x
n
= 
x 0
n
Cx n
Cn x
= C02 + C12 +........+ Cn2 = 2nCn
3. If n = 3, the number of ways in which they swap their places without meeting at a point are :
(Travel at same speed)
;fn n = 3, gks rc muds LFkkuksa dks vkils esa cnyus ij fdlh fcUnq ij fcuk feys gq, ØePp;ksa dh la[;k gSA
¼leku pky ls pyus ij½
(A) 190 (B) 360 (C*) 380 (D) 180
 Total   Meet  2n 2 2n
Sol. Swap without meeting fcuk feys gq, vkil eas cnyus ij =  –   = ( Cn) – Cn
 ways   ways 
For n = 3 ds fy,  (6C3)2 – 6C3 = 380
PAGE NO.-3
IITIANS CAREER
Comprehension # 2 (Q.4 to 5)
16 players P1, P2, .....,P16 play a knock out tournament. Assuming that the players are paired at random
in each round
16 f[kykM+h P1, P2, .....,P16 ,d ukWdvkmV (knock out) VwukZesaV [ksyrs gSA ekuk fd f[kykM+h ;kn`fPNd izR;sd pj.k
esa ;qXe esa gSA
4. If all the players are of equal strength then find the probability that P 1 reaches final under the condition
P2 reaches semifinal but not reaches in final.
;fn izR;sd f[kykM+h n{krk cjkcj gS rc P1 ds Qkbuy esa igaqpus dh izkf;drk gksxh tcfd P2 lsehQkbuy esa igaqprk
gS ijUrq Qkbuy esa ughaA
1 2 4 8
(A) (B*) (C) (D)
15 15 15 15
P(P1 reaches final  P2 reaches semifinal but not in final)
Sol. Required probability equal to =
P(P2 reaches semifinal but not in final)
P(P1 and P2 reaches semifinal  P1 wins in semifinal but P2 loss semifinal)

=
P(P2 reaches semifinal and P2 loss in semifinal)
14
C2  1  1 1 1 1 1 
       
16
C4  3  2 2 2 2 2  2
= 15

C3 1 15
16

C4 2
P(P1 Qkbuy esa igaqprk gS  P2 lsehQkbuy esa igaqprk gS ijUrq QkbZuy esa ugha )
Hindi. vHkh"V izkf;drk =
P(P2 lsehQkbuy esa igaqprk gS ijUrq QkbZuy esa ugha )
=
P(P1 vkSj P2 lsehQkbuy esa igaqprs gS  P1 lsehQkbuy thrrk gS ijUrq P2 lsehQkbuy gkjrk gS
semifinal) P(P2 lsehQkbuy esa igaqprk gS ijUrq P2 lsehQkbuy
14
C2  1  1 1 1 1 1 
       
16
C4  3  2 2 2 2 2  2
= 15

C3 1 15
16

C4 2
5. Let it is known that whenever the players Pi and Pj play, the player Pi will win if i < j. What is the
probability that the player P8 reaches the final ?
ekuk ;g fn;k x;k fd f[kykM+h Pi vkSj Pj [ksyrs gS rc f[kykM+h Pi thrsxk ;fn i < j. gS rc f[kykM+h P8 ds Qkbuy esa
igaqpus dh izkf;drk D;k gS \
4 6 8 8
(A) 15
(B) 15
(C*) 15
(D) 16
C7 C7 C7 C8
Sol. When P8 reaches final then effectively he wins over 7 players in first round.
favourable number of ways of selecting these 7 players are 8C7 and total ways equal to 15C7
8
C 8
 Required probability is 15 7  15
C7 C7
PAGE NO.-4
IITIANS CAREER
Hindi. rc P8 Qkbuy esa igaqprk gS rc og izFke pj.k esa 7 f[kykfM+;ksa ls thrrk gSA
bu 7 f[kykfM+;ksa ds pqus tkus ds ØePp; 8C7 gS rFkk dqy rjhds 15C7 gSA
8
C7 8
 vHkh"V izkf;drk 15
 15
C7 C7
Comprehension # 3 (Q. No. 6 to 8)

Urn-I contains 5 Red balls and 1 Blue ball,
Urn-II contains 2 Red balls and 4 Blue balls.
A fair die is tossed. If it results in an even number, balls are repeatedly withdrawn one at a time with
replacement from urn-I. If it is an odd number, balls are repeatedly withdrawn one at a time with
replacement from urn-II.
ik=k-I esa 5 yky xasn vkSj 1 uhyh xsan j[krk gSA

ik=k-II esa 2 yky xasn rFkk 4 uhyh xsan j[krk gSA
,d iklk Qsadk tkrk gSA ;fn ml ij ,d le la[;k vkrh gS] rc ik=k -I ls foLFkkiu ds lkFk ,d ckj esa ,d
iqujko`fÙk ls xasnsa fudkyh tkrh gaSA ;fn fo"ke la[;k vkrh gS] rks ik=k -II ls foLFkkiu ds lkFk ,d ckj esa ,d
iqujko`fÙk ls xsansa fudkyh tkrh gSA
6. Conditional probability that the first two draws have resulted in blue balls given that urn-II is used is
izFke nks MªkW esa uhyh xsansa vkus dh lgizfrcfU/kr izkf;drk gksxh] tcfd fn;k x;k gS fd xsansa ik=k -II ls fudkyh xbZ
gSaµ
(A) 1/2 (B*) 4/9 (C) 1/3 (D) None of these buesa ls dksbZ
ughsaA
7. If the probability that the urn-I is being used is p, and q is the corresponding figure for urn-II, given that
the first two draws resulted in both blue balls then
;fn ik=k-I ds mi;ksx fd,s tkus dh izkf;drk p, rFkk ik=k-II ds mi;ksx fd,s tkus dh izkf;drk q gS] tcfd fn;k x;k
gS fd igys nks MªkW esa uhyh xsansa fudyh] rc
(A*) q = 16p (B) q = 4p (C) q = 2p (D) q = 3p
8. The probability of getting a red ball in the third draw, given that the first two draws resulted in both blue
balls, is
rhljs MªkW esa yky xasn vkus dh izkf;drk gS] tcfd fn;k x;k gS fd izFke nks MªkW esa nksuksa uhyh xsansa fudyh gSµ
(A) 1/3 (B) 1/2 (C*) 37/102 (D) 41/102
Sol. (6 to 8)
Let
A: first two draws resulted in both blue balls.
1 1
B1 : urn-I is used P(B1) = B2 : urn-II is used P(B2) =
2 2
1 1
·
11 1 4 4 4 1
P  A B1   ·  P  A B2   ·  and P B1 A   2 36  =p
6 6 36 6 6 9 1 1 1 4 17
·  ·
2 36 2 9
1 16
·
16
P  B2 A  2 36  =q   q = 16p
1 16 1 1 17
·  ·
2 36 2 36
1 5 16 2 37
Now P(red ball in third draw / A) = P(B1/A) P(R) + P(B2/A) P(R) = ·  · =
17 6 17 6 102
PAGE NO.-5
IITIANS CAREER
9. A fair coin is tossed repeatedly until two consecutive heads is obtained. The probability that two
consecutive heads occur on the seventh and eight flips is equal to :
,d fu"i{kikrh flDdksa dks tc rd mNkyk tkrk gS rc rd nks Øekxr 'kh"kZ izkIr u gks tk,A lkroha vkSj vkBoha
mNky esa nks Øekxr 'kh"kZ vkus dh izkf;drk cjkcj gSµ
11 15 13 17
(A) (B) (C*)
(D)
256 256 256 256
Sol. × × × × × T H H
First five are (no consecutive heads) 5T or 4T, 1H or 3T, 2H or 2T, 3H
i.e. TTTTTTHH
or HTTTTTHH or HTHTTTHH or HTHTHTHH
1  C1  C2  C3
5 4 3
13
 Required probability = 8

2 256
Hindi. × × × × × T H H
izFke ik¡p gS (dksbZ Øekxr 'kh"kZ ugh) 5T or 4T, 1H or 3T, 2H or 2T, 3H
vFkkZr~ T T T T T T H H
;k HTTTTTHH ;k HTHTTTHH ;k HTHTHTHH
1  5C1  4C2  3C3 13

 vHkh"V izkf;drk = 8

2 256
10. Let A = {x1, x2, ….., x8} and B = {y1, y2, y3, y4}. The total number of functions f : A  B that are onto and
there are exactly three elements x in A such that f(x) = y1, is :
ekuk A = {x1, x2, ….., x8} vkSj B = {y1, y2, y3, y4} gSA f : A  B esa dqy Qyuksa dh la[;k gksxh tks vkPNknd gS]
rFkk A esa Bhd rhu vo;o bl izdkj gS fd f(x) = y1
(A) 11088 (B) 10920 (C) 13608 (D*) None of these buesa ls dksbZ ugha
Sol. No. of functions Qyuksa dh la[;k = 8C3 × (35 – 3C125 + 3C2 15) = 8400
11. Find number of ways in which 3 boys and 15 girls can sit togther in a row such that between any 2 boys
at least 2 girls sit.
(A) 3! 5! (B*) 3! 15! 14C3 (C) 3! 15! 13C3 (D) 15! 15C3
3 yM+ds rFkk 15 yM+fd;ksa dks ,d iafDr esa fdrus rjhdksa ls cSBk;k tk ldrk gS ;fn fdUgha nks yMdksa ds e/; de
ls de nks yM+fd;k¡ gksA
(A) 3! 5! (B*) 3! 15! 14C3 (C) 3! 15! 13C3 (D) 15! 15C3
Sol. Three boys can sit in 3! ways 3! rjhdksa ls rhu yM+ds cSB ldrs gSA
x1 + x2 + x3 + x4 = 15 where x1  0, x2  2, x3  2, x4  0  3! 14C3 15!
12. A is a set containing n different elements. A subset P of A is chosen. The set A is reconstructed by
replacing the elements of P. A subset Q of A is again chosen. The number of ways of chosing P and Q
so that P  Q contains exactly two elements
(A) nC3 × 2n (B*) nC2 × 3n–2 (C) 3n – 2 (D) None of these
n fHkUu oLrqvksa dk leqPp; A gSA A dk mileqPp; P pquk tkrk gSA leqPp; A esa P ds vo;oksa dks A esa feyk;k
tkrk gSA nksckjk A dk mileqPp; Q pquk tkrk gSA P rFkk Q dks pquus ds rjhds crk,sa ;fn P  Q esa dsoy Bhd nks
vo;o gSA
(A) nC3 × 2n (B*) nC2 × 3n–2 (C) 3n – 2 (D) buesa ls dksbZ ugha
Sol. x  P, x  Q
x  P, x  Q  3n–2
x  P, x  Q
13. Four whole numbers taken at random are multiplied together. What is the chance that the last digit in
the product is 1, 3, 7 or 9 ?
;kn`fPNd :i ls pquh xbZ pkj iw.kZ la[;kvksa dk xq.kuQy fd;k tkrk gS] rks xq.kuQy esa vfUre vad 1, 3, 7 ;k 9
gksusa dh izkf;drk gksxh &
16 1 8 4
(A*) (B) (C) (D)
625 210 125 25
PAGE NO.-6
IITIANS CAREER
44
Sol. Probability izkf;drk =
10 4
14. The probability that out of 10 persons, all born in January, at least two have the same birthday is
31 31 31
C10 C10 P10
(A) 1 – (B) 1 – (C*) 1 – (D) None of these
30! 365! 3110
10 O;fDrvksa esa ls ;fn lHkh dk tUe tuojh ekg esa gqvk gks rks muesa ls de ls de nks O;fDr;ksa dk tUefnu ,d
gh fnu gksus dh izkf;drk gS&
31 31 31
C10 C10 P10
(A) 1 – (B) 1 – (C*) 1 – (D) (D) buesa ls dksbZ ughaA
30! 365! 3110
Sol. P(at least two have same birthday)
= 1 – P(no two have same birthday)
31
C10  10 !
=1–
3110
Hindi. P(de ls de nks dk tUefnu ,d gh fnu gks)
= 1 – P(fdUgh Hkh nks dk tUefnu ,d fnu ugh gks)
31
C10  10 !
=1–
3110
15. A lattice point in the plane is a point whose coordinates are both integers. Given a set of 100 distinct
lattice points in the plane. The smallest number of line segments AB for which A and B are distinct
Lattice points in this set and the midpoint of AB is also a lattice point (not necessarily in the set) is
lery es a ,d fcUnq tkyd fcUnq gS ftlds nks u ks funs Z ' ka k d iw . kkZ d gS A lery es a 100 fHkUu&
fHkUu tkyd fcUnq v ks a dk leq P p; fn;k x;k gS A js [ kk [k.M AB dh U;w u re la [ ;k gks x h
ftlds fy, A vkS j B bl leq P p; es a fHkUu& fHkUu tkyd fcUnq gS rFkk AB dk e/; fcUnq Hkh
tkyd fcUnq gS ] ¼tks leq P p; es a gks ] vko';d ugh gS A ½ gS A
(A) 1000 (B) 1100 (C*) 1200 (D) 1300
 x  x' y  y' 
Sol. The midpoint of the segment connecting (x, y) and (x', y') is  , Therefore a and a' must
 2 2 
have the same parity, as must b and b' for the midpoint to be a lattice point. We therefore divide the
set into four groups: (even, even), (even, odd), (odd, even), (odd, odd), with the number of points in
each
 x  x' y  y' 
(x, y) vkS j (x', y') dks feykus okyh js [ kkvks a dk e/; fcUnq  , gS blfy, a vkS j a' leku
 2 2 
lekurk yxrk gS D;ks f d e/; fcUnq ds fy, b vkS j b' tkyd fcUnq gks x kA blfy, ge bldks
pkj lew g es a foHkkftr djrs gS (le] le ), (le] fo"ke ), (fo"ke] le ), (fo"ke] fo"ke ), iz R ;s d es a
fcUnq v ks a dh la [ ;k ds lkFk
Group a, b, c, d. The number of such segments is then
lew g a, b, c, d. bl iz d kj ds [k.M gS rc
 a   b   c   d  a(a  1) b(b  1) c(c  1) d(d  1)
    =   
 2  2  2  2 2 2 2 2
1
= (a2  a  b2  b  c 2  c  d2  d)
2
PAGE NO.-7
IITIANS CAREER
1 2
= (a  b2  c 2  d2  100) =
2
This is minimized when ;g U;w u re fd;k tk ldrk gS tc a = b = c = d, giving a value of ;g
1
eku (4 · 252 − 100) = 1200. gS
2
16. In a famous game-show hosted by Mr. Monty Hall, he gives the player (Mr. Kabir) a choice of 3 doors to
choose from. Behind one of the doors is a new car and behind the other two, there is nothing (no prize).
Mr. Kabir picks any door at random (say door no.1) and the host Mr. Monty, who knows what's behind
the doors, opens another door (say door no. 3 for example) which has nothing behind it. He then offers
Mr. Kabir a chance to swap or stick with the door he had initially chosen. What must Mr. Kabir do to
maximize his chance of winning the car?
(A*) Swap the door
(B) Stick to the originally chosen door
(C) It does not matter as the chance of winning the car with swapping or sticking with the door is same
(D) None of these
,d iz f l) xs e &'kks es a es t cku Jh eks a V h gkW y ] f[kykM+ h Jh dchj dks rhu njokts es a ls ,d
njoktk pq u us dks dgrs gS A rhu njoktks a es a ls nks njoktks a ds ihNs dks b Z buke ugh gS A
tcfd ,d ds ihNs dkj gS A dchj ,d njoktk ¼ekuk uEcj ,d½ ;kn` f PNd :i ls pq u rs gS
rFkk eks U Vh gkW y tks ;s tkurs gS fd fdl njokts ds ihNs D;k gS ] ,d ,s l k njoktk [kks y rs gS
ftles a ihNs dq N ugh gS A ¼uEcj ,d dks Nks M + d j½ vc dchj lkgc dks ekS d k fn;k tkrk gS fd
og ;k rks mlh njokts ds lkFk tk, ;k nw l jk njoktk ¼uEcj nks pq u rs ½ dkj thrus dh
la H kkouk lcls T;knk gks x h ;fn&
(A*) og njoktk cny ys a A
(B) og mlh njoktks a ds lkFk tk, tks mUgks u s igys pq u k FkkA
(C) njoktk cnyus ls dkj thrus dh la H kkouk viz H kkfor jgs x hA
(D) bues a ls dks b Z ugha
Sol. (1) (2) (3)

1
Initially, each door has probability equal toof a car being behind it.
3
1
Say we choose door 2  P(car behind 2) =
3
2
 P(car behind 1 and 3) =
3
Let us assume that now Monty opens one door from 1 or 3 which is empty. Then, the probability of
2
car behind the remaining door equal to {as one empty door was opened}.
3
1 2
 P(car by sticking to same door) = and P(car by swapping) =
3 3
 Mr Kabir must swap doors to win
17. The number of six lettered word containing at least one A, at least one B and at least one C will be
N% v{kjks a ds 'kCnks a dh la [ ;k gks x h ftles a de ls de ,d A de ls de ,d B rFkk de ls de ,d
C gks x k&
(A)266 – 256 + 246 – 236 (B*) 266 – 3.256 + 3.246 – 236
(C) 26 – 3.25 + 6.24 – 23
6 6 6 6 (D) 266 – 2.256 + 3.246 – 4.236
Sol. Apply inclusion exclusion principle (la ; ks t u fo;ks t u fl}kUr yxkvks )

PAGE NO.-8
IITIANS CAREER
18. From a regular pack of 52 cards, 6 cards are selected. The number of ways of selection such that there
is at least one card of each suit and every card is of different denomination is
52 iÙkks ds ,d lk/kkj.k xM~ M h ls ] 6 iÙks ;kn~ f PNd pq u s tkrs gS A p;u ds Øep;ks a dh la [ ;k gks x h
tcfd de ls de ,d lew g dk ,d iÙkk rFkk iz R ;s d iÙks dk eku fHkUu&fHkUu iz d kj dk gS A
13.13! 132.11! 14! 13!
(A*) (B) (C) (D)
6.7! 7! 7! 6.7!
Sol. Select 6 different denomination out of 13 by 13C6 ways
Now, grouping of 6 card into 4 suits (3, 1, 1, 1) or (2, 2, 1, 1)
 6! 6!  13.13!
Total ways = 13C6  3
 2 2 2
 4! =
 3!(1!) 3! (2!) (1!) (2!)  6.7!
Hindi. 13 es a l s 6 fHkUu&fHkUu eku dks pq u us d s y 13C6 rjhds
vc 6 iÙkks a es a ls 4 lew g (3, 1, 1, 1) ;k (2, 2, 1, 1) dks ys u s ij
 6! 6!  13.13!
dq y rjhds = 6    4! =
2
13C
3 2 2 6.7!
 3!(1!) 3! (2!) (1!) (2!) 
19. A 7 × 7 grid is cut from an 8 × 8 chess board, such that the corners are black. In how many ways we
can put 2 identical coins, one on a black square and one on a white square, such that they are not
placed in the same row or same column
8 × 8 vkdkj ds 'krja t ds cks M Z ls 7 × 7 vkdkj ,d fxz M dkVk tkrk gS ftles a dks u s dkys gS a A fdrus
rjhdks a ls 2 loZ l e flDds ,d ij dkyk oxZ rFkk ,d ij lQs n oxZ gS A os bl iz d kj gS fd os leku
ia f Dr ;k leku LrEHk es a j[ks gS A
(A) 24 . 34 (B*) 24 . 33 (C) 23 . 33 (D) 23 . 34
Sol. Total ways dq y rjhds = (25 × 24) – (4× 3 × 7 × 2) = 432
20. An 8 lettered word is formed using 4 A, 2 E, 2 I. The probability that the word formed will have 1 st A
from right before its 1st E from right is
,d vkB v{kj dk 'kCn 4 A, 2 E, 2 I dh lgk;rk ls cuk;k tkrk gS A
1 3 1 2
(A) (B) (C) (D*)
3 4 2 3
7!
Sol. Number of words start from A =
3! 2! 2!
6!
Number of words start from IA =
3! 2!
5!
Number of words start from IIA =
2! 2!
7! 6! 5!
 
3! 2! 2! 3! 2! 2! 2! 2
Required Probability = =
8! 3
2! 2! 4!
7!
Hindi. A ls 'kq : gks u s okys 'kCnks a dh la [ ;k
3! 2! 2!
6!
IA ls 'kq : gks u s okys 'kCnks a dh la [ ;k
3! 2!
5!
IIA ls 'kq : gks u s okys 'kCnks a dh la [ ;k
2! 2!
7! 6! 5!
 
3! 2! 2! 3! 2! 2! 2! 2
vHkh"V iz k f;drk = =
8! 3
2! 2! 4!
PAGE NO.-9
IITIANS CAREER
21. If x, y, z  N. Then the probability that x2 + y2 + z2 is divisible by 7 is

;fn x, y, z  N. rc x2 + y2 + z2 ds 7 ls foHkkftr gks u s dh iz k f;drk gS &
1 1 2 5
(A*) (B) (C) (D)
7 49 343 343
Sol. Every natural number can be expressed as one of :-
7n, 7n + 1, 7n + 2, 7n + 3, 7n + 4, 7n+ 5, 7n + 6, the square of whose on division by 7 leaves remainder
0,1, 4, 2, 2, 4, 1 respectively.
Now, the sum of square of 3 natural number will be divisible by 7 if the number selected leaves
remainder (0,0,0) or (1, 2, 4)
3
 1 2 2 2 1
P(E) =    6    =
 
7 7 7 7 7
Hnidi. iz R ;s d iz k d` r la [ ;k dks O;Dr fd;k tk ldrk gS A
7n, 7n + 1, 7n + 2, 7n + 3, 7n + 4, 7n+ 5, 7n + 6, ds oxZ 7 ls foHkkftr djus ij 'ks " kQy 7 ns r s gS A 0,1,
4, 2, 2, 4, 1
vc 3 iz k d` r la [ ;kvks a ds oxks Z dk ;ks x ] 7 ls foHkkftr gS A ;fn la [ ;k,a pq u us ij 'ks " kQy (0,0,0) rFkk
(1, 2, 4) gS A
3
 1 2 2 2 1
P(E) =    6    =
7 7 7 7 7
22. Three boxes are having 17, 19, 23 chits numbered from 1 to 17, 1 to 19 and 1 to 23 respectively.
Kejriwal takes out one chit from all 3 boxes and found it to be 1 prime number and 2 perfect square.
He now takes out 1 more chit from box , then the probability that the selected chit is prime will be
rhu cDlks es a Ø e'k% 17, 19, 23 fVdV gS ftu ij Øe'k% 1 ls 17, 1 ls 19 rFkk 1 rd 23 la [ ;k, va f dr
gS ds t jhoky th iz R ;s d ckW D l ls ,d&,d fVdV fudkyrs gS ,d vHkkT; la [ ;k vkS j nks iw . kZ oxZ
la [ ;k fudyrh gS A vc og ckW D l 1 es a ls ,d vks j fVdV fudkyrs gS A rks iz k f;drk Kkr
dhft, fd og ,d vHkkT; la [ ;kA
70 161 7 6
(A) (B*) (C) (D)
272 384 17 16
Sol.     
4  P.S. 4  P.S. 4  P.S.
7  P.N. 8  P.N. 9  P.N.

 Possibility of selection of  PSS SPS SSP
1 prime and 2 square   Prime   Square   Square
I  Square or   Prime or   Square
II  Square   Square   Prime
7 4 4
 
17 19 23 7
Probability of PSS: P(PSS) = =
7 4 4 4 8 4 4 4 9 24
       
17 19 23 17 19 23 17 19 23
8 9
Similarly P(SPS) = , P(SSP) =
24 24
7 6 8 7 9 7 161
Now, Probability of prime in 4th draw from box = × + × + × =
24 16 24 16 24 16 384
Hindi.     
4  P.S. 4  P.S. 4  P.S.
7  P.N. 8  P.N. 9  P.N.

 p;uks a dh la H kkouk  PSS SPS SSP
1 vHkkT; rFkk 2 oxZ   vHkkT;   oxZ   oxZ
I  oxZ or   vHkkT; or   oxZ
II  oxZ   oxZ   vHkkT;
PAGE NO.-10
IITIANS CAREER
7 4 4
 
17 19 23 7
Probability of PSS: P(PSS) = =
7 4 4 4 8 4 4 4 9 24
       
17 19 23 17 19 23 17 19 23
8 9
Similarly P(SPS) = , P(SSP) =
24 24
7 6 8 7 9 7 161
Now, Probability of prime in 4th draw from box = × + × + × =
24 16 24 16 24 16 384
23. In a school cafeteria, nine students sit down to three vacant round tables, with four seats around each.
The probability that Rahul and Narendra are not sitting on adjacent seats, given that different number of
students are sitting on each table will be
,d fo|ky; ds U Vhu es a ukS fo|kFkhZ rhu [kkyh o` r h; es t ks a ds pkjks a vks j cS B rh gS ftues a iz R ;s d ij
pkj dq f lZ ; k gS ;fn iz R ;s d Vs c y ij fHkUu&fHkUu la [ ;k es a fo|kFkhZ cS B s gks rks iz k f;drk Kkr dhft,
fd jkgq y rFkk ujs U nz lkFk&lkFk lhV ij u cS B s gks A
10 5 10 5
(A) (B) (C) (D*)
54 108 216 54
Sol. Only possible ways of grouping 2, 3 & 4 persons
9!
Total ways = × 3! × 3! × 3! × 3
2! 3! 4!
Favorable ways (grouping × distribution of table × arrangement of 4 persons × arrangement of 3
persons × arrangement of 2 persons) :
Case-I : When no one is with Sonu and Monu
7!
× 3! × 3! × 3! × 1
3! 4!
Case-II : When one person sit with Sonu and Monu
7!
× 3! × 3! × 2 × 3
1! 2! 4!
Case-III : When two person sit with Sonu and Monu
7!
× 3! × 2! × 3! × 3
2! 2! 3!
 2 2 2! 
7! 3! 3! 3   
 3!4! 2!4! 2!2!3!  5
Probability = =
9! 54
× 3! × 3! × 3! × 3
2! 3! 4!
24. An insurance company believes that people can be divided into two classes, those who are accident
prone and those who are not. Their statistics show that an accident prone person will not have an
accident in a year period with probability 0.4 whereas this probability is 0.2 for the other kind. Given that
30% of people are accident prone, the probability that a new policy holder will have an accident within a
year of purchasing a policy is :
,d chek dEiuh }kjk nks Js.kh;ksa esa foHkDr gksus okys yksxksa ij fo'okl fd;k tkrk gSA ,d rks og ftudh T;knkrj
nq?kZVuk gksrh gS fd T;knkrj nq?kZVuk gksus okys O;fDr;ksa dh ,d o"kZ esa nq?kZVuk ugh gksus dh izkf;drk 0.4 gS tcfd
;gh nqljs izdkj ds yksxksa esa 0.2 izkf;drk gSA fn;k x;k gS fd 30% O;fDr;ksa dh nq?kZVuk T;knkrj gksrh gSA ,d
ikWfylh ds ysus ds ,d o"kZ ds vUnj ml fcfer O;fDr dh nq?kZVuk gksus dh izkf;drk gSµ
(A*) 0.74 (B) 0.28 (C) 0.34 (D) 0.66
Sol. P(A | B1) = 0.6, P(A | B2) = 0.8
P(B1) = 0.3, P(B2) = 0.7
2
 P(B ) P(A | B )
3 6 7 8
P(A) = i i =     0.74
i1
10 10 10 10
PAGE NO.-11
IITIANS CAREER
25. 2n objects of each of three types are distributed between two people so that each one of them gets 3n
objects. The number of different ways it can be done is
(A*) 3n2 + 3n + 1 (B) 6nC3n (C) 6n + 1 (D) 6n2 + 6n + 1
rhu fHkUu& fHkUu izdkj dh oLrqvksa] ftuesa ls izR;sd izdkj dh 2n oLrq,¡ gS] dks nks O;fDr;ksa esa bl izdkj foHkkftr
fd;k tkrk gS fd izR;sd O;fDr dks 3n oLrq,sa feyrh gSA bUgsa fdrus fHkUu& fHkUu rjhdksa ls foHkkftr fd;k tk ldrk
gSµ
(A*) 3n2 + 3n + 1 (B) 6nC3n (C) 6n + 1 (D) 6n2 + 6n + 1
Sol. Coefficient of x is (x + x1 + x2 + . . . . + x2n)3
3n 0
26. If an unbiased coin is tossed 10 times then the probability that no two consecutive heads occurs is
;fn ,d fu"i{k flDds dks 10 ckj mNkyk tkrk gS rks fdUgha Hkh nks Øekxr mNkyksa es fpÙk ugha vkus dh izkf;drk
gSµ
10
9 1  1 1
(A*) (B) 1 – (C)   (D)
64 210
2 2
p p
Sol. pn = n–1  n–2 , n  4
2 4
T H 1 T 1
= pn–2 × = pn–1 ×
4 2
3 5 8
As p2 = and p3 =  By above formula, p4 =
4 8 16
13 21 34 55 89 144
similarly p5 = , p6 = , p7 = , p8 = , p9 = , p10 =
32 64 128 256 512 1024
pn–1 pn–2
Hindi. pn =  ,n4
2 4
T H 1 T 1
= pn–2 × = pn–1 ×
4 2
3 5 8
tSlk fd p2 = rFkk p3 =  mijksDr lw=k ls p4 =
4 8 16
13 21 34 55 89 144
blhizdkj p5 = , p6 = , p7 = , p8 = , p9 = , p10 =
32 64 128 256 512 1024
27. A King is placed in the middle of a 15 × 15 chess board. He can move in any direction (forward,
backward, left, right or diagonally) but only one square at a time. He now starts moving from his point to
any direction and then returns to the middle point in 6 steps. By how many different ways he can return
to the point ?
16×16 ds 'krjat ds cksMZ ij ,d jktk e/; esa fojkteku gSA og ,d ckj esa ,d oxZ fdlh Hkh fn'kk ¼vkxs] ihNs]
nka;s] cka;s] fodf.kZr½ esa xfr dj ldrk gSA og vc viuh fLFkfr ls xfrdjuk izkjEHk djrk gS rFkk 6 ckj esa og iqu%
e/; esa vius LFkku ij vk tkrk gSA tks fHkUu& fHkUu rjhdksa dh la[;k Kkr dhft,A
(A) 4040 (B*) 5120 (C) 7680 (D) 5420
Sol. If we move in some direction, its inverse move takes us back.
 To return back to original place, each move must be paired with its inverse.
Let, A = {F1, F2, F3, F4}  forward moves
B = {B1, B2, B3, B4}  Inverse moves
6! 6!
 Ways = 4 C1  + 4 C1 3 C1 + 4 C3  6!
3!3! 2!2!
(All diff )
(Only 1 move) (2 Re peated 1 diff )
 Ways = 80 + 12 × 180 + 4 × 720
Ways = 5120
PAGE NO.-12
IITIANS CAREER
28. Let persons A and B throws a die one by one for a game. If sum of number appearing on (n) th and
(n+1)th chance is 7 then the person who threw die in (n+1)th chance declared winner of the game. If A
threw die first time, then probability of A winning the game is
ekuk ,d [ksy ds fy, ,d ds ckn ,d A vkSj B ikls dks Qsadrs gSA ;fn n oha vkSj n+1 oha ckj ij la[;kvksa dk
;ksxQy 7 gS rc O;fDr tks n+1 oha pky esa iklk Qasdrk gS og [ksy dks thrrk gSA ;fn A iklk Qsadus dh 'kq:vkr
djrk gS rc A ds }kjk [ksy thrus dh izkf;drk gSA
3 5 6 5
(A) (B*) (C) (D)
61 11 11 6
5 1 5 5 5 1
Sol.       .....
6 6 6 6 6 6
 
5 1  1  5 36 5
=     
6 6  25  36 11 11
 1 
 36 
29. A Bag contains 3 balls. Colour of balls are either Red or White. A ball drawn from bag is found Red.
The probability of all balls are Red is
,d FkSys esa rhu xsans gSA xsnksa dk jax ;k rks yky ;k lQsn gSA FkSys ls ,d xsn yky ik;h tkrh gSA lHkh xsanksa ds
yky gksus dh izkf;drkA
1 1 1 2
(A*) (B) (C) (D)
4 3 2 3
1
Sol. Probability that all balls are white balls is
8
1
Probability that all balls are red balls is
8
3
probability that one ball is red and two balls are white balls is
8
3
probability that one ball is white and two balls are red balls is
8
1 3

 all balls are red  8 3
P  
 ball draw from bag is red  3  1  3  2  1  3
8 3 8 3 8 3
3 1
= 
12 4
1
Hindi. lHkh xsnksa ds lQsn xsnksa gksus dh izkf;drk gSA
8
1
lHkh xsnsa yky xsnksa gksus dh izkf;drk gSA
8
3
,d xsn yky rFkk nks xsans lQsn gksus dh izkf;drk gSA
8
3
,d xsns lQsn rFkk nks xsns yky xsns gksus dh izkf;drk gSA
8
1 3

 lHkh xsns yky gS  8 3
P  
 FkSys ls fudkyh xbZ xsnsa yky gS  3  1  3  2  1  3
8 3 8 3 8 3
3 1
= 
12 4
PAGE NO.-13
IITIANS CAREER
30. A bag contains four tickets marked with number 112, 121, 211, 222. One ticket is drawn at random from
the bag. Let Ei (i = 1, 2, 3) denote the event that ith digit on the selected ticket is 2, then which of the
following is correct ?
(A*) E1 and E2 are independent (B*) E2 and E3 are independent
(C*) E3 and E1 are independent (D) E1, E2, E3 are independent
,d FkSys esa pkj fVdV j[ks gS ftu ij la[;k,sa 112, 121, 211, 222 vafdr gSA ,d fVdV ;kn`fPNd :i FkSys ls
pquk tkrk gSA ekuk Ei (i = 1, 2, 3), pqusa x;s fVfdV ij i ok¡ vad 2 vkus dh ?kVuk gS] rks fuEufyf[kr esa ls dkSulk
fodYi lR; gS&
(A*) E1 vkSj E2 ijLij LorU=k ?kVuk,¡ gSA (B*) E2 vkSj E3 ijLij LorU=k gSA
(C*) E3 vkSj E1 ijLij LorU=k ?kVuk,¡ gSA (D) E1, E2, E3 ijLij LorU=k gSA
Sol. P(E1) = P(E2) = P(E3) = 1/2, P(E1  E2) = P(E2  E3) = P(E3  E1) = 1/4
P(E1  E2  E3) = 1/4
31*. Let all letters of word 'MATHEMATICS' are arranged in all possible order. Three events A, B and C are
defined as :
A : Both M are together B : Both T are together C : Both A are together
Which of the following hold(s) good ?
ekuk 'MATHEMATICS' 'kCn ds lHkh v{kjksa dks lHkh laHkkfor Øe esa O;ofLFkr fd;k tkrk gSA rhu ?kVuk,sa A, B
vkSj C bl izdkj ifjHkkf"kr gS fd
A : nksuksa M ,d lkFk gSA B : nksuksa T ,d lkFk gSA C : nksuksa A ,d lkFk gSA
fuEu esa ls dkSuls lR; gS?
2 2
(A*) P(A) = P(B) = (B*) P(A  B) = P(B  C) = P(C  A) =
11 55
4 58
(C*) P(A  B  C) = (D*) P ((A  B) | C) 
495 405
10!
2! 2! 2
Sol. P(A) =  = P(B) = P(C)
11! 11
2! 2! 2!
9!
2! 2
P(A  B) =  = P(A C) = P(B C)
11! 55
2! 2! 2!
2 2 2 4
  
8! 4 58
P(A  BC) =   P ((A  B) | C)  11 55 55 495 
11! 495 2 405
1
2! 2! 2! 11
32*. A bag contains a number of coloured balls, with equal numbers of each colour. Adding 20 balls of a
new colour to the bag would not change the probability of drawing (without replacement) two balls of
same colour. Then
(A*) The number of balls in the bag before adding 20 balls is 190
(B) The number of balls in the bag after adding 20 balls is 190
(C*) The number of balls of each colour before adding 20 balls is 10
(D) The different number of colour ball available in the bag is 10
,d FkSys esa izR;sd jax dh leku la[;k esa jaxhu xsns lhfer la[;k esa j[kh gSA u;s vU; jax dh 20 xsnksa dks FkSys esa
j[kus ij leku jax dh nks xsns fcuk foLFkkiu ds fudkyus dh izkf;drk esa dksbZ ifjorZu ugha gksrk gSA rc
(A*) 20 xsanksa dks j[kus ls igys FkSys esa xsanksa dh la[;k 190 gSA
(B) 20 xsanksa dks j[kus ds ckn FkSys esa xsanksa dh la[;k 190 gSA
(C*) 20 xsanksa dks j[kus ls igys FkSys esa izR;sd jax dh xsnksa dh la[;k 10 gSA
(D) FkSys esa miyC/k fHkUu&fHkUu jax dh xsns 10 gSA
PAGE NO.-14
IITIANS CAREER
Sol. Let the number of different coloured balls = x
Let the number of balls of each colour = y
xy(y  1)
Now, P(getting two balls of same colour) = .......(1)
xy(xy  1)
After adding 20 balls
xy(y  1)  20.19
P(getting same colour) = .......(2)
(xy  20)(xy  19)
Equating (1) and (2)
xy(y  1) xy(y  1)  20.19

=
xy(xy  1) (xy  20)(xy  19)
Let xy = A and y –1 = B
19(B  1)
A =  B = 9 , A = 19 × 10
19  2B
 y= 10, xy = 19 × 10
 x = 19
Hindi. ekuk fHkUu&fHkUu jax dh xsnksa dh la[;k = x
ekuk izR;sd jax dh xsnksa dh la[;k = y
xy(y  1)
vc, P(leku jax dh nks xsnsa) = .......(1)
xy(xy  1)
20 xsnksa dks tksM+us ds ckn
xy(y  1)  20.19
P(leku jax dh xsnsa) = .......(2)
(xy  20)(xy  19)
lehdj.k (1) vkSj (2)
xy(y  1) xy(y  1)  20.19

=
xy(xy  1) (xy  20)(xy  19)
ekuk xy = A vkSj y –1 = B
19(B  1)
A =  B = 9 , A = 19 × 10
19  2B
 y= 10, xy = 19 × 10
 x = 19
33*. A bag contain 10 balls numbered from 0 to 9, which are equally likely to be picked. A person picked a
ball and replaced it in the bag after noting its number. This process is repeated 2 more times. What is
the probability that the ball picked second is numbered less than both the first and third picked balls
,d FkSys esa 0 ls 9 rd ukekafdr 10 xsnsa j[kyh gS ftudks fudkyus dh izkf;drk lelEHkkoh gSA ,d O;fDr ,d xsan
mBkrk gSA vkSj bldh la[;k dks fy[krs gq, okil FkSys esa okfil j[k nsrk gSA ;g izfdz;k nks vks j ckj nksgjkbZ tkrh
gSA nqljh xsan ds fudyus ij ukekafdr la[;k] izFke xsan vkSj rhljh xasn nksuks ds fudyus ij ukekafdr la[;k ls de
gksus dh izkf;drk gSA
171 144 57 6
(A*) (B) (C*) (D)
600 600 200 25
Sol. 1st draw = a
2nd draw = b
3rd draw = c
Case – I b < a, b < c , a  c
= 10C3 × 2
Case – II b < a, b < c , a = c
= 10C2 × 1
10
C3  2 10 C2 57 171
P(E) = = =
10.10.10 200 600
PAGE NO.-15
IITIANS CAREER
34*. 9 married couples are going for a roller coaster ride, having 9 rows consisting of 2 seats each,
numbered from 1 to 18. Number of possible arrangements such that at least 5 wives are seated in the
same row as that of their husband (in seats of each row, exactly one female and one male to be
seated) is of the form P  29 9, then
(A*) sum of all the digit of P is 16 (B) number of divisors of P is 6
(C) number of divisors of P is 9 (D*) sum of all the divisors of P is 1456
,d jks y j dks L Vj jkbM es a 9 ia f Dr;ka gS ftues a iz R ;s d ia f Dr es a nks lhVs gS ftu ij 1 ls 18 rFkk
la [ ;k, va f dr gS ukS fookfgr ;q x y dks iz d kj bl jkbM es a O;ofLFkr djuk gS fd de ls de 5
;q x y ,d lkFk ,d ia f Dr es a cS B s ¼iz R ;s d ia f Dr es a ,d iq : "k rFkk ,d efgyk gh cS B ldrh gS ½ ;fn
bl iz d kj ls cS B kus ds rjhdks dh la [ ;k P  29 9 gks rks &
(A*) P ds lHkh va d ks dk ;ks x Qy 16 gS A (B) P ds Hkktdks a dh la [ ;k 6 gS A
(C) P ds Hkktdks a dh la [ ;k 9 gS A (D*) P ds a la H kh Hkktdks a dks ;ks x Qy 1456 gS A
Sol. Possible ways of arrangement :-
(5 couples together and 4 not together) + (6 couples together and 3 not together) +
(7 couples together and 2 not together) + (9 couples together and 0 not together)
= (9C5  9  29  9!) + (9C6  2 29  9!) + (9C7  1 29  9!) + (9C9  29  9!) = 1339  29  9!
P = 1339
Hindi. la H kkfor Øep;
(5 ;q x y ,d lkFk vkS j 4 ,d lkFk ugha gS ) + (6 ;q x y ,d lkFk vkS j 3 ,d lkFk ugha gS ) +
(7 ;q x y ,d lkFk vkS j 2 ,d lkFk ugha gS ) + (9 ;q x y ,d lkFk vkS j 0 ,d lkFk ugha gS )
= (9C5  9  29  9!) + (9C6  2 29  9!) + (9C7  1 29  9!) + (9C9  29  9!) = 1339  29  9!
P = 1339
35*. 9 digit numbers are formed using only 2 and 3, then

(A*) number of numbers divisible by 24 is 21
(B*) number of numbers divisible by 6 is 85
(C) number of numbers divisible by 6 is 84
(D) number of numbers divisible by 24 is 42
ds o y 2 vkS j 3 va d ks dh la g k;rk ls 9 va d dh la [ ;k cukbZ tkrh gS A
(A*) 24 ls foHkkftr gks u s okyh la [ ;kvks a dh la [ ;k 21 gS A
(B*) 6 ls foHkkftr gks u s okyh la [ ;kvks a dh la [ ;k 85 gS A
(C) 6 ls foHkkftr gks u s okyh la [ ;kvks a dh la [ ;k 84 gS A
(D) 24 ls foHkkftr gks u s okyh la [ ;kvks a dh la [ ;k 42 gS A
Sol. Divisible by 24:- ( last 3 digits divisible by 8 and sum divisible by 3)

24 ls foHkkftr gks u s ds fy,
(va f re rhu va d vkB ls foHkkftr gks vkS j ;ks x Qy rhu ls foHkkftr gks )
333332 232 / 332222232
6
C1 + 6
C2  21
Divisible by 6 :- (last digit even and sum divisible by 3)
33333322 2 / 33322222 2 / 22222222 2
8
C2 + 8
C5 + 8
C8  85
36. Let 1, 1, 2, ……., k are divisors of number N = 2n–1(2n – 1), where 2n – 1 is a prime number and 1 <
1 1 1
1 < 2 < ……. < k, then the value of 1    ......  is
1 2 k
ekuk 1, 1, 2, ……., k la[;k N = 2n–1(2n – 1) ds Hkktd gSA tgk¡ 2n – 1 ,d vHkkT; la[;k gS vkSj 1 < 1 < 2
1 1 1
< ……. < k , rc 1    ......  dk eku gksxk&
1 2 k
Ans. 2
PAGE NO.-16
IITIANS CAREER
Sol. Number of divisors = (n – 1 + 1)(1 + 1) = 2n  k = 2n – 1
Divisors of N are 1, 2, 22, ……, 2n–1, 2n – 1, 2(2n – 1), 22(2n – 1), 2n–1(2n – 1)
1 1 1  1 1 1  1  1 1 1 
 1   ......  =  1   2  ......  n1  + n  1   2  ......  n1 
1 2 k  2 2 2  2 1  2 2 2 
  1 
n
1   2n  1  2n 
 2 1      1  n  2  n  n 2
  2   

2  1  2  2  1 
  
Sol. Hkktdksa dh la[;k = (n – 1 + 1)(1 + 1) = 2n  k = 2n – 1

N Hkktd gS 1, 2, 22, ……, 2n–1, 2n – 1, 2(2n – 1), 22(2n – 1), 2n–1(2n – 1)
1 1 1  1 1 1  1  1 1 1 
 1   ......  =  1   2  ......  n1  + n  1  2  2  ......  n1 
1 2 k  2 2 2  2 1  2 2 
  1 
n
1   2n  1  2n 
 2 1      1  n  2  n  n 2
  2   

2  1  2  2  1 
  
37. In a certain laboratory, chemicals are identified by a colour-coding system. There are 21 different
chemicals. Not more than one chemical is left colourless and not more than one chemical is coloured
with all the colours available. Rest of the chemicals are coded with either 2 colour-pair (unique) or 3
colour-pair (unique). If the order of colours in the pairs does not matter, what is the minimum number of
different colours needed to code all 21 chemicals
fdlh iz ; ks x 'kkyk es a 21 fHkUu& fHkUu jlk;u gS ftudh igpku ja x ks dh dks f Ma x }kjk dh tk rh gS A
,d ls vf/kd jlk;u ja x ghu ugh gS rFkk vf/kdre ,d gh jlk;u gS ftl ij lHkh miyC/k ja x ks ls
dks f Ma x dh x;h gS A vU; lHkh jlk;u ij ;k rks nks ja x ks ¼vf}rh;½ ;k rhu ja x ks ¼vf}rh;½ }kjk
dks f Ma x dh x;h gS A dks f Ma x es a ja x ks ds Øe dk dks b Z egRo ugh gS A lHkh 21 jlk;uks a dks dks f Ma x ds
fy, U;w u re fdrus ja x ks dh vko';drk gS A
Ans. 5
Sol. nC + nC + nC + nC  21
0 2 3 n
 nC2 + nC3  19
 n+1C3  19
n5
38. Find the number of total permutations of a1, a2, a3, ..... a18 from 1, 2, 3,......, 18 ; such that |ai – i| is
the same for i {1, 2, .....,18} and the value is a multiple of 3.
1, 2, 3,......, 18 ls a1, a2, a3, ..... a18 ds dqy Øep;ksa dh la[;k gksxh tcfd |ai – i| i {1, 2, .....,18} ds fy,
leku gS rFkk eku 3 dk xq.kt gS&
Ans. 3
Sol. Case- |ai –i| = 0
 a1 = 1, a2 = 2,……,a18 = 18
 one possible arrangement
Case- |ai –i| = 3
 a1 = 4, a2 = 5, a3 = 6, a4 = 1, a5 = 2,…, a17 = 14, a18 = 15
Case- |ai –i| = 6
 no possible arrangement
Case-V |ai –i| = 9
 a1 = 10, a2 = 11,……,a9 = 18, a10 = 1, a11 = 2,……,a18 = 9
total arrangements possible equal to 3
Hindi. Case- |ai –i| = 0
 a1 = 1, a2 = 2,……,a18 = 18
 ,d laHkkfor O;oLFkhdj.k
Case- |ai –i| = 3
 a1 = 4, a2 = 5, a3 = 6, a4 = 1, a5 = 2,…, a17 = 14, a18 = 15
PAGE NO.-17
IITIANS CAREER
 ,d laHkkfor O;oLFkhdj.k
Case- |ai –i| = 6
 dksbZ laHkkfor Øep; ugha
Case-V |ai –i| = 9
 a1 = 10, a2 = 11,……,a9 = 18, a10 = 1, a11 = 2,……,a18 = 9
 dsoy ,d Øep; nks laHkkfor Øep; 3 ds cjkcj gSA
39. If A be any event in sample space the maximum value of 3 P(A)  4 P(A) is
;fn izfrn'kZ lef"V esa A dksbZ ?kVuk gS rc 3 P(A)  4 P(A) dk vf/kdre eku gSµ
Ans. 5
Sol. Let P(A) = sin2  Given expression = 3 sin + 4cos whose maximum value is 5.
where 0    90°
Hindi. ekuk P(A) = sin2  fn;k x;k O;atd = 3 sin + 4cosftldk vf/kdre eku 5 gSA
tgk¡ 0    90°
40. There are 10 cards, labeled from 1 to 10. Three cards denoted by a, b, c (a > b > c) are drawn from the
a
1 k
 (x  2bx  3c)dx  0 is
2
cards at the same time if the probability such that then is.
0
k 10
1 ls 10 rd ukekafdr 10 iÙks gSA rhu iÙkksa dks Øe'k% a, b, c (a > b > c) ls O;Dr fd;k tkrk gS] ,d lkFk iÙkksa ls
a
1 k
[khpk tkrk gS ;fn izkf;drk gS tcfd  (x 2  2bx  3c)dx  0 rc dk eku gS&
k 0 10
Ans. [4]
a
 (x  2bx  3c)dx  0
2
Sol.
0
a3
  ba2  3ac  0
3
 a2  3ab  9c  0
 a2 = 3(ab – 3c)
 a is multiple of 3
Case- : a = 3  b = 2, c = 1
Case- : a = 6  b = 3, c = 2
Case- : a = 9  b = 4, c = 3
 only 3 solution of (a, b, c)
3 1
 Probability equal to 10 
C3 40
PAGE NO.-18
IITIANS CAREER
PAGE NO.-19

Reso Test

Hochgeladen von

Dokumentinformationen

Originaltitel

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

Reso Test

Hochgeladen von

Copyright:

Verfügbare Formate

IITIANS CAREER

TARGET : JEE (ADVANCED) 2018

Course : VIJETA & VIJAY (ADP & ADR) Date : 14.04.2018

DPP Syllabus: Permutation & Combination, Probability

1. (C) 2. (B) 3. (C) 4. (B) 5. (C) 6. (B) 7. (A)

36. 2 37. 5 38. 3 39. 5 40. 4

Total Marks: 126 Max. Time: 120 min.

1. The correct statement from the following is:

= C02 + C12 +........+ Cn2 = 2nCn

= C02 + C12 +........+ Cn2 = 2nCn

P(P1 and P2 reaches semifinal  P1 wins in semifinal but P2 loss semifinal)

Comprehension # 3 (Q. No. 6 to 8)

vuqPNsn # 3 (iz0 la0 6 ls 8)

ik=k-I esa 5 yky xasn vkSj 1 uhyh xsan j[krk gSA

1  5C1  4C2  3C3 13

Sol. (1) (2) (3)

Sol. Apply inclusion exclusion principle (la ; ks t u fo;ks t u fl}kUr yxkvks )

21. If x, y, z  N. Then the probability that x2 + y2 + z2 is divisible by 7 is

xy(y  1) xy(y  1)  20.19

xy(y  1) xy(y  1)  20.19

35*. 9 digit numbers are formed using only 2 and 3, then

Sol. Divisible by 24:- ( last 3 digits divisible by 8 and sum divisible by 3)

Sol. Hkktdksa dh la[;k = (n – 1 + 1)(1 + 1) = 2n  k = 2n – 1

Das könnte Ihnen auch gefallen