4 PERMUTATIONS AND

COMBINATIONS

FUNDAMENTAL PRINCIPLE OF COUNTING Sol. (i) Number of two digit numbers = 5 × 4 = 20

ADDITIONAL PRINCIPLE Number of three digit numbers = 5 × 4 × 3 = 60
Number of four digit numbers = 5 × 4 × 3 × 2 = 120
If a work can be done in m different ways and another work Total = 200
which is independent of first can be done in n different ways, (ii) Number of two digit numbers = 5 × 5 = 25
then either of the two operations can be preformed in (m + n) Number of three digit numbers = 5 × 5 × 5 = 125
ways. Number of four digit numbers = 5 × 5 × 5 × 5 = 625
Total = 775
Illustrating the Concepts
NOTATION OF FACTORIAL
There are 15 gates to enter a city from north and 10 gates to
enter the city from east. In how many ways a person can enter Notation of factorial and its algebra:
the city? The continued product of first n, natural number is called as “n
Number of ways to enter the city from north = 15 factorial” and dentoed by n! or n
Number of ways to enter the city from east = 10 n! = 1 · 2 · 3 · 4 · ... (n – 1)n!
A person can enter the city from northor from east. 4! = 4 · 3 · 2 · 1 = 24
Hence, the number of ways to enter the city = 15 + 10 = 25 3! = 1 · 2 · 3 = 6
5! = 120; 61 = 720; 7! = 5040
Multiplication Principle
Special Results:
If one operation (I) can be done in m different ways and  0! = 1 i.e. factorial of zero is 1
another Operation (II) can be performed in n different ways,  Factorial of negative number is underfined
then total number of ways in which both of these can be  (2n!) = 2n · n! [1 · 3 · 5 ... (2n – 1)]
performed together is m × n. If there are more than two
operations to be done, then the total number of different ways PERMUTATIONS
to do all of them together will be m × n × p × ... Each of different arrangement which can be made by taking
For example: Operation A can be performed in “a, b, c” some or all of a number of things is called a permutation. It is
different ways and operation B can be perfomred in p, q assumed that
different ways, then possible ways to perform operation A and  the given things let us say there are n of them are all
operation B together are a-p, a-q, b-p, b-q, c-p, c-q i.e., each distinct, that is, no two are alike.
way of operation A is combined by 2 ways operation B.  the arrangement is placing one thing next to another as
i.e., Total ways = 2 + 2 + 2 = 2 added 3 times = 2 × 3 = 6. in a straight line; hence it is also known as linear
permutation.
In general, total ways = m × n where m and n are individual  In any arrangement, any one thing is used only once. In
ways of performing the operations. other words, there is no repetition.
Counting Formulae for Permutation
TRAIN YOUR BRAIN The meaning of nPr
Example 1: How many numbers between 10 and 10,000 can be Suppose there are r blank spaces in a row and n different letters.
formed by using the digits 1, 2, 3, 4, 5 if The number of ways of filling up the blank spaces with n
different letters is the number of ways of arranging n things r at
(i) No digit is repeated in any number.
a time, i.e. nPr. It must be noted that each space has to be filled
(ii) Digits can be repeated. up with only one letter.
 n
Pr = n (n  1) (n  2) …….. (n  r + 1) Arrangement of n things when all are not distinct
n!  If given n things are not all distinct, then it is possible
=  n  r  ! (using factorial notation) that few many be of one kind, and few others may be of
second kind, etc. In such case, the number of
n! = n(n  1) ….. 3.2.1. where 0  r  n. permutations of n things taken all at a time, where p are
In particular alike of one kind, q are alike of second kind and r are
 The number of permutations of n different things taken alike of third kind and the rest n  (p + q + r) are all
all at a time = nPn = n! distinct is given by
 nP0 = 1, nP1 = n and nPn1 = nPn = n! n!
 nPr = n (n1Pr1) where r = 1, 2, …….. n. (p + q + r  n)
p!q!r!
Important Results
Number of permutations under certain conditions: TRAIN YOUR BRAIN
 Number of permutations of n different things, taken r at
a time, when a particular thing is to be always included Example 4: Consider word ASSASSINATION, first number of
ways of arranging the letters.
in each arrangement is r.  n 1Pr 1 .
(i) Number of words using all.
 Number of permutations of n different things, taken r at Sol. (i) ASSASSINATION contains four S, three A, two N
a time, when a particular thing is never taken in any and two I.
arrangement is n1Pr.
 Number of permutations of n different things, taken r at 13!
Total ways =
a time, when m particular things are never taken in any (4!) (3!) (2!) (2!)
arrangement is nmPr.
 Number of permutations of n different things, taken all Exponent of Prime p IN n!
at a time, when m specified things always come together Since, exponent of prime p in n! is denoted by Ep (n!), where p is
is (m !) (n  m + 1) !. a prime number and n is a natural number. Then the last integer
 Number of permutations of n different things, taken all amongst 1, 2, 3, ……, (n  1), n which is divisible by p is [n/p] p,
at a time, when m specified things never come together
where [n/p] denotes the greatest integer. ( [x]  x)
is n!  m! (n  m + 1) !
Ep (n !) = Ep (1, 2, 3 …..(n  1) . n)
Example 2: If all the letters of the word 'QUEST' are arranged in = Ep (p . 2p . 3p . ….. (n  1) p . [n/p] p)
all possible ways and put in dictionary order, then find the rank Because the remaining natural numbers from 1 to n are not
of the word QUEST. divisible by p.
Sol. Number of words beginning with E = 4P4 = 24 
n   n 
Number of words beginning with QE = 3P3 = 6 Thus,  p   E p  1.2.3...  p 
Number of words beginning with QS = 6     
Number of words beginning withQT = 6. n
Next word is 'QUEST' Now the last integer among 1, 2, 3, ….. ,  p  which is
 
 its rank is 24 + 6 + 6 + 6 + 1 = 43.
divisible by p is
PERMUTATION OF n DISTINCT OBJECT n / p  n  n  n 
WHEN REPETITION IS ALLOWED  p    p 2    p   E p  p.2p.3...  p2  p
         
If n distinct things are arrangement at r places when repetition
is allowed, then the number of arrangements are n
Because the remaining natural numbers from 1 to  p  are
n  n  ....  n  n r  
 . not divisible by p.
r times

n   n    n 
Thus,  p    p2   E p 1.2.3...  p 2 
TRAIN YOUR BRAIN       
Example 3: There are m men and n monkeys (n > m). If a man can Similarly, we get
have any number of monkeys, in how many ways may every n  n   n  n
monkey have a master? EP(n!) =     2    3   ....   S 
Sol. The first monkey can select his master by m ways, and after p p  p  p 
that the second monkey can select his master again by m ways, Where s is the largest natural number such that ps  n < ps+1
so can the third. And so on, hence all monkeys can select master Note: Er p (n !) = Er (n !) (If r > p)
by = m  m  m …. up to n times = (m)n ways. Where r and p are prime numbers.
PERMUTATIONS AND COMBINATIONS 79 P
W
 Important Results of Combinations (Selections)
TRAIN YOUR BRAIN
 The number of ways in which r objects can be selected
Example 5: Find the number of zeros at the end of 100 ! . from n distinct objects if a particular object is always
Sol. In terms of prime factors 100! can be written as included is n1Cr1.
2a . 3b . 5c . 7d ….  The number of ways in which r objects can be selected
Now from n distinct objects if a particular object is always
100  100  100  100  excluded is n1Cr.
E2(100!) =   2  3  4   The number of ways in which r objects can be selected
 2  2  2  2 
100  100  from n distinct objects if m particular objects are always
 5  6  included is nmCrm.
2  2 
 The number of ways in which r objects can be selected
= 50 + 25 + 12 + 6 + 3 + 1 = 97
from n distinct objects if m particular objects are always
100  100  excluded is nmCr.
and E5(100!) =   2 = 20 + 4 = 24
 5   5  Some Important Results About Points:
97 b 24 d
 100 ! = 2 . 3 . 5 . 7 ….. If there are n points in a plane which m (< n) are collinear, then
73 b
= 2 . 3 . (2  5) . 7 …. 24 d (a) The number of different straight lines obtained by joining
these n points is
= 273 . 3b . (10)24 . 7d …. n
C2 – mC2 + 1
Hence, number of zeros at the end of 100 ! is 24. (b) Total number of different triangles formed by joining
Exponent of 10 in 100 ! = min (97, 24) = 24. these n points is
n
C3 – mC3
COMBINATIONS (c) Number of diagonals in polygon of n sides is
Each of different grouping or selections that can be made by n
n(n  3)
some or all of a number of given things without considering the C2 – n i.e.
2
order in which things are placed in each group, is called (d) If m parallel lines in a plane are intersected by a family of
combinations.
other n parallel lines. Then total number of
Counting Formulae for Combinations parallelograms so formed is
The number of combinations (selections or groupings) that can m mn (m  1) (n  1)
C2  n C2 i.e.
be formed from n different objects taken r at a time is denoted 4
by nCr and its value is equal to (e) Number of triangles formed by joining vertices of convex
polygon of n sides is nC3 of which
n!
n
Cr = (0  r  n) (i) Number of triangles having exactly two sides
(n  r)!r! common to the polygon = n
n (ii) Number of triangles having exactly one side
Pr
n
as Cr = common to the polygon = n(n – 4)
r!
(iii) Number of triangles having no side common to
as in a permutation the arrangement of r selected objects out of
n, is done in r! ways and in combination arrangement in a group n(n  4) (n  5)
the polygon =
is not considered. 6
In particular
 nC0 = nCn = 1 i.e. there is only one way to select none or TRAIN YOUR BRAIN
to select all objects out of n distinct objects.
 nC1 = n There are n ways to select one thing out of n Example 6: Fifteen players are there for selection for a cricket
distinct things. match.
 nCr = nCnr (i) In how many ways the playing 11 can be selected?
Therefore nCx = nCy  x = y or x + y = n. (ii) In how many ways the playing 11 can be selected
 If n is odd then the greatest value of n C r is including a particular player?
n n (iii) In how many ways the playing 11 can be selected
C n 1
or C n 1 . excluding two particular players?
2 2
Sol. (i) 11 players are to be selected from 15
 If n is even then the greatest value of nCr is nCn/2.
Number of ways = 15C11 = 1365.

P 80 DROPPER JEE
W
 (ii) Since one player is already included, we have to Whereas when order of groups is not important, then
select 10 from the remaining 14
(mn)!
Number of ways = 14C10 = 1001. division into m equal group is done in ways.
m!(n!)m
(iii) Since two players are to be excluded, we have to
select 11 from the remaining 13.
Number of ways = 13C11 = 78. TRAIN YOUR BRAIN
Example 7: In how many ways we can select 4 letters from the
letters of the word MSSSSPP? Example 8: In how many ways 10 persons can be divided into
Sol. MSSSSPPM, SSSS, PP 5 pairs?
Number of ways of selecting 4 alike letters = 2C1 = 2. Sol. We have each group having 2 persons and the qualitative
Number of ways of selecting 3 alike and 1 different letters characteristic are same (Since there is no purpose mentioned or
= 2C1 × 3C1 = 6 names for each pair).
Number of ways of selecting 2 alike and 2 alike letters 10!
Thus the number of ways = = 945.
= 3C2 = 3 (2!)5 5!
Number of ways of selecting 2 alike & 2 different
= 3C1 × 3C2 = 9 CIRCULAR PERMUTATIONS
Number of ways of selecting 4 different = 4C4 = 1 In the event of the given n things arranged in a circular or even
Total number of ways = 2 + 6 + 3 + 9 + 1 = 21 elliptical permutation the first and the last thing in the
arrangement are indistinguishable.
DIVISION OF DISTINCT OBJECT INTO
GROUPS Arrangements Around a Circular Table
In the case of grouping we have the following. Consider five persons A, B, C, D, E be seated on the
If m + n + p things are divided into 3 groups one containing m, circumference of a circular table in order which has no head
the second n and the third p things; number of groupings is now, shifting A, B, C, D, E one position in anticlockwise direction
(m + n + p)
Cm .(n + p)Cn .pCp we will get arrangements as shown in following figure:
We observe that arrangements in all figures are different.
(m  n  p)! Thus, the number of circular permutations of n different
= where m, n, p are distinct natural numbers.
m!n!p! things taken all at a time is (n  1)!, if clockwise and anticlockwise
If m = n = p (say) then the number of groupings (unmindful orders are taken as different.
of the order of grouping) is E D C B A

3m! A D E C D B C A B E

(m!)3 3! C B A E D
B A E D C
Thus if 52 cards be divided into four groups of 13 each, the
(i) (ii) (iii) (iv) (v)
number of groupings is
52!
(13!) 4 .4! TRAIN YOUR BRAIN
On the other hand, when 52 cards are dealt 13 each to four Example 9: 20 persons were invited to a party. In how many
persons, the number of ways in which this can be done is ways can they and the host be seated at a circular table? In how
52! many of these ways will two particular persons be seated on
(13!) 4 either side of the host?
As another example, if we consider the division of 52 cards Sol. 1 st part: Total persons on the circular table
into four groups, three groups containing each 16 and the fourth = 20 guest + 1 host = 21 they can be seated in (21  1)! = 20!
cards, the number of ways in which this can be done is ways.
52! 2nd part: After fixing the places of three persons (1 host + 2
3!(16!)3 4! persons). Treating (1 host + 2 person) = 1 unit, so we have now
Note the 3 ! factor in the denominator. This is for the reason {(remaining 18 persons + 1 unit) = 19} and the number of
that there are only 3 equal groups. arrangement will be (19  1)! = 18! also these two particular
In general, the number of ways in which mn different things person can be seated on either side of the host in 2! ways.
(mn)! Hence, the number of ways of seating 21 persons on the
can be divided equally into m distinct groups is when
(n!)m circular table such that two particular persons be seated on
order of groups is important. either side of the host = 18!  2! = 2  18!

