Permutation & Combination: There Can Never Be Surprises in Logic... Wittgenstein, Ludwig

Permutation & Combination
There can never be surprises in logic...Wittgenstein, Ludwig
The most fundamental application of mathematics is counting. There are many natural methods used
for counting
This chapter is dealing with various known techniques those are much faster than the usual counting
methods.
We mainly focus, our methods, on counting the number of arrangements (Permutations) and the
number of selections (combinations), even although we may use these techniques for counting in some
other situations also .
Let us start with a simple problem
A group G1 of 3 circles C1, C2, C3 having different centers are situated in such a way that C2 lie entirely
inside C1 ; C3 lie entirely inside C2. Another group G2 of 4 circles C1, C2, C3, C4 are also situated in a
similar fashion. The two groups of circles are in such a way that each member of G1 intersect with every
member of G2, as shown in the following figure
(i) How many centres the circles altogether has ?

(ii) How many common chords are obtained ?
The answer to the first part is "3 + 4 = 7" and answer to the second part is "3 × 4 = 12" . The method in
which we calculated first part of the problem is called as "addition rule" and the method we used to
calculate its second part is called as the "multiplication rule". These rules altogether are the most
important tools in counting, popularly known as "the fundamental counting principle".
Fundamental counting principle :
Suppose that an operation O1 can be done in m different ways and another operation O2 can be done in
n different ways.
(i) Addition rule : The number of ways in which we can do exactly one of the operations O1, O2
is m + n
(ii) Multiplication rule : The number of ways in which we can do both the operations O1, O2 is mn.
Note : The addition rule is true only when O1 & O2 are mutually exclusive and multiplication rule is true only
when O1 & O2 are independent (The reader will understand the concepts of mutual exclusiveness and
independence, in the due course)
Example # 1 : There are 8 buses running from Kota to Jaipur and 10 buses running from Jaipur to Delhi. In
how many ways a person can travel from Kota to Delhi via Jaipur by bus?
Solution : Let E1 be the event of travelling from Kota to Jaipur & E2 be the event of travelling from Jaipur
to
Delhi by the person.
E1 can happen in 8 ways and E2 can happen in 10 ways.
Since both the events E1 and E2 are to be happened in order, simultaneously,
the number of ways = 8 × 10 = 80.
Example # 2 : How many numbers between 10 and 10,000 can be formed by using the digits 1, 2, 3, 4, 5 if
(i) No digit is repeated in any number. (ii) Digits can be repeated.
Corporate Office: CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005 1
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
ADVPC - 1
Solution : (i) Number of two digit numbers = 5 × 4 = 20

Number of three digit numbers = 5 × 4 × 3 = 60
Number of four digit numbers = 5 × 4 × 3 × 2 = 120
Total = 200
(ii) Number of two digit numbers = 5 × 5 = 25
Number of three digit numbers = 5 × 5 × 5 = 125
Number of four digit numbers = 5 × 5 × 5 × 5 = 625
Total = 775
Self Practice Problems :

(1) How many 4 digit numbers are there, without repetition of digits, if each number is divisible
by 5 ?
(2) Using 6 different flags, how many different signals can be made by using atleast three flags,
arranging one above the other?
Ans. (1) 952 (2) 1920
Arrangements :
If nPr denotes the number of permutations (arrangements) of n different things, taking r at a time, then
n!
n
Pr = n (n  1) (n  2)..... (n  r + 1) =
(n  r)!
NOTE : (i) Factorials of negative integers are not defined.
(ii) 0 ! = 1 ! = 1
(iii) nPn = n ! = n. (n  1) !
(iv) (2n) ! = 2n. n ! [1. 3. 5. 7... (2n  1)]
Example # 3 : How many three digit can be formed using the digits 1, 2, 3, 4, 5, without repetition of digits?
How many of these are even?
Solution : Three places are to be filled with 5 different objects.
 Number of ways = 5P3 = 5 × 4 × 3 = 60
For the 2nd part, unit digit can be filled in two ways & the remaining two digits can be filled
in 4P2 ways.
 Number of even numbers = 2 × 4P2 = 24.
Example # 4 : If all the letters of the word 'QUEST' are arranged in all possible ways and put in dictionary
order, then find the rank of the given word.
Solution : Number of words beginning with E = 4P4 = 24
Number of words beginning with QE = 3P3 = 6
Number of words beginning with QS = 6
Number of words beginning withQT = 6.
Next word is 'QUEST'
 its rank is 24 + 6 + 6 + 6 + 1 = 43.
(3) Find the sum of all four digit numbers (without repetition of digits) formed using the digits
1, 2, 3, 4, 5.
(4) Find 'n', if n – 1P3 : nP4 = 1 : 9.
(5) Six horses take part in a race. In how many ways can these horses come in the first, second
and third place, if a particular horse is among the three winners (Assume No Ties)?
(6) Find the sum of all three digit numbers those can be formed by using the digits. 0, 1, 2, 3, 4.
Ans. (3) 399960 (4) 9 (5) 60 (6) 27200
Result : Let there be 'n' types of objects, with each type containing atleast r objects. Then the number of ways of
arranging r objects in a row is nr.
ADVPC - 2
Example # 5 : How many 3 digit numbers can be formed by using the digits 0, 1, 2, 3, 4, 5. In how many of
these we have atleast one digit repeated?
Solution : We have to fill three places using 6 objects (repetition allowed), 0 cannot be at 100th place.
The number of numbers = 180.
Number of numbers in which no digit is repeated = 100
 Number of numbers in which atleast one digit is repeated = 180 – 100 = 80
Example # 6 : How many functions can be defined from a set A containing 5 elements to a set B having 3
elements? How many of these are surjective functions?
Solution : Image of each element of A can be taken in 3 ways.
 Number of functions from A to B = 35 = 243.
Number of into functions from A to B = 25 + 25 + 25 – 3 = 93.
 Number of onto functions = 150.

(7) How many functions can be defined from a set A containing 4 elements to a set B containing 5
elements? How many of these are injective functions?
(8) In how many ways 5 persons can enter into a auditorium having 4 entries?
Ans. (7) 625, 120 (8) 1024.
Combination :
If nCr denotes the number of combinations (selections) of n different things taken r at a time, then
n
n ! Pr
n
Cr = = where r  n ; n  N and r  W.
r! (n  r)! r!
NOTE : (i) nCr = nCn – r
(ii) Cr + nCr – 1 = n + 1Cr
n
(iii) nCr = 0 if r  {0, 1, 2, 3........, n}
Example # 7 : There are fifteen players for a cricket match.

(i) In how many ways the 11 players can be selected?
(ii) In how many ways the 11 players can be selected including a particular player?
(iii) In how many ways the 11 players can be selected excluding two particular players?
Solution : (i) 11 players are to be selected from 15
Number of ways = 15C11 = 1365.
(ii) Since one player is already included, we have to select 10 from the remaining 14
(iii) Since two players are to be excluded, we have to select 11 from the remaining 13.
Example # 8 : If 49C3r – 2 = 49C2r + 1, find 'r'.

Solution : n
Cr = nCs if either r = s or r + s = n.
Thus 3r – 2 = 2r + 1  r=3
or 3r – 2 + 2r + 1 = 49  5r – 1 = 49  r = 10
  r = 3, 10
Example # 9 : A regular polygon has 20 sides. How many triangles can be drawn by using the vertices, but
not using the sides?
Solution : The first vertex can be selected in 20 ways. The remaining two are to be selected from 17
vertices so that they are not consecutive. This can be done in 17C2 – 16 ways.
 The total number of ways = 20 × (17C2 – 16)
But in this method, each selection is repeated thrice.
ADVPC - 3
20  (17 C2  16)
 Number of triangles = = 800.
3
Example # 10 : 15 persons are sitting in a row. In how many ways we can select three of them if adjacent
persons are not selected ?
Solution : Let P1, P2, P3, P4, P5, P6, P7, P8, P9, P10 ,P11 , P12 , P13 ,P14 ,P15 be the persons sitting in this order.
If three are selected (non consecutive) then 12 are left out.
Let P,P,P,P,P,P,P,P,P,P,P,P be the left out & q, q, q be the selected. The number of ways in
which these 3 q's can be placed into the 13 positions between the P's (including extremes) is
the number ways of required selection.
Thus number of ways = 13C3 = 286.
Example # 11 : In how many ways we can select 4 letters from the letters of the word MSSSSPP?
Solution : M

SSSS
PP
Number of ways of selecting 4 alike letters = 2C1 = 2.
Number of ways of selecting 3 alike and 1 different letters = 2C1 × 3C1 = 6
Number of ways of selecting 2 alike and 2 alike letters = 3C2 = 3
Number of ways of selecting 2 alike & 2 different = 3C1 × 3C2 = 9
Number of ways of selecting 4 different = 4C4 = 1
Total number of ways = 2 + 6 + 3 + 9 + 1 = 21

(9) In how many ways 7 persons can be selected from among 5 Indian, 4 British & 2 Chinese, if
atleast two are to be selected from each country ?
(10) Find a number of different seven digit numbers that can be written using only three digits 1,2&3
under the condition that the digit 2 occurs exactly twice in each number ?
(11) In how many ways 6 boys & 6 girls can sit at a round table so that girls & boys sit alternate?
(12) In how many ways 4 persons can occupy 10 chairs in a row, if no two sit on adjacent chairs?
(13) In how many ways we can select 3 letters of the word PROPORTION ?
Ans. (9) 100 (10) 672 (11) 86400 (12) 840 (13) 36
Arrangement of n things, those are not all different :

The number of permutations of 'n' things, taken all at a time, when 'p' of them are same & of one type, q
of them are same & of second type, 'r' of them are same & of a third type & the remaining
n!
n  (p + q + r) things are all different, is .
p ! q !r !
Example # 12 : In how many ways we can arrange 3 red flowers, 4 yellow flowers and 5 white flowers in a row?
In how many ways this is possible if the white flowers are to be separated in any arrangement?
(Flowers of same colour are identical).
Solution : Total we have 12 flowers 3 red, 4 yellow and 5 white.
12 !
Number of arrangements = = 27720.
3 ! 4 ! 5 !
For the second part, first arrange 3 red & 4 yellow
7 !
This can be done in = 35 ways
3 ! 4 !
Now select 5 places from among 8 places (including extremes) & put the white flowers there.
This can be done in 8C5 = 56.
ADVPC - 4
 The number of ways for the 2nd part = 35 × 56 = 1960.

Example # 13 : In how many ways the letters of the word "ARRANGE" can be arranged without altering the
relative positions of vowels & consonants?
4!
Solution : The consonants in their positions can be arranged in = 12 ways.
2!
3!
The vowels in their positions can be arranged in = 3 ways
2!
 Total number of arrangements = 12 × 3 = 36
(14) How many words can be formed using the letters of the word ASSESSMENT if each word
begin
with A and end with T?
(15) If all the letters of the word ARRANGE are arranged in all possible ways, in how many of words
we will have the A's not together and also the R's not together?
(16) How many arrangements can be made by taking four letters of the word MISSISSIPPI?
Ans. (14) 840 (15) 660 (16) 176.
Formation of Groups :
Number of ways in which (m + n + p) different things can be divided into three different groups
containing m, n & p things respectively is

m  n  p  ! ,
m !n !p !
If m = n = p and the groups have identical qualitative characteristic then the number of groups
(3n)!
= .
n! n! n! 3!
(3n)!
Note : If 3n different things are to be distributed equally among three people then the number of ways = .
n!3
Example # 14 : 12 different toys are to be distributed to three children equally. In how many ways this can be
done ?
Solution : The problem is to divide 12 different things into three different groups.
12!
Number of ways = = 34650.
4! 4! 4!
Example # 15 : In how many ways 10 persons can be divided into 5 pairs?

Solution : We have each group having 2 persons and the qualitative characteristic are same (Since there
is no purpose mentioned or names for each pair).
10!
Thus the number of ways = = 945.
(2!)5 5!

(17) 9 persons enter a lift from ground floor of a building which stops in 10 floors (excluding ground
floor), if it is known that persons will leave the lift in groups of 2, 3, & 4 in different floors. In how
many ways this can happen?
(18) In how many ways one can make four equal heaps using a pack of 52 playing cards?
(19) In how many ways 11 different books can be parcelled into four packets so that three of the
packets contain 3 books each and one of 2 books, if all packets have the same destination?
52! 11!
Ans. (17) 907200 (18) 4
(19)
(13!) 4! (3!)4 2
ADVPC - 5
Circular Permutation :
The number of circular permutations of n different things taken all at a time is (n  1) !.
(n  1)!
If clockwise & anticlockwise circular permutations are considered to be same, then it is .
2
Note: Number of circular permutations of n things when p are alike and the rest are different, taken all at a
(n  1) !
time, distinguishing clockwise and anticlockwise arrangement is .
p!
Example # 16 : In how many ways can we arrange 6 different flowers in a circle? In how many ways we
can form a garland using these flowers?
Solution : The number of circular arrangements of 6 different flowers = (6 – 1)! = 120
When we form a garland, clockwise and anticlockwise arrangements are similar. Therefore, the
1
number of ways of forming garland = (6 – 1) ! = 60.
2
Example # 17 : In how many ways 6 persons can sit at a round table, if two of them prefer to sit together?
Solution : Let P1, P2, P3, P4, P5, P6 be the persons, where P1, P2 want to sit together.
Regard these person as 5 objects. They can be arranged in a circle in (5 – 1)! = 24 ways. Now
P1, P2 can be arranged in 2! ways. Thus the total number of ways = 24 × 2 = 48.
(20) In how many ways letters of the word 'MONDAY' can be written around a circle, if vowels
are to be separated in any arrangement ?
(21) In how many ways we can form a garland using 3 different red flowers,5 different yellow flowers
and 4 different blue flowers, if flowers of same colour must be together?
Ans. (20) 72 (21) 17280
Selection of one or more objects

(a) Number of ways in which atleast one object may be selected out of 'n' distinct objects, is
n
C1 + nC2 + nC3 +...............+ nCn = 2n – 1
(b) Number of ways in which atleast one object may be selected out of 'p' alike objects of one
type, 'q' alike objects of second type and 'r' alike objects of third type, is
(p + 1) (q + 1) (r + 1) – 1
(c) Number of ways in which atleast one object may be selected from 'n' objects where 'p' alike of
one type, 'q' alike of second type and 'r' alike of third type and rest n – (p + q + r) are
different, is (p + 1) (q + 1) (r + 1) 2n – (p + q + r) – 1
Example # 18 : There are 12 different books in a shelf. In how many ways we can select atleast one of them?
Solution : We may select 1 book, 2 books,........, 12 books.
  The number of ways = 12C1 + 12C2 + ....... + 12C12 = 212 – 1. = 4095
Example # 19 : There are 11 fruits in a basket of which 6 are apples, 3 mangoes and 2 bananas (fruits of same
species are identical). How many ways are there to select atleast one fruit?
Solution : Let x be the number of apples being selected
y be the number of mangoes being selected and
z be the number of bananas being selected.
Then x = 0, 1, 2, 3, 4, 5,6
y = 0, 1, 2, 3
z = 0, 1, 2
Total number of triplets (x, y, z) is 7 × 4 × 3 = 84
Exclude (0, 0, 0)
 Number of combinations = 84 – 1 = 83.
ADVPC - 6
Self Practice Problems

(22) In a shelf there are 6 physics, 4 chemistry and 3 mathematics books. How many combinations
are there if (i) books of same subject are different? (ii) books of same subject are identical?
(23) From 5 apples, 4 mangoes & 3 bananas, in how many ways we can select atleast two fruits of
each variety if (i) fruits of same species are identical? (ii) fruits of same species are different?
Ans. (22) (i) 8191 (ii) 139 (23) (i) 24 (ii) 212 – 4
Results : Let N = p q r ..... where p, q, r...... are distinct primes & a, b, c..... are natural numbers then:
a. b. c.
(a) The total numbers of divisors of N including 1 & N is = (a + 1) (b + 1) (c + 1)........

(b) The sum of these divisors is =
(p0 + p1 + p2 +.... + pa) (q0 + q1 + q2 +.... + qb) (r0 + r1 + r2 +.... + rc)........
(c) Number of ways in which N can be resolved as a product of two factors is

 (a  1) (b  1) (c 1) ....
1
if N is not a perfect square
=  12
 2 (a  1) (b  1) (c 1) ....  1  if N is a perfect square

(d) Number of ways in which a composite number N can be resolved into two factors which are
relatively prime (or coprime) to each other is equal to 2 n1 where n is the number of
different prime factors in N.
Example # 20 : Find the number of divisors of 1350. Also find the sum of all divisors.
Solution : 1350 = 2 × 33 × 52
 Number of divisors = (1+ 1) (3 + 1) (2 + 1) = 24
sum of divisors = (1 + 2) (1 + 3 + 32 + 33) (1 + 5 + 52) = 3720.
Example # 21 : In how many ways 8100 can be resolved into product of two factors?
Solution : 8100 = 22 × 34 × 52
1
Number of ways = [(2 + 1) (4 + 1) (2 + 1) + 1] = 23
2
(24) How many divisors of 9000 are even but not divisible by 4? Also find the sum of all such
divisors.
(25) In how many ways the number 8100 can be written as product of two coprime factors?
Ans. (24) 12, 4056 (25) 4
Negative binomial expansion :

(1 – x)– n = 1 + nC1x + n + 1C2 x2 + n + 2C3x3 + ........ to  , if – 1 < x < 1.
Coefficient of xr in this expansion = n+r1

Cr (n  N)
Result : Number of ways in which it is possible to make a selection from m + n + p = N things, where p are
alike of one kind, m alike of second kind & n alike of third kind, taken r at a time is given by coefficient
of xr in the expansion of
(1 + x + x2 +...... + xp) (1 + x + x2 +...... + xm) (1 + x + x2 +...... + xn).
For example the number of ways in which a selection of four letters can be made from the letters of the
word PROPORTION is given by coefficient of x4 in
(1 + x + x2 + x3) (1 + x + x2) (1 + x + x2) (1 + x) (1 + x) (1 + x).
Method of fictious partition :

Number of ways in which n identical things may be distributed among p persons if each person may
receive none, one or more things is n+p1Cn.
Example # 22 : Find the number of solutions of the equation x + y + z = 6, where x, y, z  W.

Solution : Number of solutions = coefficient of x6 in (1 + x + x2 + ....... x6)3
ADVPC - 7
= coefficient of x6 in (1 – x7)3 (1 – x)–3

= coefficient of x6 in (1 – x)–3
= 3+6–1C6 = 8C2 = 28.
Example # 23 : In a bakery four types of biscuits are available. In how many ways a person can buy 10
biscuits if he decide to take atleast one biscuit of each variety?
Solution : Let the person select x biscuits from first variety, y from the second, z from the third and w
from the fourth variety. Then the number of ways = number of solutions of the equation
x + y + z + w = 10.
where x = 1, 2, .........,7
y = 1, 2, .........,7
z = 1, 2, .........,7
w = 1, 2, .........,7
So, number of ways = coefficient of x10 in (x + x2 + ...... + x7)4
= coefficient of x6 in (1 + x + ....... + x6)4
= coefficient of x6 in (1 – x7)4 (1 – x)–4
= coefficient x6 in (1 – x)–4
= 4+6–1C6 = 9C3 = 84
Self Practice Problems:

(26) Three distinguishable dice are rolled. In how many ways we can get a total 15?
(27) In how many ways we can give 5 apples, 4 mangoes and 3 oranges (fruits of same species are
similar) to three persons if each may receive none, one or more?
Ans. (26) 10 (27) 3150
Derrangements :
Number of ways in which 'n' letters can be put in 'n' corresponding envelopes such that no letter goes to
 1 1 1 1 1 
correct envelope is n !  1      ..........  (1)n 
 1 ! 2 ! 3 ! 4 ! n !
Example # 24 : In how many ways we can put 5 writings into 5 corresponding envelopes so that no writing go
to the corresponding envelope?
Solution : The problem is the number of dearragements of 5 digits.
 1 1 1 1 
This is equal to 5!      = 44.
2 ! 3 ! 4 ! 5 !
Example # 25 : Four slip of papers with the numbers 1, 2, 3, 4 written on them are put in a box. They are drawn
one by one (without replacement) at random. In how many ways it can happen that the ordinal
number of atleast one slip coincide with its own number?
Solution : Total number of ways = 4 ! = 24.
The number of ways in which ordinal number of any slip does not coincide with its own number
 1 1 1 
is the number of dearrangements of 4 objects = 4 !    =9
2 ! 3 ! 4 !
Thus the required number of ways. = 24 – 9 = 15

(28) In a match the column question, Column  contain 10 questions and Column II contain 10
answers written in some arbitrary order. In how many ways a student can answer this question
so that exactly 6 of his matching are correct ?
(29) In how many ways we can put 5 letters into 5 corresponding envelopes so that atleast one
letter go to wrong envelope ?
Ans. (28) 1890 (29) 119
ADVPC - 8
Exponent of prime p in n! :
Let p be a prime number, n be a positive integer and Let Ep(n) denote the exponent of the prime p in the
positive integer n. Then,
n   n   n  n
Ep (n!)      2    3   ......   s 
p  p  p  p 
where s is the largest positive integer such that ps  n < ps+1
Example # 26 : Find exponent 2 and 3 in 100!
 100   100   100   100 

Solution : Exponent of 2 in 100! is represented by E2 (100!)      2    3   ......   6 
 2   2   2   2 
= 50 + 25 + 12 + 6 + 3 + 1 = 97
 100   100   100   100 

Exponent of 3 in 100! is represented by E3 (100!)    2  3  4 
 3   3   3  3 
= 33 +11 + 3 + 1 = 48
Example # 27 : If 100! is divided by (24)k (where k  n), then find maximum value of k.
 100   100   100   100 

Solution : Exponent of 2 in 100! is represented by E2 (100!)      22    23   ......   26 
 2       
= 50 + 25 + 12 + 6 + 3 + 1 = 97
 Exponent of 23 in 100! is 32.
 100   100   100   100 

Exponent of 3 in 100! is represented by E3 (100!)    2  3  4 
 3   3   3  3 
= 33 +11 + 3 + 1 = 48
 Exponent of (23 × 3) in 100! is min{48, 32} = 32
 Exponent of (24) in 100! is = 32