PERMUTATIONS AND COMBINATIONS 81 P

W
 P20 H P1 CASE II: If clockwise and anticlockwise orders are taken as not
P19 different, then the required number of circular
P2
P18 n
P3 Pr
permutations =
P17 2r
P4
P16
P5 TRAIN YOUR BRAIN
P15 Example 11: In how many ways can 24 persons be seated round
P6
a table, if there are 13 seats?
P14
P7 Sol. In case of circular table the clockwise and anticlockwise
P13 P8 order are different, then the required number of circular
24
P12 P9 P13 24!
P11 P10 permutations =  .
13 13  11!
Arrangements of beads or flowers (all different) around a Example 12: How many necklace of 12 beads each can be made
circular necklace or garland from 18 beads of various colours?
Consider five beads A, B, C, D, E in a necklace or five Sol. In the case of necklace there is not distinction between the
flowers A, B, C, D, E in a garland etc. If the necklace or garland clockwise and anticlockwise arrangements, then the required
on the left is turned over we obtain the arrangement on the 18
P12 18!
right, i.e., anticlockwise and clockwise order of arrangement is number of circular permutations = 2 12  6! 24
not different we will get arrangements as follows:  
we see that arrangements in above figures are not different. 18  17  16  15  14  13! 119  13!
Then the number of circular permutations of n different = =
6  5  4  3  2  1  24 2
1
things taken all at a time is (n  1) !, if clockwise and TOTAL NUMBER OF SELECTION
2
anticlockwise orders are taken as not different. Selection from Distinct Objects
F lip t o right
The number of ways (or combinations) of selection from n
D C C D distinct objects, taken at least one of them is
n
C1 + nC2 + nC3 + ...... + nCn = 2n – 1
Logically it can be explained in two ways, as one can be
selected in nC1 ways, two in nC2 ways and so on ……. and by
E B B E
addition principle of counting the total number of ways of doing
either of the job is
A A n
C1 + nC2 + …..+ nCn
Also, for every object, there are two choices, either
TRAIN YOUR BRAIN selection or non-selection. Hence total choices are 2n. But this
also includes the case when none of them is selected. Therefore
Example 10: Consider 21 different pearls on a necklace. How the number of selections, when atleast one is selected = 2n  1.
many ways can the pearls be placed in on this necklace such
that 3 specific pearls always remain together? TRAIN YOUR BRAIN
Sol. After fixing the places of three pearls. Treating 3 specific
pearls = 1 units, so we have now 18 pearls + 1 unit = 19 and the Example 13: Given five different green dyes, four different blue
number of arrangement will be (19  1)! = 18! also, the number of dyes and three different red dyes, how many combination of
ways of 3 pearls can be arranged between themselves is 3! = 6. dyes can be chosen taking at least one green, one blue dye?
Since, there is no distinction between the clockwise and Sol. Any one dye of a particular colour can be either chosen or
anticlockwise arrangements. So, the required number of not; and, thus there are 2 ways in which each one may be dealt
1 with.
arrangements = 18! . 6 = 3 (18 !). Number of ways of selection so that at least one green dye
2
is included = 25  1 = 31
Number of circular permutations of n different things taken r
(1 is subtracted to correspond to the case when none of
at a time
the green dyes is chosen.)
CASE I: If clockwise and anticlockwise orders are taken as A similar argument may be advanced in respect of other
different, then the required number of circular two colours also.
n
P Number of combinations = (25  1) (24  1) (23).
permutations = r .
r = 31  15  8 = 3720
P 82 DROPPER JEE
W
Selection from Identical Objects DIVISORS OF A GIVEN NATURAL NUMBER
1. The number of selections of r (r  n) objects out of n    
Let n  N and n = p1 1 .p 2 2 .p3 3 .......pk k , where p1, p2, p3, ….. pk are
identical objects is 1.
different prime numbers and 1, 2, 3, …. , k are natural
2. The number of ways of selections of at least one object
numbers then:
out of n identical object is n.
3. The number of ways of selections of at least one out of  the total number of divisors of N including 1 and n is
a1 + a2 ……. + an objects, where = (1 + 1) (2 + 1) (3 + 1) …. (k + 1)
a1 are alike of one kind, a2 are alike of second kind, and  the total number of divisors of n excluding 1 and n is
so on ……..an are alike of nth = (1 + 1) (2 + 1) (3 + 1) …. (k + 1)  2
kind, is (a1 + 1) (a2 + 1) …….(an + 1)  1.  the sum of these divisors is
4. The number of ways of selections of atleast one out of = (p10  p11  p12  .....  p11 ) (p 02  p12  p 22  .....  p 2 2 )
a1 + a2 + a3 + ……+ an + k objects,
where a1 are alike of one kind, ……….an are alike of nth (p 0k  p1k  p k2  .....  p kk )
kind and k are distinct is (a1 + 1) (a2 + 1).....(an + 1) 2k – 1.
(Use sum of G.P. in each bracket)
 the number of ways in which n can be resolved as a
TRAIN YOUR BRAIN product of two factors is
Example 14: Find the number of combinations that can be 1
( + 1) (2 + 1) …... (k + 1), if n is not a perfect
formed with 5 oranges, 4 mangoes and 3 bananas when it is 2 1
essential to take square
(i) at least one fruit 1
[(1 + 1) (2 + 1) …... (k + 1) + 1], if n is a perfect
(ii) one fruit of each kind. 2
Sol. Here 5 oranges are alike of one kind, 4 mangoes are alike of square
second kind and 3 bananas are alike of third kind  The number of ways in which composite number n can
(i) The required number of combinations (when at least be resolved into two factors which are relatively prime
one fruit) (or coprime) to each other is equal to 2k1 where k is the
= (5 + 1) (4 + 1) (3 + 1) 20  1 = 120  1 = 119 number of different factors (or different primes) in n.
(ii) The required number of combinations (when one fruit
of each kind)
= 5C1  4C1  3C1 = 5  4  3 = 60. TRAIN YOUR BRAIN
Example 16: If n = 10800, then find the
GRID PROBLEM
(a) total number of divisors of n
Complete cartesian plane is partitioned by drawing line || to x
(b) the number of even divisors
and y-axis equidistant apart like the lines on a chees board.
(c) the number of divisors of the form 4m + 2
Then the
Example 15: Number of ways in which an ant can reach from (1, (d) the number of divisors which are multiples of 15
1) to (4, 5) via shortest path. Sol. n = 10800 = 24  33  52
Sol. Whatever may be the mode of travel of the ant; it has to Any divisor of n will be of the form 2a  3b  5c where
traverse 3H (Horizontal) and 4V (Vertical) paths. 0  a  4, 0  b  3, 0  c  2.
7! For any distinct choices of a, b and c, we get a divisor of n
Hence required number of ways =  7 C3 (a) total number of divisors = (4 + 1) (3 + 1) (2 + 1) = 60
4!3!
(b) for a divisor to be even, a should be at least one. So
(4, 5) total number of even divisors = 4(3 + 1) (2 + 1) = 48.
(c) 4m + 2 = 2(2m + 1). In any divisor of the form
4m + 2, a should be exactly 1. So number of divisors of
the form 4m + 2 = 1 (3 + 1) (2 + 1) = 12.
(d) A divisor of n will be a multiple of 15 if b is at least one
and c is at least one. So number of such divisors = (4+
1)  3  2 = 30.
(1, 1)
O SUMMATION OF NUMBERS (3 DIFFERENT
WAYS)
Note: If there are n vertical and m horizontal lines then there will (a) Sum of all the numbers greater then 10000 formed by the
be (n – 1) horizontal and (m – 1) vertical paths. digits 1, 3, 5, 7, 9 if no digit being repeated.

PERMUTATIONS AND COMBINATIONS 83 P

W
Method 1: All possible numbers = 5! = 120 METHOD OF INCLUSION EXCLUSION
If one occupies the units place then total number = 24. If A1, A2 , ……… , Am are finite sets and A = A1  A2  ….  Am,
Hence 1 enjoys units place 24 times then
1
n(A) = a1  a2 + a3  a4 + ……. + (1)m+1 am
where a1 = n(A1) + n(A2) + …… + n(Am)
Similarly 1 enjoys each place 24 times
Sum due to 1 = 1 × 24 (1 + 10 + 102 + 103 + 104) a2 = 
1 i  j  m
n(A i  A j )
Similarly
Sum due to the digit 3 = 3 × 24(1 + 10 + 102 + 103 + 104) a3 = 
1 i  j  k  m
n(A i  A j  A k )
       and so on.
2 3 4
Required total sum = 24 (1 + 10 + 10 + 10 + 10 ) Corollary (Sieve-Formula)
(1 + 3 + 5 + 7 + 9) If A1, A2, ….. Am are m subsets of a set A containing N
Method 2: In 1st column there are twenty four 1’s, Twenty elements, then n(A1'  A '2  A m' )
four 3’s and so on and their sum is = 24 × 25 = 600
Hence add. in vertical column normally we get = 6666600 = N   n(A i ) + 
1 i j m
n(A i  A j )
i

5th 2nd 1st

– 
1 i  j k  m
n(A i  A j  A k )
X X X X X
+ .....+ (–1)mn (A1  A 2  .....  A m )
X X X X X
120
Number ·· ·· ·· ·· ·· DEARRANGEMENTS
· · · · ·
·· ·· ·· ·· ·· It is rearrangement of objects such that no one goes to its
· · · · ·
X X X X X
original place.
If n things are arranged in a row, the number of ways in
666 6 6 0 0 = 6666600 which they can be rearranged so that none of them occupies its
original placed is
Method 3: Applicable only if the digits used are such that  1 1 1
they have the same common difference. (valid even if the digits n!1   ....  (1) n 
 1! 2! n!
are repeating) Writing all the numbers in ascending order of
n
magnitude 1
It is denoted by Dn  n! (1) r
S = (13579 + 13597 + ... + 97513 + 97531) r 0 r!
S = (13579 + 99531) + (13597 + 97513) + ...
= (111110) 60 time = 6666600 Ans. TRAIN YOUR BRAIN
n Example 18: A person writes letters to six friends and addresses
S= (l + L) where n = number of numbers, l = smallest,
2 the corresponding envelopes. In how many ways can the letters
L = Largest be placed in the envelopes so that (i) at least two of them are in
ARRANGEMENT IN GROUPS the wrong envelopes. (ii) all the letters are in the wrong
envelopes.
The number of ways of distribution and arrangement of n distinct Sol. (i) The number of ways in which at least two of them are in
things into r different groups is n! n+r1Cr1 or n! n1Cr1 according the wrong envelopes
as empty groups are allowed or not allowed. 6
n
=  C n  r Dr
TRAIN YOUR BRAIN r2
= C D2 + nCn–3D3 + nCn–4D4 + nCn–5D5 + nCn–6D6
n
n–2
Example 17: In how many ways can three balls of different Here n = 6
colours be put in 4 glass cylinders of equal width such that any
6  1 1 6  1 1 1
glass cylinder may have either 0, 1, 2 or 3 balls? = C4 .2!1     C3 .3i 1    
1! 2! 1! 2! 3!
Sol. There are four glass cylinders. Consider additionally
 1 1 1 1
(4 – 1) = 3 things; and, the number of ways is 6C3 (corresponding  6 C2 .4!1     
 1! 2! 3! 4!
to (n + r – 1)Cr – 1) multiplied by 3! = 120.
P 84 DROPPER JEE
W
  1 1 1 1 1 Note: For use in problems of the above type the following
 6 C1 .5!1       Binomial expansions may be noted
 1! 2! 3! 4! 5! 
 1 1 1 1 1 1 1
 6 C0 .6!1        = (1 – x)1 = 1 + x + x2 + … + x r + …
 1! 2! 3! 4! 5! 6!  1 x
= 15 + 40 + 135 + 264 + 265 = 719.
1
(ii) The number of ways in which all letters be placed in = (1 – x)2 = 1 + 2x + 3x2 + … + (r + 1) x r + …
(1  x) 2
wrong envelopes
 1 1 1 1 1 1 1
= 6! 1        = (1 – x) 3 = 1 + 3x + 6x 2 + … +
 1! 2! 3! 4! 5! 6!  (1  x)3
1 1 1 1 1  (r  1)(r  2) r
= 720     
 2 6 24 120 720  1.2
x +....

= 360  120 + 30  6 + 1 = 265.

1
= (1 – x) 4 = 1 + 4x + 10x 2 + … +
(1  x) 4
TRAIN YOUR BRAIN
(r  1)(r  2)(r  3) r
Example 19: Four slip of papers with the numbers 1, 2, 3, 4 x  .....
written on them are put in a box. They are drawn one by one 1.2.3
(without replacement) at random. In how many ways it can 1
happen that the ordinal number of atleast one slip coincide with and more generally = (1 – x)p = 1 + px + …
(1  x) P
its own number?
Sol. Total number of ways = 4 ! = 24. (r  1)(r  2)...(r  p  1) r
The number of ways in which ordinal number of any slip + x +…
1.2.3...(p  1)
does not coincide with its own number is the number of
and the coefficient of x r in this general case is easily
 1 1 1 seen to be (r + p – 1)Cp – 1
dearrangements of 4 objects = 4 !     = 9
2! 3! 4!
Thus the required number of ways. = 24 – 9 = 15
TRAIN YOUR BRAIN
USE OF MULTIONOMIALS
Example 20: Let us consider the more general problem of
 If there are l objects of one kind, m objects of second
distributing n identical things given among r persons, each one
kind, n objects of third kind and so on; then the number
whom, can receive 0, 1, 2 or more things ( n).
of ways of choosing r objects out of these objects
(i.e., l + m + n + ….) is the coefficient of xr in the expansion Sol. Consider r brackets corresponding to the r persons.
of In each bracket take an expression given by 1 + x + x2 + …
(1 + x + x2 + x3 + …. x l) (1 + x + x2 + ….. + xm) + xn (the various powers of x; namely, 0, 1, 2, ..., n correspond to
(1 + x + x2 + ….. + xn) the number of things each person can have in the distribution)
Further if one object of each kind is to be included, then
In the continued product (1 + x + x2 + … + xn) ( ) ( ) ...
the number of ways of choosing r objects out of these
objects (i.e., l + m + n + ….) is the coefficient of x r in the repeated r times, collect the coefficient of xn. This coefficient
expansion of gives the required number of ways of distribution.
(x + x2 + x3 + …. x l) (x + x2 + x3 +….. + xm) (x + x2 + x3 + …..  the number of ways
+ xn) = Coefficient of xn in (1 + x + x2 + ... + xn) ( ) ( ) ... repeated r
 If there are l objects of one kind, m object of second times
kind, n object of third kind and so on; then the number
r
of possible arrangements/permutations of r objects out  1  x n 1 
n
of these objects (i.e., l + m + n + ….. ) is the coefficient of = Coefficient of x in 
 1  x 
xr in the expansion of
= Coefficient of xn in (1 – xn+1)r (1 – x)r
 x x2 x   x x2 xm 
r!1    .........    1    .......   = Coefficient of xn in (1 – x)r
 1! 2! !   1! 2! m! 
(r  1)(r  2)....(r  n  1)
 x x2 xn  = = (n + r – 1)C
1    .......   ....... 1.2.....(r  1) r1
 1! 2! n! 

PERMUTATIONS AND COMBINATIONS 85 P

W
An Alternative Method for the General Problem = 20) is 20. It is then we say that there is a solution corresponding
to x = 4; y = 5; z = 8; w = 3. Hence the number of solutions in the
In this case, we consider additionally (r – 1) things (this number
manner required is the coefficient of x20 in
is one less than r, the number of persons). It may be seen that
(1 + x + ...+ x20)4
the number of ways of dividing the n things among the r persons
4
as per the condition of the problem is (n + r – 1)C(r – 1).  1  x 21 
i.e. in 
 1  x 
TRAIN YOUR BRAIN i.e. in (1 – x21)4 (1 – x)–4
i.e. in (1 – x)–4 and this is = 23C3
Example 21: An unlimited number of Red, White, Blue and Green
(Note: In (1 – x)–4 coefficient of xn is (n + 3)C
balls are given. Ten balls are drawn. Find the number of ways of 3

selection. Method of Fictious Partition:

Sol. In this the expression in x to be considered is 1 + x + x2 + … Number of ways in which n identical things may be distributed
to correspond to the unlimited number available in each colour. among p persons if each person may receive none, one or more
There are four such colours. things is n+p1Cn.
The required number of ways
= Coefficient of x10 in [1 + x + x2 + ...]4
4
TRAIN YOUR BRAIN
10
 1  11  12  13
= Coefficient of x in   = = 286
1 x 6 Example 22: Find the number of ways in which 11 identical
apples can be distributed among 6 children, so that each child
Use of Multinomials in Solving Linear Equation receives at least one apple.
Multinomials can be used to solve linear equations. The method Sol. First give one apple to each child. There are remaining 5
is illustrated with the help of following illustrations. apples to be distributed among 6 children (so that each may
e.g. Find the number of non negative integral solutions of receive any number of apples not exceeding five).
x + y + z + w = 20. The number of ways required
Any one of the four variables can take from the value zero = (11 – 1)C6 – 1 = 10C5 = 252
to the value 20; and hence we construct a polynomial in a Alternatively, the number of ways of distribution is given
variable (say x) with x raised to different powers which would by the coefficient of x11 in (x + x2 + … + x11)6.
constitute the values that any one variable can take when the
equation is solved in the manner indicated. We, thus, consider Example 23: Find the number of solutions of the equation
the product expression, x + y + z = 6, where x, y, z  W.
(1 + x + x2 + ... + x20) (1 + x + .. + x20) (1 + x + ... + x20) Sol. Number of solutions = coefficient of x6 in (1 + x + x2 + .......
(1 + x + ... + x20) x6)3
four factors since there are four variables. If we take x4 in = coefficient of x6 in (1 – x7)3 (1 – x)–3
the first factor; x5 in the second; x8 in the third; then we take the = coefficient of x6 in (1 – x)–3
term x3 in the fourth so that the sum of the powers (4 + 5 + 8 + 3 = 3+6–1C6 = 8C2 = 28.

P 86 DROPPER JEE
W
 Topicwise Questions

Fundamental Principle of Counting 9. 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
1. The number of 10-digit numbers such that the product of
girls sit side by side, is:
any two consecutive digits in the number is a prime
(a) 36000 (b) 9080
number, is
(c) 3960 (d) 11600
(a) 1024 (b) 2048 10. 10 different letters of an alphabet are given. Words
(c) 512 (d) 64 with 5 letters are formed from these given letters, then
2. The number of six digit numbers that can be formed from the number of words which have atleast one letter
the digits 1, 2, 3, 4, 5, 6 & 7 so that digits do not repeat repeated is:
and the terminal digits are even is: (a) 69760 (b) 30240
(a) 144 (b) 72 (c) 99748 (d) None
(c) 288 (d) 720 11. In a conference 10 speakers are present. If S1 wants to
3. Number of positive integers which have no two digits speak before S 2 & S 2 wa nt s t o spea k aft er
having the same value with sum of their digits being 45, is S3, then the number of ways all the 10 speakers can
(a) 10 ! (b) 9 ! give their speeches with the above restriction if the
remaining seven speakers have no objection to speak
(c) 9 · 9 ! (d) 17 · 8 !
at any number is:
4. The number of signals that can be made with 3 flags
(a) 10C3 (b) 10P8
each of different colour by hoisting 1 or 2 or 3 above
10 !
the other, is: (c) 10P3 (d)
3!
(a) 3 (b) 7
12. 20 Passengers are to travel by a double decked bus
(c) 15 (d) 16 which can accommodate 13 in the upper deck and 7 in
Permutation and Combination under Conditions the lower deck. The number of ways that they can be
divided if 5 refuse to sit in the upper deck and 8 refuse
5. Number of cyphers at the end of 2002C1001 is to sit in the lower deck, is
(a) 0 (b) 1 (a) 25 (b) 21
(c) 2 (d) 200 (c) 18 (d) 15
6. If all the letters of the word "QUEUE" are arranged in 13. How many nine digit numbers can be formed using
all possible manner as they are in a dictionary, then the digits 2, 2, 3, 3, 5, 5, 8, 8, 8 so that the odd digits
the rank of the word QUEUE is: occupy even positions?
(a) 15th (b) 16th (a) 7560 (b) 180
(c) 17th (d) 18th (c) 16 (d) 60
7. 8 chairs are numbered from 1 to 8. Two women & 3 14. There are five different peaches and three different apples.
Number of ways they can be divided into two packs of
men wish to occupy one chair each. First the women
four fruits if each pack must contain atleast one apple, is
choose the chairs from amongst the chairs marked 1
(a) 95 (b) 65
to 4, then the men select the chairs from among the
(c) 60 (d) 30
remaining. The number of possible arrangements is:
(a) 6C3. 4C4 (b) 6P2. 4P3 Grouping
4 4
(c) C3. P3 (d) 4P2. 6P3 15. 9 students of class 12th of whom 2 from section A, 3 from
8. Number of words that can be made with the letters of section B and 4 from section C are available for inter school
the word "GENIUS" if each word neither begins with debate competition. Number of ways in which 4 students
G nor ends in S, is: can be selected so that there is atleast 1 from each
section, is
(a) 24 (b) 240 (a) 144 (b) 120
(c) 480 (d) 504 (c) 72 (d) 71

PERMUTATIONS AND COMBINATIONS 87 P

W
 16. A team of 8 students goes on an excursion, in two cars, of Distribution of Alike Objects
which one can seat 5 and the other only 4. If internal 23. The number of ways in which 10 identical apples can be
arrangement inside the car does not matter then the number distributed among 6 children so that each child receives
of ways in which they can travel, is atleast one apple is:
(a) 91 (b) 182 (a) 126 (b) 252
(c) 126 (d) 3920 (c) 378 (d) None of these
24. The number of terms in a complete homogeneous
Circular Permutation expression of degree n in x, y and z is
17. The number of ways in which 6 red roses and 3 white n (n  1)
(a) n (b)
roses (all roses different) can form a garland so that 2
all the white roses come together, is
(n  1) (n  2)
(a) 2170 (b) 2165 (c) (d) None
2
(c) 2160 (d) 2155
25. Number of ways of selecting 5 coins from coins three
18. The number of ways in which 5 beads, chosen from 8
each of Rs. 1, Rs. 2 and Rs. 5 if coins of the same
different beads be threaded on to a ring, is:
denomination are alike, is:
(a) 672 (b) 1344
(a) 9 (b) 12
(c) 336 (d) None (c) 21 (d) None
Selection and Permutation of Alike Objects Multinomial, De-arrangement and other Concepts
19. The number of words that can be formed by using the 26. The sum of all the numbers which can be formed by
letters of the word ‘MATHEMATICS’ that start as well using the digits 1, 3, 5, 7 all at a time and which have
as end with T, is no digit repeated, is
(a) 80720 (b) 90720 (a) 16 × 4! (b) 1111 × 3!
(c) 20860 (d) 37528 (c) 16 × 1111 × 3! (d) 16 × 1111 × 4!.
20. The number of permutations that can be formed by 27. The sum of all the four digit numbers which can be formed
arranging all the letters of the word ‘NINETEEN’ in using the digits 6,7,8,9 (repetition is allowed)
which no two E’s occur together. is (a) 2133120 (b) 2133140
8! (c) 2133150 (d) 2133122
5!
(a) (b) 28. The number of proper divisors of a pbqcrds where a, b,
3! 3! 3!  6 C 2
c, d are primes & p, q, r, s  N, is
(a) p q r s
5! 8! 6
(c) × 6C3 (d) × C 3. (b) (p + 1) (q + 1) (r + 1) (s + 1)  4
3! 5!
(c) p q r s  2
21. There are 2 identical white balls, 3 identical red balls and (d) (p + 1) (q + 1) (r + 1) (s + 1)  2
4 green balls of different shades. The number of ways in 29. N is a least natural number having 24 divisors. Then
which they can be arranged in a row so that atleast one the number of ways N can be resolved into two factors
ball is separated from the balls of the same colour, is: is
(a) 6 (7 ! – 4!) (b) 7 (6 ! – 4 !) (a) 12 (b) 24
(c) 8 ! – 5 ! (d) None (c) 6 (d) None of these
30. How many divisors of 21600 are divisible by 10 but
22. Number of 7 digit numbers the sum of whose digits is 61
not by 15?
is
(a) 10 (b) 30
(a) 12 (b) 24
(c) 40 (d) None
(c) 28 (d) None

P 88 DROPPER JEE
W
 Learning Plus

1. The number of 4 digit numbers that can be formed from 11. A man has 10 friends. In how many ways he can invite
the digits 0, 1, 2, 3, 4, 5, 6, 7 so that each number contain one or more of them to a party
digit 1 is (Repetition is not allowed) (a) 10! (b) 210
(a) 1225 (b) 1252 (c) 10! – 1 (d) 210 –1
(c) 750 (d) 480 12. The number of parallelograms that can be formed from a
2. A polygon has 35 diagonals, then the number of its sides set of four parallel lines intersecting another set of three
is parallel lines is
(a) 8 (b) 9 (a) 6 (b) 18
(c) 10 (d) 11 (c) 12 (d) 9
3. In how many ways can 10 balls be divided between two 13. The greatest possible number of points of intersection
boys, one receiving two and the other eight balls
of 8 straight lines and 4 circles is
(a) 45 (b) 75
(a) 32 (b) 64
(c) 90 (d) 65
(c) 76 (d) 104
4. In how many ways can 5 boys and 3 girls sit in a row so
14. Let Tn denote the number of triangles which can be formed
that no two girls are together
4
using the vertices of a regular polygon of n sides. If Tn+1
(a) 5 !  3 ! (b) P3  5 ! – Tn = 21, then n equals
6
(c) P3  5 ! (d) P3  3! 5
(a) 5 (b) 7
5. In how many ways can a girl and a boy be selected from (c) 6 (d) 4
a group of 15 boys and 8 girls 15. Out of 10 points in a plane 6 are in a straight line. The
(a) 15  8 (b) 15  8 number of triangles formed by joining these points are
23 23 (a) 100 (b) 150
(c) P2 (d) C2
(c) 120 (d) 140
6. If 15
C 3r 15 C r  3 , then the value of r is 16. There are n points in a plane of which p points are
collinear. How many lines can be formed from these points
(a) 3 (b) 4
(n p ) n
(c) 5 (d) 8 (a) C2 (b) C2  p C 2
7. In a football championship, there were played 153 matches. n
(c) C2  p C2  1 (d) n
C2  p C2  1
Every team played one match with each other. The number
of teams participating in the championship is 17. Out of 6 books, in how many ways can a set of one or
(a) 17 (b) 18 more books be chosen
(c) 9 (d) 13 (a) 64 (b) 63
8. In how many ways a team of 11 players can be formed (c) 62 (d) 65
out of 25 players, if 6 out of them are always to be 18. The number of ways of dividing 52 cards amongst four
included and 5 are always to be excluded players equally, are
(a) 2020 (b) 2002
(c) 2008 (d) 8002 52 ! 52 !
(a) (b)
9. In how many ways can a committee consisting of one or (13 !) 4 (13 !) 2 4 !
more members be formed out of 12 members of the
Municipal Corporation 52 ! 52 !
(c) (d)
(a) 4095 (b) 5095 4
(12 !) ( 4 !) (12 !) 2 4 !
(c) 4905 (d) 4090
19. If among the 13 cricket players 4 are bowlers, then in
10. The number of ways in which we can select three numbers
how many ways can we form a cricket team of 11 players
from 1 to 30 so as to exclude every selection of all even
in which at least 2 bowlers are included
numbers is
(a) 4060 (b) 3605 (a) 55 (b) 72
(c) 455 (d) 446 (c) 78 (d) 75

PERMUTATIONS AND COMBINATIONS 89 P

W
 20. To fill 12 vacancies there are 25 candidates of which five 24. The number of ways in which 6 men and 5 women can
are from scheduled caste. If 3 of the vacancies are dine at a round table if no two women are to sit together
reserved for scheduled caste candidates while the rest is given by
are open to all, then the number of ways in which the (a) 6! × 5! (b) 30
selection can be made (c) 5! × 4! (d) 7! × 5!
(a) 20 C7  5  20C8  10  20C9 25. The number of ways in which four letters of the word
‘MATHEMATICS’ can be arranged is given by
22
(b) C9  5 C3 (a) 136 (b) 192
(c) 22
C3  5C 3 (c) 1680 (d) 2454
26. Number of divisors of n = 38808 (except 1 and n) is
(d) 5 C3 22C9 (a) 70 (b) 68
21. In how many ways can 5 boys and 5 girls sit in a circle so (c) 72 (d) 74
that no two boys sit together 27. The total number of ways of selecting six coins out of 20
(a) 5! 5! (b) 4!  5! one rupee coins, 10 fifty paise coins and 7 twenty five
paise coins is
5! 5! (a) 28 (b) 56
(c) (d) 9!
2 (c) 37C6 (d) 37P 6
22. In how many ways a garland can be made from exactly 10 28. The number of positive integral solutions of abc = 30 is
flowers? (a) 30 (b) 27
(a) 10 ! (b) 9 ! (c) 8 (d) 16
29. In how many ways 3 letters can be posted in 4 letter-
9! boxes, if all the letters are not posted in the same letter-
(c) 2(9 !) (d) box
2
23. The number of ways in which 5 male and 2 female (a) 63 (b) 60
members of a committee can be seated around a round (c) 77 (d) 81
table so that the two female are not seated together is 30. The exponent of 3 in 100! is
(a) 480 (b) 600 (a) 33 (b) 44
(c) 720 (d) 840 (c) 48 (d) 52

Advanced Level Multiconcept Questions

M C Q / C O M P R E H E N S I O N / M AT C H I N G / 3. Which of the following statements are correct?

NUMERICAL (a) Number of words that can be formed with 6 of the
1. The kindergarten teacher has 25 kids in her class. She letters of the word "CENTRIFUGAL" if each word
takes 5 of them at a time, to zoological garden as often must contain all the vowels is 3 · 7!
as she can, without taking the same 5 kids more than (b) There are 15 balls of which some are white and the
once. Then the number of visits, the teacher makes to rest black. If the number of ways in which the balls
the garden exceeds that of a kid by: can be arranged in a row, is maximum then the number
(a) 25C5  24C4 (b) 24C5
25 24 of white balls must be equal to 7 or 8. Assume balls of
(c) C5  C5 (d) 24C4
2. Consider the word 'MULTIPLE' then in how many other the same colour to be alike.
ways can the letters of the word 'MULTIPLE' be (c) There are 12 things, 4 alike of one kind, 5 alike of
arranged; another kind and the rest are all different. The total
(a) without changing the order of the vowels equals number of combinations is 240.
3359 (d) Number of selections that can be made of 6 letters
(b) keeping the position of each vowel fixed equals 59 from the word "COMMITTEE" is 35.
(c) without changing the relative order/position of 4. The number of ways in which 10 students can be
vowels & consonants is 359
divided into three teams, one containing 4 and others
(d) Total number of words using all the letters equals
3 each, is
47!
P 90 DROPPER JEE
W
 9. Number of ways in which 6 different toys can be
10 !
(a) (b) 2100 distributed equally among 3 children is also equal to
4 !3!3! (a) number of ways in which all the letters of the word
KUMKUM can be arranged in a definite order.
10
10 ! 1 (b) number of different signals which can be obtained
(c) C4 . 5C3 (d) .
6 !3 !3 ! 2 from 10 different flags taken two at a time keeping
one above the other.
5. Consider the word D = F R E E W H E E L. Which of the
(c) number of ways in which five different marbles can
following statement(s) is/are correct
be placed in three different boxes so that no box
(a) Number of other ways in which the letters of the
remains empty.
word D can be arranged is 9P5.
(d) number of ways in which all the letters of the word
(b) Number of ways is which the letters of the word D
CALCULUS can be arranged without changing the
can be an arranged in a circle is 8P4 distisguishing
order and position of non alike letters.
between clockwise and anticlockwise.
10. Coefficient of x2 y3 z4 in the expansion of (x + y + z)9 is
(c) Number of ways in which the letters of the word D
equal to
can be arranged if vowels and consonants both are (a) the number of ways in which 9 things of which 2 alike
1 10 of one kind, 3 alike of 2nd kind, and 4 alike of 3rd kind can
in alphabetical order is C be arranged.
2 5
(d) If as many more words are formed as possible using (b) the number of ways in which 9 identical things can be
the letters of the word D the number of words which distributed in 3 persons each receiving atleast two
contain the word FEEL is 6P4. things.
(c) the number of ways in which 9 identical things can be
6. The number of ways of arranging the letters AAAAA,
distributed in 3 persons each receiving none one or
BBB, CCC, D, EE & F in a row if the letter C are separated more.
from one another is: (d) the number of ways in which 9 different books can
12! 13 ! be tied up in to three bundles one containing 2, other
(a) 13C3. 5! 3! 2! (b) 5 ! 3 ! 3 ! 2 ! 3 and third containing 4 books.
Comprehension – 01 ( 11 and 13)
14 ! 13 ! There are 8 official and 4 non-official members, out of these 12
(c) 3 ! 3 ! 2 ! (d) 11. 6 !
members a committee of 5 members is to be formed, then answer
7. Number of ways in which the letters of the word the following questions.
"TOMATO" can be arranged if two alike vowels are 11. Number of committees consisting of 3 official and 2 non-
official members, are
separated, is not equal to
(a) 363 (b) 336
(a) number of ways in which letters of the word
(c) 236 (d) 326
“RAITHATHA” can be arranged if no two alike letters
12. Number of committees consisting of at least two non-
are separated. official members, are
(b) number of 3 digit numbers with atleast one 3 and (a) 456 (b) 546
atleast one 2. (c) 654 (d) 466
(c) number of ways in which Ram and Rama can 13. Number of committees in which a particular official
exchange their maps if Ram has 3 and Rama has member is never included, are
7 maps, all maps being different, maintaining their (a) 264 (b) 642
original number of maps at the end. (c) 266 (d) 462
(d) number of ways in which 2 alike apples and 4 alike Comprehenssion – 02 ( No. 14 and 15)
oranges can be distributed in three children if each Let n be the number of ways in which the letters of the word
child get none, one or more fruits. "RESONANCE" can be arranged so that vowels appear at the
8. The number of non-negative integral solutions of x 1 + even places and m be the number of ways in which
x2 + x3 + x4  n (where n is a positive integer) is "RESONANCE" can be arrange so that letters R, S, O, A, appear
(a) n+3C3 (b) n+4C4 in the order same as in the word RESONANCE, then answer the
n+5
(c) C5 (d) n+4Cn following questions.

PERMUTATIONS AND COMBINATIONS 91 P

W
14. The value of n is 15. The value of m is
(a) 360 (b) 720 (a) 3780 (b) 3870
(c) 240 (d) 840 (c) 3670 (d) 3760

16. 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
(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?
17. Match the column
Column-I Column-II
(a) There are 12 points in a plane of which 5 are collinear. (P) 185
The 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.

INTEGER TYPE 23. The number of permutations which can be formed out
of the letters of the word "SERIES" taking three letters
18. A man has 7 relatives, 4 of them are ladies & 3 gentlemen; together, is:
his wife has also 7 relatives, 3 of them are ladies & 4 24. A box contains 6 balls which may be all of different
gentlemen. In how many ways can they invite a dinner colours or three each of two colours or two each of
three different colours. The number of ways of
party of 3 ladies & 3 gentlemen so that there are 3 of the
selecting 3 balls from the box (if ball of same colour
man’s relative & 3 of the wife’s relatives? are identical), is N then sum of the digits in the number
19. The exponent of 7 in 50! is 'N' equals
20. The number of ways in which 10 identical apples can be 25. Sum of all the numbers that can be formed using all
the digits 2, 3, 3, 4, 4, 4, is N then sum of the digit of
distributed among 6 children so that each child receives
the number 'N' equals
atleast one apple is: 26. Six married couple are sitting in a room. Number of
21. The number of ways in which 5 beads, chosen from ways in which 4 people can be selected so that there
8 different beads be threaded on to a ring, is: is exactly one married couple among the four is N then
number of divisors of N equals
22. Number of five digits numbers divisible by 3 that can be
27. The number of ways selecting 8 books from a library
formed using the digits 0, 1, 2, 3, 4, 7 and 8 if, each digit is which has 10 books each of Mathematics, Physics,
to be used atmost one is N where 'N' is three digit number Chemistry and English, if books of the same subject are
then sum of the digit of 'N' alike, is N then number of divisors of N.1

P 92 DROPPER JEE
W
 JEE Mains & Advanced Past Years Questions

JEE-MAIN 7. There are m men and two women participating in a chess

PREVIOUS YEARS tournament. Each participant plays two games with every
other participant. If the number of games played by the
1. If all the words (with or without meaning) having five
men between themselves exceeds the number of games
letters, formed using the letters of the word SMALL and
played between the men and the women by 84, then the
arranged as in a dictionary; then the position of the word
value of m is: [JEE Main-2019 (January)]
SMALL is: [JEE Main-2016]
th th
(a) 12 (b) 11
(a) 46 (b) 59
(c) 9 (d) 7
(c) 52nd (d) 58th
8. All possible numbers are formed using the digits 1, 1, 2, 2,
2. A man X has 7 friends, 4 of them are ladies and 3 are men.
2, 2, 3, 4, 4 taken all at a time.The number of such numbers
His wife Y also has 7 friends, 3 of them are ladies and 4
in which the odd digits occupy even places is:
are men. Assume X and Y have no common friends. Then
[JEE Main-2019 (April)]
the total number of ways in which X and Y together can
(a) 175 (b) 162
throw a party inviting 3 ladies and 3 men, so that 3 friends
(c) 160 (d) 180
of each of X and Y are in this party, is: [JEE (Main) 2017]
9. The number of four-digit numbers strictly greater than
(a) 415 (b) 435
(c) 475 (d) 485 4321 that can be formed using the digits 0,1,2,3,4,5
3. From 6 different novels and 3 different dictionaries, 4 (repetition of digits is allowed) is:
novels and 1 dictionary are to be selected and arranged [JEE Main-2019 (April)]
in row on a shelf so that the dictionary is always in the (a) 288 (b) 306
middle. The number of such arrangements is- (c) 360 (d) 310
[JEE Main-2018]
10. A committee of 11 members is to be formed from 8 males
(a) less than 500
and 5 females. If m is the number of ways the committee
(b) at least 500 but less than 750
is formed with at least 6 males and n is the number of
(c) at least 750 but less than 1000
ways the committee is formed with at least 3 females,
(d) at least 1000
4. Consider a class of 5 girls and 7 boys. The number of then: [JEE Main-2019 (April)]

different teams consisting of 2 girls and 3 boys that can (a) m = n = 78 (b) n = m –8
be formed from this class, if there are two specific boys A (c) m + n = 68 (d) m = n = 68
and B, who refuse to be the members of the same team is: 11. Some identical balls are arranged in rows to form an
[JEE Main–2019 (January)] equilateral traingle. The first row consists of one ball, the
(a) 500 (b) 200 second row cosists of two balls and so on. If 99 more
(c) 300 (d) 350 identical balls are added to the total number of balls used
5. The number of natural number less than 7, 000 which can in forming the equilaterial triangle, then all these balls can
be formed by using the digits 0, 1, 3, 7, 9 (repetition of be arranged in a square whose each side contains exactly
digits allowed) is equal to: [JEE Main–2019 (January)] 2 balls less than the number of balls each side of the
(a) 250 (b) 374 triangle contains. Then the number of balls used to form
(c) 372 (d) 375 the equialteral triangle is: [JEE Main-2019 (April)]
6. Consider three boxes, each containing 10 balls labelled 1, (a) 190 (b) 262
2,......, 10. Suppose one ball is randomly drawn from each of
(c) 225 (d) 157
the boxes. Denote by ni, the label of the ball drawn from the
12. The number of 6 digit numbers that can be formed using
ith box, (i = 1, 2, 3). Then, the number of ways in which the
balls can be chosen such that n1 < n2 < n3 is: the digits 0, 1, 2, 5, 7 and 9 which are divisible by 11 and
[JEE Main–2019 (January)] no digit is repeated, is: [JEE Main-2019 (April)]

(a) 120 (b) 82 (a) 36 (b) 60

(c) 240 (d) 164 (c) 48 (d) 72

PERMUTATIONS AND COMBINATIONS 93 P

W
13. Suppose that 20 pillars of the same height have been 21. Let n > 2 be an integer. Suppose that there are n Metro
erected along the boundary of a circular stadium. If the stations in a city located along a circular path. Each
top of each pillar has been connected by beams with the pair of stations is connected by a straight track only.
top of all its non-adjacent pillars, then the total number Further, each pair of nearest stations is connected by
beams is: [JEE Main-2019 (April)] blueline, whereas all remaining pairs of stations are
(a) 210 (b) 190 connected by redline. If the number of red lines is 99
(c) 170 (d) 180 times the number of blue lines, then the value of n is:
[JEE Main-2020 (September)]
14. The number of ways of choosing 10 objects out of 31
objects of which 10 are identical and the remaining 21 are (a) 199 (b) 201
(c) 101 (d) 200
distinct, is: [JEE Main-2019 (April)]
22. If the letters of the word ‘MOTHER’ be permuted and all
(a) 220 (b) 220 – 1
the words so formed (with or without meaning) be listed
(c) 220 + 1 (d) 221
as in a dictionary, then the position of the word ‘ MOTHER’
15. A group of students comprises of 5 boys and n girls. If
is _______ [JEE Main-2020 (September)]
the number of ways, in which a team of 3 students can
23. A test consists of 6 multiple choice questions, each having
randomly be selected from this group such that there is at
4 alternative answers of which only one is correct. The
least one boy and at least one girl in each team, is 1750, number of ways, in which a candidate answers all six
then n is equal to: [JEE Main-2019 (April)]
questions such that exactly four of the answers are
(a) 25 (b) 28 correct, is _______. [JEE Main-2020 (September)]
(c) 27 (d) 24 24. There are 3 sections in a question paper and each section
16. A person throws two fair dice. He wins Rs. 15 for throwing contains 5 questions. A candidate has to answer a total
a doublet (same numbers on the two dice), wins Rs. 12 of 5 questions, choosing at least one question from each
when the throw results in the sum of 9, and loses Rs. 6 for section. Then the number of ways, in which the candidate
any other outcome on the throw. Then the expected gain/ can choose the questions, is:
loss (in Rs.) of the person is: [JEE Main-2019 (April)] [JEE Main-2020 (September)]
25. The number of words, with or without meaning, that can
1
(a) 2 gain (b) loss be formed by taking 4 letters at a time from the letters of
2 the word 'SYLLABUS' such that two letters are distinct
1 1 and two letters are alike, is _______.
(c) loss (d) gain [JEE Main-2020 (September)]
4 2
26. The number of words (with or without meaning) that can
17. Total number of 6-digit numbers in which only one digit
be formed from all the letters of the word "LETTER" in
is repeated and all the five digits 1, 3, 5, 7 and 9 appear, is which vowels never come together is ________ .
[JEE Main-2020 (January)] [JEE Main-2020 (September)]
1 27. Two families with three members each and one family
(a) 56 (b) 6! with four members are to be seated in a row. In how many
2
ways can they be seated so that the same family members
5
(c) 6! (d) (6!) are not separated? [JEE Main-2020 (September)]
2
(a) 2! 3! 4! (b) (3!)3.(4!)
18. An urn contains 5 red marbles, 4 black marbles and 3 2.
(c) (3!) (4!) (d) 3! (4!)3
white marbles. Then the number of ways in which 4 28. A scientific committee is to formed from 6 Indians and 8
marbles can be drawn so that at the most three of them foreigners, which includes at least 2 Indians and double
are red is _________. [JEE Main-2020 (January)] the number of foreigners as Indians. Then the number of
19. The number of 4 letter words (with or without meaning) ways, the committee can be formed is:
that can be formed from the eleven letters of the word [JEE Main-2021 (February)]
'EXAMINATION' is [JEE Main-2020 (January)] (a) 560 (b) 1050
20. If the number of five digit numbers with distinct digits (c) 1625 (d) 575
and 2 at the 10th place is 336 k, then k is equal to: 29. The students S1, S2, ... , S10 are to be divided into 3 groups
[JEE Main-2020 (January)]
A, B and C such that each group has at least one student
and the group C has at most 3 students. Then the total
(a) 7 (b) 4
number of possibilities of forming such groups is
(c) 6 (d) 8
[JEE Main-2021 (February)]

P 94 DROPPER JEE
W
 30. The total number of positive integral solutions (x, y, z) 40. The number of times the digit 3 will be written when listing
such that xyz = 24 is [JEE Main-2021 (February)] the integers from 1 to 1000 is [JEE Main-2021 (March)]
(a) 36 (b) 45
41. The missing value in the following figure is
(c) 24 (d) 30
31. The total number of numbers, lying between 100 and 1000
that can be formed with the digits 1, 2, 3, 4, 5, if the
2 3
repetition of digits is not allowed and numbers are divisible
by either 3 or 5 is [JEE Main-2021 (February)]
1 5
32. The total number of two digit numbers ‘n’, such that 1 ?
3n + 7n is a multiple of 10, is [JEE Main-2021 (February)]
424 36
33. The number of seven digit integers with sum of the digits 12 4
equal to 10 and formed by using the digits 1,2 and 3 only
is [JEE Main-2021 (February)] 8 7
(a) 77 (b) 42
(c) 35 (d) 82
Use the logic which gives answer in single digit
34. A natural number has prime factorization given by [JEE Main-2021 (March)]
n = 2x3y5z, where y and z are such that y + z = 5 and
JEE-ADVANCED
5
y 1  z 1  , y > z. Then the numberof odd divisors of PREVIOUS YEARS
6 1. The total number of ways in which 5 balls of different
n, including 1, is: [JEE Main-2021 (February)]
colours can be distributed among 3 persons so that each
(a) 11 (b) 6x
person gets at least one ball is [IIT JEE 2012]
(c) 12 (d) 6 (a) 75 (b) 150
35. The total number of 4-digit numbers whose greatest (c) 210 (d) 243
common divisor with 18 is 3, is Paragraph for Question Nos. 2 & 3
[JEE Main-2021 (February)]
Let an denote the number of all n-digit positive integers formed
36. Consider a rectangle ABCD having 5, 7, 6, 9 points in the
by the digits 0,1 or both such that no consecutive digits in them
interior of the line segments AB, CD, BC, DA respectively. are 0. Let bn = the number of such n-digit integers ending with
Let  be the numberof triangles having these points from digit 1 and cn = the number of such n-digit integers ending with
different sides as vertices and  be the number of
digit 0.
quadrilaterals having these points from different sides as
2. Which of the following is correct? [IIT JEE 2012]
vertices. Then ( – ) is equal to:
[JEE Main-2021 (March)]
(a) a17 = a16 + a15 (b) c17  c16 + c15
(c) b17  b16 + c16 (d) a17 = c17 + b16
(a) 795 (b) 1173
3. The value of b6 is
(c) 1890 (d) 717
(a) 7 (b) 8
37. Team ‘A’ consists of 7 boys and girls and Team ‘B’ has 4 (c) 9 (d) 11
boys and 6 girls. If a total of 52 single matches can be 4. Let n 1 < n 2 < n 3 < n 4 < n 5 be positivie integers such that
arranged between these two teams when a boy plays n 1 + n 2 + n 3 + n 4 + n 5 = 20. Then the number of such
against a boy and a girl plays against a girl, then n is distinct arrangements (n 1, n2, n 3, n 4, n 5) is
equal to : [JEE Main-2021 (March)] [JEE Advanced-2014]
(a) 5 (b) 2 5. Let n  2 be an integer. Take n distinct points on a
(c) 4 (d) 6 circle and join each pair of points by a line segment.
Colour the line segment joining every pair of adjacent
38. If the sides AB, BC and CA of a triangle ABC have 3, 5 and points by blue and the rest by red. If the number of
6 interior points respectively, then the total number of red and blue line segments are equal, then the value
triangles that can be constructed using these points as of n is [JEE Advanced-2014]
vertices, is equal to : [JEE Main-2021 (March)] 6. Six cards and six envelopes are numbered 1, 2, 3, 4, 5,
(a) 364 (b) 240 6 and cards are to be placed in envelopes so that each
(c) 333 (d) 360 envelope contains exactly one card and no card is
placed in the envelope bearing the same number and
39. The sum of all the 4 -digit distinct numbers that can be
moreover the card numbered 1 is always placed in
formed with the digits 1,2,2 and 3 is:
envelope numbered 2. Then the number of ways it can
[JEE Main-2021 (March)]
be done is [JEE Advanced-2014]
(a) 26664 (b) 122664 (a) 264 (b) 265
(c) 122234 (d) 22264 (c) 53 (d) 67

PERMUTATIONS AND COMBINATIONS 95 P

W
 7. Let n be the number of ways in which 5 boys and 5 (iii) Let 3 be te total number of ways in which the
girls can stand in a queue in such a way that all the committe can be formed such that the committee has
girls stand consecutively in the queue. Let m be the
5 members, at elst 2 of them being girls.
number of ways in which 5 boys and 5 girls can stand
in a queue in such a way that exactly four girls stand (iv) Let 4 be the total number of ways in which the
consecutively in the queue. Then the value of m/n is committeee can be formed such that the commitee
[JEE Advanced-2015] has 4 members, having at least 2 girls and such that
8. A debate club consists of 6 girls and 4 boys. A team of 4 both M1 and G1 are NOT in the committee together.
members is to be selected from this club including the
[JEE Advanced-2018]
selection of a captain (from among these 4 members) for
the team. If the team has to include at most one boy, then LIST-I LIST-II
the number of ways of selecting the team is (P) The value of 1 is (a) 136
[JEE Advanced-2016]
(a) 380 (b) 320 (Q) The value of 2 is (b) 189
(R) The value of 3 is (c) 192
(c) 260 (d) 95 (S) The value of 4 is (d) 200
9. Let S = { 1, 2, 3, .........,9). For k = 1, 2,...........5, let Nk be the
number of subsets of S, each containing five elements (5) 381
out of which exactly k are odd. Then N1 + N2 + N3 + N4 + (6) 461
N5 = [JEE Advanced-2017] The correct option is:-
(a) 210 (b) 252
(c) 126 (d) 125 (a) P  4; Q  6; R  2; S  1
10. Words of length 10 are formed using the letters A, B, C, D, (b) P  1; Q  4; R  2; S  3
E, F, G, H, I, J. Let x be the number of such words where no (c) P  4; Q  6; R  5; S  2
letter is repeated; and let y be the number of such words
where exactly one letter is repeated twice and no other (d) P  4; Q  2; R  3; S  1
14. Five person A,B,C,D and E are seated in a ciruclar
y
letter is repeated. Then,  [JEE Advanced-2017] arrangement. If each of them is given a hat of one of the
9x
three colours red, blue and green ,then the number of ways
11. The number of 5 digit numbers which are divisible by 4,
with digits from the set {1, 2, 3, 4, 5} and the repetition of of distributing the hats such that the persons seated in
digits is allowed, is _____ [JEE Advanced-2018] adjacent seats get different coloured hats is
12. Let X be a set with exactly 5 element and Y be a set with [JEE Advanced-2019]
exactly 7 elements. If  is the number of one-one functions
15. An engineer is required to visit a factory for exactly four
from X and Y and is the number of onto functions from
1 days during the first 15 days of every month and it is
Y to X, then the value of     is ...... mandatory that no two visits take place on consecutive
5!
[JEE Advanced-2018] days. Then the number of all possible ways in which such
13. In a high school, a committee has to be formed from a visits to the factory can be made by the engineer during 1-
group of 6 boys M1, M2, M3, M4, M5, M6 and 5 girls 15 June 2021 is _____ [JEE(Advanced)-2020]
G1, G2, G3, G4, G5.
(i) Let 1 be the total number of ways in which the 16. In a hotel, four rooms are available. Six persons are to be
committee can be formed such that the committee accommodated in these four rooms in such a way that
has 5 members, having exactly 3 boys and 2 girls. each of these rooms contains at least one person and at
(ii) Let a2 be the total number of ways in whcih the most two persons. Then the number of all possible ways
committe can be formed such that the committee has in which this can be done is _____
at least 2 members, and having an equal number of
[JEE(Advanced)-2020]
boys and girls.

P 96 DROPPER JEE
W
 ANSWER KEY

Topicwise Questions

1. (b) 2. (d) 3. (a) 4. (c) 5. (b) 6. (c) 7. (d) 8. (d) 9. (a) 10. (a) 11. (d) 12. (b)
13. (d) 14. (d) 15. (c) 16. (c) 17. (c) 18. (a) 19. (b) 20. (c) 21. (a) 22. (c) 23. (a) 24. (c)
25. (b) 26. (c) 27. (a) 28. (d) 29. (a) 30. (a)

Learning Plus
1. (c) 2. (c) 3. (c) 4. (c) 5. (a) 6. (a) 7. (b) 8. (b) 9. (a) 10. (b) 11. (d) 12. (b)
13. (d) 14. (b) 15. (a) 16. (c) 17. (b) 18. (a) 19. (c) 20. (a) 21. (b) 22. (d) 23. (a) 24. (a)
25. (d) 26. (a) 27. (a) 28. (b) 29. (b) 30. (c)

Advanced Level Multiconcept Questions

MCQ/COMPREHENSION/MATCHING/NUMERICAL
1. (a, b) 2. (a,b,c,d) 3. (a, b, c, d) 4. (b,c) 5. (b,c,d) 6. (a,d)
7. (b,c,d) 8. (b,d) 9. (a,b,d) 10. (a,d) 11. (b) 12. (a)
13. (d) 14. (b) 15. (a) 16. (a)(R), (b)(P),(c)(Q), (d)(S)
17. (a) - (Q); (b) - (P); (c) - (S); (d) -(R) 18. [0485] 19. [0008] 20. [0126] 21. [0672]
22. [0015] 23. [42] 24. [4] 25. [12] 26. [20] 27. [8]

JEE Mains & Advanced Past Years Questions

JEE-MAIN
PREVIOUS YEARS
1. (d) 2. (d) 3. (d) 4. (c) 5. (b) 6. (a) 7. (a) 8. (d) 9. (d) 10. (a) 11. (a) 12. (b)
13. (c) 14. (a) 15. (a) 16. (b) 17. (d) 18. [490] 19. [2454] 20. (d) 21. (b) 22. [309] 23. [135] 24. [2250]
25. [240] 26. [120] 27. (b) 28. (c) 29. (31650) 30. (d) 31. (32) 32. (45) 33. (a) 34. (c) 35. (1000)
36. (d) 37. (c) 38. (c) 39. (a) 40. (300) 41. (4)

JEE-ADVANCED
PREVIOUS YEARS
1. (b) 2. (a) 3. (b) 4. [7] 5. [5] 6. (c) 7. [5] 8. (a) 9. (c) 10. (5) 11. [625] 12. [119]
13. (c) 14. [30.00] 15. [495.00] 16. [1080.00]

PERMUTATIONS AND COMBINATIONS 97 P

W
 PERMUTATIONS AND
5 COMBINATIONS

Topicwise Questions
1. (b) As per the given condition, digit 1 should occur at =1
alternate places of the number and at the remaining 5
places either 2, 3, 5 or 7 should appear. Now when the =1
number starts with 1, number of numbers = 45 and
when the number starts with either 2, 3, 5 or 7, number 17th rank
of numbers = 45 7. (d) Total number of possible arrangements is
4
So, total number = 2 × 45 = 2048 Ans. P2 × 6P3 .
8. (d) First we have to find all the arrangements of the
2. (d) 1 . .3. .5. .7 word ‘GENIUS’ is
(3 × 2) × (5 × 4 × 3 × 2) = 6 × 120 = 720 ] 6 ! = 720
3. (a) 1 + 2 + 3 + ............. + 9 = 45 = 0 + 1 + 2 + 3 + ......... + 9 number of arrangement which in either started with
All 9 digit such numbers = 9 ! G ends with S is
(5! + 5! – 4!) = (120 + 120 – 24)= 216
All 10 digit such numbers when '0' included = 10 ! – 9 !
Hence total number of arrangement which is neither
So, total = 9 ! + (10 ! – 9 !) = (10) ! Ans. started with G nor ends with S is.
4. (c) Total number of signals can be made from 3 flags (720 – 216) = 504
each of different colour by hoisting 1 or 2 or 3 9. (a) Total no. of arrangement if all the girls do not sit
above. side by side is = [all arrangement – girls seat side
by side]
i.e. 3 + 3 × 2 + 3 × 2 × 1 = 3 + 6 + 6 = 15 = 8! – (6! × 3!) = 6! (56 –6) = 6! × 50 = 720 × 50
= 36000
2002C
(2002)! 10. (a) Number of words which have at least one letter
5. (b) 1001 =
(1001)!(1001)! repeated = total words – number of words
no. of zeros in (2002)! are which have no letter repeated = 105 – 10 × 9 × 8 × 7
400 + 80 + 16 + 3 = 499 × 6 = 69760
no. of zeroes in (1001 !)2 = 2(200 + 40 + 8 + 1) = 498 11. (d) First we select 3 speaker out of 10 speaker and put
in any way and rest are no restriction i.e. total
(2002)! 10!
Hence no. of zeroes is =1 number of ways = 10C3 . 7! =
(1001!) 2 3!
6. (c) Word QUEUE 12. (b) upperdeck - 13 seats  8 in upper deck.
E  2, Q , U - 2 lowerdeck - 7 seats  5 in lower deck
= 12 Remains passengers = 7
Now Remains 5 seats in upper deck and 2 seats
4!
in lower deck
2!
for upper deck number of ways = 7C5
=3 for lower deck number of ways = 2C2
3! 7.6
So total number of ways = 7C5 × 2C2 = = 21
2! 2
 13. (d) Even place 21. (a) Total number of ways of arranging 2 identical white
balls,
3 identical red balls and 4 green balls of different

There are four even places and four odd digit 9!

shades = 2 !3!  6.7 !
4!
number so total number of filling is 2!.2! rest are
Number of ways when balls of same colour are
5! together = 3! × 4! = 6.4!
also occupy is 3!.2! ways  Number of ways of arranging the balls when atleast
one ball is separated from the balls of the same colour
4! 5!
Hence total number of ways = 2!.2!  3!.2! = 60 = 6.7! – 6.4! = 6(7! – 4!)
22. (c) only 7, 8 and 9 can be used
14. (d) Peaches 5 p1 , p2 , p3, p4, p5
Apples 3 a1 , a2 , a3 7!
Hence number of ways = 3C1 × 5C3 = 30 Ans. Aliter: 9, 9, 9, 9, 9, 9, 7 =7
6!
2 Section A
7!
9, 9, 9, 9, 9, 8, 8
15. (c) 9 3 Section B 4 are selected
   2!5! = 21
4 Section C Total = 28 Ans.
required number of ways 23. (a) Coefficient x10 in (x + x2 .....x5)6 = coefficient of x4 in (x0
+ x1 .......x4)6 = 6 + 4 – 1C4 = 9C4 = 126
A B C Alternatively: Give one apple to each child and then
2 1 1 for rest 4 apples = 4 + 6 – 1C6 – 1 = 126
1 1 2 24. (c) (x + y + z)n  use beggar] n+2C2
1 2 1 25. (b) 3 A + 2 O. A. = 3 . 2 = 6 ; 3 A + 2 diff = 3 ;
Hence 2C1 · 3C1 · 4C2 + 2C1 · 3C2 · 4C1 + 2C2 · 3C1 · 4C1 2 A + 2 O. A. + 1 D = 3  12
= 36 + 24 + 12 = 72 Ans. 26. (c) If 1 be unit digit then total no. of number is 3! = 6
16. (c) They can sit in groups of either 5 and 3 or 4 and 4 Similarly so on if 3, 5, or 7 be unit digit number
then total no. of no. is 3! = 6
8! 8!  2! Hence sum of all unit digit no. is = 6× (1+3+5+7) =
required number = 1 + = 126
5!  3! 4!  4!  2! 6× 16 = 96
17. (c) Total number of ways is Hence total sum is = 96 × 103 + 96 × 102 + 96 × 101 +
6! 3! 96 × 100
= 720 × 3 = 2160 = 96000 + 9600 + 960 + 96 = 106656 = 16 × 1111 × 3!
2!
18. (a) First we select 5 beads from 8 different beads to 8C5 27. (a) (1 + 10 + 102 + 103) × 43 × (6 + 7 + 8 + 9 ) = (1111) ×64
Now total number of arrangement is ×30 =2133120
28. (d) Total number of proper divisors is
4!
8C × = 672 (p + 1) (q + 1) (r + 1) (s + 1) – 2 (Number and 1
5 2!
are not proper divisor)
19. (b) T T 29. (a) N = 2.3 5 = 23 .32 .5
( + 1) ( + 1) ( + 1) = 4.3.2
9!
Total arrangement is 2!.2! = 90720 N = 360 = 23 . 32 .5
4.3.2
20. (c) NINETEEN  12
2
 N  3 : , T 30. (a) Here 21600 = 25. 33. 52
E3 (2 × 5) × 24 × 33 × 51
First we arrange the word of N, N, N, I and T Now numbers which are divisible by
5! 10 = (4 + 1)(3 + 1)(1 + 1) = 40
then the number of ways = .
3! (2 × 3 × 5) × (24 × 32 × 51) now numbers which are
Now total 6 number of place which are arrange E is divisible by both 10 and 15
6C
3 = (4 +1)(2 +1)(1+1) = 30
5! 6 So the numbers which are divisible by only
Hence total number of ways = . C3
3! 40 – 30 = 10

PERMUTATIONS AND COMBINATIONS 71 P

W
 Learning Plus
1. (c) 7 × 7 × 6 × 5 – 6 × 6 × 5 × 4 = 750 15. (a) Number of triangles = 10 C3  6 C 3  120  20  100 .
n! 16. (c) Given, total number of points = n and number of
2. (c) Since n C 2  n  35   n  35
2! (n  2)! collinear points = p. We know that one line has two
 n (n  1)  2n  70  n 2  3n  70 end points. Therefore total number of lines = n C 2 .
 n 2  3n  70  0  (n  7) (n  10)  0 Since p points are collinear, therefore total number of
lines drawn from collinear points = p
 n  10 C 2 . We also
10 ! know that, corresponding to the line of collinearity,
3. (c) A gets 2, B gets 8;  45 one will also be added.
2 !8 !
10 ! Therefore number of lines = n C 2  p C 2  1.
A gets 8, B gets 2; 8 ! 2 !  45
17. (b) Required number of ways
45  45  90
6 C1 6 C 2  6 C3  6 C4  6 C5 6 C6  26  1  63
4. (c) Since the 5 boys can sit in 5 ! ways. In this case there
are 6 places are vacant in which the girls can sit in 18. (a) Required number of ways
6P ways. Therefore required number of ways are
3  52 C13  39 C13  26 C13 13C13
6P × 5 !
3 52 ! 39 ! 26 ! 13 ! 52 !
5. (a) Required number of ways     
39 !  13 ! 26 !  13 ! 13 !  13 ! 13 ! (13 ! ) 4
15C1 8 C1  15  8 19. (c) The number of ways can be given as follows
15
6. (a) C3r 15C r  3 15 C15  3r 15C r  3 2 bowlers and 9 other players  4 C 2  9 C 9
 15  3r  r  3  r  3 3 bowlers and 8 other players  4 C 3  9 C8
n n (n  1)
7. (b) C 2  153   153  n  18 4 bowlers and 7 other players  4 C 4  9 C 7
2
8. (b) Since 5 are always to be excluded and 6 always to be Hence required number of ways
included, therefore 5 players to be chosen from 14.  6  1  4  9  1  36  78
Hence required number of ways are 14 C 5  2002 . 20. (a) The selection can be made in
20
9. (a) Required number of ways C7  5C5  20C8  5 C4  5C3  20 C9
12 C1 2 C 2 12 C 3  ....... 12C12  212  1 21. (b) Since total number of ways in which boys can occupy

 4096  1  4095 any place is (5  1) !  4 ! and the 5 girls can be sit

accordingly in 5 ! ways.
10. (b) Required number of ways  30C 3 15C 3  3605
Hence required number of ways are 4! × 5!
11. (d) Required number of ways = 210 – 1
1
10 22. (d) A garland can be made from 10 flowers in (9 !)
(Since the case that no friend be invited i.e., C 0 is 2
ways.
excluded).
{  n flowers’ garland can be made in
12. (b) Required number of ways  4 C 2  3C 2  18
1
13. (d) The required number of points (n  1)! ways}
2
8C 2  1  4C 2  2   C  C  2
8
1
4
1 23. (a) Fix up a male and the remaining 4 male can be seated
 28  12  32  2  104 in 4! ways. Now no two female are to sit together and
as such the 2 femaleare to be arranged in five empty
14. (b) Clearly, n C 3  Tn . seats between two consecutive male and number of
arrangement will be 5
n 1 P2 . Hence by fundamental
So, C 3  n C 3  21  ( n C 3  n C 2 )  n C3  21
theorem the total number of ways is = 4!  5 P2 = 24
 n C 2  21 or n(n  1)  42  7 . 6  n  7
× 20 = 480 ways.
P 72 DROPPER JEE
W
 24. (a) 27. (a) Since the total number of selections of r things from
W n things where each thing can be repeated as many
M× M
× n  r 1
W W times as one can, is Cr
M× ×M Therefore the required number  3  6 1C 6  28
W × × W 28. (b) We have, 30 = 2 × 3 × 5. So, 2 can be assigned to
M W M either a or b or c i.e. 2 can be assigned in 3 ways.
Similarly, each of 3 and 5 can be assigned in 3 ways.
No. of ways in which 6 men can be arranged at a
Thus, the no. of solutions are 3 × 3 × 3 = 27.
round table = (6 – 1)!
Now women can be arranged in 6! ways. 29. (b) Three letters can be posted in 4 letter boxes in 43 = 64
Total Number of ways = 6! × 5! ways but it consists the 4 ways that all letters may be
25. (d) Word ‘MATHEMATICS’ has 2M, 2T, 2A, H, E, I, C, S. posted in same box. Hence required ways = 60.
Therefore 4 letters can be chosen in the following
ways. 30. (c) Let E (n ) denote the exponent of 3 in n. The greatest
Case I : 2 alike of one kind and 2 alike of second kind integer less than 100 divisible by 3 is 99.
3 4! We have E(100 !)  E(1 . 2 . 3 . 4....99 . 100)
i.e. , C 2  No. of words  C 2 2 ! 2 !  18
3

Case II : 2 alike of one kind and 2 different  E(3 . 6 . 9 ....99)  E[(3 . 1)(3 . 2)(3 . 3)........(3 . 33)]
i.e., 3 C1  7 C 2  No.of  33  E(1 . 2 . 3......33)

3 7 4! Now E(1 . 2 . 3......33)  E(3 . 6 . 9....33)

words  C1  C 2   756
2!
Case III : All are different  E[(3 . 1)(3 . 2)(3 . 3)........(3 . 11)]

i.e. 8 C4  No. of words 8 C4  4!  1680  11 E (1 . 2 . 3 .....11)

Hence total number of words are 2454.
and
26. (a) Since, 38808 = 8 × 4851
E(1 . 2 . 3 ....11)  E (3 . 6 . 9)  E[(3 . 1)(3 . 2)(3 . 3)]
 8  9  539  8  9  7  7  11  2 3  3 2  7 2  11
So, number of divisors 3  E (1 . 2 . 3)  3  1  4
= (3 + 1) (2 + 1) (2 + 1) (1 + 1) = 72.
This includes two divisors 1 and 38808. Hence, the Thus E(100 !)  33  11  4  48 .
required number of divisors = 72 – 2 = 70.

Advanced Level Multiconcept Questions

1. (a, b) 8! 5! 8!
 = = 3360
25
Total no. of visits that a teacher goes is = C5 (selection 3!5! 2! 3!2!
of 5 different kids each time & teacher goes every time) Hence required no. is 3360 – 1 = 3359
Number of visits of a boy = select one particular boy & 4 (b) Keepin g t h e posi ti on of each vowel fi xed
M_LT_PL_
from rest 24 = 24C4
5!
So extra visits of a teacher from a boy is Number of ways = = 60 other ways = 60–1 = 59
2
= 25C5 – 24C4 = 24C5 (c) without changing the relative order/position of
2. (a,b,c,d) vowels & consonants

(a) Without changing the order of the vowels of 5!

so number of ways is =  3! = 60 × 6 = 360
MULTIPLE 2!
Hence required number is = 360–1 = 359
8
So we choose the first three place in C3 ways 8!
and the rest are arranged is (d) Total
2!
PERMUTATIONS AND COMBINATIONS 73 P
W
3. (a, b, c, d) 6. (a,d)
12!
/ 4v We have arrange all the letter except ‘CCC’ is
5!.3!.2!
(a) 11 \  7C2 · 6! = 3 · 7 · 6! = 3 · 7!
7c now there are 13 place where ‘C’ can be placed 13C3
12! 13
15! W W.....W Hence required number of ways is = C3
(b) No. of ways = = 15cv  5! 3! 2!
r!(15  r )! r
= 11 . 13!
B B B......B 6!

15r 7. (b,c,d)
This is maximum if r = 7 or 8 |T | M |A|T |
4!
Number of ways = 5C2 × = 10 × 12 = 120.
2!
(c)  Total no. of combinations (a) RAITHATHA
A = 3, H = 2, T = 2, R = 1, I = 1
= 5 · 6 · 23 = 240
AAA HH TT R I
(d) 2 alike + 2 other alike + 2 other a like = 1
 Number of ways = 5! = 120
2 alike + 2 other alike + 2 different = 3C2 · 4C2 = 18
2 alike + 4 different = 3C1 · 5C1 = 15
2, 3, 3
3, 2, 2 3! 3!
All 6 different = 1 (b) = + + (7C1
2, 3, non-zero digit 2 ! 2!
= 35 Ans.
2, 3, 0
4. (b,c)
× 3!) + (2 × 2) = 3 + 3 + 42 + 4 = 52.
Total required number of teams is
(c) M1, M2, ........., M7 | N1, N2, N3
10 1 Total ways = 3 (7C1) + 3(7C2) + 1 (7C3) = 21 + 63 + 35
= C 4 . 6 C3 . 3 C3 . = 2100 = 10
C4 . 5C2 = 2100
2! = 119.
Alternatively:
5. (b,c,d)
Number of ways = 10C3 – 1 = 120 – 1 = 119 Ans.
(a) False as is should be 9P5 – 1
(d) Number of ways = 4C2 × 6C2 = 6 × 15 = 90. Ans.
F 8. (b,d)
x1 + x2 + x3 + x4  n  x1 + x2 + x3 + x4 + y = n (where y
R
L is known as pseudo variable)
E Total no. of required solution is = n + 5 –1Cn = n+4Cn
E
or n+4C4
E 9. (a,b,d)
H E
W
 6!  6!
  × 3! = = 90.
(b) x . 4! = 8!  2! 2! 2! 3!  2!2!2!
6!
8! 8 (a)  (a) is correct.
 x= = P4 2!2!2!
4! 10C
(b) 2 · 2!  (b) is correct.
(c) Vowels E E E E select 4 places in 4 ways arrange9C
1, 2, 2 
consonants alphabatically only us one ways. 5! 1 5! 1 
(c) 5 =   3! = 150 
1, 1, 3  1!1!3! 2! 2!2!1! 2! 
1 1
 9C4 = 126 = · 256 = · 10C5 (c) is incorrect. (Using Division and Distribution)
2 2
(d) A and S remains in 2nd and 8th position
(d) True
6!
 correct answer are (b), (c) and (d) Hence, number of ways =  (d) is correct.]