(30) Find the number of zeros at the end of 50C .
25
(31) Find the last non zero digits of 25!.
Ans (30) 0 (31) 4
ADVPC - 9
Øep; ,oa la p ;
There can never be surprises in logic...Wittgenstein, Ludwig
xf.kr dk izeq[k vk/kkjHkwr vuqiz;ksx x.kuk gSA lkekU;r% x.kuk ds fy, dbZ fof/k;k¡ mi;ksx gksrh gSA
;g v/;k; mu fofHkUu ifjfpr fof/k;ksa dk mi;ksx djrk gS tks lkekU; x.ku fof/k;ksa ls vf/kd rst gSA
ge eq[;r% gekjh x.kuk dh fof/k;ksa dks foU;klksa ds izdkj ¼Øep;½ rFkk p;uksa ds izdkj ¼lap;½ ij dsfUnzr djrs gSaA
;|fi ge x.kuk dh bu fof/k;ksa dks dqN vU; fLFkfr;ksa esa Hkh mi;ksx dj ldrs gSA
vc ge ,d lk/kkj.k mnkgj.k ls 'kq: djrs gSa&
,d lewg G1 esa rhu o`Ùk C1, C2, C3 ftuds dsUnz fHkUu&fHkUu gS bl izdkj gS fd C2 iw.kZr% C1 ds vUnj fLFkr gS
C3 iw.kZr% C2 ds vUnj fLFkr gSaA 4 o`Ùkksa C1, C2, C3, C4 dk ,d vU; lewg G2 Hkh blh izdkj O;ofLFkr gSA o`Ùkksa
ds ;s nksauks lewg bl izdkj gS fd G1 dk izR;sd lnL; G2 ds izR;sd lnL; dks izfrPNsn djrk gS] tSlk fd
fuEufyf[kr fp=k esa n'kkZ;k x;k gSA
(i) o`Ùkksa ds dqy dsUnz fdrus gkasxs \

(ii) dqy fdruh mHk;fu"B thok,¡ izkIr gkasxhA
igys Hkkx dk gy "3 + 4 = 7" vkSj nwljs Hkkx dk gy "3 × 4 = 12" A igys Hkkx dk gy Kkr djus esa ge ftl
fof/k dk mi;ksx djrs gaS mls ";ksx dk fl}kUr" vkSj nwljs Hkkx esa ge ftl fof/k dk mi;ksx djrs gSa mls "xq.ku dk
fl}kUr" dgrs gSaA ;s fl}kUr x.kuk esa izeq[k vko';d lk/ku gS] tks fd "x.kuk ds vk/kkjHkwr fl}kUr" ls tkus tkrs gaSA
x.kuk ds vk/kkjHkwr fl)kUr (Fundamental counting principle) :