2! 2! 2!
P 74 DROPPER JEE
W
 10. (a,d) 5! 7!
Consider (x + y + z)9 = 9Cr x9 – r (y + z)r Hence, the required number of ways = 
2! 2!2!
= 9Cr x9 – r · rCp yr – p zp [x + (y + z)]9
120  5040
put r = 7 ; p = 4 = = 75600.
8
9C 7C 9!
4C 17. (a) - (Q) ; (b) - (P) ; (c) - (S) ; (d) - (R)
or 2· 3· 4=
2! 3! 4! A) 8C4 + 8C3 × 5C1 + 8C2 × 5C2
11. (b) 3 official out of 8 can be selected by 8C3 = 56 ways (b) The number of ways of selecting 3 points out of 12
2 non-official out of 4 can be selected in 4C2 = 6 ways points is 12C3 .
 required number of committees are 56 × 6 = 336. Three points out of 7 collinear points can be selected
12. (a) Two non-officials and 3 officials i.e. in 7C3 ways.
4
C2 × 8C3 = 6 × 56 = 336. Hence, the number of triangles formed is 12C3 – 7C3 =
Three non-official and 2 officials 185.
4
C3 × 8C2 = 4 × 28 = 112.
(c) mC2 × nC2
Four non-officials and 1 official
4
C4 × 8C1 = 1 × 8 = 8 (d) Two circles intersect in 2 points.
Total 336 + 112 + 8 = 456.  Maximum number of points of intersection of two
13. (d) Required no. of ways circles = 2 × number of selections of two circles from
= 12 – 1C5 = 11C5 = 462 8 circles.
14. (b) = 2 × 8C2 = 2 × 28 = 56
15. (a) In the word RESONANCE there are 9 letters.  Maximum number of points of intersection of two
Consonants (5), 1R, 1S, 1C and 2N straight line = 1 × number of selections of two
straight line from 4 straight line = 4C2 = 6
Vowels (d), 2E, 1O, 1A
 Maximum number of points of intersection of one
total even places 4 ;
straight line and one circle = 2 × number of selections
4! of one straight line from 4 straight line and number of
No. of ways arranging vowels in even places is= 12
2! selections of one circles from 8 circles
No. of ways arranging consonants in remaining odd = 4C1.8C1.2 = 64
5!
places is = 60 NUMERICAL VALUE BASED
2!
required number of arrangement = 12 × 60 = 720 = n 18 [0485]

9! 4L 3L
Required number of arrangements are = 3780 Man – 7 ; Wife – 7
2! 2! 4!
3G 4G
16. (a)  (R), (b)  (P), (c)  (Q), (d)  (S) 3L and 3G are to be invited.
(a) Required number of ways = (2 + 1) (3 + 1) (4 + 1) – 1 = 59. Man’s Wife’sTotal Ways
(b) 10C3 = 120 3L 3G 4C3 · 4C3 = 16
3
(c) Requied number of ways 3G 3L C3 · 3C3 = 1
= Coefficient of x10 in (1 + x + x2 + ......)4 2L + 1G 1L + 2G (4C2 · 3C1) × (3C1 · 4C2) =324
1L + 2G 2L + 1G (4C1 · 3C2) × (3C2· 4C1) = 144
= Coefficient of x10 in (1 – x)–4 = 10+4–1C4–1 = 13C3 = 286
(d) The word ‘MATHEMATICS’ consists of 11 letters of Total = 485.
which 7 are consonants namely M,M, T, T,H,C,S and 19. [0008]
4 vowels and a group of consonants can be
5  50   50 
arranged in
P5 5!
ways. ( A is repeated twice)  7    7 2   7  1  8