ekuk fd ,d lafØ;k O1, m fofHkUu rjhdks ls dh tk ldrh gS vkSj vU; lafØ;k O2 , n fofHkUu rjhdks ls dh tk
ldrh gS] rc
(i) ;ksx dk fl}kUr (Addition rule) : lafØ;k O1, O2 esa ls Bhd ,d dks ge m + n rjhdks ls dj ldrs gSA
(ii) xq.ku dk fl}kUr (Multiplication rule) : lafØ;k O1, O2 nksuksa dks ,d lkFk ge mn rjhdks ls dj ldrs gSaA
uksV : ;ksx fl}kUr dsoy rHkh lR; gS tcfd O1 vkSj O2 ijLij viothZ gS] rFkk xq.ku fl}kUr dsoy rHkh lR; gS tc O1
vkSj O2 Lora=k gSA (ge ijLij viothZ vkSj Lora=k ds ckjs esa vkxs i<+saxs )
mnkgj.k # 1 : ekuk fd dksVk ls t;iqj ds fy, 8 clsa rFkk t;iqj ls fnYyh ds fy, 10 clsa pyrh gS] rc ,d O;fDr cl
}kjk dksVk ls fnYyh ok;k t;iqj fdrus izdkj ls tk ldrk gSaA
gy : izFke ?kVuk E1 ¼dksVk ls t;iqj tkuk½ ds ?kfVr gksus ds izdkj = 8
f}rh; ?kVuk E2 ¼t;iqj ls fnYyh tkuk½ ds ?kfVr gksus ds izdkj = 10
pawfd nksuksa ?kVukvksa E1 o E2 Øe ls gksxh vr% dksVk ls fnYyh ok;k t;iqj tkus dh dqy fof/k;k¡
= 8 × 10 = 80.
mnkgj.k # 2 : vadks 1,2,3,4,5 dh lgk;rk ls 10 rFkk 10,000 ds e/; fdruh la[;k,¡ cukbZ tk ldrh gS tcfd
(i) fdlh Hkh la[;k esa vadks dh iqujko`fÙk ugha gksA (ii) vadks dh iqujko`fÙk gks ldrh gSaA
gy : (i) nks vadks okyh la[;k,¡ = 5 × 4 = 20
ADVPC - 1
Øep; ,oa la p ;
rhu vadks okyh la[;k,¡ = 5 × 4 × 3 = 60

pkj vadks okyh la[;k,¡ = 5 × 4 × 3 × 2 = 120
dqy la[;k,¡ = 20 + 60 + 120 = 200
(ii) nks vadks okyh la[;k,¡ = 5 × 5 = 25
rhu vadks okyh la[;k,¡ = 5 × 5 × 5 = 125
pkj vadks okyh la[;k,¡ = 5 × 5 × 5 × 5 = 625
dqy la[;k,¡ = 775
vH;kl dk;Z :
(1) vadks dh iqujko`fÙk fd;s fcuk pkj vadks okyh fdruh la[;k,¡ cuk;h tk ldrh gSa] tks 5 ls foHkkftr gksrh gSa\
(2) 6 fHkUu >.Mks esa ls de ls de rhu >.Ms ysdj ,d nwljs ds Åij j[k fdrus fHkUu ladsr cuk;s tk ldrs gSa\
Ans. (1) 952 (2) 1920
Øep;ksa dh la[;k (Arrangement) :
;fn nPr ] n fofHkUu oLrqvksa esa ls ,d lkFk r oLrqvksa p;u ds Øep;ksa dh la[;k gS rks
n!
n
Pr = n (n  1) (n  2)..... (n  r + 1) =
(n  r)!
funsZ'k: (i) n!, n ds _.kkRed iw.kk±d ekuksa ds fy, ifjHkkf"kr ugha gksrk gSA
(ii) 0 ! = 1 ! = 1 ;
(iii) nPn = n ! = n. (n  1) !
(iv) (2n) ! = 2n. n ! [1. 3. 5. 7... (2n  1)]
mnkgj.k # 3 : vadks dh iqujko`fÙk fd;s fcuk] vadks 1, 2, 3, 4, 5 dh lgk;rk ls rhu vadks okyh fdruh la[;k,¡ cuk;h tk
ldrh gSa vkSj buesa ls fdruh la[;k,¡ le gSa ?
gy : rhu LFkkuksa dks 5 fHkUu oLrqvksa ls Hkjuk gS
vr% dqy rjhdks dh la[;k = 5P3 = 5 × 4 × 3 = 60
f}rh; Hkkx % le la[;k gsrq bdkbZ ds LFkku ij ;k rks 2 vk;sxk ;k 4 rFkk cps gq, nks LFkku 4P2 rjhdks
ls Hkjs tk;sxsaA
  le la[;kvksa dh dqy la[;k = 2 × 4P2 = 24.
mnkgj.k # 4 : ;fn 'kCn 'QUEST' ds v{kjksa dks lHkh lEHko rjhdksa ls O;ofLFkr djus ij cuus okys 'kCnksa dks 'kCn dks"k
(dictionary) ds Øekuqlkj tek;s] rks fn;k x;k 'kCn dkSuls LFkku ij vk;sxk\
gy : 'kCnksa dh la[;k tks E ls izkjEHk gksrs gS = 4P4 = 24
'kCnks dh la[;k tks QE ls izkjEHk gksrs gS = 3P3 = 6
'kCnksa dh la[;k tks QS ls izkjEHk gksrs gSa = 6
'kCnksa dh la[;k tks QT ls izkjEHk gksrs gS = 6.
blds ckn 'kCn 'QUEST' gksxkA
vr% QUEST dk LFkku = 24 + 6 + 6 + 6 + 1 = 43.
vH;kl dk;Z :
(3) vadks 1, 2, 3, 4, 5 dh lgk;rk ls cuus okyh lHkh pkj vadks dh la[;kvksa dk ;ksx Kkr djks tcfd vadksa
dh iqujkZo`fÙk laHko ugha gksA
(4) ;fn n – 1P3 : nP4 = 1 : 9 rks 'n' dk eku Kkr dhft,A
(5) N% ?kksM+s ,d jsl esa fgLlk ysrs gSaA ;s ?kksM+s fdrus rjhdksa ls izFke] f}rh; vkSj r`rh; LFkku ij vk ldrs
gSa] ;fn ,d fo'ks"k ?kksM+k bu rhu fotsrkvksa esa 'kkfey gS \ (leku LFkku izkIr djus dh dksbZ
lEHkkouk ugha gSa)
(6) vadksa 0, 1, 2, 3, 4 dh lgk;rk ls cuus okyh lHkh rhu vadksa dh la[;kvksa dk ;ksxQy Kkr djks\
Ans. (3) 399960 (4) 9 (5) 60 (6) 27200
ADVPC - 2
Øep; ,oa la p ;
ifj.kke : ekuk fd 'n' izdkj dh oLrq,sa gS ftuesa ls izR;sd izdkj dh de ls de r oLrq,¡ gS rc r oLrqvksa dks ,d
iafDr esa O;ofLFkr djus ds rjhds = nr.
mnkgj.k # 5 : vadks 0, 1, 2, 3, 4, 5 dk mi;ksx djds rhu vadks okyh fdruh la[;k,¡ cuk;h tk ldrh gS \ buesa ls ,slh
fdruh la[;k,¡ gS ftuesa de ls de ,d vad dh iqujko`fÙk gksrh gSa ?
gy : gesa 6 vadks dks 3 LFkkuksa ij Hkjuk gS tcfd iqujko`fÙk lEHko gS vkSj 0 dHkh Hkh igys LFkku ij ugha vk;sxkA
dqy rjhdksa dh la[;k = 180.
mu la[;kvksa dh la[;k ftuesa ,d Hkh vad dh iqujko`fÙk u gks = 100
  mu la[;kvksa dh la[;k ftuesa de ls de ,d vad dh iqujko`fÙk gksrh gSa = 180 – 100 = 80
mnkgj.k # 6 : leqPp; A {5 vo;o} ls leqPp; B {3 vo;o} esa dqy fdrus Qyu ifjHkkf"kr gksrs gSa\ buesa ls fdrus
vkPNknd Qyu gSa?
gy : A ds izR;sd vo;o ds rhu izfrfcEc gks ldrs gSa
vr% A ls B esa ifjHkkf"kr Qyuksa dh la[;k = 35 = 243.
A ls B esa vUr{ksZih (into) Qyuksa dh la[;k = 25 + 25 + 25 – 3 = 93.
vr% vkPNknd Qyuksa dh la[;k = 243 – 93 = 150.
vH;kl dk;Z :
(7) leqPp; A {4 vo;o} ls leqPp; B {5 vo;o} esa dqy fdrus Qyu ifjHkkf"kr gksrs gSa ? buesa ls fdrus
,dSdh Qyu gSa\
(8) 5 O;fDr fdrus rjhdks ls ,d flusek x`g (auditorium), ftlesa 4 izos'k }kj gS] esa izos'k dj ldrs gSa\
Ans. (7) 625, 120 (8) 1024.
p;u (Combination) :
;fn n fofHkUu oLrqvksa esa ls r oLrqvksa dks ,d lkFk ysdj cuk, x;s lap;ksa dh la[;k nCr gS] rc
n
n! Pr
n
Cr = = tcfd r  n ; n  N vkSj r  W.
r! (n  r)! r!
uksV: (i) nCr = nCn – r
(ii) nCr + nCr – 1 = n + 1Cr
(iii) nCr = 0 if r  {0, 1, 2, 3........, n}
mnkgj.k # 7 : ,d fØdsV Vhe ds fy, 15 f[kykfM+;ksa dk p;u fd;k x;k gSa :
(i) fdrus rjhdks ls 11 f[kykfM+;ksa dks pquk tk ldrk gS\
(ii) ,d fo'ks"k f[kykM+h dks ges'kk ysrs gq, fdrus rjhdksa ls 11 f[kykfM+;ksa dks pquk tk ldrk gSa\
(iii) nks fo'ks"k f[kykfM+;ksa dks dHkh Hkh u ysrs gq,s fdrus rjhdksa ls 11 f[kykfM+;ksa dks pquk tk ldrk gSa\
gy : (i) 15 f[kykfM+;ksa esa ls 11 f[kykfM+;ksa dks pquus ds rjhds = 15C11 = 1365.
(ii) pwafd ,d f[kykM+h igys ls gh ys fy;k x;k gS vr% 'ks"k 14 esa ls 10 dks
pquus ds rjhds = 14C10 = 1001.
(iii) pwafd nks f[kykfM+;ksa dks dHkh Hkh ugha ysuk gS vr% 13 esa ls 11 f[kykfM+;ksa dks
pquus ds rjhds = 13C11 = 78.
mnkgj.k # 8 : ;fn 49C3r – 2 = 49C2r + 1 gks] rks 'r' dk eku Kkr djksA
gy : n
Cr = nCs ;fn r = s ;k r + s = n.
vr% 3r – 2 = 2r + 1  r=3
;k 3r – 2 + 2r + 1 = 49  5r – 1 = 49  r = 10
  r = 3, 10
mnkgj.k # 9 : 20 Hkqtkvksa okys ,d lecgqHkqt ds 'kh"kks± dks ysdj fdrus f=kHkqt cuk;s tk ldrs gSa tcfd Hkqtkvksa dk
mi;ksx u gks \
ADVPC - 3
Øep; ,oa la p ;
gy : igyk 'kh"kZ 20 rjhdks ls pquk tk ldrk gSaA cps gq, 2 'kh"kksZ dks 17 'kh"kksZ esa ls bl izdkj pquk gS fd nks
Øekxr 'kh"kZ u vk;sA ;g 17C2 – 16 rjhdks ls fd;k tk ldrk gSaA
  dqy rjhds = 20 × (17C2 – 16)
ijUrq blesa izR;sd 'kh"kZ dk p;u 3 ckj vkrk gS vr%
20  (17 C2  16)
f=kHkqtksa dh la[;k = = 800.
3
mnkgj.k # 10: 15 O;fDr ,d iafDr esa cSBs gSaA buesa ls rhu O;fDr;ksa dks fdrus izdkj ls pquk tk ldrk gS tcfd dksbZ
Hkh nks Øekxr O;fDr ugha pqus tk;s\
gy : ekuk O;fDr fuEu Øe P1, P2, P3, P4, P5, P6, P7, P8, P9, P10 ,P11 , P12 , P13 ,P14 ,P15 esa cSBs gSA ;fn buesa
ls 3 dk p;u djs ¼Øekxr ugh½ rks 12 O;fDr 'ks"k cpsxsaA
ekuk fd P,P,P,P,P,P,P,P,P,P,P,P cp tkrs gSa rFkk q, q, q dks pqu ysrs gSa] bu 3 q dks ftruh izdkj ls
P ds e/; 13 LFkkuksa ¼fljksa lfgr½ ij O;ofLFkr fd;k tkrk gS ] mrus gh rjhds okfUNr p;u ds
gksxsaA
vr% p;u ds dqy rjhds = 13C3 = 286.
mnkgj.k # 11 : MSSSSPP 'kCn ds v{kjksa esa ls pkj v{kjksa dks fdruh izdkj ls pquk tk ldrk gSa ?
gy : M
 
SSSS
PP
4 leku v{kjksa ds p;u ds rjhds = 2C1 = 2.
3 leku rFkk 1 fHkUu v{kj ds p;u ds rjhds = 2C1 × 3C1 = 6
2 leku] 2 leku v{kjksa ds p;u ds rjhds = 3C2 = 3
2 leku] 2 fHkUu v{kjksa ds p;u ds rjhds = 3C1 × 3C2 = 9
4 fHkUu v{kjksa ds p;u ds rjhds = 4C4 = 1
dqy rjhds = 2 + 6 + 3 + 9 + 1 = 21
vH;kl dk;Z :
(9) 5 Hkkjrh;ksa] 4 fczfV'k rFkk 2 phuh O;fDr;ksa esa ls 7 O;fDr;ksa dks fdrus izdkj ls pquk tk ldrk gS tcfd
gj ns'k ds de ls de nks O;fDr t:j pqus tk;ss \
(10) vad 1, 2, 3 dks ysdj 7 vadksa dh fdruh fofHkUu la[;k,sa cuk;h tk ldrh gS tcfd izR;sd la[;k esa vad 2
Bhd nks ckj gks \
(11) 6 yM+dksa rFkk 6 yM+fd;k¡ dks ,d xksy est ds pkjksa rjQ fdrus izdkj ls cSBk;k tk ldrk gS tcfd yM+ds
rFkk yM+fd;k¡ ,dkUrj Øe esa cSBs\
(12) ,d iafDr esa fLFkr 10 lhVksa ij 4 O;fDr fdrus rjhdksa ls cSB ldrs gSa tcfd dksbZ Hkh nks O;fDr vklUu
(adjacent ) lhVksa ij ugha cSBrs gSa\
(13) PROPORTION 'kCn ds v{kjksa esa ls 3 v{kjksa dks fdruh izdkj ls pquk tk ldrk gSa\
Ans. (9) 100 (10) 672 (11) 86400 (12) 840 (13) 36
n oLrqvksa ds foU;kl tks fd lHkh fHkUu ugha gS
(Arrangement of n things, those are not all different) :
;fn dqy 'n' oLrq,¡ esa ls 'p' oLrq,¡ ,d izdkj dh] 'q' oLrq,¡ nwljs izdkj dh] 'r' rhljs izdkj dh leku oLrq,¡ gSa rFkk
'ks"k
n  (p + q + r) oLrq,¡ fHkUu&fHkUu gks] rks lHkh n oLrqvksa dks ,d lkFk ysdj cuk;s x;s dqy Øep;ksa
n!
dh la[;k = .
p! q! r!
mnkgj.k # 12 : 3 yky] 4 ihys rFkk 5 lQsn Qwyksa dks ,d iafDr esa fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS ? lQsn
Qwyksa dks vyx&vyx j[krs gq, bu Qqyksa dks dqy fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS\
(,d jax ds Qwyksa dks leku ekuk x;k gSa)
ADVPC - 4
Øep; ,oa la p ;
gy : dqy 12 Qwyksa esa ls 3 yky] 4 ihys rFkk 5 lQsn gSA

12!
O;ofLFkr djus ds dqy rjhds = = 27720.
3! 4! 5!
f}rh; Hkkx% igys 3 yky rFkk 4 ihys Qwyksa dks O;ofLFkr djrs gS ftUgsa O;ofLFkr djus ds rjhds
7!
= = 35
3! 4!
dqy 8 LFkkuksa esa ¼fljksa lfgr½ 5 dk p;u dj] muesa lQsn Qwyksa dks j[kus ds dqy rjhds = 8C5 = 56.
vr% dqy rjhds = 35 × 56 = 1960.
mnkgj.k # 13 : "ARRANGE" 'kCn ds v{kjksa dks dqy fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS tcfd Loj rFkk O;atuksa
dk LFkkukUrj.k mUgh ds LFkkuksa ij vkil esa fd;k tk,\
4!
gy : O;atuks dks muds LFkkukas ij ijLij O;ofLFkr djus ds rjhds = = 12
2!
3!
Lojks dks muds LFkkukssa ij ijLij O;ofLFkr djus ds rjhds = =3
2!
  O;ofLFkr djus ds dqy rjhds = 12 × 3 = 26
vH;kl dk;Z :
(14) 'ASSESSMENT' 'kCn ds v{kjksa ls dqy fdrus 'kCn cuk;s tk ldrs gS tcfd izR;sd 'kCn A ls izkjEHk gks
rFkkT ls [kRe gks\
(15) ;fn 'kCn ARRANGE ds v{kjksa dks lHkh lEHko rjhdksa ls O;ofLFkr fd;k tk;s rc ,sls fdrus 'kCn lEHko
gS ftuesa uk rks nksukas A lkFk vk;s uk gh nksuksa R lkFk vk;s\
(16) MISSISSIPPI 'kCn v{kjksa esa ls 4 v{kjksa dks ysdj fdrus 'kCn cuk;s tk ldrs gSa\
Ans. (14) 840 (15) 660 (16) 176.
lewgksa dk fuekZ.k (Formation of Groups) :

(m + n + p) fHkUu oLrqvksa dks rhu fHkUu lewgksa ftuesa izR;sd esa Øe'k% m, n ,oa p oLrq,¡ gSa] esa foHkkftr djus ds
m  n  p !
rjhds = ,
m! n! p!
(3n)!
;fn m = n = p gks rFkk izR;sd lewg esa oLrqvksa dks leku ekuk tk;s] rks lewgks dh la[;k = .
n! n! n! 3!
(3n)!
uksV : ;fn 3n oLrqvksa dks 3 O;fDr;ksa esa leku izdkj ls ckaVk tk;s rks ck¡Vus ds rjhds = .
n!3
mnkgj.k # 14 : 12 fHkUu f[kykSuksa dks 3 cPPkks esa leku :i ls ckaVk tkrk gS] rks ;g dk;Z dqy fdrus rjhdksa ls fd;k tk
ldrk gSa ?
gy : ;g 12 fHkUu oLrqvksa dks rhu fHkUu lewgksa esa ck¡Vus okyh leL;k gSA
12!
vr% rjhdks dh la[;k = = 34650.
4! 4! 4!
mnkgj.k # 15 : 10 O;fDr;ksa dks 5 tksM+ks esa fdrus fofHkUu rjhdksa ls foHkkftr fd;k tk ldrk gS tk ldrk gSa ?
gy : gekjs ikl izR;sd lewg esa 2 O;fDr gS vkSj mudh lewg fo'ks"krk leku gS (pw¡fd izR;sd lewg dks funsZf'kr
;k uke nsus dh vko';drk ugha gSA)
10!
vr% rjhdksa dh la[;k = = 945.
(2!)5 5!
vH;kl dk;Z :
ADVPC - 5
Øep; ,oa la p ;
(17) /kjkry ls 9 O;fDr ,d lkFk ,d fy¶V esa cSBrs gS] tks 10 eaftyksa ¼/kjkry dks NksM+dj½ ij :drh gSaA ;fn
;g Kkr gS fd O;fDr 2, 3 rFkk 4 ds lewgksa esa fHkUu&fHkUu eaftyksa ij mrjrs gS] rks ;g dqy fdrus
rjhdksa ls lEHko gSa \
(18) rk'k ds 52 iÙkksa dks pkj leku <sjks (equal heaps) esa fdrus izdkj ls foHkkftr fd;k tk ldrk gSa ?
(19) 11 fofHkUu fdrkcksa dks pkj iSdVksa esa fdrus izdkj ls iklZy fd;k tk ldrk gS tcfd rhu iSdsVksa esa
rhu&rhu fdrkcsa vk;s rFkk ,d iSdsV esa nks fdrkcsa vk;s] ;fn lHkh iSdsVkas dk xUrO; ,d gSa \
52! 11!
Ans. (17) 907200 (18) 4
(19)
(13!) 4! (3!)4 2
o`Ùkh; ;k pØh; Øep; (Circular Permutation) :

n fofHkUu oLrqvksa dks ,d lkFk ysdj cuus okys o`Ùkh; Øep;ksa dh la[;k (n  1) ! gksrh gSA
(n  1)!
;fn nf{k.kkorZ rFkk okekorZ Øep;ksa dks ,d le>k tk;s rks Øep;ksa dh la[;k gksrh gSaA
2
uksV: ;fn n fofHkUu oLrqvksa esa ls p ,d leku gks rFkk 'ks"k fHkUu gks rc lHkh dks ,d lkFk ysdj (nf{k.kkorZ rFkk okekorZ
(n  1) !
Øep;ksa dks fHkUu ekurs gq,½ cuus okys Øep;ksa dh la[;k gksrh gSasA
p!
mnkgj.k # 16 : 6 fofHkUu Qwyksa dks ,d o`Ùk esa fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS ? bu Qwyksa ls ,d ekyk
fdrus izdkj ls cuk;h tk ldrh gS ?
1
gy : 6 fofHkUu Qwyksa ds o`Ùkh; Øep;ksa dh la[;k = (6 – 1)! = 120
2
tc ge ekyk cukrs gSa] rks nf{k.kkorZ rFkk okekorZ O;oLFkk leku gksrh gSA
vr% ekyk cukus ds rjhdksa dh la[;k = (6 – 1) ! = 60.
mnkgj.k # 17 : ,d xksy est ds pkjksa vksj 6 O;fDr fdrus izdkj ls cSB ldrs gS] ;fn muesa ls nks fof'k"V O;fDr ,d lkFk
cSBrs gks \
gy : ekuk fd P1, P2, P3, P4, P5, P6 N% O;fDr gS ftuesa ls P1, P2 lkFk cSBuk pkgrs gSA vr% bUgsa ,d ekudj
5 oLrqvksa dks o`Ùk esa O;ofLFkr djus ds rjhds = (5 – 1)! = 24 ijUrq P1, P2 dks iqu% 2! rjhdksa ls
O;ofLFkr fd;k tk ldrk gS vr% dqy rjhds = 24 × 2 = 48.
vH;kl dk;Z :
(20) 'kCn 'MONDAY' ds v{kjksa dks o`Ùk ds pkjksa rjQ fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS] ;fn lHkh
Loj vyx&vyx vk;s\
(21) 3 fHkUu yky Qwyksa] 5 fHkUu ihys Qwyksa rFkk 4 fHkUu uhys Qwyksa dks ysdj ,d ekyk fdrus izdkj ls cuk;h tk
ldrh gS] tcfd leku jax ds Qwy ges'kk lkFk vk;sa \
Ans. (20) 72 (21) 17280
,d ;k vf/kd oLrqvksa dk p;u (Selection of one or more objects) :

(a) 'n' fHkUu oLrqvksa esa ls de ls de ,d oLrq ds p;u ds rjhds
= nC1 + nC2 + nC3 +...............+ nCn = 2n – 1
(b) oLrqvksa ds lewg ftlesa p ,d izdkj dh] q ,d izdkj dh rFkk r ,d izdkj dh leku oLrq,sa gSa] esa ls de
ls de ,d oLrq ds p;u ds rjhds
= (p + 1) (q + 1) (r + 1) – 1
(c) 'n' oLrqvksa ds ,d lewg ftlesa 'p' ,d izdkj dh] 'q' ,d izdkj dh] r ,d izdkj dh leku oLrq,¡ gSa rFkk
'ks"k
n – (p + q + r) fHkUu gSa] esa ls de ls de ,d oLrq ds p;u ds rjhds
¾ (p + 1) (q + 1) (r + 1) 2n – (p + q + r) – 1
ADVPC - 6
Øep; ,oa la p ;
mnkgj.k # 18 : ,d vyekjh esa 12 fHkUu fdrkcsa j[kh gS] rks muesa ls de ls de ,d fdrkc dks fdrus izdkj ls pquk tk
ldrk gSa\
gy : ge fdrkcksa dk p;u fuEu izdkj djsxsa ( 1 fdrkc, 2 fdrkc,........, 12 fdrkc
  dqy rjhds = 12C1 + 12C2 + ....... + 12C12 = 212 – 1. = 4095
mnkgj.k # 19 : ,d Vksdjh esa 11 Qy gS ftuesa ls 6 lsc] 3 vke rFkk 2 dsys gSa ¼leku iztkfr ds Qy loZle gSa½ rks buesa
ls de ls de ,d Qy fdrus izdkj ls pquk tk ldrk gSa \
gy : ekuk x mu lscksa dh la[;k gS ftudk p;u gksrk gSaA
y mu vkeks dh la[;k gS ftudk p;u gksrk gSaA
z mu dsyks dh la[;k gSa ftudk p;u gksrk gSaA
rks x = 0, 1, 2, 3, 4, 5,6
y = 0, 1, 2, 3
z = 0, 1, 2
f=k;qXeksa (x, y, z) dh dqy la[;k = 7 × 4 × 3 = 84
(0, 0, 0) dks gVkus ij
  dqy p;u ds rjhds = 84 – 1 = 83.
vH;kl dk;Z :
(22) ,d vyekjh esa 6 HkkSfrd 'kkL=k, 4 jlk;u 'kkL=k rFkk 3 xf.kr dh fdrkcsa gS] rc ,sls fdrus lap; cuk;s tk
ldrs gS tcfd
(i) ,d fo"k; dh fdrkcsa vkil esa fHkUu gks \ (ii) ,d fo"k; dh lHkh fdrkcsa leku gks \
(23) 5 lscks] 4 vkeksa rFkk 3 dsyksa esa ls izR;sd izdkj ds de ls de 2 Qy fdrus izdkj ls pqus tk ldrs gSa
tcfd
(i) ,d izdkj ds lHkh Qy leku gks \ (ii) ,d izdkj ds lHkh Qy vkil esa fHkUu gks\
Ans. (22) (i) 8191 (ii) 139 (23) (i) 24 (ii) 212 – 4
ifj.kke : ekuk fd N = pa. qb. rc...... tgk¡ p, q, r...... ijLij fHkUu o vHkkT; la[;k,¡ gaS rFkk a, b, c..... izkd`r
la[;k,a gS] rks:
(a) N ds dqy Hkktdksa dh la[;k (1 o N dks lfEefyr djrs gq,) = (a + 1) (b + 1) (c + 1)........
(b) bu Hkktdksa dk ;ksx = (p0 + p1 + p2 +.... + pa) (q0 + q1 + q2 +.... + qb) (r0 + r1 + r2 +.... + rc)........
(c) mu rjhdksa dh la[;k ftuds }kjk N dks nks xq.ku[k.Mksa esa ckaVk tk ldrk gSa

 (a  1) (b  1) (c 1) ....
1
;fn N ,d iw.kZ oxZ ugha gSa
=  21
 2 (a  1) (b  1) (c 1) .... 1  ;fn N ,d iw.kZ oxZ gS

(d) la;qDr la[;k N dks nks ijLij vHkkT; xq.ku[k.Mksa esa O;Dr djus ds rjhds 2n1 gksrs gS] tgk¡ n , N ds fHkUu
vHkkT; xq.ku[k.Mksa dh la[;k gSaA
mnkgj.k # 20 : 1350 ds Hkktdksa dh la[;k Kkr dhft, rFkk budk ;ksx Hkh Kkr dhft,A
gy : 1350 = 2 × 33 × 52
  Hkktdksa dh la[;k = (1+ 1) (3 + 1) (2 + 1) = 24
Hkktdksa dk ;ksx = (1 + 2) (1 + 3 + 32 + 33) (1 + 5 + 52) = 3720.
mnkgj.k # 21 : 8100 dks nks xq.ku[k.Mksa esa fdrus rjhdksa ls foHkDr fd;k tk ldrk gSa \
gy : 8100 = 22 × 34 × 52
1
rjhdksa dh la[;k = [(2 + 1) (4 + 1) (2 + 1) + 1] = 23
2
vH;kl dk;Z :
(24) 9000 ds ,sls fdrus le Hkktd gksxsa tks 4 ls foHkkftr ugha gksrs gSa\ ,sls lHkh Hkktdksa dk ;ksxQy Hkh Kkr
dhft,A
ADVPC - 7
Øep; ,oa la p ;
(25) la[;k 8100 dks nks ijLij vHkkT; xq.ku[k.Mksa ds :i esa fdrus rjhdksa ls ckaVk tk ldrk gSa \
Ans. (24) 12, 4056 (25) 4
_.kkRed f}in izlkj (Negative binomial expansion) :

(1 – x)– n = 1 + nC1x + n + 1C2 x2 + n + 2C3x3 + ........ to  , ;fn – 1 < x < 1.
bl izlkj esa xr dk xq.kkad = n+r1Cr (n  N)
ifj.kke : m + n + p = N oLrqvksa] ftuesa ls p ,d izdkj dh] m ,d izdkj dh rFkk n ,d izdkj leku oLrq,¡ gS] esa ls r
oLrqvksa ds p;u ds rjhds
O;atd (1 + x + x2 +...... + xp) (1 + x + x2 +...... + xm) (1 + x + x2 +...... + xn) ds izlkj esa xr ds xq.kkad ds cjkcj
gksxsaA
mnkgj.k% PROPORTION 'kCn ds v{kjksa esa ls pkj v{kjksa ds p;u ds rjhdks dh la[;k O;atd
(1 + x + x2 + x3) (1 + x + x2) (1 + x + x2) (1 + x) (1 + x) (1 + x) esa x4 ds xq.kkad ds cjkcj gksxhA
dkYifud foHkktu dh fof/k (Method of fictious partition) :

n ,d leku oLrqvksa dks p O;fDr;ksa esa ck¡Vus ds rjhds tcfd izR;sd O;fDr dks dksbZ oLrq u feys] ,d feys ;k ,d
ls T;knk feys] n+p1Cn gksrs gSa
mnkgj.k # 22 : lehdj.k x + y + z = 6 ds gyksa dh la[;k Kkr dhft, tcfd x, y, z  W.
gy : gyksa dh la[;k = (1 + x + x2 + ....... x6)3 esa x6 dk xq.kkad
= (1 – x7)3 (1 – x)–3 esa x6 dk xq.kkad
= (1 – x)–3 esa x6 dk xq.kkad = 3 + 6 –1C6 = 8C6 = 8C2 = 28.
mnkgj.k # 23 : ,d csdjh esa pkj izdkj ds fcLdqV miyC/k gSaA ,d O;fDr 10 fcLdqV fdrus izdkj ls [kjhn ldrk gS] ;fn
og ;g fu'p; djs dh izR;sd izdkj dk de ls de ,d fcLdqV vo'; ysuk gSa\
gy : ekuk fd O;fDr izFke izdkj ds x, f}rh; izdkj ds y ] r`rh; izdkj ds z rFkk prqFkZ izdkj ds w fcLdqVksa
dk p;u djrk gSA rks p;u ds rjhds = lehdj.k x + y + z + w = 10 ds gyks dh la[;k
tgk¡ x = 1, 2, .........,7
y = 1, 2, .........,7
z = 1, 2, .........,7
w = 1, 2, .........,7
vr% fcLdqV [kjhnus ds dqy rjhds = (x + x2 + ...... + x7)4 esa x10 dk xq.kkad
= (1 + x + ....... + x6)4 esa x6 dk xq.kkad
= (1 – x7)4 (1 – x)–4 esa x6 dk xq.kkad
= (1 – x)–4 esa x6 dk xq.kkad = 4 + 6 –1C6 = 9C3 = 84.
vH;kl dk;Z :
(26) rhu fHkUu iklksa (dice) dks ,d lkFk QSadus ij fdrus izdkj ls ;ksx 15 vk ldrk gSa\
(27) 5 lsc] 4 vke rFkk 3 lUrjks ¼leku iztkfr ds Qy leku gSa½ dks 3 O;fDr;ksa esa fdrus izdkj ls ckaVk tk
ldrk gS tcfd izR;sd O;fDr ,d Hkh Qy u feys] ,d Qy feys ;k ,d ls vf/kd Qy feys\
Ans. (26) 10 (27) 3150
iquZO;oLFkk (Dearrangement) :
'n' fHkUu i=kksa dks muds laxr 'n' fyQkQks esa Mkyus ds rjhds tcfd ,d Hkh i=k lgh fyQkQs esa u tk;s
 1 1 1 1 1
= n !  1     – ............  (1)n 
 1! 2! 3! 4! n! 
mnkgj.k # 24 : 5 i=kksa dks 5 laxr fyQkQks esa fdrus izdkj ls Mkyk tk ldrk gS tcfd dksbZ Hkh i=k lgh fyQkQs esa u
tk;s\
gy : ;gk¡ n = 5
ADVPC - 8
Øep; ,oa la p ;
dqy rjhds = 5!      = 44.

1 1 1 1

2! 3! 4! 5! 
mnkgj.k # 25 : pkj dkxt dh ifpZ;ksa ij 1, 2, 3, 4 fy[kdj ,d ckWDl esa Mky fn;k tkrk gSaA bUgsa ,d&,d djds
;kn`fPNd :i ls fcuk izfrLFkkfir fd;s fudkyk tkrk gSaA ,slk fdrus rjhdksa ls lEHko gks ldrk gSa fd de
ls de ,d iphZ dh Øe la[;k bl ij fy[kh la[;k ds cjkcj gks\
gy : dqy rjhds = 4 ! = 24.
fdlh Hkh iphZ dh Øe la[;k ds bl ij fy[kh la[;k ds cjkcj ugha gksus ds rjhds =
1 1 1
4 oLrqvksa dks iquZO;ofLFkr djds ds rjhds = 4 !     = 9
 2! 3! 4! 
vr% dqy okafNr rjhds = 24 – 9 = 15
vH;kl dk;Z :
(28) ,d LrEHk feyku iz'u esa izFke LrEHk esa 10 iz'u gS rFkk f}rh; LrEHk esa 10 mÙkj gS tks fdlh LosPN Øe
esa gSaA ,d fo|kFkhZ bl iz'uksa dks fdrus rjhdksa ls gy dj ldrk gSa] tcfd og Bhd 6 feyku lgh djs\
(29) 5 i=kksa dks muds laxr 5 fyQkQksa esa fdruh izdkj ls Mkyk tk ldrk gS tcfd de ls de ,d i=k xyr
fyQkQs esa tk;s \
Ans. (28) 1890 (29) 119
n! esa vHkkT; la[;k p dk ?kkarkd (Exponent of prime p in n!) :

ekuk p vHkkT; la[;k gS] n /kukRed iw.kkaZd gSA Ep(n) /kukRed iw.kk±d n esa vHkkT; p ds ?kkrkad dks O;Dr djrk gSA
n   n   n  n
Ep (n!)      2    3   ......   s 
p  p  p  p 
tgk¡ s, vf/kdre /kukRed iw.kk±d gS tcfd ps  n < ps+1

mnkgj.k # 26 : 100! es 2 vkSj 3 dk ?kkrkad fyf[k,A
 100   100   100   100 

gy : 100! esa 2 dk ?kkrkad E2 (100!)      22    23   ......   26 
 2       
= 50 + 25 + 12 + 6 + 3 + 1 = 97
 100   100   100   100 

100! esa 3 dk ?kkrkad E3 (100!)    2  3  4 
 3   3   3  3 
= 33 +11 + 3 + 1 = 48
mnkgj.k # 27 : ;fn 100! dks (24)k ls foHkkftr fd;k tkrk gS (tgka k  n), rc k dk vf/kdre eku gS&
 100   100   100   100 

gy : 100! esa 2 dk ?kkrkad E2 (100!)      2    3   ......   6 
 2   2   2   2 
= 50 + 25 + 12 + 6 + 3 + 1 = 97  100! es 23 dk ?kkrkad = 32
 100   100   100   100 

100! es 3 dk ?kkrkad E3 (100!)    2  3  4 
 3   3   3  3 
= 33 +11 + 3 + 1 = 48
ADVPC - 9
Øep; ,oa la p ;
 100! es (23 × 3) dk ?kkrkad] U;wure {48, 32} = 32
 100 esa (24) dk ?kkrkad = 32
vH;kl dk;Z :
(30) 50C
25 ds vUr esa 'kwU;ksa dh la[;k gS&
(31) 25! ds vfUre v'kwU; vad dks Kkr dhft,A
Ans (30) 0 (31) 4
10
Corporate Office: CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
ADVPC - 10
 Marked Questions may have for Revision Questions.

 fpfUgr iz'u nksgjkus ;ksX; iz'u gSA
PART - I : SUBJECTIVE QUESTIONS
Hkkx - I : fo"k;kRed iz'u ¼SUBJECTIVE QUESTIONS½
Section (A) : Fundamental principle of counting, problem based on selection of given

object & arrangement of given object.
[k.M (A) : x.kuk ds vk/kkjHkwr fl)kUr] nh xbZ oLrqvksa ds pquko] foU;kl ij vk/kkfjr leL;k,¡
A-1. There are nine students (5 boys & 4 girls) in the class. In how many ways
(i) One student (either girl or boy) can be selected to represent the class.
(ii) A team of two students (one girl & one boy) can be selected.
(iii) Two medals can be distributed. (no one get both)
(iv) One prize for Maths, two prizes for Physics and three prizes for Chemistry can be distributed.
(No student can get more than one prize in same subject & prizes are distinct)
,d d{kk esa ukS fo|kFkhZ gSA (5 yM+ds ,oa 4 yM+fd;k¡) fdrus rjhdksa ls
(i) ,d fo|kFkhZ (yM+dk ;k yM+dh) pquk tk ldrk gS tks d{kk dk izfrfuf/k gSA
(ii) nks fo|kFkhZ;ksa dk ,d ny (,d yM+dh vkSj ,d yM+dk) pquk tk ldrk gSA
(iii) nks iqjLdkj forjhr fd;s tkrs gSA ¼fdlh Hkh ,d dks nksuksa u feys½
(iv) xf.kr ds fy, ,d iqjLdkj] HkkSfrd ds fy, nks iqjLdkj vkSj jlk;u ds fy, rhu iqjLdkj fdrus izdkj ls
forjhr fd;s tkrs gSA (tcfd fdlh Hkh fo|kFkhZ dks ,d fo"k; esa ,d ls vf/kd iq:Ldkj ugha fey ldrk rFkk
iq:Ldkj fHkUu&fHkUu gS)
Ans. (i) 9 (ii) 20 (iii) 72 (iv) 326592
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 A vkSj B ds chp 10 cls lapkfyr gksrh gSaA ,d O;fDr LFkku A ls LFkku B ij tkdj okil LFkku A ij
fdrus rjhdksa ls vk ldrk gS ;fn og okilh esa nwljh cl dk mi;ksx djsaA
Ans. 90
A-3. There are 4 boys and 4 girls. In how many ways they can sit in a row
(i) there is no restriction. Ans. 40320
(ii) not all girls sit together. Ans. 37440
(iii) no two girls sit together. Ans. 2880
(iv) all boys sit together and all girls sit together . Ans. 1152
(v) boys and girls sit alternatively. Ans. 1152
pkj yM+ds ,oa pkj yM+fd;k¡ gSA os ,d iafDr esa fdrus rjhds ls cSB ldrs gS tcfd&
(i) dksbZ izfrcU/k u gks! Ans. 40320
(ii) lHkh yM+fd;k¡ lkFk u cSBsA Ans. 37440
(iii) dksbZ Hkh nks yM+fd;k¡ lkFk u cSBsA Ans. 2880
(iv) lHkh yM+ds lkFk&lkFk ,oa lHkh yM+fd;k¡ lkFk&lkFk cSBs gksA Ans. 1152
(v) yM+ds ,oa yM+fd;k¡ ,dkUrj Øe esa cSBs gksA Ans. 1152
A-4. Find the number of words those can be formed by using all letters of the word ‘DAUGHTER’. If
(i) Vowels occurs in first and last place. Ans. 4320
(ii) Start with letter G and end with letters H. Ans. 720
(iii) Letters G,H,T always occurs together. Ans. 4320
ADVPC - 1
(iv) No two letters of G,H,T are consecutive Ans. 14400

(v) No vowel occurs together Ans. 14400
(vi) Vowels always occupy even place. Ans. 2880
(vii) Order of vowels remains same. Ans. 6720
(viii) Relative order of vowels and consonants remains same. Ans. 720
(ix) Number of words are possible by selecting 2 vowels and 3 consonants. Ans. 3600
‘DAUGHTER’. ‘'kCn ds lHkh v{kjksa ls cuus okys 'kCnksa dh la[;k Kkr dhft, tcfd
(i) Loj izFke ,oa vfUre LFkku ij gksA Ans. 4320
(ii) G ls vkjEHk ,oa H ls vUr gksA Ans. 720
(iii) G,H,T lnSo lkFk&lkFk gks Ans. 4320
(iv) G,H,T esa ls dksbZ Hkh nks Øekxr u gksA Ans. 14400
(v) dksbZ Hkh Loj LkkFk&lkFk u gksA Ans. 14400
(vi) Loj le LFkkuksa ij vk;sA Ans. 2880
(vii) Lojksa dk Øe vifjofrZr gksA Ans. 6720
(viii) Lojksa ,oa O;atuksa dk lkis{k Øe leku gks Ans. 720
(ix) nks Loj ,oa rhu O;atuksa ls cuus okys 'kCnksa dh la[;k Ans. 3600
A-5. 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 find the ratio of m: n.(where m and n are coprime natural number)
'kCn "STRANGE" ds v{kjksa dks lHkh lEHko rjhdksa ls O;ofLFkr dj 'kCn cuk;s tkrs gSaA ekukfd 'm' mu 'kCnksa dh
la[;k gS ftuesa Loj ,d lkFk ugha vkrs gSa vkSj 'n' mu 'kCnksa dh la[;k gS ftuesa Loj ,d lkFk vkrs gS] rks vuqikr
m: n dk eku Kkr dhft,A (tgk¡ m vkSj n lg vHkkT; izkÑr la[;k gS)
Ans. 5: 2
A-6. 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?
,d iz'u i=k esa nks Hkkx gS Hkkx A vkSj Hkkx B rFkk izR;sd Hkkx esa 5 iz'u gSaA ,d Nk=k 6 iz'uksa ds mÙkj fdrus rjhdksa
ls ns ldrk gS ;fn mls izR;sd Hkkx esa ls de ls de nks iz'u vo'; p;u djus gSA
Ans. 200
A-7. How many 3 digit even numbers can be formed using the digits 1, 2, 3, 4, 5 (repetition allowed)?
vadks 1, 2, 3, 4, 5 dh lgk;rk ls 3 vadks dh fdruh le la[;k,¡ cukbZ tk ldrh gSa ;fn vadks dh iqujko`fÙk gks
ldrh gSA
Ans. 50
A-8. Find the number of 6 digit numbers that ends with 21 (eg. 537621), without repetition of digits.
vadks dh fcuk iqujko`fÙk ds 6 vadks dh fdruh la[;k,¡ cukbZ tk ldrh gS] tks 21 ls lekIr gksrh gS\ (mnkgj.k
537621)
Ans. 7. 7P3
A-9. 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 Øe ls j[kh tkrh gSaA lEHkkfor urhtksa dh la[;k fdruh gksxh \
Ans. 10
P4
A-10. Find the number of natural numbers from 1 to 1000 having none of their digits repeated.
1 ls 1000 rd ,slh izkd`r la[;kvksa dh la[;k Kkr dhft, ftuesa ,d Hkh vad dh iqujko`fÙk ugha gksrh gSA
Ans. 738
A-11. 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?
ADVPC - 2
,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 fdruh gksxh \
Ans. 9999
A-12. 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+dks vkSj 3 yM+fd;ksa esa ls 6 O;fDr;ksa dh ,d lfefr fdrus rjhdksa ls cukbZ tk ldrh gS ;fn lfefr esa de ls
de nks yM+ds vkSj de ls de nks yM+fd;ksa dks vo'; 'kkfey fd;k tk;sA
Ans. 65
A-13. 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+;ksa esa ls 11 f[kykfM+;ksa dh ,d Vhe fdrus rjhdksa ls pquh tk ldrh gS ;fn bu f[kykfM+;ksa esa ls dsoy 6
f[kykM+h xsanckth dj ldrs gSa vkSj 11 f[kykfM+;ksa esa de ls de 4 xsanckt vo'; 'kkfey fd;s tk;saA
Ans. 1170
A-14. 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;ksa esa ls 6 dh ,d lfefr fdrus rjhdksa ls cukbZ tk ldrh gS ;fn ,d fo'ks"k O;fDr 'A' dks pquk tkrk gS]
rks nwljs fo'ks"k O;fDr 'B' dks vo'; pquuk gksxk\
Ans. 154
A-15. In how many ways we can select 5 cards from a deck of 52 cards, if each selection must include atleast
one king.
52 iÙkksa dh ,d xM~Mh esa ls 5 iÙks fdrus rjhdksa ls pqus tk ldrs gSa ;fn iz R;sd p;u esa de ls de ,d ckn'kkg
vo'; vk;s\
Ans. 886656
A-16. How many four digit natural numbers not exceeding the number 4321 can be formed using the digits 1,
2, 3, 4, if repetition is allowed?
vad 1,2,3,4 dh lgk;rk ls pkj vadksa dh fdruh izkd`r la[;k,¡ cukbZ tk ldrh gS tks 4321 ls cM+h ugha gks]
tcfd vadks dh iqujko`fÙk gks ldrh gSaA
Ans. 229
A-17. 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&lkFk ugha vk;sa \
Ans. 7350
A-18. If A = {1, 2, 3, 4 .....n} and B A ; C A, then the find number of ways of selecting
(i) Sets B and C

(ii) Order pair of B and C such that B  C = 
(iii) Unordered pair of B and C such that B  C = 
(iv) Ordered pair of B and C such that B C = A and B C = 
(v) Unordered pair of B and C such that B C = A, B C = 
(vi) Ordered pair of B and C such that B C is singleton
;fn A = {1, 2, 3, 4 .....n} rFkk B A ; C A, rc pquus ds Øep;ksa dh la[;k gS&
(i) leqPp; B rFkk C
(ii) B rFkk C ds Øfer ;qXe tcfd B  C = 
(iii) B rFkk C ds vØfer ;qXe tcfd B  C = 
ADVPC - 3
(iv) B rFkk C ds Øfer ;qXe tcfd B C = A rFkk B C = 

(v) B rFkk C ds vØfer ;qXe tcfd B C = A, B C = 
(vi) B rFkk C ds Øfer ;qXe tcfd B C ,dy leqPp; gSA
3n – 1
Ans. (i) 4n (ii) 3n (iii) 1 (iv) 2n
2
(v) 2n–1 (vi) n
C1 . 3n–1
A-19. For a set of six true or false statements, no student in a class has written all correct answers and no
two students in the class have written the same sequence of answers. What is the maximum number of
students in the class, for this to be possible.
N% lR; ;k vlR; dFkuksa ds ,d leqPp; ds ckjs esa] ,d d{kk ds fdlh Hkh Nk=k us lHkh lgh mÙkj ugh fn;s gS rFkk
fdUgh Hkh nks Nk=kksa us mÙkjksa dk leku Øe esa mÙkj ugh fn;k gsS rks ,slk laHko gks blds fy, d{kk esa vf/kdre Nk=kksa
dh la[;k Kkr dhft,A
Ans. 63
A-20. How many arithmetic progressions with 10 terms are there, whose first term is in the set {1, 2, 3, 4}
and whose common difference is in the set {3, 4, 5, 6, 7} ?
10 inks okyh dqy fdruh lekUrj Jsf.k;k¡ cuk;h tk ldrh gS ftudk çFke in leqPp; {1, 2, 3, 4} dk vo;o gS
rFkk lkoZ vUrj leqPp; {3, 4, 5, 6, 7} dk vo;o gSA
Ans. 20
A-21. Find the number of all five digit numbers which have atleast one digit repeated.
ik¡p vdksa dh mu lHkh la[;kvksa dh la[;k Kkr dhft;s ftuesa de ls de ,d vad dh iqujko`fr gks jgh gksA
Ans. 62784
A-22. 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 ,slh fdruh fofHkUu O;oLFkk,¡ lEHko gSa \ ¼leku jax ds Qwy leku gSaA½
Ans. 280
Section (B) : Grouping and Circular Permutation

Section (B) :
B-1. In how many ways 18 different objects can be divided into 7groups such that four groups contains
3 objects each and three groups contains 2 objects each.
18 fofHkUu oLrqvksa dks 7 lewgksa esa fdrus izdkj ls foHkkftr fd;k tk ldrk gS ;fn buesa ls
4 lewgksa esa ls izR;sd esa 3 ,oa 'ks"k 3 lewgksa esa ls izR;sd esa 2 oLrq,¡ gksa\
18!
Ans.
(3!) . (2!)3 4! 3!
4
B-2. 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 fofHkUu oLrqvksa dks A, B rFkk C esa fdrus izdkj ls ck¡Vk tk ldrk gS] tcfd A dks 3, B dks 5 rFkk 'ks"k
oLrq,sa C dks nsrs gksA
Ans. 360360
B-3. Find number of ways of distributing 8 different items equally among two children.
8 fofHkUu oLrqvksa dks nks cPpksa esa leku :i ls fdrus izdkj ls ck¡V ldrs gSA
Ans. 70
B-4. (a) In how many ways can five people be divided into three groups?
(b) In how many ways can five people be distributed in three different rooms if no room must be
empty?
ADVPC - 4
(c) In how many ways can five people be arranged in three different rooms if no room must be
empty and each room has 5 seats in a single row.
(a) 5 O;fDr;ksas dks 3 lewgksa esa fdrus izdkj ls foHkkftr fd;k tk ldrk gS \
(b) 5 O;fDr;ksa dks 3 fofHkUu dejksa esa fdrus izdkj ls ck¡Vk tk ldrk gS ;fn dksbZ Hkh dejk [kkyh u jgs \
(c) 5 O;fDr;ksa dks 3 dejksa esa fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS ;fn dksbZ Hkh dejk [kkyh u jgs
rFkk izR;sd dejs dh ,d iafDr esa ik¡p LFkku gSA
Ans. (a) 25 (b) 150. (c) 270000
200!
B-5. Prove that : is an integer
(10!)20 19!
200!
fl) dhft, : ,d iw.kk±d gSaA
(10!)20 19!
B-6. In how many ways 5 persons can sit at a round table, if two of the persons do not sit together?
,d xksy est ds pkjksa vksj 5 O;fDr fdrus rjhdksa ls cSB ldrs gSa ;fn buesa ls nks fo'ks"k O;fDr ,d lkFk ugha cSBrs
gSa\
Ans. 12
B-7. In how many ways four men and three women may sit around a round table if all the women are
together?
pkj iq:"k rFkk rhu efgyk,sa ,d xksy est ds pkjksa vkSj fdrus izdkj ls cSB ldrs gSa] tcfd lHkh efgyk,sa lkFk esa
cSBs\
Ans. 144
B-8. 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 A rFkk C ds
e/; cSBs\
Ans. 48
B-9. In how many ways four '+' and five '–' sign can be arranged in a circles so that no two '+' sign are
together.
pkj '+' rFkk ikap '–' fpUg~kas dks ,d o`Ùk ds pkjksa vkSj fdrus izdkj ls O;ofLFkr fd;k tk ldrk gS ;fn dksbZ Hkh nks
'+' fpUg~ lkFk u gksa\
Ans. 1
Section (C) : Problem based on distinct and identical objects and divisors
[k.M (C) : nh xbZ oLrqvksa ds le:i rFkk fHkUu&fHkUu gksus ls lEcfU/kr leL;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) mu rjhdksa dh la[;k] ftuesa N dks nks xq.ku[k.Mksa esa fo;ksftr fd;k tk ldrk gS
(ii) mu rjhdksa dh la[;k] ftuesa 5N dks nks xq.ku[k.Mksa esa fo;ksftr fd;k tk ldrk gS
(iii) mu rjhdksa dh la[;k] ftuesa N dks nks lg&vHkkT; xq.ku[k.Mksa esa fo;ksftr fd;k tk ldrk gS
Ans. (i) 18 (ii) 23 (iii) 4
ADVPC - 5
C-2. Find number of ways of selection of one or more letters from AAAABBCCCDEF
(i) there is no restriction. Ans. 479

(ii) the letters A & B are selected atleast once. Ans. 256
(iii) only one letter is selected. Ans. 6
(iv)  atleast two letters are selected Ans. 473
AAAABBCCCDEF ls ,d ;k vf/kd v{kjksa ds p;u ds rjhds Kkr dhft, tcfd
(i) dksbZ izfrcU/k u gks Ans. 479
(ii) A ,oa B dk de ls de ,d ckj p;u vo'; gksA Ans. 256
(iii) dsoy ,d v{kj pquk x;k gksA Ans. 6
(iv)  de ls de nks v{kjksa dks pquk x;k gksA Ans. 473
C-3. Find number of ways of selection of atleast one vowel and atleast one consonant from the word
TRIPLE
TRIPLE 'kCn ds v{kjksa esa ls de ls de ,d Loj rFkk de ls de ,d O;atu dk p;u fdrus izdkj ls dj ldrs
gS\
Ans. 45
C-4. 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,A
(i) buesa ls fdrus 11 ds xq.kt gS] budk ;ksx Hkh Kkr dhft,A
(ii) buesa ls fdrus 4 ls HkkT; ysfdu 15 ls ughaA
Ans. 36
(i) 18, 11.(20 + 21 + 22) (30 + 3 + 32) (5° + 5)
(ii) 3.2 + 1.1.2 = 8
Section (D) : Multinomial theorem & Dearrangement

[k.M (D) : o`Ùkh; Øep; rFkk cgqinh; izes; ij vk/kkfjr leL;k,¡
D-1. Find number of negative integral solution of equation x + y + z = – 12
lehdj.k x + y + z = – 12 ds _.kkRed iw.kk±d gyksa dh la[;k Kkr dhft,A
Ans. 55
D-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% ,d leku gjh] N% ,d leku uhyh rFkk N% ,d leku yky oLrqvksa dks nks O;fDr;ksa esa fdrus izdkj ls ck¡V
ldrs gSa] tcfd izR;sd O;fDr leku la[;k esa oLrq,sa izkIr djrk gksA
Ans. 37
D-3. Find the number of solutions of x + y + z + w = 20 under the following conditions:

(i) x, y, z, w are whole number
(ii) x, y, z, w are natural number
(iii) x, y, z, w  {1, 2, 3, .........., 10}
(iv) x, y, z, w are odd natural number
x + y + z + w = 20 ds gyksa dh la[;k Kkr dhft, tcfd :
(i) x, y, z, w iw.kZ la[;k;sa gkasA
(ii) x, y, z, w izkd`r la[;k;sa gkasA
(iii) x, y, z, w  {1, 2, 3, .........., 10}
(iv) x, y, z, w fo"ke izkd`r la[;k;sa gkasA
Ans. (i) 23C3 (ii) 19C3 (iii) 19C3 – 4.9C3 (iv) 11C8
ADVPC - 6
D-4_. A person has 4 distinct regular tetrahedron dice. The number printed on 4 four faces of dice are –3, –1,
1 and 3. The person throws all the 4 dice. Find the total number of ways of getting sum of number
appearing on the bottom face of dice equal to 0.
,d O;fDr ds ikl pkj fHkUu&fHkUu leprq"Qyd ikls gSA iklksa dh pkj lrgksa ij –3, –1, 1, 3 fy[kk x;k gSA
O;fDr lHkh pkj iklksa dks Qsdrk gS rFkk ikls dh fupyh lrg ij vkus okyh la[;kvksa dk ;ksx 'kwU; gksus ds dqy
rjhds Kkr dhft,A
Ans. 9C
3 – 4 × 5C3 = 44
D-5. Five balls are to be placed in three boxes in how many diff. ways can be placed the balls so that no box
remains empty if
(i) balls and boxes are diff,
(ii) balls identical and boxes diff.
(iii) balls diff. and boxes identical
(iv) balls as well as boxes are identical
ik¡p xsanksa dks 3 lUnwdksa esa bl izdkj j[kk tkrk gS fd dksbZ Hkh laUnwd [kkyh u jgs rks rjhdksa dh la[;k Kkr dhft,
tcfd
(i) xsans ,oa lUnwd fHkUu&fHkUu gksA
(ii) xsans leku gks rFkk lUnwd fHkUu&fHkUu gksA
(iii) xSnsa fHkUu&fHkUu ,oa lUnwd leku gksA
(iv) xSnsa ,oa lUnwd nksuksa leku gks
Ans. (i) 150, (ii) 6, (iii) 25, (iv) 2
b
D-6_. Let Dn represents derangement of 'n' objects. If Dn+2 = a Dn+1 + b Dn  n  N, then find
a
b
ekuk Dn, 'n' oLrqvksa dh iquZO;oLFkk dks O;kDr djrk gS ;fn Dn+2 = a Dn+1 + b Dn  n  N, rc Kkr dhft,A
a
Ans. 1
D-7. 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?
,d O;fDr vius 5 fe=kksa dks i=k fy[krk gS vkSj laxr fyQkQks ij irs fy[krk gSA ;s i=k fyQkQksa esa fdrus izdkj ls
j[ks tk ldrs gSa rkfd
(a) lHkh i=k xyr fyQkQksa esa gks\
(b) de ls de rhu i=k xyr fyQkQksa esa gksa\
Ans. (a) 44 (b) 109
Section (E) : Miscellaneous

[k.M (E) :
E-1. (i) Find exponent of 3 in 20 !
20 ! esa 3 dk ?kkrkad Kkr dhft,A
(ii) Find number of zeros at the end of 45!.
45! ds vUr esa 'kwU;ksa dh la[;k Kkr dhft,A
Ans. (i) 8 (ii) 10
ADVPC - 7
E-2_. Find the total number of ways of selecting two number from the set of first 100 natural number such that
difference of their square is divisible by 3
izFke izkd`r la[;kvksa ds leqPp; ls nks la[;k,a 100 ftuds oxksZ dk vUrj 3 ls foHkkftr gS] dks pquus ds rjhds
gksxsaA
Ans. 34C + 33C2 + 33C2 + 34C1 . 33C1
2
E-3_. A four digit number plate of car is said to be lucky if sum of first two digit is equal to sum of last two
digit. Then find the total number of such lucky plate. (Assume 0000, 0011, 0111, ......... all are four digit
number)
,d dkj dh pkj vad dh uEcj IysV dks yDdh dgk tk,xk ;fn blds izFke nks vadks dk ;ksxQy] vafre nks vadks
ds ;ksxQy ds cjkcj gSA rc bl izdkj dh dqy yDdh IysV dh dqy la[;k gS&.
(ekuk fd 0000, 0011, 0111, ......... lHkh pkj vad la[;k gS)
Ans. 670
E-4_. Let each side of smallest square of chess board is one unit in length.
(i) Find the total number of squares of side length equal to 3 and whose side parallel to side of
chess board.
(ii) Find the sum of area of all possible squares whose side parallel to side of chess board.
(iii) Find the total number of rectangles (including squares) whose side parallel to side of chess
board.
'krjat ds cksMZ ij lcls NksVs oxZ dh izR;sd Hkqtk dh yEckbZ 1 bdkbZ gSA
(i) 3 yEckbZ dh Hkqtk ds oxksZ dh la[;k Kkr dhft,] tcfd Hkqtk] 'krjat cksMZ ds Hkqtk ds lekUrj gSA
(ii) lHkh lEHkkfor oxksZ dk {ks=kQy Kkr dhft,A tcfd oxZ dh Hkqtk] 'krjat cksMZ ds Hkqtk ds leku gSA
(iii) vk;rksa ¼oxksZ dks 'kkfey djrs gq,½ dh dqy la[;k gksxh tcfd vk;r dh Hkqtk 'krjat cksMZ ds lekUrj gSA
Ans. (i) 36 (ii) 1968 (iii) 1296
E-5. A person is to walk from A to B. However, he is restricted to walk only to the right of A or upwards of A.
but not necessarily in the order shown in the figure. Then find the number of paths from A to B.
,d O;fDr dks A ls B rd igq¡puk gS tcfd og fcUnq A ds nka;h rjQ ;k A ds Åij dh rjQ gh pysxk ;g izfrcU/k
fn;k x;k gS iajrq fn;s x;s fp=k ds Øe esa pys vko';d ugh gS rks ml O;fDr ds A ls B rd tkus ds fofHkUu iFkksa
dh la[;k Kkr dhft;sA
B
A
Ans. 126
PART - II : ONLY ONE OPTION CORRECT TYPE
ADVPC - 8
Hkkx - II : dsoy ,d lgh fodYi çdkj (ONLY ONE OPTION CORRECT TYPE)
Section (A) : Fundamental principle of counting, problem based on selection of given

object & arrangement of given object, rank of word
[k.M (A) : x.kuk ds vk/kkjHkwr fl)kUr] nh xbZ oLrqvksa ds pquko] foU;kl ij vk/kkfjr leL;k,¡] fn;s x;s
'kCn dh ojh;rk ij vk/kkfjr leL;k,¡
A-1. 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
A-2. 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:
vkB dqflZ;ksa ij 1 ls 8 rd uEcj yxs gSaSA 2 vkSjrsa vkSj 3 vkneh izR;sd ,d&,d dqlhZ ij cSBuk pkgrs gSaA igys
vkSjrsa 1 ls 4 uEcj yxh gqbZ dqflZ;ksa esa ls dqflZ;k¡ pqurh gSa vkSj blds ckn vkneh cph gqbZ dqflZ;ksa esa ls dqflZ;k¡
pqurs gS] rks laHkkfor O;LFkkiuksa dh la[;k gksxh&
(A) 6C3. 4C4 (B) P2. 4P3 (C) 4C3. 4P3 (D*) 4P2. 6P3
A-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" 'kCn ds v{kjksa ls ,sls fdrus 'kCn cuk, tk ldrs gSa tks u rks G ls 'kq: gksrs gSa vkSj u gh S ij lekIr
gksrs gSa&
(A) 24 (B) 240 (C) 480 (D*) 504
A-4. 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’ 'kCn ds v{kjksa ls ,sls fdrus 'kCn cuk, tk ldrs gSa tks T ls izkjEHk gksrs gSa vkSj T ij gh lekIr
gksrs gS&
(A) 80720 (B*) 90720 (C) 20860 (D) 37528
A-5. 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+ds vkSj 3 yM+fd;k¡ ,d iafDr esa fLFkr 8 lhVksa ij cSBs gq, gSaA ;fn lHkh yM+fd;k¡ ,d lkFk ugha cSBs] rks os
lHkh fdrus rjhdksa ls cSB ldrs gSa&
(A*) 36000 (B) 9080 (C) 3960 (D) 11600
A-6. 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
,d fØdsV Vhe ds 16 f[kykfM+;ksa esa 4 xsanckt vkSj 2 fodsV dhij gSA 11 f[kykfM+;ksa dh ,d Vhe fdrus rjhdks ls
cuk;h tk ldrh gSa] ftlesa de ls de 3 xsanckt vkSj de ls de ,d fodsV&dhij gks \
(A) 2400 (B*) 2472 (C) 2500 (D) 960
A-7 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
ADVPC - 9
,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 ls
5 O;fDr Åij cSBus ls euk djrs gSa rFkk 8 O;fDr uhpsa cSBus ls euk djrs gSa] rks bUgs fdrus izdkj ls foHkkftr fd;k
tk ldrk gSa&
(A) 25 (B*) 21 (C) 18 (D) 15
A-8. The number of permutations that can be formed by arranging all the letters of the word ‘NINETEEN’ in
which no two E’s occur together. is
'kCn ‘NINETEEN’ ds lHkh v{kjksa dks fdrus izdkj ls O;ofLFkr fd;k tk ldrk gSa rkfd dksbZ Hkh nks 'E' ,d lkFk
ugha vk;s&
8! 5! 5! 6 8! 6
(A) (B) (C*) × C3 (D) × C3.
3! 3! 3!  6
C2 3! 5!
A-9. 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
vaxzsth o.kZekyk ds 10 v{kj fn;s x;s gSaA bu v{kjksa dh lgk;rk ls 5 v{kj okys 'kCn cuk;s tkrs gS] rks ,sls fdrus
'kCn gksxsa ftuesa de ls de ,d v{kj dh iqujko`fÙk gksrh gS&
(A) 69760 (B) 30240 (C) 99748 (D) buesa ls dksbZ ugha
A-10. 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 :
,d lEesyu esa 10 oDrk mifLFkr gSaA ;fn oDrk S1 , S2 ls igys cksyuk pkgrk gS vkSj S2 , S3 ds ckn cksyuk pkgrk
gS vkSj ;fn 'ks"k lkr oDrk fdlh Hkh LFkku ij cksy ldrs gSa] rks lHkh 10 oDrk vius Hkk"k.k fdrus izdkj ls ns ldrs
gSa \
10 !
(A) 10C3 (B) 10P8 (C) 10P3 (D*)
3
A-11. 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" ds v{kjksa ls fufeZr lHkh 'kCnksa dks 'kCndks"k ds Øekuqlkj O;ofLFkr fd;k tk;s] rks 'kCn
QUEUE dk Øe gS&
(A) 15th (B) 16th (C*) 17th (D) 18th
A-12. 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 ,d lkFk mi;ksx djrs gq, cukbZ tk ldus okyh lHkh la[;kvksa dk ;ksx fdruk gksxk tcfd vadks
dh iqujko`fÙk ugha gks ldrh gSa&
(A) 16 × 4! (B) 1111 × 3! (C*) 16 × 1111 × 3! (D) 16 × 1111 × 4!.
A-13. 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
LFkkuksa ij vk;s&
(A) 7560 (B) 180 (C) 16 (D*) 60
A-14. There are 2 identical white balls, 3 identical red balls and 4 green balls of different shades. The number
of ways in which they can be arranged in a row so that atleast one ball is separated from the balls of
the same colour, is :
(A*) 6 (7 ! – 4!) (B) 7 (6 ! – 4 !) (C) 8 ! – 5 ! (D) none
2 loZle lQsn xsan] 3 loZle yky xsan vkSj 4 fofHkUu gjh xsan gSA bUgs ,d iafDr esa fdrus rjhdksa ls O;OfLFkr fd;k
tk ldrk gS tcfd de ls de ,d xsan vius leku jax dh xsanksa ls vyx vk;s&
ADVPC - 10
(A*) 6 (7 ! – 4!) (B) 7 (6 ! – 4 !) (C) 8 ! – 5 ! (D) buesa ls dksbZ ugha
A-15. 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
,d lUnwd esa 2 fHkUu lQsn] 3 fHkUu dkyh vkSj 4 fHkUu yky xsnsa gSaA lUnwd esa ls 3 xsansa dqy fdrus rjhdksa ls
fudkyh tk ldrh gS tcfd izR;sd p;u esa de ls de ,d dkyh xsan vo'; lfEefyr gks ¼leku jax dh xsnsa
fofHkUu gS½
(A) 60 (B) 64 (C) 56 (D) buesa ls dksbZ ugha
A-16. Eight cards bearing number 1, 2, 3, 4, 5, 6, 7, 8 are well shuffled. Then in how many cases the top 2
cards will form a pair of twin prime equals
8 iÙkksa ij ukekafdr la[;k1, 2, 3, 4, 5, 6, 7, 8 gSA fdruh fLFkfr;ksa esa muesa ls Åijh nks iÙks ;qxy vHkkT; la[;kvksa
dk ;qXe cukrs gSA
(A) 720 (B) 1440 (C*) 2880 (D) 2160
A-17. Number of natural number upto one lakh, which contains 1,2,3, exactly once and remaining digits any
time is -
,d yk[k rd dh mu izkd`r la[;kvksa dh la[;k ftuesa vad 1, 2, 3 Bhd ,d ckj vk;s rFkk ckdh cps vad fdruh
Hkh ckj vk lds] gkasxhA
(A*) 2940 (B) 2850 (C) 2775 (D) 2680
A-18. The sum of all the four digit numbers which can be formed using the digits 6,7,8,9 (repetition is allowed)
vadksa 6,7,8,9 dh lgk;rk ls cuk;h tk ldus okyh lHkh pkj vadks dh la[;kvksa dk ;ksxQy gS (iqujko`fÙk laHko gS)
(A*) 2133120 (B) 2133140 (C) 2133150 (D) 2133122
A-20. 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 ;qxyksa dks fefJr ;qxy Vsful fdrus izdkj ls f[kyk;k tk ldrk gS ;fn dksbZ Hkh ifr vkSj iRuh ,d gh
[ksy (game) esa ugha [ksy ldrs gSa ?
(A) 756 (B) 3024 (C*) 1512 (D) 6048
Section (B) : Grouping and circular Permutation

Section (B) :
B-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:
 5 ! 2 9! 9!
(A) (B) (C*) (D) none
3 !  2 !
8 2 3
9 vyx&vyx f[kykSus fofHkUu vk;q oxZ ds 4 cPpksa esa fdrus rjhdksa ls ckaVs tk ldrs gS ;fn 3 cM+s cPpksa dks le
la[;k esa f[kykSus feys vkSj lcls NksVs cPps dks ,d f[kYkkSuk T;knk feys&
 5 ! 2 9! 9!
(A) (B) (C) (D) buesas ls dksbZ ugha
3 !  2 !
8 2 3
B-2_. In an eleven storeyed building (Ground floor + ten floor), 9 people enter a lift cabin from ground floor. It
is know that they will leave the lift in groups of 2, 3 and 4 at different residential storeys. Find the
number of ways in which they can get down.
ADVPC - 11
Hindi ,d X;kgj eaftyk bekjr (/kjkry + 10 ekys), esa 9 O;fDr] /kjkry ls fy¶V esa p<+rs gSA ;g fn;k gS fd os
vyx&vyx vkoklh; eafty ij 2, 3 vkSj 4 ds lewg esa fy¶V ls mrjrs gSA rc muds }kjk mrjus ds rjhds gSA
9  9! 8  9! 2  10! 10!
(A) (B) (C) (D*)
4 4 9 4
B-3. 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:
8!
(A) 4 !. 4 ! (B) (C*) 288 (D) none
4!
8 fofHkUu Qwyksa ls ,d gkj fdrus rjhdksa ls cuk;k tk ldrk gSa ;fn 4 fo'ks"k Qwy dHkh Hkh vyx u gksa&
8!
(A) 4 !. 4 ! (B) (C) 288 (D) buesa ls dksbZ ugha
4!
B-4. 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 yky xqykcksa vkSj 3 lQsn xqykcksa ¼lHkh xqykc vyx&vyx gSa½ ls ,d ekyk fdrus rjhdksa ls cukbZ tk ldrh gSa
tcfd lHkh lQsn xqykc ,d lkFk jgsa&
(A) 2170 (B) 2165 (C*) 2160 (D) 2155
B-5. 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+ds vkSj 4 yM+fd;k¡ ,d o`Ùk esa fdrus rjhdksa ls [kM+s jg ldrs gSa rkfd izR;sd yM+dk vkSj yM+dh ,dkUrj Øe
esa jgsa&
(A*) 3 !. 4 ! (B) 4 !. 4 ! (C) 8 ! (D) 7 !
B-6. 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 fofHkUu eksfr;ksa esa ls 5 eksrh dks pqudj ,d fjax esa yxkus ds rjhdksa dh la[;k gSa&
(A*) 672 (B) 1344 (C) 336 (D) buesa ls dksbZ ugha
B-7. 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) 2. (3 !)2 (4 !)3
2 Hkkjrh;] 3 vesfjdu] 3 bVkfy;u vkSj 4 ÝsUp ,d o`Ùk esa fdrus rjhdks ls cSB ldrs gSa ;fn leku jk"Vªh;rk ds
O;fDr ,d lkFk cSBuk pkgrs gks\
(A) 2. (4 !)2 (3 !)2 (B) 2. (3 !)3. 4 ! (C) 2. (3 !) (4 !)3 (D) 2. (3 !)2 (4 !)3
Section (C) : Problem based on distinct and identical objects and divisors
[k.M (C) : nh xbZ oLrqvksa ds le:i rFkk fHkUu&fHkUu gksus ls lEcfU/kr leL;k
C-1. The number of proper divisors of apbqcrds where a, b, c, d are primes & p, q, r, s  N, is
la[;k apbqcrds ¼tgk¡ a, b, c, d vHkkT; la[;k,¡ gSa vkSj p, q, r, s  N gSa½ ds 1 vkSj Loa; ds vykok Hkktdksa dh la[;k
gSa–
(A) p q r s (B) (p + 1) (q + 1) (r + 1) (s + 1)  4
(C) p q r s  2 (D*) (p + 1) (q + 1) (r + 1) (s + 1)  1
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
ADVPC - 12
N ,d ,slh lcls NksVh izkd`r la[;k gS ftlds 24 Hkktd gS] rks N dks fdrus izdkj ls nks xq.ku[k.Mksa ds :i esa
ifjofrZr fd;k tk ldrk gS&
C-3. How many divisors of 21600 are divisible by 10 but not by 15?
(A*) 10 (B) 30 (C) 40 (D) none
21600 ds 10 ls foHkkftr gSa ysfdu 15 ls foHkkftr ugha gksus okys Hkktdksa dh la[;k gS&
(A) 10 (B) 30 (C) 40 (D) buesas ls dksbZ ugha
C-4. The number of ways in which the number 27720 can be split into two factors which are co-primes, is:
la[;k 27720 dks nks lgvHkkT; xq.ku[k.Mksa esa fdrus rjhdksa ls foHkkftr fd;k tk ldrk gS&
(A) 15 (B*) 16 (C) 25 (D) 49
C-5. The number of words of 5 letters that can be made with the letters of the word "PROPOSITION".
"PROPOSITION" 'kCn ds v{kjksa ls 5 v{kj ds fdrus 'kCn cuk, tk ldrs gSa \
(A*) 6890 (B) 7000 (C) 6800 (D) 6900
C-6. How many ways can atleast 2 fruit be selected out of 5 Mangoes, 4 Apples, 3 Bananas and three
different fruits.
5 vke, 4 lsc, 3 dsys rFkk 3 fHkUu Qyksa esa ls de ls de nks Qyksa dks fdrus izdkj ls pquk tk ldrk gS \
(A) 959 (B*) 953 (C) 960 (D) 954
Provided fruits of same kind are identical)
Section (D) : Multinomial theorem and Dearrangement
[k.M (D) :
D-1. The number of ways in which 10 identical apples can be distributed among 6 children so that each child
receives atleast one apple is :
(A*) 126 (B) 252 (C) 378 (D) none of these
10 loZle lscksa dks 6 cPpksa esa ckVusa ds rjhds ;fn iz R;sd cPpk de ls de ,d lsc izkIr djrk gks&
D-2. Number of ways in which 3 persons throw a normal die to have a total score of 11, is
3 O;fDrksa }kjk ,d ikls dks Qsadusa ij vadksa dk ;ksx 11 vkus ds rjhdksa dh la[;k gS&
(A*) 27 (B) 25 (C) 29 (D) 18
D-3. 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
;fn fdlh fo'ks"k czk.M dh lHkh pkdysV loZle gks] rks cktkj esa miyC/k 8 fofHkUu czk.Mks esa ls 6 pksdysV pquus ds
rjhdksa dh la[;k gSa&
(A) 13C6 (B) 13C8 (C) 86 (D) buesa ls dksbZ ugha
D-4. Number of positive integral solutions of x1 . x2 . x3 = 30, is

x1 . x2 . x3 = 30 ds /kukRed iw.kk±d gyksa dh la[;k gS&
(A) 25 (B) 26 (C*) 27 (D) 28
D-5. 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, then
number of arrangement equals.
(A) 6 (B) 9 (C) 44 (D*) 4
ADVPC - 13
;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=k
fo"ke vad okys fyQkQs esa gh j[ks tk ldrs gSa rFkk le vadksa okys i=k le vad okys fyQkQs esa gh tk ldrs gSa
rkfd dksbZ Hkh i=k lgh fyQkQs esa u j[kk tk;s rc foU;klksa dh la[;k gksxhA
D-6_. Seven cards and seven envelopes are numbered 1, 2, 3, 4, 5, 6, 7 and cards are to be placed in
envelopes so that each envelope contains exactly one card and no card is placed in the envelope
bearing the same number and moreover the card number 1 is always placed in envelope number 2 and
2 is always placed in envelope numbered 3, then the number of ways it can be done is
lkr iÙks rFkk lkr fyQkQksa ij ukekafdr 1, 2, 3, 4, 5, 6, 7 gSA iÙkksa dks fyQkQs esa bl izdkj ls j[kk tkrk gSA fd
izR;sd fyQkQk Bhd ,d iÙkk j[ks vkSj dksbZ Hkh iÙkk leku la[;k ds fyQkQs esa ugh gks tcfd ;g fn;k gS fd iÙkk
la[;k 1 lnSo] fyQkQk la[;k 2 esa gks vkSj 2 lnSo ukekafdr 3, fyQkQs esa j[kk x;k tk, rc ;g fdrus izdkj ls
fd;k tk ldrk gSA
(A*) 53 (B) 44 (C) 9 (D) 62
Section (E) : Miscellaneous

[k.M (E) : fofo/k
E-1_. The number of ways of choosing triplets (x, y, z) such that z  max {x, y} and
x, y, z  {1, 2, 3 ......, n} is
f=kd (x, y, z) pquus ds rjhdksa dh la[;k gksxh tcfd z  max {x, y} rFkk
x, y, z  {1, 2, 3 ......, n} gSA
n
 n(n  1)2 
(A*) 
t 1
t2 (B) n+1C3 – n+2C3 (C) 2 (n+2C3) + n+1C2 (D) 

 2


E-2. 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 'kgj dh xfy;ksa dks 'krjat dh fclkr dh js[kkvksa dh rjg O;ofLFkr fd;k x;k gSA mÙkj ls nf{k.k dh vksj tkus
okyh m xfy;k¡ gS vkSj iwoZ ls if'pe dh vksj tkus okyh n xfy;k¡ gSA ,d O;fDr mÙkj&if'pe dksus ls nf{k.k&iwoZ
dksus rd fdrus rjhdksa ls tk ldrk gSa tcfd og U;wure lEHkkfor nwjh ls tk;sA
(m  n) ! (m  n  2) !
(A) m2  n2 (B) (m 1)2 . (n 1)2 (C) (D*)
m! . n! (m  1) ! . (n 1) !
E-3_. Number of ways of selecting pair of black squares in chessboard such that they have exactly one
common corner is equal to :
'krjat ds cksMZ ij nks dkys oxksZ ds ;qXe dks pquus ds rjhds gksaxs tcfd os Bhd ,d mHk;fu"B dksuk j[krk gSA
(A) 64 (B) 56 (C*) 49 (D) 50
PART - III : MATCH THE COLUMN

Hkkx - III : dkWye dks lqesfyr dhft, (MATCH THE COLUMN )
1. Match the column

Column – I Column – II
(A) The total number of selections of fruits which can be made (p) 120
from, 3 bananas, 4 apples and 2 oranges is, it is given that
fruits of one kind are identical
ADVPC - 14
(B) There are 10 true-false statements in a question paper. (q) 286

How many sequences of answers are possible in which exactly
three are correct ?
(C) The number of ways of selecting 10 balls from unlimited (r) 59
number of red, black, white and green balls is, it is given
that balls of same colours are identical
(D) The number of words which can be made from the letters of the (s) 75600
word ‘MATHEMATICS’ so that consonants occur together ?
LrEHk –  LrEHk – 
(A) 3 dsys] 4 lsc vkSj 2 lUrjksa esa ls Qy pquus ds dqy rjhds] (p) 120
tcfd ,d izdkj ds lHkh Qy leku gSa] gksaxs&
(B) iz'u iz=k esa 10 lR;&vlR; izdkj ds dFku gS (q) 286

Bhd rhu mÙkj lgh gksus ds lHkh laHkkfor rjhds gksxs ?
(C) vlhfer la[;k esa mifLFkr yky] dkyh] lQsn vkSj gjh xsnksa esa ls (r) 59
10 xsans pquus ds rjhdksa dh la[;k] tcfd leku jax dh lHkh xsnsa
loZle gaS] gksxh&
(D) 'kCn ‘MATHEMATICS’ ds v{kjksa ls cuk, tk ldus okys 'kCnksa (s) 75600
dh la[;k gksxh tcfd O;atu lkFk&lkFk gks
Ans. (A)  (r), (B)  (p), (C)  (q), (D)  (s)
2. Match the column

Column-I Column-II
(A) There are 12 points in a plane of which 5 are collinear. (p) 185
The maximum number of distinct convex quadrilaterals which can be
formed with vertices at these points is:
(B) If 7 points out of 12 are in the same straight line, then (q) 420
the number of triangles formed is
(C) If AB and AC be two line segemets and there are 5, 4 points on (r) 126
AB and AC (other than A), then the number of quadrilateral, with
vertices on these points equals
(D) The maximum number of points of intersection of 8 unequal (s) 60

circles and 4 straight lines.
LrEHk dk feyku dhft;sA

LrEHk - I LrEHk - II
(A) lery esa 12 fcUnqvksa esa ls 5 lajs[kh; gS] fofHkUu vf/kdre mÙky prqHkqZtksa (p) 185
dh la[;k gksxh ftlds ;s fcUnq 'kh"kZ gS&
(B) ;fn 12 esa ls 7 fcUnq ,d ljy js[kk esa gS& (q) 420
rc cuk, x, f=kHkqtksa dh la[;k gS
(C) ;fn AB rFkk AC nks js[kk[k.M gS rFkk 5, 4 fcUnq AB rFkk AC ij Øe'k gS (r) 1260
(A dks NksM+dj) rc prqHkqZtksa dh la[;k gksxh ftlds 'kh"kZ ;s fcUnq 'kh"kZ gSA
(D) 8 vleku o`Ùkksa vkSj 4 ljy js[kkvksa ds izfrPNsn fcUnqvksa (s) 60

dh vf/kdre la[;k gS
Ans. (A) - (q) ; (B) - (p) ; (C) - (s) ; (D) - (r)
ADVPC - 15

PART - I : ONLY ONE OPTION CORRECT TYPE

Hkkx-I : dsoy ,d lgh fodYi çdkj (ONLY ONE OPTION CORRECT TYPE)
1. A train is going from London to Cambridge stops at 12 intermediate stations. 75 persons enter the train
after London with 75 different tickets of the same class. Number of different sets of tickets they may be
holding is:
yUnu ls dSfEczt tkus okyh ,d Vsªu 12 ek/;fed LVs'kuksa ij :drh gSaA yUnu ds ckn leku Js.kh ds 75 fHkUu
fVdV ysdj 75 ;k=kh Vsªu esa izos'k djrs gSa] bu fVdVks ds fy, vyx&vyx lewg cuk;s tk ldrs gS&
(A*) 78C3 (B) 91C75 (C) 84C75 (D) 78C74
2. 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.
,d ifjokj esa ,d nknkth, m csVs&csfV;k¡ vkSj 2n iksrs&iksfr;k¡ gSA os fMuj ds fy, ,d iafDr esa cSBrs gSaA
iksrs&iksfr;k¡ izR;sd fljs dh n lhVksa ij cSBuk pkgrs gSa vkSj nknkth ugha pkgrs fd muds fdlh Hkh rjQ dksbZ iksrk
;k iksrh cSBsA fdrus rjhdksa ls ;g ifjokj fMuj ds fy, cSB ldrk gSa \
(A*) (2n)! m! (m  1) (B) (2n)! m! m (C) (2n)! (m – 1)! (m  1) (D) (2n – 1)! m! (m  1)
3. A bouquet from 11 different flowers is to be made so that it contains not less than three flowers. Then
then number of different ways of selecting flowers to form the bouquet.
11 fofHkUu Qwyksa dh lgk;rk ls ,d xqynLrk cuk;k tkrk gS tcfd blesa rhu ls de Qwy ugha gksA xqynLrksa dks
cukus ds fy, Qwyksa dks pquus ds rjhdksa dh la[;k gS&
(A) 1972 (B) 1952 (C*) 1981 (D) 1947
4. If  = x1 x2 x3 and  = y1 y2 y3 be two three digit numbers, then the 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 gksxh] ftlesa
 dks  esa ls fcuk gkfly fy;s ?kVk;k tk ldsA
(A) 55 . (45)2 (B*) 45 . (55)2 (C) 36 . (45)2 (D) 553
5. 'n' digits positive integers formed 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 vadks ds /kukRed iw.kk±d cuk, tkrs gSa ftudk izR;sd vad 1, 2 ;k 3 gks \ buesa ls ,slh fdruh la[;k,¡ gksxh ftuesa
lHkh rhuksa vad 1, 2, 3 de ls de ,d ckj vk;s\
(A) 3(n –1) (B) 3n – 2.2n + 3 (C) 3n – 3.2n – 3 (D*) 3n – 3.2n + 3
6. 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. Then the maximum number of fresh lines thus introduced
is
,d lery esa ' n ' ljy js[kk,¡ gS ftuesa ls dksbZ Hkh nks lekUrj ugha gS vkSj dksbZ Hkh rhu js[kk,¡ leku fcUnq ls ugha
xqtjrh gSaA muds izfrPNsn fcUnqvksa dks feyk;k tkrk gSaA bl izdkj cuus okyh u;h vf/kdre ljy js[kkvksa dh la[;k
gSa&
(A) 1 n (n  1)2 (n  3) (B) 1 n (n  1) (n  2) (n  3)
12 8
(C*) 1 n (n  1) (n  2) (n  3) (D) 1 n (n  1) (n  2) (n  3)
8 8
ADVPC - 1
7. X = {1, 2, 3, 4, ...... 2017} and A  X ; B  X ; A  B  X here P  Q denotes that P is subset of Q(P 
Q). Then number of ways of selecting unordered pair of sets A and B such that A  B  X.
X = {1, 2, 3, 4, ...... 2017} rFkk A  X ; B  X ; A  B  X tgk¡ P  Q, Q dks P dk mileqPp; dks O;ä djrk
gSA Q(P  Q) leqPp; A rFkk B ds vØfer ;qXeksa ds pquus ds Øep;ksa dh la[;k tcfd A  B  X.
(42017  32017 )  (22017  1) (42017  32017 )
(A*) (B)
2 2
4 2017
3 2017
 22017
(C) (D) None of these buesa ls dksbZ ugha
2
8. 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) 7296
15 le:i lsc vkSj 10 le:i larjks dks rhu O;fDr;ksa esa fdrus rjhdksa ls ckaVk tk ldrk gS ;fn izR;sd O;fDr dks
'kwU;] ,d ;k vf/kd feysA
(A) 5670 (B) 7200 (C*) 8976 (D) 7296
9. 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:
,d iz'u i=k ds nks dksM 12 fo|kfFkZ;ksa esa ck¡Vs tkrs gSa] rks bu fo|kfFkZ;ksa dks nks iafDr;ksa esa fdrus izdkj ls fcBk;k
tk ldrk gS fd izR;sd iafDr esa ikl&ikl cSBs fo|kfFkZ;ksa dks leku iz'u&i=k ugha feys rFkk izR;sd LrEHk ds lHkh
fo|kfFkZ;ksa dks leku iz'u i=k feysA
12! (12)!
(A) (B) (C) (6 !)2. 2 (D*) 12 ! × 2
6! 6! 25 . 6!
10_. How many ways are there to invite one of three friends for dinner on 6 successive nights such that no
friend is invited more than three times ?
6 Øekxr jk=kh ij Hkkstu ds fy, rhu fe=kks esa ls ,d dks fdrus rjhds ls vkeaf=kr dj ldrk gS tcfd og fdlh
Hkh fe=k dks rhu ls vf/kd ckj ugh cqykrk gSA
6  6! 6! 6! 6  6! 6! 6!
(A*) + 3 + (B) + 6 +
1!2!3! 3!3! 2!2!2! 1!2!3! 3!3! 2!2!2!
6  6! 6! 6! 3  6! 6! 6!
(C) + + (D) + 3 +
1!2!3! 3!3! 2!2!2! 1!2!3! 3!3! 2!2!2!
11. If n identical dice are rolled, then number of possible out comes are.
6n
(A) 6n (B) (C*) (n  5) c 5 (D) None of these
n!
;fn n loZle iklksa (dice) dks Qsadk tkrk gS] rks laHkkfor ifj.kkeksa dh la[;k gS&
6n (n  5)
(A) 6n (B) (C) c5 (D) buesa ls dksbZ ugha
n!
12. Number of ways in which a pack of 52 playing cards be distributed equally among four players so that
each have the Ace, King, Queen and Jack of the same suit, is
rk'k ds 52 iÙkksa dks 4 O;fDr;ksa esa leku :i ls ckVusa ds fdrus rjhdsa gksaxsa tcfd izR;sd O;fDr dks leku izdkj
(same suit) ds bDdk] ckn'kkg] csxe vkSj xqyke feyrs gks&
36 ! . 4 ! 36 ! 52 ! . 4 ! 52 !
(A*) (B) (C) (D)
 9 ! 4
 9 ! 4
13 ! 4
13 !4
ADVPC - 2
13. Find total number of positive integral solutions of 15 < x1 + x2 + x3  20.

(A*) 685 (B) 1140 (C) 455 (D) 1595
15 < x1 + x2 + x3  20 ds dqy /kukRed iw.kk±d gyksa dh la[;k Kkr dhft,A

(A*) 685 (B) 1140 (C) 455 (D) 1595
14. Seven person P1, P2, ........., P7 initially seated at chairs C1, C2 ........ ,C7 respectively. They all left there
chairs symultaneously for hand wash. Now in how many ways they can again take seats such that no
one sits on his own seat and P1 sits on C2 and P2 sits on C3 ?
lkr O;fDr P1, P2, ........., P7 izkjEHk esa Øe'k% C1, C2 ........ ,C7 dqflZ;k ij cSBs gS oks lHkh ,d lkFk gkFk /kksus viuh
dqflZ;ksa ls mBdj tkrs gS vkSj iqu% dqflZ;ksa ij cSBrs gS rks ,sls rjhdksa dh la[;k ftuesa dksbZ Hkh O;fDr Loa; dh dqlhZ
ij u cSBs ,oa P1 , dqlhZ C2 ij ,oa P2 , dqlhZ C3 ij cSBs] gksxh &
(A) 52 (B*) 53 (C) 54 (D) 55
15. Given six line segments of length 2, 3, 4, 5, 6, 7 units, the number of triangles that can be formed by
these segments is
N% js[kk[k.M fn;s x;s gS ftudh yEckbZ;k¡ 2, 3, 4, 5, 6, 7 bdkbZ gSaA bu js[kk[k.Mksa dh lgk;rk ls cuk, tk ldus
okys f=kHkqtksa dh la[;k gSa&
(A*) 6C3 – 7 (B) 6C3 – 6 (C) 6C3 – 5 (D) 6C3 – 4
16. There are m apples and n oranges to be placed in a line such that the two extreme fruits being both
oranges. Let P denotes the number of arrangements if the fruits of the same species are different and
Q the corresponding figure when the fruits of the same species are alike, then the ratio P/Q has the
value equal to :
(A*) nP2. mPm. (n  2) ! (B) mP2. nPn. (n  2) ! (C) nP2. nPn. (m  2) ! (D) none
m lscksa vkSj n lUrjksa dks ,d iafDr esa bl izdkj j[kk x;k gSa fd nksuksa fdukjksa ij j[ks gq, Qy lUrjs gSaA ekukfd P
mu dqy foU;klksa dh la[;k dks iznf'kZr djrk gS tcfd leku iztkfr ds Qy vyx&vyx gSa vkSj Q mu dqy
foU;klksa dh la[;k dks iznf'kZr djrk gS tcfd leku iztkfr ds Qy ,d leku gSa] rks vuqikr P/Q dk eku gksxk –
(A*) nP2. mPm. (n  2) ! (B) mP2. nPn. (n  2) ! (C) nP2. nPn. (m  2) ! (D) buesa ls dksbZ ugha
17. The number of intersection points of diagonals of 2009 sides regular polygon, which lie inside the
polygon.
2009 Hkqtkvksa okys cgqHkqt esa fod.kksZ ds izfrPNsn fcUnqvksa dh la[;k Kkr dhft, tks fd cgqHkqt ds vUnj fLFkr gSA
(A*) 2009C4 (B) 2009C2 (C) 2008C4 (D) 2008C2
18. 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
,d vk;r ftldh Hkqtk,¡ 2m – 1 ,oa 2n – 1 bdkbZ gS dks lekUrj js[kkvksa }kjk fp=k esa fn[kk, vuqlkj bdkbZ yEckbZ
ds oxks± esa ckaVk tkrk gS] rks mu lEHko vk;rksa dh la[;k ftudh Hkqtkvksa dh yEckbZ fo"ke gSa] gksxh&
(A) (m + n – 1)2 (B) 4m+n–1 (C*) m2 n2 (D) m(m + 1)n(n + 1)
ADVPC - 3
m
19_. Find the number of all rational number such that
n
m
(i) 0 < < 1, (ii) m and n are relatively prime (iii) m n = 25!
n
m
lHkh ifjes; la[;k dh la[;kvksa dh la[;k Kkr dhft, tcfd&
n
m
(i) 0 < < 1, (ii) m vkSj n lg vHkkT; gSA (iii) m n = 25!
n
(A*) 256 (B) 128 (C) 512 (D) None of these
PART - II : SINGLE AND DOUBLE VALUE INTEGER TYPE

Hkkx - II : ,dy ,oa f}&iw.kk±d eku izdkj ¼SINGLE AND DOUBLE VALUE INTEGER TYPE½
1. Number of five digits numbers divisible by 3 that can be formed using the digits 0, 1, 2, 3, 4, 7 and 8 if,
N
each digit is to be used atmost one is N then   is equal to
8
vadks 0, 1, 2, 3, 4, 7 vkSj 8 dk mi;ksx djrs gq, 3 ls foHkkftr gksus okyh 5 vadks dh N la[;k,¡ cukbZ tk ldrh gSa
N
tcfd izR;sd vad dk mi;ksx vf/kdre 1 ckj gqvk gks rc cjkcj gSA
8
Ans. 93
2.^ The sides AB, BC & CA of a triangle ABC have 3, 4 & 5 interior points respectively on them. If the
k
number of triangles that can be constructed using these interior points as vertices is k, then   is
5
equal to
f=kHkqt ABC dh Hkqtkvksa AB, BC vkSj CA ij Øe'k% 3, 4 vkSj 5 vH;kUrj fcUnq (interior points) fLFkr gSaA bu
vH;kUrj fcUnqvksa dks 'kh"kZ ekudj cuk, x, f=kHkqtksa dh la[;k k gS rc   dk eku gSA
k
5
Ans. 41
3.^ Shubham has to make a telephone call to his friend Nisheeth, Unfortunately he does not remember the
7 digit phone number. But he remembers that the first three digits are 635 or 674, the number is odd
and there is exactly one 9 in the number. The maximum number of trials that Shubham has to make to
be successful is N then (N–3400) is equal to
'kqHke vius fe=k fuf'kFk dks VsyhQksu djuk pkgrk gSA nqHkkZX;o'k mldks 7 vadksa dk Qksu uEcj irk ugha gSA ijUrq
mldks ;g irk gS fd izFke rhu vad 635 ;k 674 gSa] uEcj fo"ke gS vkSj Bhd ,d '9' j[krk gS] rks 'kqHke }kjk mlds
fe=k dks VsyhQksu yxkus ds vf/kdre iz;klksa dh la[;k] N gS rc (N–3400) cjkcj gSA
Ans. 2
4.^ 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
 k 
in which the division may be made is k, then   is equal to.
 10 
7 fofHkUu flDds rhu O;fDr;ksa esa ckaVs tkrs gSaA ;fn fdUgh Hkh nks O;fDr;ksa dks leku la[;k esa flDds ugha feyrs gSa
ysfdu izR;sd dks de ls de ,d flDdk feyrk gS vkSj dksbZ flDdk 'ks"k ugha jgrk gS] rks bl izdkj ds foHkktu ds
 k 
rjhds k gS rc   cjkcj gSA
 10 
ADVPC - 4
Ans. 63
5. 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(b!)(5!) then b equals to
vaxszth o.kZekyk ds ik¡p Lojksa rFkk nl n'keyo vadksa dks ,d iafDr esa bl rjg O;ofLFkr fd;k tk, fd nks Lojkasa ds
e/; fo"ke la[;k esa vad vk;sa rFkk nksuksa fljksa ij Loj vk;sa rks rjhdksa dh la[;k 20(b!)(5!) gS rc b cjkcj gS&
Ans. 10
6.^ The number of integers which lie between 1 and 106 and which have the sum of the digits equal to 12 is
N then (N–6000) is equal to
1 vkSj 106 ds chp iw.kkZad dh la[;k N gS ftuds vadks dk ;ksx 12 gS rc (N – 6000) cjkcj gS
Ans. 62
7.^ The number of ways in which 8 non-identical apples can be distributed among 3 boys such that every
 N 
boy should get atleast 1 apple & atmost 4 apples is N then   is equal to
 60 
8 fofHkUu lsc dks 3 yM+dks esa ckaVus ds rjhdksa dh la[;k N gS] tcfd izR;sd yM+ds dks de ls de ,d vkSj vf/kd
ls vf/kd 4 lsc feyrs gSa rc   cjkcj gS

N
60 
Ans. 77
8. In a hockey series between team X and Y, they decide to play till a team wins ‘10’ match. Then the
20
Cm
number of ways in which team X wins is then m is equal to
2
Vhe X vkSj Y ds e/; ,d gkWdh J`a[kyk [ksyh tkrh gSA os tc rd [ks yrs gS tc rd dh ,d Vhe ‘10’ eSp u thr
20
Cm
ysrh gS] rks X Vhe ds thrus ds Øep;ksa dh la[;k gS rc m cjkcj gS
2
Ans. 10
9. Three ladies have brought one chlid each 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. Then find the number of ways in which interviews can be arranged
rhu efgyk,¡ izR;sd vius ,d cPps dks fo|ky; esa izos'k fnykus vkrh gSA iz/kkuk/;kid N% O;fDr;ksa dk ,d ds ckn
,d lk{kkRdkj ysuk pkgrk gS tcfd fdlh Hkh eka dk mlds cPps ls igys lk{kkRdkj ugha fy;k tkrk gS] rks lk{kkRdkj
ysus ds dqy rjhds gksxsaA
Ans. 90
10.^ 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
,d fu'kkusckth izfr;ksfxrk esa ,d O;fDr izR;sd fu'kkus ds fy, 0, 2 ;k 4 vad izkIr dj ldrk gSaA og 5 fu'kkuksa esa
14 vad izkIr djus ds fofHkUu rjhdksa dh la[;k cjkcj gS
Ans. 30
11. 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;ksa A, B, C, D, E vkSj F dks ,d xksy est ds pkjksa vksj fdrus rjhdksa ls cSBk;k tk ldrk gSa ;fn A ds
nka;h vksj lnSo B ;k C cSBrs gSa vkSj B ds nka;h vksj lnSo C ;k D cSBrs gSaA
Ans. 18
ADVPC - 5
12. The number of permutations which can be formed out of the letters of the word "SERIES" taking three
letters together is
SERIES 'kCn ds v{kjksa esa ls 3 v{kjksa dks ,d lkFk ysdj cuk, tk ldus okys Øep;ksa dh la[;k gS :
Ans. 42
13.^ 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
,d cDls esa 6 xsans ftuesa ls lHkh vyx&vyx jax dh gks ldrh gSa ;k nks jax dh rhu&rhu xsans gks ldrh gS ;k rhu
fofHkUu jax dh nks&nks xsans gks ldrh gSaA ¼;fn leku jax dh xsans loZle gks½] rks cDls esa ls 3 xsans pquus ds rjhds
gS&
Ans. 31
14_. Five friends F1, F2, F3, F4, F5 book five seats C1, C2 , C3 ,C4 , C5 respectively of movie KABIL
independently (i.e. F1 books C1, F2 books C2 and so on). In how many different ways can they sit on
these seats if no one wants to sit on his booked seat, more over F 1 and F2 want to sit adjacent to each
other.
ik¡p fe=k F1, F2, F3, F4, F5 fQYEk ^dkfcy^ ns[kus ds fy;s flusek gky esa ik¡p lhVsa Øe'k% C1, C2 , C3 ,C4 , C5
Lora=k :i ls vkjf{kr djokrs gS rks bu lhVksa ij cSBus dk ,slk rjhdksa dh la[;k Kkr dhft;s ftuesa dksbZ Hkh Loa;
}kjk vkjf{kr lhV ij ugha cSBs rFkk F1 vkSj F2 lkFk&lkFk cSBsA
Ans. 21
15. 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;s x;s fp=k ds oxks± esa ik¡p X fdrus izdkj ls j[ks tk ldrs gSa rkfd dksbZ Hkh iafDr [kkyh u jgs \
A
Ans. 98
 N 
16.^ Sum of all the numbers that can be formed using all the digits 2, 3, 3, 4, 4, 4, is N then   is
 1111110 
equal to
 N 
vadks 2, 3, 3, 4, 4, 4 dks ,d lkFk iz;qDr djrs gq, fufeZr lHkh la[;kvksa dk ;ksx N gksxk rc la[;k  
 1111110 
cjkcj gS
Ans. 20
17.^ 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 N then (N–225) is equal to
,d dejs esa N% fookfgr ;qxy cSBs gq, gSaA buesa ls pkj O;fDr dks pquus ds rjhds N gS tcfd bu pkjksa esa Bhd ,d
fookfgr ;qxy vk, rc (N – 225) cjkcj gS&
Ans. 15
18. 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:
ADVPC - 6
ekuk fd Pn ,d iafDr esa cSBs gq, ' n ' O;fDr;ksa esa ls 3 O;fDr;ksa ds p;u djus ds dqy rjhdksa dks iznf'kZr djrk gS
tcfd muesa ls dksbZ Hkh nks Øekxr ugha gS vkSj Qn mu laxr rjhdksa dks iznf'kZr djrk gS tcfd os ,d o`Ùk esa cSBs
gksA ;fn Pn  Qn = 6 gks] rks ' n ' cjkcj gksxk&
Ans. 10
19^. The number of ways selecting 8 books from a library which has 10 books each of Mathematics,
Physics, Chemistry and English, if books of the same subject are alike, is (N2 – 4) then N is equal to
,d iqLrdky; esa xf.kr] HkkSfrdh] jlk;u 'kkL=k vkSj vaxzsth izR;sd fo"k; dh 10 iqLrdsa gSaA ;fn ,d fo"k; dh lHkh
iqLrds ,d leku gks] rks iqLrdky; esa ls 8 iqLrdsa p;u djus ds dqy rjhdsa (N2 – 4) gS rc N cjkcj gSA
Ans. 13
20.^ The number of three digit numbers of the form xyz such that x < y and z  y is N then (N–225) is equal
to
xyz :i dh rhu vadks dh la[;kvksa dh la[;k N gksxh tcfd x < y vkSj z  y gksxh rc (N–225) cjkcj gS&
Ans. 51
PART - III : ONE OR MORE THAN ONE OPTIONS CORRECT TYPE

Hkkx - III : ,d ;k ,d ls vf/kd lgh fodYi çdkj
1. 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
,d ijh{kk esa] ,d ijh{kkFkhZ dks mu lHkh pkj fo"k;ksa esa ikl gksuk vko';d gSa ftUgs og i<+ jgk gSaA og fdrus rjhdksa
ls Qsy gks ldrk gSa&
(A) 4P1 + 4P2 + 4P3 + 4P4 (B) 44 – 1
(C*) 24 – 1 (D*) 4C1 + 4C2 + 4C3 + 4C4
2. 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:
,d ulZjh d{kk dh f'kf{kdk viuh d{kk ds 25 cPpksa dks 5–5 ds leqgksa esa fpfM+;k?kj fn[kkus ys tkrh gS tcfd mUgh
leku 5 cPpksa ds lewg dks nwckjk ugha ys tk;k tkrk gS] rks f'kf{kdk fdlh ,d cPps ds Hkze.kksa dh la[;k ls fdruh
T;knk ckj Hkze.k djsxh&
(A*) 25C5  24C4 (B*) 24C5 (C) 25C5  24C5 (D) 24C4
3. 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:
,d fo|kFkhZ dks ,d ijh{kk esa 13 iz'uksa esa ls 10 iz'uksa ds mÙkj nsus gSaA og fdrus rjhdksa ls mÙkj ns ldrk gS ;fn
mls izFke 5 iz'uksa esa ls de ls de 3 ds mÙkj nsuk vko';d gks \
(A*) 276 (B) 267
(C*) 13C10 – 5C3 (D*) 5C3 . 8C7 + 5C4 . 8C6 + 8C5
4. Number of ways in which 3 different numbers in A.P. can be selected from 1, 2, 3,...... n is:
(n  2)(n  4) n2  4n  5
(A) if n is even (B) if n is odd
4 2
n  12 if n is odd n n  2
(C*) (D*) if n is even
4 4
la[;kvksa 1, 2, 3,...... n esa ls lekUrj Js<+h esa 3 fHkUu&fHkUu la[;k,¡ fdrus izdkj ls pquh tk ldrh gSa \
(n  2)(n  4) n2  4n  5
(A) ;fn n le gSa (B) ;fn n fo"ke gSa
4 2
ADVPC - 7
n  12 ;fn n n  2
(C) n fo"ke gSa (D) ;fn n le gSa
4 4
5. 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.
(A*) m+nCm (B*) m+nCn (C) m+nC|m–n| (D) m+nC|n–m|
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 loZle flDdksa ds O;ofLFkr djus ds rjhdksa
dh la[;k gksxh tcfd O;oLFkkiu dsUnzh; fpUg ds nksuksa rjQ lefer gksA
6. The number of ways in which 10 students can be divided into three teams, one containing 4 and others
3 each, is
10 fo|kfFkZ;ksa dks 3 Vheksa esa fdrus izdkj ls foHkkftr fd;k tk ldrk gSa ;fn ,d Vhe esa 4 fo|kFkhZ gSa vkSj 'ks"k nks esa
izR;sd esa 3 fo|kFkhZ gks \
10 ! 10 ! 1
(A) (B*) 2100 (C*) 10C4 . 5C3 (D) .
4 ! 3 ! 3 ! 6 ! 3 ! 3 ! 2
7. If all the letters of the word 'AGAIN' are arranged in all possible ways & put in dictionary order, then
(A*) The 50th word is NAAIG (B*) The 49th word is NAAGI
(C*) The 51 word is NAGAI
st
(D*) The 47th word is INAGA
;fn 'AGAIN' 'kCn ds lHkh v{kjksa dks lHkh lEHko rjhdksa ls O;ofLFkr dj 'kCndks"k ds Øe esa j[kk tk;s] rc
(A*) 50ok¡ 'kCn NAAIG gS (B*) 49ok¡ 'kCn NAAGI gS

(C*) 51ok¡ 'kCn NAGAI gS (D*) 47ok¡ 'kCn INAGA gS
8. 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
fofHkUu jaxks (dkyh] lQsn] yky...) dh 8 xsanks dks ,d iafDr esa fdrus rjhdksa ls O;ofLFkr fd;k tk ldrk gS ;fn
fo'ks"k jax dh nks xsans ¼ekukfd yky vkSj lQsn½ dHkh Hkh ,d lkFk u vk;sa \
(A*) 8 !  2.7 ! (B*) 6. 7 ! (C*) 2. 6 !. 7C2 (D) buesa ls dksbZ ugha
9. Consider the word 'MULTIPLE' then in how many other ways can the letters of the word 'MULTIPLE' be
arranged ;
(A*) without changing the order of the vowels equals 3359
(B*) keeping the position of each vowel fixed equals 59
(C*) without changing the relative order/position of vowels & consonants is 359
(D*) using all the letters equals 47! – 1
MULTIPLE 'kCn ds v{kjksa dks fdrus vU; rjhdksa ls O;ofLFkr fd;k tk ldrk gSaA tcfd
(A) Lojksa dk Øe vifjofrZr jgs] rc Øep; 3359 ds cjkcj gSA
(B) izR;sd Loj dk LFkku fuf'pr jgs] rc Øep; 59 ds cjkcj gSA
(C) Lojksa vkSj O;atuksa dk lkis{k Øe@LFkku vifjofrZr jgs] rc Øep; 359 gS
(D*) lHkh v{kjksa dh lgk;rk ls cuus okys 'kCnksa dh dqy la[;k 47! – 1 gSA
10. 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{kjksa AAAAA, BBB, CCC, D, EE vkSj F dks ,d iafDr esa fdrus izdkj ls O;ofLFkr dj ldrs gS tcfd v{kj c
,d nwljs ls vyx jgs&
ADVPC - 8
12! 13! 14! 13!

(A*) 13C3. (B) (C) (D*) 11.
5! 3! 2! 5 ! 3! 3 ! 2 ! 3 ! 3! 2 ! 6!
11. The number of non-negative integral solutions of x1 + x2 + x3 + x4  n (where n is a positive integer) is

x1 + x2 + x3 + x4  n (tgk¡ n ,d /kukRed iw.kk±d gSa) ds v_.kkRed iw.kk±d gyksa dh la[;k gSa &
(A) n+3C3 (B*) n+4C4 (C) n+5C5 (D*) n+4Cn
12. 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:
,d flusek?kj dh izFke iafDr esa 10 lhVksa ij pkj O;fDr;ksa dks fdrus rjhdksa ls cSBk;k tk ldrk gS] tcfd dksbZ Hkh
nks O;fDr ikl&ikl u cSBsa \
(A) 7C4 (B*) 4. 7P3 (C*) 7C3. 4 ! (D*) 840
13. C36 is divisible by

50
C36 fdlls foHkkftr gS&

50
(A*) 19 (B*) 52 (C) 192 (D) 53
14. Pn is equal to
2n
Pn dk eku gSa &

2n
(A*) (n + 1) ( n + 2) ..... (2n) (B*) 2n [1 . 3 . 5 .....(2n – 1)]

(C*) (2) . (6) . (10) .... (4n – 2) (D*) n! (2nCn)
15. The number of ways in which 200 different things can be divided into groups of 100 pairs, is:
200 fHkUu&fHkUu oLrqvksa dks 100 ;qXeksa esa fdrus rjhdksa ls foHkkftr fd;k tk ldrk gSa&
200 !  101   102   103   200 
(A) (B*)       ....  
2100
 2  2  2   2 
200 !
(C*) 100
(D*) (1. 3. 5...... 199)
2 (100) !
PART - IV : COMPREHENSION
Hkkx - IV : 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.
1. Number of committees consisting of at least two non-official members, are

(A*) 456 (B) 546 (C) 654 (D) 466
2. Number of committees in which a particular official member is never included, are

(A) 264 (B) 642 (C) 266 (D*) 462
vuqPNsn # 1
8 ljdkjh vkSj 4 xSj&ljdkjh lnL; gS] bu 12 lnL;ksa esa ls 5 lnL;ksa dh ,d lfefr cukbZ tkrh gSA rks
fuEufyf[kr iz'uksa ds mÙkj nhft,A
1. de ls de nks xSj&ljdkjh lnL;ksa dks ysdj cukbZ tkus okyh lfefr;ksa dh la[;k gS &
(A) 456 (B) 546 (C) 654 (D) 466
ADVPC - 9
2. ,d fo'ks"k ljdkjh lnL; dks dHkh lfEefyr ugha djrs gq, cukbZ tkus okyh lfefr;ksa dh la[;k gS &
(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.
3. The value of n is
(A) 360 (B*) 720 (C) 240 (D) 840
4. The value of m is
(A*) 3780 (B) 3870 (C) 3670 (D) 3760
vuqPNsn # 2
ekuk fd 'kCn "RESONANCE" ds v{kjksa dks O;ofLFkr djus ds mu rjhdksa dh la[;k gS ftuesa Loj le LFkkuksa ij
vkrs gS] n gSa vkSj 'kCn "RESONANCE" ds v{kjkas dks O;ofLFkr djus ds mu rjhdksa dh la[;k gS ftuesa v{kj R, S,
O, A, blh Øe eas vkrs gSa] m gS rks fuEufyf[kr iz'uksa ds mÙkj nhft, &
3. n dk eku gS &
(A) 360 (B) 720 (C) 240 (D) 840
4. m dk eku gS &
(A*) 3780 (B) 3870 (C) 3670 (D) 3760
Comprehension # 3
A mega pizza is to be sliced n times, and Sn denotes maximum possible number of pieces.
5. Relation between Sn & Sn– 1

(A) Sn = Sn–1 + n + 3 (B) Sn = Sn–1 + n + 2 (C) Sn = Sn–1 + n + 2 (D*) Sn = Sn–1 + n
6. If the mega pizza is to be distributed among 60 person, each one of them get atleast one piece then
minimum number of ways of slicing the mega pizza is :
(A) 10 (B) 9 (C) 8 (D*) 11
vuqPNsn # 3 (Q. no. 5 to 6)
,d cM+s ihtk ds n VqdM+s fd, tkrs gS vkSj VqdM+ksa dh vf/kdre laHkkfor la[;k Sn gSA
5. Sn vkSj Sn– 1 esa lEcU/k gS&

(A) Sn = Sn–1 + n + 3 (B) Sn = Sn–1 + n + 2 (C) Sn = Sn–1 + n + 2 (D*) Sn = Sn–1 + n
6. ;fn ,d cM+s ihtk dks 60 O;fDr;ksa esa ckVk tkrk gS rc muesa ls izR;sd de ls de ,d VqdM+k izkIr djrk gS rc cM+s
ihtk ds fd, x, VqdM+ks ds U;wure Øep;ksa dh la[;k gS&
(A) 10 (B) 9 (C) 8 (D*) 11
10
ADVPC - 10

PART - I : JEE (ADVANCED) / IIT-JEE PROBLEMS (PREVIOUS YEARS)

Hkkx - I : JEE (ADVANCED) / IIT-JEE ¼fiNys o"kksZ½ ds iz'u
* Marked Questions may have more than one correct option.
* fpfUgr iz'u ,d ls vf/kd lgh fodYi okys iz'u gS -
1. If r, s, t are prime numbers and p, q are the positive integers such that the LCM of p, q is r 2 t4s2, then the
number of ordered pair (p, q) is [IIT-JEE-2006, (3, –1), 184]
;fn r, s, t vHkkT; la[;k,¡ gks rFkk p, q /kukRed iw.kk±d bl izdkj gks fd p rFkk q dk y-l-i- r2 t4s2 gS] rks Øfer
;qXeksa (p, q) dh la[;k gksxh – [IIT-JEE-2006, (3, –1), 184]
(A) 252 (B) 254 (C*) 225 (D) 224
2. 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 'kCn ds v{kjksa ls fufeZr lHkh 'kCnksa dks vaxsth 'kCn dks"k ds Øekuqlkj O;ofLFkr fd;k tk;s] rks 'kCn
COCHIN ds Øe ls iwoZ dqy fdrus 'kCn gSA
(A) 360 (B) 192 (C*) 96 (D) 48
[IIT-JEE-2007, P-II, (3, – 1), 81]
3. 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]
Column I
Column II
(A) The number of permutations containing the word ENDEA is (p) 5!

(B) The number of permutations in which the letter E occurs in the first (q) 2 × 5!
and the last positions is
(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)
'kCn ENDEANOEL ds v{kjksa ds lHkh lEHkkfor Øep; yhft;s Column I esa fn;s x;s izdFku@O;atdksa dk dkWye
Column II esa fn;s x;s dFkuksa ls lqesy djsa vkSj viuk mÙkj 4 × 4 eSfVªDl ds mfpr cqYyksa (bubbles) dks dkyk
djds n'kkZ,a
[IIT-JEE-2008, P-II, (6, 0), 81]
dkWye I dkWye II
(A) 'kCn ENDEA dks lfEefyr djus okys Øep;ksa dh la[;k gS (p) 5!
(B) izFke vkSj vafre nksuks LFkkuksa ij v{kj E okys Øep;ksa dh la[;k gS (q) 2 × 5!
(C) vafre ik¡p LFkkuksa ij D, L vkSj N esa ls dksbZ v{kj u vkus okys Øep;ksa (r) 7 × 5!
dh la[;k gS
(D) dsoy fo"ke LFkkuksa ij gh v{kj A, E, O vkus okys Øep;ksa dh la[;k gS (s) 21 × 5!
ADVPC - 1
Ans. (A) (q), (B) (s), (C) (q), (D) (q)
IIT-JEE 2009
4. 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.kkZdksa dh la[;k] ftuds vadks dk ;ksx 10 gS vkSj tks dsoy 1, 2 o 3 vadksa ls cuh gksa] og gS
(A) 55 (B) 66 (C*) 77 (D) 88
5. 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 S ds vla;qDr mileqPp;ksa ds vØfer ;qXeksa dh dqy la[;k fuEu gS
(A) 25 (B) 34 (C) 42 (D*) 41
[IIT-JEE-2010, Paper-2, (5, –2), 79]
6. The total number of ways in which 5 balls of different colours can be distributed among 3 persons so
that each person gets at least one ball is [IIT-JEE 2012, Paper-1, (3, –1), 70] [P & C]
fofHkUu jaxksa dh ikap xsanksa dks rhu yksxksa esa bl izdkj ck¡Vus ds dqy rjhdksa dh la[;k ftlesa izR;sd O;fDr dks de ls
de ,d xsan vo'; feys] fuEu gS
(A) 75 (B*) 150 (C) 210 (D) 243
Paragraph for Question Nos. 8 to 9
iz'u 8 ls 9 ds fy, vuqPNsn
Let an denote the number of all n-digit positive integers formed by the digits 0,1 or both such that no
consecutive digits in them are 0. Let bn = the number of such n-digit integers ending with digit 1 and cn =
the number of such n-digit integers ending with digit 0.
ekukfd an mu lHkh n- vadksa okys /kukRed iw.kk±dksa (n-digit positive integers) dh la[;k gS tks 0, 1 vFkok nksuksa
vadksa ls curs gS vkSj ftuesa vad 0 Øfed (consecutive) ugha gSA eku yas fd bn = mijksDr mu lHkh n- vadkas okys
/kukRed iw.kk±dksa dh la[;k ftuds var esa vad 1 gS] vkSj cn= mijksDr mu lHkh n- vadksa okys /kukRed iw.kk±dksa dh
la[;k ftuds var esa vad 0 gSA
7. Which of the following is correct ? [IIT-JEE 2012, Paper-2, (3, –1), 66]
fuEu esa ls dkSu lk dFku lgh gS ?
(A*) a17 = a16 + a15 (B) c17  c16 + c15 (C) b17  b16 + c16 (D) a17 = c17 + b16
8. The value of b6 is

b6 dk eku D;k gS ?
(A) 7 (B*) 8 (C) 9 (D) 11
9. Let n1 < n2 < n3 < n4 < n5 be positivie integers such that n1 + n2 + n3 + n4 + n5 = 20. Then the number of
such distinct arrangements (n1, n2, n3, n4, n5) is
;fn n1 < n2 < n3 < n4 < n5 bl izdkj ds /kukRed iw.kk±d gS ftuds fy, n1 + n2 + n3 + n4 + n5 = 20 gSA rc ,sls
fofHkUu foU;klksa (distinct arrangements) (n1, n2, n3, n4, n5) dh dqy la[;k gSA
[JEE (Advanced) 2014, Paper-1, (3, 0)/60]
Ans. (7)
10. Let n  2 be an integer. Take n distinct points on a circle and join each pair of points by a line segment.
Colour the line segment joining every pair of adjacent points by blue and the rest by red. If the number
of red and blue line segments are equal, then the value of n is
ekuk fd n  2 ,d iw.kkZad gSA ,d o`Ùk ij n fofHkUu fcUnq ysdj mu fcUnqvksa ds izR;sd ;qXe dks js[kk[k.M ls tksMsA
bu js[kk[k.Mksa esa ls vklUu fcUnqvksa (adjacent points) dks tksM+us okys izR;sd js[kk[k.M dks uhyk rFkk vU;
js[kk[k.Mksa dks yky jax nsaA ;fn yky o uhys js[kk[k.Mksa dh la[;k leku gS rks n dk eku gS :
[JEE (Advanced) 2014, Paper-1, (3, 0)/60]
Ans. (5)
ADVPC - 2
11. Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so
that each envelope contains exactly one card and no card is placed in the envelope bearing the same
number and moreover the card numbered 1 is always placed in envelope numbered 2. Then the
number of ways it can be done is [JEE (Advanced) 2014, Paper-2, (3, –1)/60]
(A) 264 (B) 265 (C) 53 (D) 67
N% dkMZ vkSj N% fyQkQs 1, 2, 3, 4, 5, 6 vadksa ls lwphc) gSA dkMkZsa dks fyQkQksa esa bl rjg Mkyuk gS fd gj
fyQkQs esa dsoy ,d gh dkMZ gks] dkMZ o fyQkQs ij vafdr la[;k leku u gks rFkk dkMZ la[;k 1 ges'kk fyQkQk
la[;k 2 esa gh gks] rks bldks djus ds dqy rjhdksa dh la[;k gS&
[JEE (Advanced) 2014, Paper-2, (3, –1)/60]
(A) 264 (B) 265 (C*) 53 (D) 67
Ans. (C)
12. Let n be the number of ways in which 5 boys and 5 girls can stand in a queue in such a way that all the
girls stand consecutively in the queue. Let m be the number of ways in which 5 boys and 5 girls can
stand in a queue in such a way that exactly four girls stand consecutively in the queue. Then the value
m
of is
n
ekuk fd n rjhdksa ls 5 yM+ds vkSj 5 yM+fd;k¡ ,d iafDr esa bl çdkj [kM+s gks ldrs gSa fd lHkh yM+fd;k¡ iafDr esa
Øekxr (consecutively) [kM+h gksaA ekuk fd m rjhdksa ls 5 yM+ds vkSj 5 yM+fd;k¡ ,d iafDr esa bl çdkj [kM+s gks
m
ldrs gS fd Bhd (exactly) 4 yM+fd;k¡ gh iafDr esa Øekxr yM+dh gksaA rc dk eku gSA
n
[JEE (Advanced) 2015, P-1 (4, 0) /88]
Ans. 5
13. A debate club consists of 6 girls and 4 boys. A team of 4 members is to be selected from this club
including the selection of a captain (from among these 4 members) for the team. If the team has to
include at most one boy. Then the number of ways of selecting the team is
[JEE (Advanced) 2016, Paper-1, (3, –1)/62]
,d okn&fookn lewg (club) esa 6 yM+fd;k¡ vkSj 4 yM+ds gSaA bl lewg esa ls ,d pkj lnL;h; ny pquuk gS ftlesa
ny ds ,d dIrku (captain) ¼mUgha pkj lnL;ksa ls½ dk pquko Hkh lfEefyr gSA ;fn ny esa vf/kdre ,d yM+dk
lfEefyr gks rc ny dks pqusa tkus ds rjhdksa dh la[;k gS
(A*) 380 (B) 320 (C) 260 (D) 95
Ans. (A)
PART - II : JEE (MAIN) / AIEEE PROBLEMS (PREVIOUS YEARS)
Hkkx - II : JEE (MAIN) / AIEEE ¼fiNys o"kksZ½ ds iz'u

1. 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 (3, –1), 120]
;fn SACHIN 'kCn ds v{kjksa ls cuus okys lHkh lEHkkfor 'kCnksa dks vaxzsth 'kCndks'k ds vuqlkj Øe esa fy[kk tk,s rks
bu 'kCnksa esa SACHIN 'kCn dk Øekad gksxk &
(1) 602 (2) 603 (3) 600 (4*) 601
2. 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,
AB=BC=AC=
The number of ways to partition S is - [AIEEE 2007 (3, –1), 120]
ADVPC - 3
leqPPk; S : = {1, 2, 3 ..........12} dks rhu cjkcj leqPp;ksa A, B, o C esa bl izdkj foHkkftr djuk gS fd
A  B  C = S, [AIEEE 2007 (3, –1), 120]
AB=BC=AC=
rks S dks foHkkftr djus ds rjhdksa dh la[;k gS &
(1) 12!/3! (4!)3 (2) 12!/3!(3!)4 (3*) 12!/(4!)3 (4) 12!/(3!)4
3. In a shop there are five types of ice-creams available.. A child buys six ice-creams.
[AIEEE 2008 (3, –1), 105]
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
,d nqdku esa 5 izdkj dh vkbZlØhe miyC/k gS ,d cPpk 6 vkbZlØhe [kjhnrk gS [AIEEE 2008 (3, –1), 105]
Statement-1 : cPpsa ds 6 vkbZlØhe [kjhnus ds rjhdksa dh la[;k 10C5 gS
Statement-2 : cPps ds 6 vkbZlØhe [kjhnus ds rjhdksa dh la[;k] 6A' s o 4 B' dks ,d iafDr esa O;ofLFkr djus ds
rjhdksa dh la[;k ds cjkcj gS
(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
4. How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no
two S are adjacent ? [AIEEE 2008 (3, –1), 105]
MISSISSIPPI 'kCn ds lHkh v{kjksa dks lHkh laHkkfor rjhdksa ls O;ofLFkr djus ij fdrus fHkUu 'kCn cuk,s tk ldrs
gS ;fn dksbZ nks S lkFk ugha vk,s ? [AIEEE 2008 (3, –1), 105]
(1) 8. 6C4 . 7C4 (2) 6. 7 8C4 (3) 6. 8. 7C4 (4*) 7. 6C4 . 8C4
5. 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 (4, –1), 144]
(1) atleast 500 but less than 750 (2) atleast 750 but less than 1000
(3*) atleast 1000 (4) less than 500
6 fHkUu miU;klksa o 3 fHkUu 'kCndks'kksa esa ls 4 miU;kl o 1 'kCndks'k pquuk gS rFkk bUgsa ,d vkyekjh esa ,d iafDr esa
bl izdkj O;ofLFkr fd;k tk;s fd 'kCndks'k lnSo e/; esa jgs] rks blds rjhdksa dh la[;k gksxh &
[AIEEE 2009 (4, –1), 144]
(1) de ls de 500 ysfdu 750 ls de (2) de ls de 750 ysfdu 1000 ls de
(3) de ls de 1000 (4) 500 ls de
6. Statement-1 : The number of ways of distributing 10 identical balls in 4 distinct boxes such that no box
is empty is 9 C3 . [AIEEE 2011, I, (4, –1), 120]
Statement-2 : The number of ways of choosing any 3 places from 9 different places is 9 C3 .
(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.
dFku-1 : 10 ,d tSlh xsanksa dk 4 fofHkUu cDlksa esa ckaVus ds rjhdksa dh la[;k rkfd dksbZ cDlk [kkyh u gks] 9 C3 gSA
dFku-2 : 9 fofHkUu LFkkuksa esa ls 3 LFkku pqus tkus ds rjhdksa dh la[;k 9 C3 gSA [AIEEE 2011, I, (4, –1), 120]
(1) dFku-1 lR; gS] dFku-2 lR; gSA dFku-2, dFku-1 dh lgh O;k[;k gSA
(2) dFku-1 lR; gS] dFku-2 lR; gSA dFku-2, dFku-1 dh lgh O;k[;k ugh gSA
ADVPC - 4
(3) dFku-1 lR; gS] dFku-2 vlR; gSA

(4) dFku-1 vlR; gS] dFku-2 lR; gSA
7. There are 10 points in a plane, out of these 6 are collinear. If N is the number of triangles formed by
joining these points. then : [AIEEE 2011, II, (4, –1), 120]
,d lery esa 10 fcUnq gSa] ftuesa ls 6 lajs[k gSaA ;fn bu fcUnqvksa ls cuus okyh f=kHkqtksa dh la[;k N gS] rks %
[AIEEE 2011, II, (4, –1), 120]
(1*) N  100 (2) 100 < N  140 (3) 140 < N  190 (4) N > 190
8. Assuming the balls to be identical except for difference in colours, the number of ways in which one or
more balls can be selected from 10 white, 9 green and 7 black balls is : [AIEEE-2012, (4, –1)/120]
;g ekurs gq, fd lHkh xsans le:i gSa rFkk muds jax fHkUu&fHkUu gSa] rks 10 lQsn] 9 gjh rFkk 7 dkyh xsanksa esa ls ,d
;k ,d ls vf/kd xsan fudkyus ds rjhdksa dh la[;k gS % [AIEEE-2012, (4, –1)/120]
(1) 880 (2) 629 (3) 630 (4*) 879
9. Let Tn be the number of all possible triangles formed by joining vertices of an n-sided regular polygon. If
Tn+1 – Tn = 10, then the value of n is : [AIEEE - 2013, (4, –1),360]
ekuk ,d n-Hkqtkvksa okyh lecgqHkqt ds 'kh"kks± dks feykdj cuus okys lHkh laHko f=kHkqtksa dh la[;k Tn gSA ;fn Tn+1 –
Tn = 10 gS] rks n dk eku gS : [AIEEE - 2013, (4, –1),360]
(1) 7 (2*) 5 (3) 10 (4) 8
10. The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without
repetition, is : [JEE(Main) 2015, (4, – 1), 120]
(1) 216 (2) 192 (3) 120 (4) 72
vadks 3, 5, 6, 7 rFkk 8 ds iz;ksx ls fcuk nksgjk;s] cuus okys 6,000 ls cMs+ iw.kkZdks dh la[;k gSA :
[JEE(Main) 2015, (4, – 1), 120]
(1) 216 (2) 192 (3) 120 (4) 72
Ans. (2)
11. If all the words (with or without meaning) having five letters, formed using the letters of the word SMALL
and arranged as in a dictionary; then the position of the word SMALL is : [JEE(Main) 2016, (4, – 1),
120]
‘'k‘Cn SMALL ds v{kjksa dk iz;ksx djds] ik¡p v{kjksa okys lHkh 'kCnksa (vFkZiw.kZ vFkok vFkZghu) dks 'kCndks"k ds
Øekuqlkj j[kus ij] '‘kCn SMALL dk LFkku gS :
(1) 59 oka (2) 52 oka (3) 58 oka (4) 46 oka
12. A man X has 7 friends, 4 of them are ladies and 3 are men. His wife Y also has 7 friends, 3 of them are
ladies and 4 are men. Assume X and Y have no common friends. Then the total number of ways in
which X and Y together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of X and
Y are in this party, is [JEE(Main) 2017, (4, – 1), 120]
,d O;fDr X ds 7 fe=k gS] ftuesa 4 efgyk,a gS rFkk 3 iq:”"kksa gS] mldh iRuh Y ds Hkh 7 fe=k gS] ftuesa 3 efgyk,a
rFkk 4 iq:”"k gSA ;g ekuk x;k gS fd X rFkk Y dk dksbZ mHk;fu”B (common) fe=k ugha gSA rks mu rjhdksa dh la[;k
ftuesa X rFkk Y ,d lkFk 3 efgykvksa rFkk 3 iq:”"kksa dks ikVhZ ij cqyk,a fd X rFkk Y izR;sd ds rhu&rhu fe=k vk;sa]
gS&
(1) 485 (2) 468 (3) 469 (4) 484
ADVPC - 5
SUBJECTIVE QUESTIONS
fo"k;kRed iz'u ¼SUBJECTIVE QUESTIONS½
1. How many positive integers are there such that n is a divisor of one of the numbers 1040, 2030?
fdruh /kukRed iw.kkZad la[;k,a bl izdkj dh gS fd la[;kvksa 1040, 2030 esa ls dksbZ ,d la[;k dk Hkktd n gS&
Ans. 2301
2. Six cards are drawn one by one from a set of unlimited number of cards, each card is marked with
numbers  1, 0 or 1. Number of different ways in which they can be drawn if the sum of the numbers
shown by them vanishes, is:
vlhfer iÙkksa ds ,d lewg esa ls ,d ds ckn ,d N% iÙks [khaps tkrs gSa vkSj izR;sd iÙks ij vad – 1, 0 ;k 1 fy[kk
gqvk gSA fdrus fofHkUu rjhdksa ls ;s iÙks [khaps tk ldrs gSa ;fn bu ij vkus okyh la[;kvksa dk ;ksx 'kwU; gksA
Ans. 141
3. A five letter word is to be formed such that the letters appearing in the odd numbered positions are
taken from the letters which appear without repetition in the word "MATHEMATICS". Further the letters
appearing in the even numbered positions are taken from the letters which appear with repetition in the
same word "MATHEMATICS". The number of ways in which the five letter word can be formed is:
ik¡p v{kjksa dk ,d 'kCn bl izdkj cuk;k tkrk gS fd fo"ke LFkkuksa ij vkus okys v{kj 'kCn "MATHEMATICS" ds
mu v{kjksa esa ls pqus tkrs gSa ftudh iqujko`fÙk ugha gks jgh gS rFkk le LFkkuksa ij vkus okys v{kj 'kCn
"MATHEMATICS" ds mu v{kjksa esa ls pqus tkrs gSa ftudh iqujko`fÙk gks jgh gSa] rks ik¡p v{kjksa dk 'kCn fdrus
rjhdksa ls cuk;k tk ldrk gSa \
Ans. 540
4. In how many ways 4 square are can be chosen on a chess-board, such that all the squares lie in a
diagonal line.
'krjat ds cksMZ ij pkj oxZ fdrus izdkj pqus tkrs gS fd lHkh oxZ ,d fod.kZ js[kk ij fLFkr gSA
Ans. 364
5. Find the number of functions f : A  B where n(A) = m , n(B) = t , which are non decreasing,
Qyu f : A  B esa Qyuksa dh la[;k Kkr dhft, tcfd n(A) = m , n(B) = t tks fd g~kleku ugha gS&
Ans. (t  m  1)cm ways
(t  m  1)cm rjhds
6. Find the number of ways of selecting 3 vertices from a regular polygon of sides ‘2n+1’ with vertices
A1, A2, A3 ,......, A2n+1 such that centre of polygon lie inside the triangle.
‘2n+1’ Hkqtkvksa okys lecgqHkqt ds 'kh"kksZ A1, A2, A3 ,......, A2n+1 esa ls 3 'kh"kksZ dk p;u djus ds ,sls rjhdksa dh la[;k
Kkr dhft;s ftuesa lecgqHkqt dk dsUnz p;fur 'kh"kksZ ls cus f=kHkqt ds vUnj fLFkr gksA
2n  1
Ans. ( 2nC2 – 3 nC2 .)
3
7. A operation * on a set A is said to be binary, if x * y  A , for all x, y  A, and it is said to be

commutative ,
if x * y = y * x for all x, y  A. Now if A = {a1, a2, ......, an}, then find the following -
(i) Total number of binary operations of A
(ii) Total number of binary operation on A such that
ai * aj  ai * ak, if j  k.
(iii) Total number of binary operations on A such that ai * aj < ai * aj + 1  i, j
ADVPC - 6
leqPp; A esa ,d lafØ;k * f}vk/kkjh gksxh] ;fn x * y  A,  x, y  A rFkk ;g Øefofues; gksxh]

;fn x * y = y * x,  x, y  A. vc ;fn A = {a1, a2, ......, an}, rks fuEu Kkr dhft,A
(i) leqPp; A esa dqy f}vk/kkjh lafØ;k,¡
(ii) leqPp; A esa dqy f}vk/kkjh lafØ;k,¡ bl izdkj fd ai * aj  ai * ak, ;fn j  k.
(iii) leqPp; A esa dqy f}vk/kkjh lafØ;k,¡ bl izdkj fd ai * aj < ai * aj + 1  i, j
2
Ans. (i) nn (ii) (n!)n (iii) 1
8. 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 ls 1000 rd ds iw.kk±dksa 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 izkIr ugha gks tkrh] rks vfpfUgr la[;kvksa dh la[;k Kkr dhft,A
Ans. 800
9. Find the number of ways in which n ‘1’ and n ‘2’ can be arranged in a row so that upto any point in the
row no. of ‘1’ is more than or equal to no. of ‘2’
n, ‘1’ rFkk n, ‘2’ dks ,d iafDr esa fdrus rjhdksa ls O;ofLFkr fd;k tk ldrk gS rkfd iafDr esa fdlh fcUnq rd ‘1’
dh la[;k ‘2’ dh la[;k ds cjkcj ;k mlls vf/kd gks \
2n
Cn
Ans.
n 1
10. Find the number of positive integers less than 2310 which are relatively prime with 2310.
2310 ls NksVh /kukRed iw.kkZadksa dh la[;k Kkr dhft, tks 2310 ds lkFk lgvHkkT; gSA
Ans. 480
11. In maths paper there is a question on "Match the column" in which column A contains 6 entries & each
entry of column A corresponds to exactly one of the 6 entries given in column B (and vice versa) written
randomly. 2 marks are awarded for each correct matching & 1 mark is deducted from each incorrect
matching. A student having no subjective knowledge decides to match all the 6 entries randomly. Find
the number of ways in which he can answer, to get atleast 25 % marks in this question.
xf.kr ds ,d iz'u i=k esa LrEHk feyku dk ,d iz'u gSa ftlesa LrEHk A esa 6 izfof"V;k¡ gS vkSj LrEHk A dh izR;sd
izfof"V LrEHk B esa ;kn`fPNd :i ls fy[kh gqbZ 6 izfof"V;ksa esa ls ,d ls esy [kkrh ¼vkSj ,sls gh mYVk Hkh½ gSaA izR;sd
lgh feyku ds fy;s 2 vad fn;s tkrs gSa vkSj izR;sd xyr feyku ds fy, 1 vad de dj fn;k tkrk gSaA ,d fo|kFkhZ
ftldks fo"k; dk dksbZ Kku ugha gSa] lHkh 6 izfof"V;ksa dks ;kn`fPNd :i ls feykus dk fu'p; djrk gSA og fdrus
rjhdksa ls mÙkj ns ldrk gSa rkfd mls bl iz'u esa de ls de 25% vad izkIr gks tk;s\
Ans. 56 ways
12. Find the number of positive unequal integral solution of the equation x + y + z = 20.
lehdj.k x + y + z = 20 ds /kukRed fHkUu&fHkUu iw.kk±d gyksa dh la[;k Kkr dhft,A
Ans. 144
13. If we have 3 identical white flowers and 6m identical red flowers. Find the number of ways in which a
garland can be made using all the flowers.
;fn gekjs ikl 3 loZle lQsn Qwy rFkk 6m loZle yky Qwy gS] rks bu lHkh Qwyksa dks iz;ksx esa ysrs gq, fdrus
rjg ls ekyk cuk;h tk ldrh gS\
Ans. 3m2 + 3m + 1
14. Number of times is the digit 5 written when listing all numbers from 1 to 105?
1 ls 105 dh lHkh la[;kvksa dks fy[kus ij vad 5 fdruh ckj fy[kk x;k gSA
Ans. 50000
ADVPC - 7
15. 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.
3n i=kksa ¼ftuesa ls n i=k, a izdkj ds gSa n i=k, b izdkj ds gSa rFkk 'ks"k i=k fHkUu gSaA½ esa ls n i=kksa ds fdrus lap;
cuk;s tk ldrs gSaA
Ans. (n + 2). 2n  1
16. In a row, there are 81 rooms, whose door no. are 1,2,.......,81, initially all the door are closed. A person
takes 81 round of the row, numbers as 1st round, 2nd round ........ 81th round. In each round, he
interchage the position of those door number, whose number is multiple of the round number. Find out
after 81st round,How many doors will be open.
,d iafDr esa 81 dejs gSa ftuds }kj la[;k 1, 2,......., 81 gSA izkjEHk esa lHkh }kj cUn gSA ;fn ,d O;fDr bl ia fDr
ds 81 pDdj yxkrk gS tks fd 1st pDdj, 2nd pDdj ........ 81 oka pDdj gSA ;fn izR;sd pDdj esa og ml }kj
dh fLFkfr dks ifjofrZr (interchage) dj nsrk gS ftldh }kj la[;k pDdj la[;k dk xq.kt gks] rks 81 osa pDdj ds
i'pkr~ dqy fdrus njokts [kqy tk;sxsa\
Ans. 9
17. Mr. Sibbal walk up 16 steps, going up either 1 or 2 steps with each stride there is explosive material on
the 8th step so he cannot step there. Then number of ways in which Mr. Sibbal can go up.
Jheku flCcy 16 dne Åij dh vksj pyrs gS] izR;sd pky esa 1 ;k 2 dne tkrs gSA muds ikl 8osa dne esa dksbZ
txg ugha gS tgk¡ og dne j[k ldrs gS rc Jheku flCcy ds Åij dh vksj dne j[kus ds rjhds gS&
Ans. 441
18. Number of numbers of the form xxyy which are perfect squares of a natural number.
xxyy :i dh la[;kvksa dh la[;k gksxh tks fd ,d izkÑr la[;k dk iw.kZ oxZ gSA
Ans. 1
19. A batsman scores exactly a century by hitting fours and sixes in twenty consecutive balls. In how many
different ways can he hit either six or four or play a dot ball?
,d cYysckt 20 Øekxr xsnksa esa 4 ju vkSj 6 ju dh lgk;rk ls Bhd ,d 'krd yxkrk gSA fdrus rjhdksa ls og
,slk dj ldrk gS ;fn fdlh Hkh xsan ij 4 ju] 6 ju vkSj [kkyh xsan ys ldrk gS&
20! 20! 20! 20!
Ans. + + +
10! 10! 7! 12! 4! 14! 2! 16! 3!
20. In how many ways can two distinct subsets of the set A of k(k  2) elements be selected so that they
have exactly two common elements.
k(k  2) vo;oksa ds leqPp; A ds nks fofHkUu mileqPp; dks fdrus izdkj ls pquk tk ldrk gS tcfd muesa Bhd 2
vo;o mHk;fu"B gksA
k  k  1
Ans. ((3)k–2 –1)
4
21. How many 5 digit numbers can be made having exactly two identical digit.
5 vadks dh la[;kvksa dh la[;k gksxh tks Bhd 2 loZle vadks ls cukbZ tk ldrh gSA
Ans. 45360
22. Find the number of 3-digit numbers. (including all numbers) which have any one digit is the average of
the other two digits.
3-vadks dh la[;kvksa dh la[;k Kkr dhft, ftlesa dksbZ Hkh ,d vad vU; nks vadks dk vkSlr gSA
Ans. 121
23. In how many ways can(2n + 1) identical balls be placed in 3 distinct boxes so that any two boxes
together will contain more balls than the third box.
(2n + 1) loZle xsanksa dks 3 fofHkUu lUnwdksa esa fdrus rjhdksa ls j[kk tk ldrk gS fd dksbZ Hkh nks lUnwd ,d lkFk]
rhljs lUnwd ls vf/kd xsan j[ksxkA
n  n  1
Ans.
2
ADVPC - 8
24. Let f(n) denote the number of different ways in which the positive integer 'n' can be expressed as sum
of 1s and 2s.
for example f(4) = 5 {2 + 2, 2 + 1 + 1, 1 + 2 + 1, 1 + 1 + 2, 1 + 1 + 1 + 1}. Now that order of 1s and 2s is
important. Then determine f(f(6))
ekuk f(n) fofHkUu Øep;ksa dh la[;k dks O;Dr djrk gS ftlesa /kukRed iw.kkZad 'n' dks 1 ;k 2 ds ;ksxQy ds :i esa
O;Dr fd;k tk ldrk gSA
mnkgj.k ds fy, f(4) = 5 {2 + 2, 2 + 1 + 1, 1 + 2 + 1, 1 + 1 + 2, 1 + 1 + 1 + 1} vc 1 ;k 2 ds Øe egRoiw.kZ gS
rc f(f(6)) Kkr dhft,A
Ans. 377
25. Prove that (n!)! is divisible by (n!)(n–1)!

fl) dhft, fd (n!)! , (n!)(n–1)! ls foHkkftr gSA
26. A user of facebook which is two or more days older can send a friend request to some one to join
facebook.
If initially there is one user on day one then find a recurrence relation for an where an is number of users
after n days.
,d Qslcqd dks dke esa ysus okyk O;fDr tks nks ;k vf/kd fnuksa iqjkus O;fDr dks Qslcqd esa 'kkfey gksus ds fy,
fuosnu djrk gS ;fn vkjEHk esa ,d fnu esa miHkksDrk gS rc an ds fy, izfrofrZ lEcU/k fyf[k;sa tgk¡ an , n fnuksa ds
ckn miHkksDrkvksa dh la[;k gSS&
Ans. an = an – 1 + an – 2
27. Let X = {1, 2, 3,.....,10}. Find the the number of pairs {A, B} such AX. B X. A  B and A  B = {5,7,8}.
ekuk X = {1, 2, 3,.....,10} rc {A, B} ;qXekas dh la[;k Kkr dhft, tc fd A  X. B  X. A  B rFkk
A  B = {5, 7, 8}.
Ans. 2186
28. Consider a 20-sided convex polygon K, with vertices A1, A2, . . . . , A20 in that order. Find the number of
ways in which three sides of K can be chosen so that every pair among them has at least two sides of
K between them. (For example (A1A2, A4A5, A11A12) is an admissible triple while (A1A2, A4A5, A19A20) is
not).
ekuk fd K ,d 20-Hkqtk okyk voeq[k cgqHkqt gS ftlds 'kh"kZ A1, A2,..., A20 mlh Øe esa gSA Kkr dhft, fd ,sls
fdrus rjhds gSa ftlesa K dh rhu Hkqtk,¡ bl rjg pquh tk ldrh gSa fd muesa ls izR;sd ;qXe esa chp esa K dh de
ls de nks Hkqtk,a gksaA
(mnkgj.kkFkZ (A1 A2, A4 A5, A11 A12) xzkg; f=kd gSa tc fd (A1 A2, A4 A5, A19 A20) ugha gSaA)
Ans. 520
29. Find the number of 4-digit numbers (in base 10) having non-zero digits and which are divisible by 4 but
not by 8.
4-vadksa dh la[;kvksa (vk/kkj 10 esa) dh la[;k gksxh ftlds v'kwU; vad gS vkSj tks 4 ls foHkkftr gS ijUrq 8 ls ughaA
Ans. 729
30. Find the number of all integer-sided isosceles obtuse-angled triangles with perimeter 2008.
ifjeki 2008 ds lHkh iw.kkaZd Hkqtkvksa ds lef}ckgq vf/kd dks.k f=kHkqtksa dh la[;k Kkr dhft,A
Ans. 86
31. Let ABC be a triangle. An interior point P of ABC is said to be good if we can find exactly 27 rays
emanating from P intersecting the sides of the triangle ABC such that the triangle is divided by these
rays into 27 smaller triangles of equal area. Determine the number of good points for a given triangle
ABC.
ADVPC - 9
ekuk fd ABC ,d f=kHkqt gSA blds varLFk fcUnq P dks mÙke (good) ekurs gSa tc ge bl fcUnq P ls fuxZr gqbZ Bhd
27 fdj.ksa Kkr dj ldrs gSa tks fd f=kHkqt ABC dh Hkqtkvksa dks izfrPNsfnr djrh gS vkSj f=kHkqt dks 27 le{ks=kQy
okys NksVs f=kHkqtksa esa foHkDr djrh gSA fdlh fn, x, f=kHkqt ABC ds fy, ,sls mÙke fcUnqvksa dh la[;k Kkr dhft,A
Ans. 26C
2
32. Let = (a1, a2, a3, ..., an) be a permutation of (1, 2, 3, ..., n). A pair (ai,aj) is said to correspond to an
inversion of , if i < j but ai > aj. (Example : In the permutation (2, 4, 5, 3, 1), there are 6 inversions
corresponding to the pairs (2, 1), (4, 3), (4, 1), (5, 3) (5, 1), (3, 1) . ) How many permutations of (1, 2, 3,
... n), (n  3), have exactly two inversions.?
ekukfd (1, 2, 3, ..., n)ds Øep; = (a1, a2, a3, ..., an) gSA ,d ;qXe (ai,aj) dks dk ,d O;qØe ds fy, laxr
dgk tkrk gS ;fn i < j ijUrq ai > aj (mnkgj.k ds fy, Øep; (2, 4, 5, 3, 1) esa 6 O;qRØe laxr ifj.kke ds ;qXe (2,
1), (4, 3), (4, 1), (5, 3) (5, 1), (3, 1) gSA) (1, 2, 3, ... n), (n  3) ds fdrus Øep;ksa ds Bhd nks
O;qRØe gS\
(n  1)(n  2)
Ans.
2
10
ADVPC - 10

Permutation & Combination: There Can Never Be Surprises in Logic... Wittgenstein, Ludwig

Uploaded by

Copyright:

Available Formats

Permutation & Combination: There Can Never Be Surprises in Logic... Wittgenstein, Ludwig

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Permutation & Combination: There Can Never Be Surprises in Logic... Wittgenstein, Ludwig

Uploaded by

Copyright:

Available Formats

Permutation & Combination

There can never be surprises in logic...Wittgenstein, Ludwig

(i) How many centres the circles altogether has ?

Solution : (i) Number of two digit numbers = 5 × 4 = 20

Self Practice Problems :

Self Practice Problems :

(iii) nCr = 0 if r  {0, 1, 2, 3........, n}

Example # 7 : There are fifteen players for a cricket match.

Example # 8 : If 49C3r – 2 = 49C2r + 1, find 'r'.

Self Practice Problems :

Arrangement of n things, those are not all different :

 The number of ways for the 2nd part = 35 × 56 = 1960.

containing m, n & p things respectively is

Example # 15 : In how many ways 10 persons can be divided into 5 pairs?

Self Practice Problems :

Selection of one or more objects

Self Practice Problems

(a) The total numbers of divisors of N including 1 & N is = (a + 1) (b + 1) (c + 1)........

Negative binomial expansion :

Coefficient of xr in this expansion = n+r1

Method of fictious partition :

Example # 22 : Find the number of solutions of the equation x + y + z = 6, where x, y, z  W.

= coefficient of x6 in (1 – x7)3 (1 – x)–3

Self Practice Problems:

Self Practice Problems:

where s is the largest positive integer such that ps  n < ps+1

Example # 26 : Find exponent 2 and 3 in 100!

 100   100   100   100 

 100   100   100   100 

 100   100   100   100 

 Exponent of 23 in 100! is 32.

 100   100   100   100 

 Exponent of (23 × 3) in 100! is min{48, 32} = 32

 Exponent of (24) in 100! is = 32

Self Practice Problems:

(31) Find the last non zero digits of 25!.

Ans (30) 0 (31) 4

There can never be surprises in logic...Wittgenstein, Ludwig

(i) o`Ùkksa ds dqy dsUnz fdrus gkasxs \

x.kuk ds vk/kkjHkwr fl)kUr (Fundamental counting principle) :

rhu vadks okyh la[;k,¡ = 5 × 4 × 3 = 60

gy : dqy 12 Qwyksa esa ls 3 yky] 4 ihys rFkk 5 lQsn gSA

lewgksa dk fuekZ.k (Formation of Groups) :

o`Ùkh; ;k pØh; Øep; (Circular Permutation) :

,d ;k vf/kd oLrqvksa dk p;u (Selection of one or more objects) :

_.kkRed f}in izlkj (Negative binomial expansion) :

dkYifud foHkktu dh fof/k (Method of fictious partition) :

dqy rjhds = 5!      = 44.

n! esa vHkkT; la[;k p dk ?kkarkd (Exponent of prime p in n!) :

tgk¡ s, vf/kdre /kukRed iw.kk±d gS tcfd ps  n < ps+1

 100   100   100   100 

 100   100   100   100 

 100   100   100   100 

 100   100   100   100 

 100! es (23 × 3) dk ?kkrkad] U;wure {48, 32} = 32

 100 esa (24) dk ?kkrkad = 32

Ans (30) 0 (31) 4

 Marked Questions may have for Revision Questions.

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

(A) 50ok¡ 'kCn NAAIG gS (B) 49ok¡ 'kCn NAAGI gS

(A) 19 (B) 52 (C) 192 (D) 53

(A) (n + 1) ( n + 2) ..... (2n) (B) 2n [1 . 3 . 5 .....(2n – 1)]