2! 2
In any such arrangement, seven consonants can be 20. [0126]
reshuffled among themselves in Coefficient x10 in (x + x2 .....x5)6 = coefficient of x4 in
7
P7 7! (x0 + x1 .......x4)6 = 6 + 4 – 1C4 = 9C4 = 126
 ways.
2! 2! 2! 2! Alternatively: Give one apple to each child and then for
(Either of M and T is repeated twice) rest 4 apples = 4 + 6 – 1C6 – 1 = 126

PERMUTATIONS AND COMBINATIONS 75 P

W
21. [0672] 3 0  2!
First we select 5 beads from 8 different beads to 8C5 2 1  2! = 2! + 2! = 4 ways
Now total number of arrangement is Ca se-III If t wo ea ch of t h r ee col our s, th en
combination is
4!
8
C5 × 2! = 672 2 1 0  3!
1 1 1  1! = 3! + 1! = 7ways
22. [0015] Hence required no.is = 20 + 7 + 4 = 31
Number divisible by 3 if sum of digits divisible
25. [12]
case-I If 1 + 2 + 3 + 4 + 8 = 18
Number of ways = 120 5!
case-II If 1 + 2 + 3 + 7 + 8 = 21 = = 10
2!3!
Number of ways = 120
case-III If 2 + 3 + 4 + 7 + 8 = 24
Number of ways = 120 5!
= = 20
case-IV If 1 + 2 + 0 + 4 + 8 = 15 3!
Number of ways = 96
case-V If 1 + 2 + 0 + 7 + 8 = 18 5!
Number of ways = 96 = = 30
2!2!
case-VI If 2 + 0 + 4 + 7 + 8 = 21
Number of ways = 96 Hence sum of unit places is
case-VII If 0 + 1 + 3 + 4 + 7 = 15 2 × 10 + 3 × 20 + 4 × 30 = 200
Number of ways = 96
Hence required sum is
Total number 744
23. [42] = 200 × (105 + 104 + 103 + 102 + 101 + 100) = 200 ×
SERIES S - 2, E - 2 , R,  (111111) = 22222200
case-I when all letter distinct is 26. [20]
4C × 3! = 4 × 6 = 24
3 First we select one married couple out of 6 married
case-II when 2 letters are same the couple i.e. 6C1 ways total number of required case
3! 6C × 5C × 4C × 2 = 6 × 5 × 4 × 2 = 240
2C 3C 1 1 1
1. 1× = 2 . 3 . 3 = 18
2! N = 240
total number is 24 + 18 = 42 27. [8]
24. [4] Using multinomial theorem total number of required
Case -I If all are different then no. of ways is = 6C3 = 20 selection is
Case-II If three each of two colours, then combination
8+3C = 11C8 = 11C3 = 165
is 8

JEE Mains & Advanced Past Years Questions

JEE-MAIN 4
PREVIOUS YEARS M   12
2
5 3
1. (d) SMALLTotal words =  60 S A  3
2 2

A 4 S L  36
  12
2
S M A L L  1
L
 4  24
Rank of SMALL is 58th

P 76 DROPPER JEE
W
 4 Ladies 3 Ladies 10. (a) Since there are 8 males and 5 females. Out of these
2. (d) x y 13, if we select 11 persons, then there will be at least
3 Men 4 Men
Total number of ways 6 males and at least 3 females in the selection.
4
C0 · 3C3 · 3C3 · 4C0 + 4C1 · 3C2 . 3C2· 4C1 + 4C2 · 3C1 · 3C1. 13 13 13 12
m  n         78
4
C2 + 4C3 · 3C0 · 3C0 · 4C3 = 485   2
11 2
n(n  1)
 6  3  11. (a) + 99 = (n – 2)2
3. (d) Number of ways =  4  4  4! 2
   n2 + n + 198 = 2(n2 + 4 – 4n)
= 15 × 3 × 24 = 1080 n2 – 9n – 190 = 0
4. (c) Number of ways = Total number of ways without n2 – 19n + 10n – 190 = 0
restriction – When two specific boys are in team n(n – 19) + 10(n – 19) = 0
without any restriction, total number of ways of n = 19
forming team is 7 C3  5 C2  350 . If two specific boys 12. (b) sum of given digits 0, 1, 2, 5, 7, 9 is 24. Let the six digit
number be abcdef and to be divisible by 11
B1, B2 are in same team then total number of ways of
so |(a + c + e) – (b + d + f)| is multiple of 11.
forming team equals to 5 C1  5C 2  50 ways total
Hence only possibility is a + c + e = 12 = b + d + f
ways = 350–50 = 300 ways Case-I {a, c, e} = {9, 2, 1} & {b, d, f} = {7, 5, 0}
So Number of numbers = 3! × 3! = 36
5. (b) a1 a2 a3
Case-II {a,c,e} = {7,5,0} and {b,d,f} = {9,2,1}
Number of numbers = 53 –1 So, Number of numbers 2×2! ×3! = 24
a4 a1 a2 a3 Total = 60
2way for a4 13. (c) Total cases = number of diagonals
Numbers of numbers = 2 ×53 = 20C2 – 20 = 170
R equired number 0020 = 53 + 2 × 53 –1 14. (a) 10 Identical 21 Distinct 1 0
= 374 Object
21
6. (a) 10C3 = 120 0 10 C10 × 1
21
7. (a) Let m–men, 2–women 1 9 C9 × 1
m
C 2  2  m C1 2 C1 .2  84   
21
10 0 C0 × 1
m 2  5m  84  0   m  12 m  7  0 21
C0 + ..... + 21C10 + 21C1 + .... + 21C0 = 221
m = 12 (21C0 + ......+ 21C10) = 220
8. (d) 15. (a) 5C1 . nC2 + 5C2 . nC1 = 1750
n2 + 3n = 700
 n = 25
16. (b) win Rs. 15  number of cases = 6
2nd place 4th place 6th place 8th place(even places)
win Rs. 12  number of cases = 4
4 3! 6! loss Rs. 6  number of cases = 26
Number of such numbers = C3    180
2! 2!4! p(expected gain/loss)
9. (d) (a) The number of four digit numbers starting with 5 6 4 26 1
= 15   12   6  
is equal to 63 = 216 36 36 36 2
(b) Starting with 44 and 55 is equal to 36 × 2 = 72 17. (d) 1, 3, 5, 7, 9
(c) Starting with 433, 434 and 435 is equal to 6 × 3 = 18 For digit to repeat we have 5C1 choice
(d) Remaining numbers are 6!
and six-digit can be arrange in ways
4322, 4323, 4324, 4325 is equal to 4 so total numbers 2!
are 5 (6!)
Hence, total such numbers = .
216 + 72 + 18 + 4 = 310 2!

PERMUTATIONS AND COMBINATIONS 77 P

W
18. [490] 24. [2250]
0 Red, 1 Red, 2 Red, 3 Red Each section has 5 questions.
Number of ways = 7C4 + 5C1 · 7C3 + 5C2 · 7C2 + 5C3 · 7C1  Total number of selection of 5 questions
= 35 + 175 + 210 + 70 = 490. = 3 × 5C1 × 5C1 × 5C3 + 3 × 5C1 × 5C2 × 5C2
19. [2454] = 3 × 5 × 5 × 10 + 3 × 5 × 10 × 10 = 750 + 1500 = 2250
25. [240]
EXAMINATION
LLSSYABU
2N, 2A, 2I, E, X, M, T, O
For two alike and two distinct letters, select any one pair
Case I
from LL, SS in 2C1 ways
8! Now from rest, select any 2 in 5C2 ways and they can be
All are different so 8P4 = = 8.7.6.5 = 1680 4!
4! arranged in ways
2!
Case II 4!
 Required number of ways = 2C1 × 5C2 × = 240
4! 2!
2 same and 2 different so 3C1 . 7C2 . 2! = 3.21.12 = 756 26. [120]
For vowels not together
Case III 4!
1st arrange L,T,T, R in ways
2!
4! Then put both E in 5 gaps formed in 5C2 ways of ways 
2 same and 2 same so 3C2. 2!.2! = 3.6 = 18
4!
No. of ways 5C2 = 120
2!
Total = 1680 + 756 + 18 = 2454
27. (b) No. of arrangement = ( 3  3 4)  3 = ( 3) 3 4
20. (d) 2
28. (c) (2I, 4F) + (3I, 6F) + (4I, 8F)
Number of numbers = 8 × 8 × 7 × 6 = 2688 = 336 k
 k= 8 = 6 C28C4  6C38C6  6C48C8
21. (b) Number of two consecutive stations = n = 15 × 70 + 20 × 28 + 15 × 1 = 1050 + 560 + 15 = 1625
29. (31650)
Number of two non-consecutive stations = n C2  n
A
Now, According to the question,
C1 9
 n C2  n = 99n B
A
n(n  1)
 – 100n = 0 C2 8
2
B
 n – 1 – 200 = 0 A
 n = 201
C3 7
22. [309]
B
EHMORT in alphabetical order
10
E..................................5! = C1[2  2]  10C2 [28  2]  10C3 [27  2]
9

H..................................5!
M E.............................4! = 27 [10 C1  4  10C2  2  10C3 ]  20  90  240
M H.............................4! = 128[40 + 90 + 120] – 350 = (128 × 250) – 350
M O E.........................3!
M O H.........................3! = 10[3165] = 31650
M O R.........................3! 30. (d) x · y · z = 24
M O T E.....................2! x · y · z = 2 3 · 31
M O T H E R ...........1! Now using beggars method. 3 things to be distributed
Rank = 2 × 5! + 2 × 4! + 3 × 3! + 2! + 1 = 309 among 3 persons Each may receive none, one or more
23. [135]
 5C2 ways
Select any 4 questions in 6C4 ways which are correct
Number of ways of answering wrong question = 3 Similarly for ‘1’  3C2 ways
 Required number of ways = 6C4 × 32 = 135 Total ways = 5C2 · 3C2 = 30 ways
P 78 DROPPER JEE
W
 31. (32) 35. (1000)
Since, required number has G.C.D with 18 as 3. It must be
divisible by  3 odd multiple of ‘3’ but not a multiple of ‘9’.
divisible by 5 (i) Now, 4-digit number which are odd multiple of ‘3’ are,
1005, 1011, 1017,.......... .9999  1499
5
(ii) 4-digit number which are odd multiple of 9 are,
= 12 1017, 1035, ... , 9999  499
4× 3  Required numbers = 1499 – 499 = 1000
12  3, 4, 5  3! = 6
36. (d)
15  2, 3, 4  3! = 6
5 Pts
24  1, 3, 5  3! = 6
A B
42  1, 2, 3  3! = 6
Required number = 24 + 12 – 4 = 32
32. (45)
 7n = (10 – 3)n = 10K + (–3)n 9 Pts 6 Pts
10 K if n = odd
n n n n
 7 + 3 = 10K + (–3) + 3
10 K + 2.3n if n = even
Let n = 2t; t  N

 3n = 32t = (10 – 1)t D C

= 10p + (–1)t 7 Pts

= 10p ± 1  = Number of triangles

 If n = even then 7n + 3n will be multiply of 10  =5·6·7+5·7·9+5·6·9+6·7·9
= 210 + 315 + 270 + 378
So if n is odd then only 7n + 3n will be multiply of 10
= 1173
 n = 11, 13, 15, ... , 99
 = Number of Quadrilateral
 Ans. 45
 = 5 · 6 · 7 · 9 = 1890
33. (a) Case-I: 1, 1, 1, 1, 1, 2, 3  =  = 1890 – 1173 = 717
7! 37. (c) Total matches between boys of both team
Ways =  42
5! = 7 C1  4C1  28
Case-II: 1, 1, 1, 1, 2, 2, 2
Total matches between girls of both
7!
Ways =  35
4!3! team = n C1 6C1  6n
Total ways = 42 + 35 = 77 Now, 28 + 6n = 52
34. (c) y + z = 5 ...(1) n=4
1 1 5 38. (c)
 
y z 6
yz 5
 z

y 6
5 5
 z

y 6 Total number of triangles formed
 yz = 6 14
Also (y – z)2 = (y + z)2 – 4yz = C3  3C3  5C3  6C3 = 333
 (y – z)2 = (y + z)2 – 4yz 4!
39. (a) Digits are 1, 2, 2, 3 total distinct numbers  12.
 (y – z)2 = 25 – 4(6) = 1 2!
y–z=1 Total numbers when 1 at unit place is 3.
from (1) and (2), y = 3 and z = 2 for calculating odd 2 at unit place is 6, 3 at unit place is 3.
divisor of p = 2x · 3y · 5z x must be zero P = 20 · 33 · 52 So, sum = (3 + 12 + 9) (103 + 102 + 10 + 1)
 total odd divisors must be (3 + 1) (2 + 1) = 12 = (1111) × 24 = 26664
PERMUTATIONS AND COMBINATIONS 79 P
W
40. (300) Similarly bn = bn–1 + bn– 2 and cn = cn–1 + cn– 2  n  3
3 = 10 × 10 = 100 and an = bn + cn  n  1
3 = 10 × 10 = 100 so a1 = 1 , a2 = 2 , a3 = 3, a4 = 5, a5 = 8..........
100 b1 = 1 , b2 = 1 , b3 = 2, b4 = 3, b5 = 5, b6 = 8 ..........
3 = 10 × 10 =
300 c1 = 0 , c2 = 1 , c3 = 1, c4 = 2, c5 = 3, c6 = 5 ..........
41. (4) x = (2 – 1)1! = 1
using this bn–1 = cn  n  2
w = (12 – 8)4! = 424
3. (b) b6 = a5
z = (7 – 4)3! = 36
hence y = (5 – 3)2! = 22 a5 = 1 - - - 1 1---0
3 3 2
C0 + C1 + 1 + C1 + 1
1+3+1+2+1
2 3
4+4=8
1 5 4. (7) n 2 = n 1 + t 1 + 1
x y
n 3 = n 2 + t2 + 1
w z
n 4 = n 3 + t3 + 1
12 4
n 5 = n 4 + t4 + 1
8 7 The given equation becomes
5n 1 + 4t 1 + 3t2 + 2t 3 + t 4 = 10
where n 1  1 ; t 1  0
JEE-ADVANCED
n 1 = t 0 + 1  5t 0 + 4t 1 + 3t 2 + 2t 3 + t 4 = 5
PREVIOUS YEARS
t 0 = 1 will yield only 1 solution.
1. (b) so t 0 = 0,
B1 B2 B3 4t 1 + 3t 2 + 2t 3 + t 4 = 5.
Case-1: 1 1 3 t 1 = 0 = t 2. there will be 3 solution
Case-2: 2 2 1 t 1 = 0, t 2 = 1 will yield 2 solution.
5! 5! t 1 = 1, t 2 must be zero 1 solution.
Ways of distribution = . 3! + .3!
1 !1 ! 3! 2! 2 ! 2 ! 1! 2! Hence in total there will be 7 solution.
Alternative:
= 150
n1 n2 n3 n4 n5
1 2 3 4 10
2. (a) 1----------------- 1 # an–1
1 2 3 5 9
----------------- 1 0 #an–2 1 2 3 6 8
So an = an–1 + an–2 1 2 4 5 7
So A choice is correct 1 2 4 6 8
1 3 4 6 7
consider B choice c17  c16 + c15
2 3 4 5 6
c15  c14 + c13 is not true
5. (5) Number of adjacent lines = n
consider C choice b17  b16 + c16
Number of line segment joining non-adjacent points
a16  a15 + a14 is not true
is nC2 – n.
consider D choice a17 = c17 + b16 P1
a17 = a15 + a15 which is not true P2
Aliter
Pn
P3

Pn – 1
P4
n(n  1)
Now, n = (nC2 – n)  2n =  n = 0, 5
using the Recursion formula an = an–1 + an–2 2
But n  2. so, n = 5.
P 80 DROPPER JEE
W
 6. (c) Cards Envelopes 7! 7
 5! 3
 5!   7 C3  3.7 C3  5!  4 7 C3  5!
1 1 3!4!  
2! 3!
2 2

3 3  4 7 C 3  7 C5  4  35  21  119
5!
4 4 13. (c)
5 5
 6  5 
6 6 (a) 1 =  3  2   200
If '2' goes in '1' then it is dearrangement of 4 things   
1 1 1 So P  4
which can be done in 4!     = 9 ways.
 2! 3! 4! 
 6  5   6  5   6  5   6  5   6  5 
If '2' doen't go in 1, it is dearrangement of 5 things (b) 2 =                   
which can be done in 44 ways. Hence total 53 ways.  1  1   2  2   3  3   4  4   5  5 
7. [5] n = 5! × 6!
11
m = 5! × 6C2 × 5C4 .2! .4! =  5  –1
 
m 5!  15  2  5!
 = 5. = 46!
n 5! 6!
So Q  6
8. (a) If there is no boy then, no. of ways = 6C4 × 4C1 = 60
If one boy is there, then, no. of ways = 4C1 × 6C3 × (  5  6   5  6   5  6   5  6 
1
C1 + 3C1 ) = 320 (c) 3 =  2  3    3  2    4  1    5  0 
           
Hence, total no. of ways = 380
= 381
Hence, (a) So R  5
9. (c) N1 = 5C1. 4C4 = 5
N2 = 5C2. 4C3 = 40  5   6   4   5   5   6   4  1   5 
(d) 2=                       = 189
N3 = 5C3. 4C2 = 60  2   2   1   1   3   1   2  1   4 
N4 = 5C4. 4C1 = 20
N5 = 5C5. 4C0 = 1Total = 126 So R  2
10. (5) A, B, C, D, E, F, G, H, I, J 14. (30.00)
x = 10!
A
y = 10C1. 10C2. 8! 9C8
E B
10 10
y C1. C2 .8! 9 10! 45
  5
9x 9  10! 9 10! D C
11. (625)
Option for last two digits are When 1R, 2B, 2G
(12), (24), (32), (44) are (52). 5C1 × 2 = 10
 Total No. of digits = 5 × 5 × 5 × 5 = 625 Other possibilities
12. (119) 1B , 2R, 2G
or 1G, 2R, 2B
n(X) = 5
So total no. of ways = 3 × 10 = 30
n(Y) = 7
15. [495.00]
  Number of one-one function 7 C5  5! Selection of 4 days out of 15 days such that no two of
Number of onto function Y to X them are consecutive
= 15–4+1C4 = 12C4
a1 b1
a2 b2
12  11 10  9
 11 5  9  495
4  3 2
16. (1080.00)
6!
a7 b5 required ways =  4!  1080
2!2!1!1!2!2!
1, 1, 1, 1, 3 1, 1, 1, 2, 2,
PERMUTATIONS AND COMBINATIONS 81 P
W