M a them a ti cs | 5.

31

Solved Examples

JEE Main/Boards Each of the above pairs can be associated with a third
station in (n – 2) ways. Thus, choosing a pair of stations
Example 1: Find the number of ways in which 5 identical and any third station can be done in (n – 1) (n – 2) ways.
balls can be distributed among 10 different boxes, if The above count also includes the case of three
exactly one ball goes into a box. consecutive stations. However, we can see that each
such case has been counted twice. For example, the pair
Sol: It is same as selecting 5 boxes from 10 boxes and S4S5 combined with S6 and the pair S5S6 combined with
distributing the balls in those 5 boxes. S4 are identical.
Number of boxes = 10 and Number of balls = 5. Hence, subtracting the excess counting, the number of
∴ Possible number of ways = C5 10 ways in which three stations can be chosen so that at
least two of them are consecutive
Example 2: There are n intermediate stations on a = (n – 1) (n – 2) – (n – 2) = (n – 2)2
railway line from one terminal to another. In how many
ways can the train stop at 3 of these intermediate Example 3: How many ways are there to invite 1 of 3
stations if friends for dinner on 6 successive nights such that no
friend is invited more than 3 times?
(i) all the three stations are consecutive.
(ii) at least two of the stations are consecutive. Sol: Divide the solution in different possible cases. 6 can
be partitioned in the following ways
Sol: The first part is very trivial. For the second part
1+2+3
consider a pair of consecutive stations and then select
a station such that it is not consecutive. Check for 0+3+3
multiple counting. 2+2+2
Let the intermediate stations be S1, S2,……, Sn Using this we can form different possibilities and
(i) The number of triplets of consecutive stations, as calculate the number of ways the friends can be invited.
S1S2S3, S2S3S4, S3S4S5, …. Sn–2Sn–1Sn, is (n – 2). Let x, y, z be the friends and let (a, b, c) denote the case
(ii) The total number of consecutive pairs of stations, as where x is invited a times, y, b times and z, c times. For
S1S2, S2S3,…………, Sn–1Sn is (n – 1). example, one possible arrangement corresponding to
5 . 3 2 | Permutations and Combinations

the triplet (3, 2, 1) is x, x, y, x, y, z 2 alike of one kind and 3 alike of different kind and so
on. Count the number of words in these cases and their
Then we have the following possibilities:
sum gives us the answer.
(i) (a, b, c) = (1, 2, 3); (1, 3, 2); (2, 3, 1); (2, 1, 3):
Proposition contains 11 letters PP, R, OOO, S, II, T, N.
(ii) (a, b, c) = (3, 3,0); (3,0,3) ; (0, 3, 3).
Following table given the number of words.
(iii) (a, b, c) = (2, 2, 2). So the total number of ways is 6 ×
Repeated letters: O(2), P(2), I(2)
6!/1! 2! 3! + 3 × 6!/3!3! + 6!/2!2!2!
Different letters: R, S, T, N
Note: We can also solve this problem using linear
equations. Letters No. of Words Total
A 5 Distinct 7
C5.5! 2520
Example 4: There are 2n guests at a dinner party.
Supposing that the master and mistress of the B 3 Alike 1.2C1.(51/3!2!) 20
house have fixed seats opposite one another. And
2 Alike
that there are two specified guests who must not be
placed next to one another. Show that the number C 3 Alike 1.6C2.(5!/3!) 300
of ways in which the company can be placed is 2 Different
(2n – 2)! (4n2 – 6n + 4)
D 2 Alike 3
C2.5C1.(5!/2!2!) 450
Sol: This is an application of division into groups. Find 2Other Alike
the total number of ways of arrangement of the guests
and then subtract the number of ways in which the two 1 Different
mentioned guests are together. E 2 Alike 3
C1.6C3.(5!/2!) 3600
Excluding the two specified guests, 2n – 2 persons can be
3 Different
divided into two groups, one containing n and the other
(2n – 2)! Total no. of words = 6890
(n – 2) in and can sit on either side of mister
n!(n – 2)!
and mistress in 2! ways and can arrange themselves in Example 6: There are 10 points in a plane where no
n!(n – 2)! three points are collinear except for 4 points which are
M collinear. Find the number of triangles formed by the
 n-2 points as vertices.
4
n G1 G2 Sol: A triangle is formed from three non-collinear
3 points. Select 3 points from 10 points in 10C3 ways and
m  2
 subtract the cases when the points are collinear, as they
1 would not form a triangle.
Now, the two specified guests where (n – 2) guests are Let us suppose that the 10 points are such that no three
seated will have (n – 1) gaps and can arrange themselves of them are collinear. Now, a triangle will be formed by
in 2! Ways. Number of ways when G1 G2 will always be any three of these ten points. Thus forming a triangle
together amount to selecting any three of the 10 points.
(2n – 2)! Now 3 points can be selected out of 10 point in 10
C3
= 2! n! (n – 2) ! (n – 1) 2! = (2n – 2)! 4(n – 1)
n!(n – 2)! ways.
Hence, the number of ways when G1 G2 are never ∴ Number of triangles formed by 10 points when no
together three of them are collinear = 10C3.
2!
= 2! n! n! – 4(n – 1) (2n – 2)! Similarly, the number of triangles formed by 4 points
n! n! 2!
then no 3 of them are collinear = 4C3
= (2n – 2)! [2n(2n – 1) – 4 (n – 1)] = (2n – 2)! [4n2 – 6n + 4]
∴ Required number of triangle formed = 10
C 3 – 4C 3 =
120 – 4 = 116.
Example 5: Find the number of words of 5 letters that
can be formed with the letters of the word Proposition. Example 7: From 6 gentlemen and 4 ladies, a committee
of 5 is to be formed. In how many ways can this be done
Sol: Divide the cases into words having 5 distinct letters, if the committee is to include at least one lady?
 M a them a ti cs | 5.33

Sol: According to the question, the committee should (b)

include atleast one lady. Consider cases when the
committee consists of 1, 2, 3 or 4 ladies and find the
number of ways for all these cases. 5 5 5 5
Each place can be filled by any of the 5 numbers.
Different combinations are listed below: Therefore, the total number of arrangements is 54.

No. of Ladies No. of Gentlemen No. of Committees (c) Each card can be given to any of the 3 servants.

1 4 4
C 1 6C 4 ∴ No. of ways = 3 × 3 × 3 × 3 × 3 × 3 = 36 = 729.

2 3 4
C 2 6C 3 (d) There are ten letters in the word BENEVOLENT of
which three are E and two are N, and the rest five are
3 2 4
C 3 6C 2 different.
4 1 4
C 4 6C 1 10!
∴ Total number of arrangements =
3! 2!
Total number of committees
Example 9: n1 and n2 are five-digit numbers. Find the
= 4C1 6C4 + 4C2 6C3 + 4C3 6C2 + 4C4 6C1 = 246 total number of ways of forming n1 and n2, so that n2 can
be subtracted from n1 without borrowing at any stage.
Example 8: (a) In how many ways can the following
diagram be coloured, subject to two conditions: Each Sol: Two numbers can be subtracted without borrowing
of the smaller triangle is to be painted with one of three if all the digits in n1 is greater than all the corresponding
colours: red, blue, green and no two adjacent regions digits in the number n2. Using this information, find the
should have the same color? number of ways for different possible cases and add
them up to get the answer.
(b)How many numbers of four digits can be formed
with the digits 1, 2, 3, 4 and 5? Let n1 = x1 x2 x3 x4 x5 and n2 = y1 y2 y3 y4 y5 be two numbers.
n1 and n2 can be subtracted without borrowing at any
stage if xi ≥ yi.
Here, xi and yi denotes the digits at various places in the
number n1 and n2 respectively.

Value of x5 Value of ys
9 0,1,2,…9
8 0,1,2,…8
7 0,1,2,…7
(c) A gentleman has 6 friends to invite. In how many
ways can he send invitation cards to them if he has 3 6 0,1,2,3,4,5,6
servants to carry the cards? 5 0,1,2,3,4,5
(d) Find the number of arrangements of the letters of 4 0,1,2,3,4
the word ‘BENEVOLENT’.
3 0,1,2,3
Sol: For each of the parts (a), (b), (c) and (d), identify 2 0,1
the number of ways a particular cell can be coloured or
filled in and then use permutation / combination to get 1 0
the result. 0
(a) These conditions are satisfied if we proceed as Thus, x5 and y5 can be selected collectively by 10 + 9 +
follows: Just color the central triangle by one color, 8 + … 1 = 55 ways. Similarly, each pair (x4, y4), (x3, y3), (x2,
this can be done in three ways. Next paint other three y2) can be selected in 55 ways. But, pair (x1, y1) can be
triangles with remaining 2 colors. By the fundamental selected in 1 + 2 + 3 + … + 9 = 45 ways as in this pair
principle of counting. This can be done in 3 × 2 × 2 × 2 we cannot have 0.
= 24 ways.
Therefore total number of ways = 45(55)4.
5 . 3 4 | Permutations and Combinations

Example 10: Prove that the product of r consecutive Sol: List down different ways in which we get the sum of
positive integers is divisible by r!. 5 and 4 and get the answer.
Event E (the first throw resulting in 5) can happen in one
Sol: Simple application of the definition of nPr.
of four ways as:
Let P be the product of r consecutive positive integers
3 + 2; 4 + 1; 2 + 3; 1 + 4.
ending with n; then
Event F (the second throw resulting in 4) can happen in
P = n(n – 1) … (n – r + 1)
one of three ways as:
P n(n – 1)...(n – r + 1)
= 2 + 2; 1 + 3; 3 + 1.
r! r!
The two events can together happen in 4 × 3 = 12 ways.
[n(n – 1)(n – 2)...(n – r + 1)][(n – r)...3.2.1]
r!(n – r)...3.2.1
n! Example 3: An eight-oared boat is to be manned by
= = nCr = an integer a crew chosen from 11 men of whom 3 can steer but
r! n – r!
cannot row and the rest cannot steer. In how many ways
∴ P is divisible by r!. can the crew be arranged if two of the men can only row
in bow side?

JEE Advanced/Boards
Bow side

Example 1: How many numbers of n digits can be made

with the non-zero digits in which no two consecutive
digits are the same?
Stroke side
Sol: Using Permutation under Restriction we can easily
find the answer. Sol: Find the number of ways we can select for steering,
There are nine non-zero digits, namely 1, 2, 3, … and 9. rowing and arranging the remaining men. Their product
gives us the required result.
The total number of men = 11
  9   8 8 8 8
The number of men who can only steer = 3
In order the make an n-digit number we have to fill n
places by using the nine digits. As no two consecutive The number of other men = 8
digits are to be the same, a digit used in a place cannot The number of ways of selecting one man for steering
be used in the next place but it can be used again in the out of 3 = 3C1.
place coming after the next place.
The number of ways in which the two particular men
So, the first place can be filled in 9 ways; who only row on bow side
the second place can be filled in 8 ways (rejecting the Can be arranged on bow side = 4P2
digit used in the first place)
The number of ways in which remaining 6 men can be
the third place can be filled in 7 + 1, i.e., 8 ways (rejecting arranged in remaining 6 places = 6!
the digit used in the second place but including the
digit used in the first place) and so on. ∴ The required number = 3C1. 4P2 . 6!

∴ The total number of desired numbers = 3 × 4 × 3 ×6! = 25920

= 9 × 8 × 8 × 8 × … to n factors = 9 × 8n–1.
Example 4: The members of a chess club took part in
a round robin competition in which each plays every
Example 2: A dice is a six-faced cube, with the faces one else once. All members scored the same number of
reading 1, 2, 3, 4, 5 and 6. When two dice are thrown, points, except four juniors whose total score were 17.5.
we add the digits they show on top and take that sum as How many members were there in the club? (Assume
the result of the throw. In how many different ways the
that for each win a player scores 1 point, for draw 1
first throw of the 2 dice shows a total of 5, and second 2
point and zero for losing.)
throw of the 2 dice shows a total of 4?
 M a them a ti cs | 5.35

Sol: Form an equation of the total number of points As the man wants to travel by one of the many possible
scored using the given information. Solve the equation shortest paths, he will never turn to the right or turn
to find the answer. downward. So a travel by one of the shortest paths is to
take 4 horizontal pieces and 4 vertical pieces of roads.
Let the number of members be n.
∴ A shortest path is an arrangement of eight objects
Total number of point = nC2.
L1, L2, L3, L4, U1, U2, U3, U4 so that the order of L’s and U’s
∴ nC2 – 17.5 = (n – 4) x (where x is the number of point do not change.
scored by each player)
( Clearly L2 cannot be taken without taking L1, U2
n (n – 1) – 35 = 2 (n – 4)x cannot be taken without taking U1, etc.)
n(n – 1) – 35 Hence, the number of shortest paths
2x = (where x takes the values 0.5, 1, 1.5 etc.)
n– 4
= The number of arrangements of L1, L2, L3, L4, U1, U2,
n2 – n – 35 U3, U4 where the order of Ls as well as the order of Us
= (must be an integer)
n– 4 do not change
n(n – 4) + 3(n – 4) – 23 23 = The number of arrangement treating Ls as identical
= = (n + 3) –
n– 4 n– 4 and Us as identical
23
⇒ must be an integer 8! 8.7.6.5
n– 4 = = = 2.7.5 = 70.
4! 4! 24
⇒ n = 27 is the only possibility.
Example 7: A condolence meeting being held in a hall
Example 5: If p, q, r, s, t are prime numbers. Find the which has 7 doors, by which mourners enter the hall.
number of ways in which the product, pq2r3st can be One can use any of the 7 doors to enter and can come
expressed as product of two factors, excluding 1 as a at any time during the meeting. At each door, a register
factor. is kept in which mourner has to affix his signature while
entering the hall. If 200 people attend the meeting,
Sol: Use the standard result to find the answer. how many different sequences of 7 lists of signatures
Total factors = 2 × 3 × 4 × 2 × 2 = 96 can arise?
96
Hence, the total ways = = 48. but this includes 1
2 Sol: Clearly, the total number of people is 200, hence the
and the number itself also. Hence, the required number sum of the entries is 200. Apply Multinomial theorem
of ways = 48 – 1 = 47 to find the total number of ways list can be made and
hence the answer.
Example 6: In the given figure you have the road plan There are 7 lists, say 1, 2,…. 7. Suppose, that list i has xi
of a city. A man standing at X wants to reach the cinema names; then,
hall at Y by the shortest path. What is the number of
different paths that he can take? x1 + ….. + x7 = 200 where xi ≥ 0 is an integer.

Y We need to first find the number of solutions of this

equation.
U4
(Note that this does not complete the solution to
U3 the questions as list 1 may contain 7 names which
would remain the same in 7!, arrangements of the
U2 names)
The number of solutions are = 200+7–1C7–1 = 206C6
U1
X But corresponding to any one solution (x1…x7) (i.e. list
L4 L4 L2 L1
f contains xf names) we can have 200! arrangements
Sol: If the man moves only in the upward and the consistent with distribution of xj names to jth list
leftward direction, then the path will be the shortest. ∴ The number of different sequences of 7 lists
Use this idea to calculate total number of shortest 206
paths. = 206C6 × 200! = .
6!
5 . 3 6 | Permutations and Combinations

JEE Main/Boards

Exercise 1 (ii) How many characters can be transmitted by using

(a) exactly five symbols? (b) at most five symbols?
Q.1 How many odd numbers less than 1000 can be
Q.11 In how many of the distinct permutation of the
formed using the digits 0, 1, 4 and 7 if repetition of
letter in MISSISSIPPI do the four I’s not come together?
digits is allowed?

Q.12 In how many ways 4 boys and 3 girls can be seated

Q.2 In how many ways can five people be seated in
in a row so that they are alternate?
a car with two people in the front seat and three in
the rear, if two particular persons out of the five cannot
drive? Q.13 A biologist studying the genetic code is interested
to know the number of possible arrangements of 12
molecules in a chain. The chain contains 4 different
Q.3 A team consisting of 7 boys and 3 girls play singles
molecules represented by the initials A (for adenine),
matches against another team consisting of 5 boys and
C (for Cytosine), G(for Guanine) and T (for Thymine)
5 girls. How many matches can be scheduled between
and 3 molecules of each kind. How many different such
the two teams if a boy plays against a girl and a girl
arrangements are possible in all?
plays against a boy?

(2n + 1) Q.14 Find the number of rearrangement of the letters of

Q.4 Prove that = 2n[1.3.5…(2n – 1)(2n + 1)]
n! the word ‘BENEVOLENT’. How many of them end in L?
Q.5 If nP4 =360, find n.
Q.15 How many words can be formed with the letters
of the word PATALIPUTRA’ without changing the relative
Q.6 Find the number of numbers between 300 and
order of the vowels and consonants?
3000 which can be formed with the digits 0, 1, 2, 3, 4
and 5, with no digit being repeated in any number.
Q.16 A person is to walk from A B
to B. However, he is restricted to
Q.7 How many even numbers are there with three digits
walk only to the right of A or
such that if 5 is one of the digits in a number then 7 is
upwards of A, but not necessarily
the next digit in that number?
in this order. One such path is
shown in the given figure
Q.8 Find the sum of 3 digit numbers formed by digits Determine the total number of
1, 2, 3 is paths available to the person A
from A to B.
Q.9 A telegraph has 5 arms and each arm is capable of
4 distinct positions, including the position of rest. What Q.17 In how many ways can three jobs I, II and III be
is the total number of signals that can be made? assigned to three persons A, B and C, if one person
is assigned only one job and all are capable of doing
Q.10 In telegraph communication, the Morse code is each job? Which assignment of jobs will take the least
used in which all the letters of the English alphabet, time to complete the jobs, if time taken (in hours) by an
digits 0 to 9 and even the punctuation marks, all usually individual on each job as follows?
referred as characters, are represented by ‘dots’ and
‘dashes’ Job persons I II III

For example, E is represented by a dot (.), T by a dash A 5 4 4

(–), O by three dashes (- - -), S by three dots (. . .) and so
1 1
on. Thus, SOS is represented by (. . . – – – . . .). B 4 3 4
4 2
(i) How many characters can be transmitted using one
symbol (dot or dash), two symbols, three symbols, C 5 3 5
four symbols? Also find the total number of characters
which can be transmitted using at most four symbols.
 M a them a ti cs | 5.37

Q.18 If 15C3r = 15Cr+3’ find r. Exercise 2

n r n n− s
Q.19 Prove that Cr × Cs = Cs × Cr −s . Single Correct Choice Type

Q.20Find the value of the expression Q.1 If the letters of the word “VARUN” are written in all
5 possible ways and then are arranged as in a dictionary,
47
C4 + ∑ 52– j C3 . then rank of the word VARUN is:
j=1
(A) 98 (B) 99 (C) 100 (D) 101
Q.21 Prove that the product of r consecutive integers
is divisible by r!. Q.2 Number of natural numbers between 100 and 1000
such that at least one of their digits is 7, is
Q.22 From a class of 25 students, 10 are to be chosen
(A) 225 (B) 243 (C) 252 (D) none
for a field trip. There are 3 students who decide that
either all of them will join or none of them will join. In
Q.3 The 120 permutations of MAHES are arranged in
how many ways can the field trip members be chosen?
dictionary order, as if each were an ordinary five-letter
word. The last letter of the 86th word in the list is
Q.23 There are ten points in a plane. Of these ten
points, four points are in a straight line and with the (A) A (B) H (C) S (D) E
exception of these four points, no three points are in
the same straight line. Find- Q.4 A new flag is to be designed with six vertical strips
using some or all of the colors yellow green, blue and
(i) The number of triangles formed.
red. Then the number of ways this can be done such
(ii) The number of straight lines formed that no two adjacent strips have the same color is
(iii) The number of quadrilaterals formed, by joining (A) 12 × 81 (B) 16 × 192 (C) 20 × 125 (D) 24 × 216
these ten points.
Q.5 The number of 10-digit numbers such that the
Q.24 In an examination a minimum of is to be secured product of any two consecutive digits in the number is
in each of 5 subjects for a pass. In how many ways can a prime number, is
a student fail?
(A) 1024 (B) 2048 (C) 512 (D) 64
Q.25 In how many ways 50 different objects can be
Q.6 Consider the five points comprising of the vertices
divided in 5 sets three of them having 12 objects each
of a square and the intersection point of its diagonals.
and two of them having 7 objects each.
How many triangles can be formed using these points?
Q.26 Six “X”s (crosses) have to be placed in the squares (A) 4 (B) 6 (C) 8 (D) 10
of the figure given below, such that each row contains
at least one X. In how many different ways can this be Q.7 How many of the 900 three digit numbers have at
done? least one even digit?
(A) 775 (B) 875 (C) 100 (D) 101

Q.8 A 5 digit number divisible by 3 is to be formed

using the numbers 0, 1, 2, 3, 4 & 5 without repetition.
The total number of ways in which this can be done is:
Q.27 Five balls of different colors are to be placed in (A) 3125 (B) 600 (C) 240 (D) 216
three boxes of different sizes. Each box can hold all five
balls. In how many different ways can we place the balls Q.9 The number of different seven digit numbers that
so that no box remains empty? can be written using only three digits 1, 2 & 3 under the
condition that the digit 2 occurs exactly twice in each
Q.28 How many different words of 4 letters can be number is
formed with the letters of the word “EXAMINATION”?
(A) 672 (B) 640 (C) 512 (D) none
5 . 3 8 | Permutations and Combinations

Q.10 Out of seven consonants and four vowels, the Q.20 A students have to answer 10 out of 13 questions
number of words of six letters, formed by taking four in an examination. The number of ways in which he
consonants and two vowels is (Assume that each can answer if he must answer at least 3 of the first five
ordered group of letter is a word): questions is
(A) 210 (B) 462 (C) 151200 (D) 332640 (A) 276 (B) 267 (C) 80 (D) 1200

Q.11 All possible three digits even numbers which can Q.21 The number of three digit numbers having only
be formed with the condition that if 5 is one of the two consecutive digits identical is:
digit, then 7 is the next digit is:
(A) 153 (B) 162 (C) 180 (D) 161
(A) 5 (B) 325 (C) 345 (D) 365
Q.22 The interior angles of a regular polygon measure
Q.12 Number of 5 digit numbers which are divisible by 150º each. The number of diagonals of the polygon is
5 and each number containing the digit 5, digits being
(A) 35 (B) 44 (C) 54 (D) 78
all different is equal to k(4!), the value of k is
(A) 84 (B) 168 (C) 188 (D) 208 Q.23 The number of n digit numbers which consists of
the digits 1 & 2 only if each digit is to be used at least
Q.13 The number of six digit numbers that can be once, is equal to 510 then n is equal to:
formed from the digits 1, 2, 3, 4, 5, 6, & 7 so that digits
(A) 7 (B) 8 (C) 9 (D) 10
do not repeat and the terminal digit are even is:
(A) 144 (B) 72 (C) 288 (D) 720 Q.24 Number of four digit numbers with all digits
different and containing the digit 7 is
Q.14 The number of natural numbers from 1000 to
(A) 2016 (B) 1828 (C) 1848 (D) 1884
9999 (both inclusive) that do not have all 4 different
digits is
Q.25 An English school and a Vernacular school are
(A) 4048 (B) 4464 (C) 4518 (D) 4536 both under one superintendent. Suppose that the
superintendentship, the four teachership of English
Q.15 Number of positive integers which have no two and Vernacular school each, are vacant, if there be
digits having the same value with sum of their digits altogether 11 candidates for the appointments, 3 of
being 45, is whom apply exclusively for the superintendentship and
(A) 10! (B) 9! (C) 9.9! (D) 17.8! 2 exclusively for the appointment in the English school,
the number of ways in which the different appointment
Q.16 Number of 3 digit number in which the digit at can be disposed of is :
hundredth’s place is greater than the other two digit is (A) 4320 (B) 268 (C) 1080 (D) 25920
(A) 285 (B) 281 (C) 240 (D) 204
Q.26 A committee of 5 is to be chosen from a group of
Q.17 Number of permutation of 1, 2, 3, 4, 5, 6, 7, 8 and 9 people. Number of ways in which it can be formed if
9 taken all at a time, such that the digit 1 appearing two particular persons either serve together or not at
somewhere to the left of 2, 3 appearing to somewhere all and two other particular persons refuse to serve with
the left of 4 and 5 somewhere to the left of 6, is (e.g. each other, is
815723946 would be one such permutation) (A) 41 (B) 36 (C) 47 (D) 76
(A) 9.7! (B) 8! (C) 5!.4! (D) 8!.4!
Q.27 A question paper on mathematics consists of
Q.18 Number of odd integers between 1000 and 8000 twelve questions divided into three parts A, B and C,
which have none of their digit repeated, is each containing four questions, in how many ways can
an examinee answer five questions, selecting at least
(A) 1014 (B) 810 (C) 690 (D) 1736
one from each part?

Q.19 The number of ways in which 5 different books (A) 624 (B) 208 (C) 1248 (D) 2304
can be distributed among 10 people if each person can
get at most one book is:
(A) 252 (B) 105 (C) 510 (D) 10C5.5!
 M a them a ti cs | 5.39

Q.28 Number of ways in which 7 green bottles and 8 Q.36 Number of different words that can be formed
blue bottles can be arranged in a row if exactly 1 pair of using all the letters of the word “DEEPMALA” if two
green bottles is side by side, is (Assume all bottles to be vowels are together and the other two are also together
alike except for the color). but separated from the first two is
(A) 84 (B) 360 (C) 504 (D) None (A) 960 (B) 1200 (C) 2160 (D) 1440

Q.29 The kindergarden teacher has 25 kids in her class. Q.37 In a unique hockey series between India &
She takes 5 of them at a time, to zoological garden as Pakistan, they decide to play on till a team wins 5
often as she can, without taking the same 5 kids more matches. The number of ways in which the series can
than once. Then the number of visits, the teacher makes be won by India, if no match ends in a draw is:
to the garden exceeds that of a kid by: (A) 126 (B) 252 (C) 225 (D) None
(A) C5 – C5 (B) C5
25 24 24
(C) C4
24
(D) None
Q.38 Sameer has to make a telephone call to his friend
Harish, Unfortunately he does not remember the 7 digit
Q.30 A rack has 5 different pairs of shoes. The number phone number. But he remembers that the first three
of ways in which 4 shoes can be chosen from it so that digits are 635 or 674, the number is odd and there is
there will be no complete pair is: exactly one 9 in the number. The maximum number of
(A) 1920 (B) 200 (C) 110 (D) 80 trials that Sameer has to make to be successful is
(A) 10,000 (B) 3402 (C) 3200 (D) 5000
Q.31 Number of ways in which 9 different toys can be
distributed among 4 children belonging to different Q.39 There are 12 guests at a dinner party. Supposing
age groups in such a way that distribution among the that the master and mistress of the house have fixed
3 elder children is even and the youngest one is to seats opposite one another, and that there are two
receive one toy more, is: specified guests who must always, be placed next to
(5!)
2
9! 9! one another; the number of ways in which the company
(A) (B) (C) (D) None
8 2 3!(2!)3 can be placed is :
(A) 20 . 10 ! (B) 22 . 10 ! (C) 44 . 10 ! (D) None
Q.32 There are 10 red balls of different shades & 9
green balls of identical shades. Then the number of Q.40 In a conference 10 speakers are present. If S1
such arrangements such that no two green balls are wants to speak before S2 and S2 wants to speak after
together in the row is: S3, then the number of ways all the 10 speakers can
(A) (10!).11P9 (B) (10!).11C9 (C) 10! (D) 10! 9! give their speeches with the above restriction if the
remaining seven speakers have no objection to speak
Q.33 A shelf contains 20 different books of which 4 are at any number is
10!
in single volume and the others form sets of 8, 5 and (A) 10C3 (B) 10P8 (C) 10P3 (D)
3
3 volumes respectively. Number of ways in which the
books may be arranged on the shelf, if the volumes of
Q.41 The number of all possible selection of one or
each set are together and in their due order is
more questions from 10 given questions, each question
20! having an alternative is:
(A) (B) 7! (C) 8! (D) 7.8!
8!5!3! (A) 310 (B) 210–1 (C) 310 – 1 (D) 210

Q.34 Number of ways in which 3 men and their wives

Q.42 Number of 7 digit numbers the sum of whose
can be arranged in a line such that none of the 3 men
digits is 61 is:
stand in a position that is ahead of his wife, is
(A) 12 (B) 24 (C) 28 (D) None
6!
(A) 3!.3! (B) 2.3!.3! (C) 3! (D)
2!2!2! Q.43 There are 2 identical white balls, 3 identical red
balls and 4 green balls of different shades. The number
Q.35 The number of different ways in which five ‘dashes’
of ways in which they can be arranged in a row so that
and eight ‘dots’ can be arranged, using only seven of
at least one ball is separated from the balls of the same
these 13 ‘dashes’ & ‘dots’ is
color, is:
(A) 1287 (B) 119 (C) 120 (D) 1235520 (A) 6 (7! – 4!) (B) 7 (6! – 4!) (C) 8 ! – 5! (D) None
5 . 4 0 | Permutations and Combinations

Q.44 Product of all the even divisors of N = 1000, is Q.52 The number 916238457 is an example of nine
digit number which contains each of the digit 1 to 9
(A) 32 . 102 (B) 64 . 214 (C) 64 . 1018 (D) 128 . 106
exactly once. It also has the property that the digits 1
to 5 occur in their natural order, while the digits 1 to 6
Q.45 A lift with 7 people stops at 10 floors. People
do not. Number of such numbers are
varying from zero to seven go out at each floor. The
number of ways in which the lift can get emptied, (A) 2268 (B) 2520 (C) 2975 (D) 1560
assuming each way only differs by the number of
people leaving at each floor, is Q.53 Number of functions defined from f : {1, 2, 3, 4, 5,
6} → {7, 8, 9, 10} such that the sum f(1) + f(2) + f(3) +
(A) 16C6 (B) 17C7 (C) 16C7 (D) None
f(4) +f(5) + f(6) is odd, is
Q.46 You are given an unlimited supply of each of the (A) 210 (B) 211 (C) 212 (D) 212 – 1
digits 1, 2, 3 or 4. Using only these four digits, you
construct n digit numbers. Such n digit numbers will Multiple Correct Choice Type
be called LEGITIMATE if it contains the digit 1 either
an even number times or not at all. Number of n digit Q.54 The continued product, 2.6.10.14… to n factors is
legitimate numbers are equal to:
(A) 2n + 1 (B) 2n+1 + 2 (C) 2n+2 + 4 (D) 2n–1(2n + 1) (A) 2nCn (B) 2nPn

Q.47 Distinct 3 digit numbers are formed using only the (C) 2n+1Cn (D) None
digits 1, 2, 3 and 4 with each digit used at most once
in each number thus formed. The sum of all possible Q.55 The maximum number of permutations of 2n
numbers so formed is letters in which there are only a’s & b’s, taken all at a
time is given by :
(A) 6660 (B) 3330 (C) 2220 (D) None
(A) 2nCn
Q.48 An ice cream parlor has ice creams in eight 2 6 10 4n – 6 4n – 2
(B) . . … .
different varieties. Number of ways of choosing 3 ice 1 2 3 n–1 n
creams taking at least two ice creams of the same
n + 1 n + 2 n + 3 n + 4 2n – 1 2n
variety, is (Assume that ice creams of the same variety (C) . . . … .
1 2 3 4 n–1 n
to be identical & available in unlimited supply)
2n 1.3.5...(2n – 3)(2n – 1)
(A) 56 (B) 64 (C) 100 (D) None (D)
n!
Q.49 There are 12 books on Algebra and Calculus (E) All of the above
in our library, the books of the same subject being
different. If the number of selection each of which
consists of 3 books on each topic is greatest then the Q.56 Number of ways in which 3 numbers in A.P. can be
number of books of Algebra and Calculus in the library selected from 1, 2, 3,… n is :
are respectively: 2
n–1 n(n – 2)
(A)   if n is even (B) if n is odd
(A) 3 and 9 (B) 4 and 8 (C) 5 and 7 (D) 6 and 6  2  4

Q.50 A person writes letters to his 5 friends and addresses (n – 1) n(n – 2)

the corresponding envelopes. Number of ways in which (C) if n is odd (D) if n is even
4 4
the letters can be placed in the envelope, so that at least
two of them are in the wrong envelopes, is,
(A) 1 (B) 2 (C) 118 (D) 119 Previous Years’ Questions
5
Q.51 For a game in which two partners oppose two Q.1 The value of the expression 47
C4 + ∑ 52– j C3 is
j=1
other partners, 8 men are available. If every possible equal to (1982)
pair must play with every other pair, the number of
games played is (A) 47C5 (B) 52C5

(A) 8C2 . 6C2 (B) 8C2 . 6C2 . 2 (C) 8C4 . 3 (D) None (C) 52C4 (D) None of these
 M a them a ti cs | 5.41

Q.2 Eight chairs are numbered 1 to 8. Two women and Q.5 If r, s, t are prime numbers and p, q are the positive
three men wish to occupy one chair each. First the integers such that LCM of p, q is r2s4t2, then the number
women choose the chairs from amongst the chairs of ordered pairs (p, q) is  (2006)
marked 1 to 4, and then the men select the chairs
(A) 252 (B) 254 (C) 225 (D) 224
from amongst the remaining. The number of possible
arrangements is  (1982)
Q.6 The letters of the word COCHIN are permuted and
(A) 6C3 × 4C2 (B) 4P2 × 4P3 all the permutations are arranged in an alphabetical
(C) 4C2 + 4P3 (D) None order as in an English dictionary. The number of words
that appear before the word COCHIN is (2007)
Q.3 A five digits number divisible by 3 is to be formed (A) 360 (B) 192 (C) 96 (D) 48
using the numbers 0, 1, 2, 3, 4 and 5, without repetition.
The total number of ways this can be done, is  (1989) Q.7 The number of seven digit integers, with sum of the
(A) 216 (B) 240 (C) 600 (D) 3125 digits equal to 10 and formed by using the digits 1, 2
and 3 only, is  (2009)
Q.4 Number of divisors of the form (4n + 2), n ≥ 0 of (A) 55 (B) 66 (C) 77 (D) 88
integer 240 is  (1998)
(A) 4 (B) 8 (C) 10 (D) 3

JEE Advanced/Boards

Exercise 1
Q.6 In an election for the managing committee of a
Q.1 Consider all the six digit numbers that can be reputed club, the number of candidates contesting
formed using the digits 1, 2, 3, 4, 5 and 6, each digit elections exceeds the number of members to be
being used exactly once. Each of such six digit numbers elected by r(r > 0). If a voter can vote in 967 different
have the property that for each digit, not more than ways to elect managing committee by voting at least
two digits, smaller than that digit, appear to the right 1 of them & can vote in 55 different ways to elect (r –
of that digit. Find the number of such six digit numbers 1) candidates by voting in the same manner. Find the
having the desired property number of candidates contesting the election & the
number of candidates losing the elections.
Q.2 Find the number of five digit number that can be
formed using the digits 1, 2, 3, 4, 5, 5, 7, 9 in which Paragraph for question nos. 7 to 9:
one digit appears once and two digits appear twice (e.g 2 American men; 2 British men; 2 Chinese men and one
41174 is one such number but 75355 is not.) each of Dutch, Egyptian, French and German persons
are to be seated for a round table conference.
Q.3 Find the number of ways in which 3 distinct
numbers can be selected from the set {31, 32, 33, ….. 3100, Q.7 If the number of ways in which they can be seated
3101} so that they form a G.P. if exactly to pairs of persons of same nationality are
together is p(6!), then find p.
Q.4 Find the number of odd numbers between 3000 to
6300 that have all different digits. Q.8 If the number of ways in which only American pair
is adjacent is equal to q(6!), then find q.
Q.5 A man has 3 friend. In how many ways he can invite
one friend every day for dinner on 6 successive nights Q.9 If the number of ways in which no two people of
so that no friend is invited more than 3 times. the same nationality are together given by r (6!), find r.
5 . 4 2 | Permutations and Combinations

Q.10 For each positive integer k, let Sk denote the Q.18 (a) Find the number of non-empty subsets S of {1,
increasing arithmetic sequence of integers whose 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} such that if, S contains k
first term is 1 and whose common difference is k. For elements, then S contains no number less than k.
example, S3 is the sequence 1, 4, 7, 10 ….. Find the
(b) If the number of ordered pairs (S, T) of subsets of
number of values of k for which Sk contain the term 36!
{1, 2, 3, 4, 5, 6} are such that S ∪ T contains exactly three
elements 10λ, then find the value of λ.
Q.11 A shop sells 6 different flavors of ice-cream. In
how many ways can a customer choose 4 ice-cream
Q.19 Find the number of permutation of the digits 1,
cones if
2, 3, 4 and 5 taken all at a time so that the sum of the
(i) They are all of different flavors digits at the first two places is smaller than the sum of
the digit at the last two places.
(ii) They are not necessarily of different flavors
(iii) They contain only 3 different flavors Q.20 In a league of 8 teams, each team played every
(iv) They contain only 2 or 3 different flavors? other team 10 times. The number of wins of the 8 teams
formed an arithmetic sequence. Find the least possible
Q.12 (a) How many divisors are there of the number number of games won by the champion.
21600. Find also the sum of these divisors.
Q.21 Find the sum of all numbers greater than 10000
(b) In how many ways the number 7056 can be resolved formed by using the digits 0, 1, 2, 4, 5 no. digit being
as a product of 2 factors. repeated in any number.
(c) Find the number of ways in which the number
300300 can be split into 2 factors which are relatively Q.22 There are 3 cars of different make available to
prime. transport 3 girls and 5 boys on a field trip. Each car can
hold up to 3 children. Find
(d) Find the number of positive integers that are divisors
of at least one of the number 1010; 157; 1811. (a) the number of ways in which they can be
accommodated.
Q.13 How many 15 letter arrangement of 5A’s, 5 B’s and (b) the numbers of ways in which they can be
5 C’s have no A’s in the first 5 letters, no B’s in the next accommodated if 2 or 3 girls are assigned to one of
5 letters, and to C’s in the last 5 letters. the cars.

Q.14 Determine the number of paths from the origin to In both the cases internal arrangement of children
the point (9, 0) in the Cartesian plane which never pass inside the car is considered to be immaterial.
through (5, 5) in paths consisting only of steps going 1
unit North and 1 unit East. Q.23 Find the number of three elements sets of positive
integers {a, b, c} such that a × b × c = 2310.
Q.15 There are n triangles of positive area that have
one vertex A(0, 0) and the other two vertices whose Q.24 Find the number of integer between 1 and 10000
coordinates are drawn independently with replacement with a least one 8 nd at least one 9 as digits
from the set {0, 1, 2, 3, 4} e.g. (1. 2), (0, 1) (2, 2) etc. Find
the value of n. Q.25 Let N be the number of ordered pairs of non-
empty sets A and B that have the following properties:
Q.16 How many different ways can 15 Candy bars be (a) A ∪ B = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
distributed between Ram, Shyam, Ghanshyam and
Balram, if Ram cannot have more than 5 candy bars (b) A ∩ B = φ
and Shyam must have at least two. Assume all Candy (c) The number of elements of A is not the element of B.
bars to be alike
(d) The number of elements of B is not an element of A.
Q.17 Find the number of three digits number from 100 Find N.
to 999 inclusive which have any one digit that is the
average of the other two. Q.26 In how many other ways can be letters of the word
MULTIPLE be arranged:
(i) Without changing the order of the vowels
 M a them a ti cs | 5.43

(ii) Keeping the position of each vowel fixed and Q.5 Number of different natural numbers which are
without changing the relative order/position or vowels smaller than two hundred million and use only the
& consonants. digits 1 or 2 is
(A) (3) . 28 – 2 (B) (3) . 28 – 1
Q.27 Let N denotes the number of all 9 digits numbers if
(C) 2 (29 – 1) (D) None
(a) The digit of each number are all from the set {5, 6,
7, 8, 9} and
Q.6 There are counters available in x different colors.
(b) Any digit that appears in the number, repeats at The counters are all alike except for the color. The total
least three times. Find the value of N/5. number of arrangements consisting of y counters,
assuming sufficient number of counters of each color,
Q.28 How many integers between 1000 and 9999 have if no arrangement consists of all counters of the same
exactly one pair of equal digit such as 4049 or 9902 but color is:
not 4449 or 4040? (A) xy – x (B) xy – y (C) yx – x (D) yx – y

Q.29 How many 6 digits odd numbers greater than Q.7 If m denotes the number of 5 digit numbers of
60,000 can be formed from the digits 5, 6, 7, 8, 9, 0 if each successive digits are in their descending order
(i) Repetitions are not allowed magnitude and n is the corresponding figure, when the
digits are in their ascending order of magnitude then
(ii) Repetitions are allowed.
(m – n) has the value
(A) 10C4 (B) 9C5 (C) 10C3 (D) 9C3
Exercise 2
Q.8 There are m points on straight line AB & n points on
Single Correct Choice Type the line AC none of them being the point A. Triangles
are formed with these points as vertices, when
Q.1 An eight digit number divisible by 9 is to be formed
(i) A is excluded
by using 8 digits out of the digits 0, 1, 2, 3, 4, 5, 6, 7 8, 9
without replacement. The number of ways in which this (ii) A is included. The ration of number of triangles in
can be done is the two cases is:
(A) 9! (B) 2(7!) (C) 4(7!) (D) (36) (7!) m+n–2 m+n–2
(A) (B)
m+n m+n–1
Q.2 Number of 4 digit numbers of the form N = abcd m+n–2 n(n – 1)
(C) (D
which satisfy following three conditions m+n+2 (m + 1)(n + 1)
(i) 4000 ≤ N < 6000
Q.9 The number of 5 digit numbers such that the sum
(ii) N is a multiple of 5
of their digits is even is
(iii) 3 ≤ b < c ≤ 6 is equal to
(A) 50000 (B) 45000 (C) 60000 (D) None
(A) 12 (B) 18 (C) 24 (D) 48
Q.10 Number of ways in which 8 people can be
Q.3 5 Indian & 5 American couples meet at a party arranged in a line if A and B must be next each other
and shake hands. If no wife shakes hands with her own and C must be somewhere behind D, is equal to
husband and no Indian wife shakes hands with a male
(A) 10080 (B) 5040 (C) 5050 (D) 10100
then the number of handshakes that takes place in the
party is
Q.11 Seven different coins are to be divided amongst
(A) 95 (B) 110 (C) 135 (D) 150 three persons. If no two of the persons receive the same
number of coins but each receives at least one coin &
Q. 4 The 9 horizontal and 9 vertical lines on an 8 × 8 none is left over, then the number of ways in which the
chessboard form ‘r’ rectangles and ‘s’ squares, The ratio division may be made is
s/r in its lowest terms is
(A) 420 (B) 630 (C) 710 (D) None
1 17 4
(A) (B) (C) (D) None
6 108 27
5 . 4 4 | Permutations and Combinations

Q.12 Let there be 9 fixed point on the circumference of Q.19 Number of rectangles in the grid shown which are
a circle. Each of these points is joined to every one of not squares is
the remaining 8 points by a straight line and the points
are so positioned on the circumference that at most 2 
straight lines meet in any interior point of the circle. The
number of such interior intersection points is:
(A) 126 (B) 351 (C) 756 (D) None
(A) 160 (B) 162 (C) 170 (D) 185
Q.13 The number of ways in which 8 distinguishable
apples can be distributed among 3 boys such that every Q.20 All the five digit numbers in which each successive
boy should get at least 1 apple & at most 4 apples is K. digit exceeds its predecessor are arranged in the
7
P3 where K has the value equal to increasing order of their magnitude. The 97th number in
(A) 14 (B) 66 (C) 44 (D) 22 the list does not contains the digit
(A) 4 (B) 5 (C) 7 (D) 8
Q.14 There are five different peaches and three different
apples. Number of ways they can be divided into two Q.21 There are n identical red balls & m identical green
packs of four fruits if each pack must contain at least balls. The number of different linear arrangements
one apple, is consisting of n red ball but not necessarily all the green
(A) 95 (B) 65 (C) 60 (D) 30 balls’ is xCy then
(A) x = m + n, y = m
Q.15 Let Pn denote the number of ways in which three
people can be selected out of ‘n’ people sitting in a row, (B) x = m + n + 1, y = ,m
if no two of them are consecutive. If Pn+1 – Pn = 15 then (C) x = m + n + 1, y = m + 1
the value of ‘n’ is
(D) x = m + n, y = n
(A) 7 (B) 8 (C) 9 (D) 10
Q.22 A gentleman invites a party of m + n (m ≠ n) friends
Q.16 The number of positive integers not greater than to a dinner & places m at one table T1 and n at another
100, which are not divisible by 2, 3 or 5 is table T2, the table being round, if not all people shall have
(A) 26 (B) 18 (C) 31 (D) None the same neighbor in any two arrangement, then the
number of ways in which he can arrange the guests, is
Q.17 There are six periods in each working day of a (m + n)! 1 (m + n)!
(A) (B)
school. Number of ways in which 5 subjects can be 4mn 2 mn
arranged if each subject is allotted at least one period
(m + n)!
and no period remains vacant is (C) 2 (D) None
mn
(A) 210 (B) 1800 (C) 360 (D) 3600
Q.23 Consider a determinant of order 3 all whose
Q.18 An old man while dialing a 7 digit telephone entries are either 0 or 1. Five of these entries are 1 and
number remembers that the first four digits consists of four of them are ‘0’. Also aij = aji ∀ 1 ≤ i, j ≤ 3. The
one 1’s, one 2’s and two 3’s. He also remembers that number of such determinants, is equal to
the fifth digit is either a 4 or 5 while has no memorizing
(A) 6 (B) 8 (C) 9 (D) 12
of the sixth digit, he remembers that the seventh digit
is 9 minus the sixth digit. Maximum number of distinct
Q.24 A team of 8 students goes on an excursion, in
trials he has to try to make sure that he dials the correct
two cars, of which one can seat 5 and the other only 4.
telephone number, is
If internal arrangement inside the car does not matter
(A) 360 (B) 240 (C) 216 (D) None then the number of ways in which they can travel, is
(A) 91 (B) 182 (C) 126 (D) 3920
 M a them a ti cs | 5.45

Q.25 One hundred management students who read at Q.33 The number of ways of choosing a committee
least one of the three business magazines are surveyed of 2 women & 6 men, if Mr. A refuses to serve on the
to study the readership pattern. It is found that 80 committee if Mr. B is a member & Mr. B can only serve,
read Business India, 50 read Business world, and 30 if Miss C is the member of the committee, is
read Business Today. Five students read all the three
(A) 60 (B) 84 (C) 124 (D) None
magazines. How many read exactly two magazines?
(A) 50 (B) 10 (C) 95 (D) 45 Q.34 Six person A, B, C, D, E and F are to be seated at a
circular table. The number of ways this can be done if
Q.26 Six people are going to sit in a row on a bench. A A must have either B or C on his right and B must have
and B are adjacent, C does not want to sit adjacent to either C or D on his right is:
D. E and F can sit anywhere. Number of ways in which
(A) 36 (B) 12 (C) 24 (D) 18
these six people can be seated, is
(A) 200 (B) 144 (C) 120 (D) 56 Q.35 There are 100 different books in a shelf. Number
of ways in which 3 books can be selected so that no two
Q.27 Number of cyphers at the end of 2002C1001 is of which are adjacent is
(A) 0 (B) 1 (C) 2 (D) 200 (A) 100C3 – 98 (B) 97C3 (C) 96C3 (D) 98C3

Q.28 Three vertices of a convex n sided polygon

are selected. If the number of triangles that can be Q.36 Number of ways in which four different toys
constructed such that none of the sides of the triangle and five indistinguishable marbles can be distributed
is also the side of the polygon is 30, then the polygon between Amar, Akbar and Anthony, if each child
is a receives at least one toy and one marble, is

(A) Heptagon (B) Octagon (A) 42 (B) 100 (C) 150 (D) 216

(C) Nonagon (D) Decagon Q.37 A 3 digit palindrome is a 3 digit number (not
starting with zero) which reads the same backwards as
Q.29 Given 11 points, of which 5 lie on one circle, other forwards. For example 171. The sum of all even 3 digit
than these 5, no 4 lie on one circle. Then the maximum palindromes, is
number of circles that can be drawn so that each
contains at least three of the given points is: (A) 22380 (B) 25700 (C) 22000 (D) 22400

(A) 216 (B) 156 (C) 172 (D) None Q.38 Two classrooms A and B having capacity of 25
and (n–25) seats respectively An denotes the number
Q.30 Number of 5 digit numbers divisible by 25 that of possible seating arrangements of room ‘A’, when
can be formed using only the digits 1, 2, 3, 4, 5, & 0 ‘n’ students are to be seated in these rooms, starting
taken five at a time is from room ‘A’ which is to be filled up full to its capacity.
(A) 2 (B) 32 (C) 42 (D) 52 If An – An–1 = 25! (49C25) then ‘n’ equals
(A) 50 (B) 48 (C) 49 (D) 51
Q.31 Let Pn denotes the number of ways of selecting
3 people out of ‘n’ sitting in a row, if no two of them Q.39 Number of positive integral solution satisfying
are consecutive and Qn is the corresponding figure the equation (x1 + x2 + x3) (y1 + y2) = 77, is
when they are in a circle. If Pn – Qn = 6, then ‘n’ is
equal to (A) 150 (B) 270 (C) 420 (D) 1024

(A) 8 (B) 9 (C) 10 (D) 12 Q.40 There are counters available in 3 different colors (at
least four of each color). Counters are all alike except for the
Q.32 Let m denote the number of ways in which 4 color. If ‘m’ denotes the number of arrangements of four
different books are distributed among 10 persons, counters if no arrangement consists of counters of same
each receiving none or one only and let n denote the color and ‘n’ denotes the corresponding figure when every
number of ways of distribution if the books are all alike. arrangement consists of counters of each color, then:
Then:
(A) m = 2 n (B) 6 m = 13 n
(A) m = 4n (B) n = 4m (C) m = 24 n (D) none
(C) 3 m = 5 n (D) 5 m = 3 n
5 . 4 6 | Permutations and Combinations

Q.41 Three digit numbers in which the middle one is a Multiple Correct Choice Type
perfect square are formed using the digits 1 to 9. Their
sum is: Q.46 The combinatorial coefficient C(n, r) is equal to
(A) 134055 (B) 270540 (A) number of possible subsets of r members from a set
of n distinct members.
(C) 170055 (D) none
(B) number of possible binary messages of length n
Q.42 A guardian with 6 wards wishes every one of with exactly r l’s.
them to study either Law of Medicine or Engineering. (C) number of non-decreasing 2-D paths from the
Number of ways in which he can make up his mind with lattice point (0, 0) to (r, n).
regard to the education of his wards if every one of
them be fit for any of the branches to study, and at least (D) number of ways of selecting r objects out of n
one child is to be sent in each discipline is: different objects when a particular object is always
included plus the number of ways of selecting ‘r’
(A) 120 (B) 216 (C) 729 (D) 540 objects out of n, when a particular object out of n, when
a particular object is always excluded.
Q.43 There are (p + q) different books on different
topics in Mathematics (p ≠ q) Q.47 There are 10 questions, each question is either
If L = The number of ways in which these books are True or False. Number of different sequences of
distributed between two students X and Y such that X incorrect answers is also equal to
get p books and Y gets q books. (A) Number of ways in which a normal coin tossed 10
M = The number of ways in which these books are times would fall in a definite order if both Heads and
distributed between two students X and Y such that Tails are present.
one of them gets p books and another gets q books. (B) Number of ways in which a multiple choice question
N = The number of ways in which these books are containing 10 alternatives with one or more than one
divided into two groups of p books and q books then, correct alternatives, can be answered.

(A) L = M = N (B) L = 2M = 2N (C) Number of ways in which it is possible to draw a

sum of money with 10 coins of different denominations
(C) 2L = M = 2N (D) L = M = 2N taken some or all at a time.

Q.44 Number of ways in which 5A’ and 6B’s can be (D) Number of different selection of 10 indistinguishable
arranged in a row which reads the same backwards and objects taken some or all at a time.
forwards, is
Q.48 The number of ways in which five different books
(A) 6 (B) 8 (C) 10 (D) 12 can be distributed among 3 persons so that each
person gets at least one book, is equal to the number
Q.45 Coefficient of x2 y3 z4 in the expansion of (x + y + of ways in which
z)9 is equal to
(A) 5 persons are allotted 3 different residential flats so
(A) The number of ways in which 9 objects of which 2 that and each person is allotted at most one flat and no
alike of one kind, 3 alike of 2nd kind, and 4 alike of 3rd two persons are allotted the same flat.
kind can be arranged.
(B) Number of parallelograms (some of which may
(B) The number of ways in which 9 identical objects can be overlapping) formed by one set of 6 parallel lines
be distributed in 3 persons each receiving at least two and other set of 5 parallel lines that goes in other
objects. direction.
(C) The number of ways in which 9 identical objects can (C) 5 different toys are to be distributed among 3
be distributed in 3 persons each receiving none one or children, so that each child gets at least one toy.
more.
(D) 3 mathematics professors are assigned five different
(D) The number of ways in which 9 different books can lecturers to be delivered, so that each professor gets at
be tied up in to three bundles one containing 2, other 3 least one lecturer.
and third containing 4 books.
 M a them a ti cs | 5.47

Q.49 If k is odd then kCr is maximum for r equal to Q.54 If the number of arrangements of the letters of
the word W if all the S’s and P’s are separated is (k)
1 1
=
(A) r (k − 1) =
(B) r (k + 1)  10! 
2 2
  then k equals
 4!.4! 
(C) k ‒ 1 (D) k
6 4 3
(A) (B) 1 (C) (D)
Q.50 Which of the following statements are correct? 5 3 2
(A) Number of words that can be formed with 6 only
of the letters of the word “CENTRIFUGAL’ if each word Paragraph 2: 16 players P1, P2, P3, ….. P16 take part in
must contain all the vowels is 3 . 7! a tennis tournament. Lower suffix player is better than
any higher suffix player. These players are to be divided
(B) There are 15 balls of which some are white and the into 4 groups each comprising of 4 players and the best
rest black. If the number of ways in which the balls con from each group is selected for semifinals.
be arranged in a row, is maximum then the number of
white balls must be equal to 7 or 8. Assume balls of the Q.55 Number of ways in which 16 players can be
same color to be alike. divided into four equal groups, is
(C) There are 12 objects, 4 alike of one kind, 5 alike and 35 8 35 8
of another kind and the rest are all different. The total (A) ∏ (2r – 1)
27 r =1
(B) ∏ (2r – 1)
24 r =1
number of combinations in 240
(D) Number of selections that can be made of 6 letters 35 8 35 8
from the word “COMMITTEE” is 35.
(C) ∏ (2r – 1)
52 r =1
(D) ∏ (2r – 1)
6 r =1

Q.51 Number of ways in which the letters of the word Q.56 Number of ways in which they can be divided into
‘B U L B U L’ can be arranged in a line is a definite order 4 equal groups if the players P1, P2, P3 and P4 are in
is also equal to the different groups, is:
(A) Number of ways in which 2 alike Apples and 4 alike (11)! (11)! (11)! (11)!
(A) (B) (C) (D)
Mangoes can be distributed in 3 children so that each 36 72 108 216
child receives any number of fruits.
(B) Number of ways in which 6 different books can be Match the Columns
tied up into 3 bundles, if each bundle is to have equal Q.57
number of books.
Column-I Column-II
(C) Coefficient of x2y2z2 in the expansion of (x + y + z)6.
(A) Number of increasing permutations (p) nm
(D) Number of ways in which 6 different prizes can be
of m symbols are there from the n set
distributed equally in three children.
numbers {a1, a2, …, an} where the order
among the number is given by a1 < a2 < a3
Comprehension Type < … an–1 < an is

Paragraph 1: Consider the word W = MISSISSIPPI (B) There are m men and n monkeys. (q) mCn
Number of ways in which every monkey
Q.52 If N denotes the number of different selections has a master, if a man can have any number
of 5 letters from the word W = MISSISSIPPI then N of monkeys
belongs to the set (C) Number of ways in which n red balls are (r) nCm
(A) {15, 16, 17, 18, 19} (B) {20, 21, 22, 23, 24} (m – 1) green balls can be arranged in a
line, so that no two red balls are together, is
(C) {25, 26, 27, 28, 29} (D) {30, 31, 32, 33, 34} (balls of the same color are alike)

Q.53 Number of ways in which the letters of the word (D) Number of ways in which ‘m’ different (s) mn
W can be arranged if at least one vowel is separated toys can be distributed in ‘n’ children if every
from rest of the vowels child may receive any number of toys, is

8!.161 8!.161 8!.161 8! 165

(A) (B) (C) (D) .
4!.4!.2! 4.4!.2! 4!.2! 4!.2! 4!
5 . 4 8 | Permutations and Combinations

Q.58 Q.2 7 relatives of a man comprises 4 ladies and 3

gentlemen, his wife has also 7 relatives; 3 of them are
Column-I Column-II ladies and 4 gentlemen. In how many ways can they
(A) Four different movies are running in a (p) 11 invite a dinner party of 3 ladies and 3 gentlemen so
town. Ten students go to watch these four that there are 3 of man’s relative and 3 of the wife’s
movies. The number of ways in which every relatives?  (1985)
movie is watched by at least one student, is
(Assume each way differs only by number Q.3 A box contains two white balls, three black balls
of students watching a movies) and four red balls. In how many ways can three balls be
drawn from the box, if at least one black ball is to be
(B) Consider 8 vertices of a regular octagon (q) 36
included in the draw? (1986)
and its center. If T denotes the number
of triangles and S denotes the number of
straight lines that can be formed with these Q.4 Eighteen guests have to be seated half on each
9 points then the value of (T – S) equals side of a long table. Four particular guests desire to sit
one particular side and three other on the other side.
(C) In an examination, 5 children were (r) 52 Determine the number of ways in which the sitting
found to have their mobiles in their pocket. arrangements can be made.  (1991)
The Invigilator fired them and took their
mobiles in his possession. Towards the end Q.5 A committee of 12 is to be formed from 9 women
of the test, Invigilator randomly returned and 8 men. In how many ways this can be done if at
their mobiles. The number of ways in which least five women have to be included in a committee?
at most two children did not get their own In how many of these committees
mobiles is
(a) the women are in majority?
(D) The product of the digits of 3214 is 24. (s) 60
The number of 4 digit natural numbers (b) the men are in majority?  (1994)
such that the product of their digits is 12, is
Q.6 Match the conditions/expressions in column I with
(E) The number of ways in which a mixed (t) 84
statement in column II.
double tennis game can be arranged from
amongst 5 married couple if no husband & Consider all possible permutations of the letters of the
wife plays in the same game, is word ENDEANOEL. (2008)

Column I Column II
Previous Years’ Questions (A) The number of permutations containing (p) 5!
the word ENDEA. is
Q.1 Five balls of different colors are to be placed in
three boxes of different sizes. Each box can hold all five. (B) The number of permutations in which (q) 2 × 5!
In how many different ways can we place the balls so the letter E occurs in the first and the last
that no box remains empty?  (1981) positions, is
(C) The number of permutations in which (r) 7 × 5!
none of the letters D, L, N occurs in the last
five positions, is
(D) The number of permutations in which the (s) 21×5!
letters A, E, O occur only in odd positions, is
 M a them a ti cs | 5.49

MASTERJEE Essential Questions

JEE Main/Boards JEE Advanced/Boards

Exercise 1 Exercise 1
Q.6 Q.10 Q.13 Q.16 Q.22 Q.5 Q.6 Q.12 Q.13 Q.16
Q.26 Q.27 Q.20 Q.22 Q.28 Q.30

Exercise 2 Exercise 2
Q.3 Q.13 Q.15 Q.18 Q.25 Q.1 Q.3 Q.8 Q.13 Q.20
Q.33 Q.43 Q.46 Q.47 Q.50 Q.26 Q.32 Q.39 Q.42 Q.43
Q.52 Q.49 Q.55 Q.58

Previous Years’ Questions Previous Years’ Questions

Q.4 Q.5 Q.7 Q.1 Q.3 Q.4 Q.6

Answer Key

JEE Main/Boards Q.13 369600

Q.14 302399, 30240

Exercise 1
Q.15 3600
Q.1 2 + 6 + 24 = 32
Q.16 126
Q.2 3 × 4 × 3 × 2 × 1 = 72 1 1
Q.17 3 + 4 + 4 = 11 Hours.
Q.3 35 + 15 = 50 4 2
Q.18 r = 3
Q.5 n = 6
Q.20 52C4 = 270725
Q.6 180
Q.22 817190
Q.7 365
Q.23 (i) 116 (ii) 40 (iii) 185
Q.8 1332
Q.24 31
Q.9 1023
50!
Q.25
Q.10 (i) 2 + 2 + 2 + 2 = 30 (ii) = 2 + 2 + 2 + 2 +
1 2 3 4 1 2 3 4
(12!) .(7!)2 3!
3

25 = 2 + 4 + 8 + 16 + 32 = 62
Q.26 26
Q.11 34650 – 840 = 33810
Q.27 150
Q.12 4! 3!
Q.28 2454
5 . 5 0 | Permutations and Combinations

Exercise 2

Single Correct Choice Type

Q.1 C Q.2 C Q.3 D Q.4 A Q.5 B Q.6 C
Q.7 A Q.8 D Q.9 A Q.10 C Q.11 D Q.12 B
Q.13 D Q.14 B Q.15 A Q.16 A Q.17 A Q.18 D
Q.19 D Q.20 A Q.21 B Q.22 C Q.23 C Q.24 C
Q.25 D Q.26 A Q.27 A Q.28 C Q.29 B Q.30 D
Q.31 C Q.32 B Q.33 C Q.34 D Q.35 C Q.36 D
Q.37 A Q.38 B Q.39 A Q.40 D Q.41 C Q.42 C
Q.43 A Q.44 C Q.45 C Q.46 D Q.47 A Q.48 B
Q.49 D Q.50 D Q.51 C Q.52 B Q.53 B Q.54 B
Q.55 E Q.56 D

Previous Years’ Questions

Q.1 C Q.2 D Q.3 A Q.4 A Q.5 C Q.6 C
Q.7 C

JEE Advanced/Boards
Exercise 1
Q.1 162 Q.2 7560 Q.3 2500 Q.4 826 Q.5 510 Q.6 10, 3
Q.7 60 Q.8 64 Q.9 244 Q.10 24 Q.11 (i)15, (ii) 126, (iii) 60 (iv) 105
Q.12 (a) 72; 78120; (b) 23 (c) 32; (d) 435 Q.13 2252 Q.14 30980 Q.15 276
Q.16 440 Q.17 121 Q.18 (a) 128; (b) 54 Q.19 48 Q.20 42
Q.21 3119976 Q.22 (a) 1680; (b) 1140 Q.23 40 Q.24 974 Q.25 186
Q.26 (i) 3359; (ii) 59; (iii) 359 Q.27 4201 Q.28 3888 Q.29 (i) 240, (ii) 15552

Exercise 2

Single Correct Choice Type

Q.1 D Q.2 C Q.3 C Q.4 B Q.5 A Q.6 A
Q.7 B Q.8 A Q.9 B Q.10 B Q.11 B Q.12 A
Q.13 D Q.14 D Q.15 D Q.16 A Q.17 B Q.18 B
Q.19 A Q.20 B Q.21 B Q.22 A Q.23 D Q.24 C
Q.25 A Q.26 B Q.27 B Q.28 C Q.29 B Q.30 C
Q.31 C Q.32 C Q.33 C Q.34 D Q.35 D Q.36 D
Q.37 C Q.38 A Q.39 C Q.40 B Q.41 A Q.42 D
Q.43 C Q.44 C Q.45 D
 M a them a ti cs | 5.51

Multiple Correct Choice Type

Q.46 A, B, D Q.47 B, C Q.48 B, C, D Q.49 A, B Q.50 B, D Q.51 C, D

Comprehension Type
Q.52 C Q.53 B Q.54 B Q.55 A Q.56 C

Matric Match Type

Q.57 A → r; B → s; C → q; D → p Q.58 A → t; B → r; C → p; D → q; E → s

Previous Years’ Questions

Q.1 300 Q.2 485 Q.3 64 Q.4 9P4 × 9P3 × (11)!

Q.5 6062, (a) 2702 (b) 1008 Q.6 A → p; B → s; C → q; D → q.

Solutions

JEE Main/Boards =2n (1 × 2 × 3.....n)(1 × 3 × 5......(2n +1))

=2n.n! (1 × 3 × 5........ (2n + 1))

Exercise 1
(2n + 1)
= 2n. (1 × 3 × 5........ (2n + 1))
0, 1, 4, 7 n!

n!
Sol 5: nP4 = 360; = 360
Sol 1: (n – 4)!
n(n – 1)(n – 2)(n – 3) = 360 ⇒ 6 × 5 × 4 × 3 = 360
0, 1, 4, 7 1 or 7
n=6
Total numbers = 4 × 4 × 2 = 32
Sol 6: Case-I: 4 digits
10r2
Sol 2:

First arrange those 3 persons in rear seats 2 × 5C3 × 3! = 120

Then remaining in front.
Case-II: 3 digits
Total ways to seat = 5!
Two particular people cannot seat on the driver self
So for this case total ways ⇒ 4! + 4! 3 or 4
3 × 5C2 × 2! = 60
or 5
Therefore, required number of ways = 5! – 4! – 4! = 4!
Total number of numbers = 60 + 120 = 180
(5 – 2) = 3 × 4 × 3 × 2 × 1 = 72

Sol 7: 5 can be there only in the thousand’s digit

Sol 3: 7C1 × 5C1 + 3C1 × 5C1 = 35 + 15 = 50
Case-I: 5 is there 0, 2, 4, 6, 8
Sol 4: (2n + 1)! = 1 × 2 × 3........ (2n + 1) 5 7 5
= (2 × 4 × 6......2n)(1 × 3 × 5...... (2n + 1))
5 choices
5 . 5 2 | Permutations and Combinations

Therefore, total number for case I = 5 10!

Total rearrangements = – 1= 302400 – 1 = 302399
Case-II: 5 is not there 3! 2!
9!
Total rearrangements with L in the end = = 30240
3! 2!
1 1 2 2334 4 56 5
5 Sol 15: PATALI PUTRA
8 9
choices Vowels = 5
choices choices
Consonants = 6
Therefore, total number for case II = 8 × 9 × 5 = 360
Vowels: A(3) I(1) U(1)
Total ways = 5 + 360 = 365
Consonants: P(2) T(2)L(1)R(1)
Sol 8: 123+132+213+231+312+321 = 1332 5! 6!
Total no. of words = × = 3600
3! 2! 2!
Sol 9: 45 – 1 = 1024 – 1 = 1023
One case is excluded when all arms are at rest. 9!
Sol 16: = 126
4! 5!
Sol 10: (i) 21 + 22 + 23 + 24 = 30
Sol 17: 3! ways
(ii) (a) 25 = 32 (b) 21 + 22 + 23 ......... 25 = 62
A → III
B→I
Sol 11: M I S S I S S I P P I
C → II
M (1) 1 1
Time = 4 + 4 + 3 = 11 hours
S (4) 4 4
I (4)
Sol 18: 15C3r = 15Cr+3
P (2)
3
Ways = Total permutations – Permutations with 4 I’s (1) 3r = r + 3 ⇒ r =
2
together
(2) 3r + r + 3 = 12 ⇒ r =
15 ⇒ 4r = 3
11! 8!
= – = 33810 3
4! 4! 2! 4! 2! r= Not possible
2
B B B B r = 3 Possible
Sol 12: ↓ ↓ ↓ ↓
G G G
××× Sol 19: nCr × rCs = nCs × n–sCr–s

first arrange girls → 3! n! r!

LHS: nCr + rCs = ,
4 seats remains in which 4 boys will be r!(n – r)! s!(r – s)!

seated → 4! n! (n – s)! 1 n! (n – s)!

= × × = ×
s! (n – s)! (n – r)!.(r – s)! s!(n – s)! (n – r)!(r – s)!
Total ways = 3! × 4! = 144
= nCs × n–sCr–s = RHS
12!
Sol 13: = 369600
(3!)4 5
Sol 20: 47C4 + ∑ 52– j C3
j=1
Sol 14: BENEVOLENT
47
= C 4 + ( 47 C3 +48C3 ....... 51C3 = 48C4 + (48C3 + ...... + 51C3)
No. of letters = 10   
B (1), E (3), N (2), V (1), O (1), L (1), T (1)
= 51C4 + 51C3 = 52C4 = 270725
 M a them a ti cs | 5.53

Sol 21: Product = (n + 1)(n + 2) ...... (n + r) 2A, 2A

4!
(n + r)! (n + r)!
3
C2 × = 18
= = r! × = r! × n+rCr 2! 2!
n! n! r!
Total = 2454
n+r
Cr will be integer
Hence product is divisible by r!. Exercise 2
Sol 22: 22C10 + 3C3 22C7= 817190 Single Correct Choice Type

Sol 23: Sol 1: (C)

ANRUV
4!
NARUV

(i) No. of triangles = 10C3 – 4C3 = 116 4!

RANUV
(ii) No. of straight lines = 6C2 + 6 × 4 + 1 4!
= 15 + 24 + 1 = 40 UANRV
4!
(iii) No. of quadrilaterals = 10C4 – 4C3 × 6 – 4C4 = 185 96
V A N R U 97
V A N U R 98
Sol 24: 25 –1 = 31 V A R N U 99
V A R U N 100
50!
Sol 25:
(12!)3 3! (7!)2 2! Sol 2: (C) Numbers = Total – Numbers with no digit 7
Total = 900
Sol 26: Cases not allowed

× ×
8 9 9
× × × × × × × ×
× × Number of numbers with at least
8
C6 – 2 = 26 One digit 7 = 900 – 8 × 9 × 9 = 252

Sol 27: Possible groups Sol 3: (D)

AEHMS
113
24
122 ASMHE 24
EAHMS
No. of ways 24
 5! 5!  ESMHA 48
= 3! ×  +  = 60 + 90 = 150 HAEMS
 1! 1! 3! (2!) 1! 2! 2! (2!)  24
HSMEA 72
Sol 28: EXAMINATION MAEHS 73
6
4 DIFF
MASHE 78
8
C4 × 4! = 1680 MEAHS
6
2 diff. 2 alike MESHA 84
4! MHAES
3
C 1 × 7C 2 × = 756
2! MHASE 86
5 . 5 4 | Permutations and Combinations

Case-II: 5 is not there

Sol 4: (A) Y, G, B, R
5
8 9
choices
4 3 3 3 3 3 choices choices

4 × 35 = 12 × 81 8 × 9 × 5 = 360
Total ways = 5 + 360 = 365
Sol 5: (B) Prime number in 0 – 9
2, 3, 5, 7 Sol 12: (B) 5

1 1 1 1 1 8 8 7 6

4 4 4 4 4 5 4 3 2 0
2 × 45 = 2048 4
C1 × 8 × 7 × 6

Total ways = 8×8×7×6+ 4C1×8×7×6 = 168 × 4!

Sol 6: (C)
Sol 13: (D) 4 odd, 3 even
5
C3 – 2 = 10 – 2 = 8
Arrangements: 4 + 2 3 + 3
Total numbers = 3C2 × 2 × 4! + 4C3 × 3C2 × 2 × 4! = 720
Sol 7: (A)
Sol 14: (B) 9000 – 9 × 9 × 8 × 7 = 4464
5 5 5
No. 5 with no even digit
Sol 15: (A) It can be a digit number with digits 1 to 9
900 – 53 = 775
or a 10 digit number with digits 0 to 9
9! + 9.9! = 10!
Sol 8: (D) The sum of the 5-digits used must be divisible
by 3.
Sol 16: (A) n
Only possible combinations are:
1, 2, 3, 4, 5&0, 1, 2, 4, 5 n n

↓↓ 9
9 × 10 × 19
5! 4.4! ∑ n2 = 6
= 285
n=1
Total = 9.4!
= 9 × 24 = 216 Sol 17: (A) Consider 1 & 2, 3 & 4, 5 & 6 to be identical
9!
Permutations = = 9.7!
Sol 9: (A) C2 × 2 = 672
7 5
(2!)3

Sol 10: (C) 7C4 × 4C2 × 6! = 151200 Sol 18: (D)

Last digit 9   Last digit not 9

Sol 11: (D) 5 can be there only in the thousand’s digit
9
Case-I: 5 is there
7 8 7 6 8 7 4
0, 2, 4, 6, 8
5 7 5 Total = 7 × 8 × 7 + 6 × 8 × 7 × 4 = 1736

5 choices
 M a them a ti cs | 5.55

Sol 19: (D) Sol 28: (C) Combine those 2 green bottles
↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ××××××××
× × × × × × × × × × 9 spaces
10 persons 6 × 9C6 = 84 × 6 = 504
10
C5 . 5!
Sol 29: (B) 25C5 – 24C4 = 24C5
Choose 5 persons from 10 getting books & distribute
books to then 5! ways .
Sol 30: (D) 5C4 × 24 = 80
Sol 20: (A) 5C3 × 8C7 + 5C4 × 8C6 + 5C5 × 8C5 Select 4 pairs out of 5 different pairs. Now in each pair
you can choose 2 different shoes.
= 80 + 5 × 28 + 56 = 276

Sol 31: (C) 2 2 2 3

Sol 21: (B)
3! 9! 9!
3 =
9 9 3! (2!) 3! 3! (2!)3
9 9

Total = 162
Sol 32: (B) × × × × × × × × × ×
(n – 2) 10 red balls
Sol 22: (C) × 180 = 150
n
11 spaces
6n – 12 = 5n ⇒ n = 12
choose 9 spaces to fill green balls. 10! ways to arrange
Diagonals = 12C2 – 12 = 54
red balls.
11
C9 × 10!
Sol 23: (C) 2n – 2 = 510
2n = 512
Sol 33: (C) 7! × 23
n=9
7! ways to arrange
2 order (ascending/descending)
Sol 24: (C) 7
7

9 8 7 8 8 7 6!
Sol 34: (D)
2! 2! 2!
9 × 8 × 7 + 8 × 8 × 7 × 3= 33 × 8 × 7= 1848
Consider man and wife to be identical and arrange them.
Sol 25: (D) Total appointment = 11 Similar concept as used in Q. 18

11 → 2 3 6 7! 7! 7! 7!
Sol 35: (C) + + .......
7! 0! 6! 1! 5! 2! 2! 5!
total ways to disposed = (2! 3! 6!) × 3 = 8640 × 3= 25920
7
C0 + 7C1 + 7C2 ....... 7C5 = 27 – 7C6 – 7C7 = 128 – 7 – 1 = 120
Sol 26: (A) Illegal ways = 2 × 7C4 + 7C3 – 2 × 5C2 = 85
No. of possible ways = 9C5 – 85= 126 – 85 = 41 Sol 36: (D)
× × × ×
Sol 27: (A) 1 1 3 EE AA

122 EAEA

3 × (4C1 × 4C1 × 4C3 + 4C1 × 4C2 × 4C2) AEAE

= 3 × (64 + 144) = 624 EAAE

4! × (5C2 × (2! + 2! + 1 + 1)) = 1440
5 . 5 6 | Permutations and Combinations

Sol 37: (A) The last match has to be won by India Total ways = 7 + 10–1C10–1= 16C9 = 16C7
1 + 5C1 + 6C2 + 7C3 + 8C4= 126
Sol 46: (D) Total ways = 3n+ nC2 .3n–2+nC4.3n–4+......
Sol 38: (B) (1 + 3)n 2n
= + = 22n–1 + 2n–1 = 2n–1(2n + 1)
2 2
635/674
Sol 47: (A) Each digit will be present at unit’s ten’s and
2(93 × 1 + 3 × 4 × 92) = 2(1701) = 3402 hundred’s place 6 times.
(1 + 2 + 3 + 4) × 6 = 60
Sol 39: (A)
60
Master
× × 60 ×
× × 60 × ×
× × Sum of digits =
× × 6660
× ×
× × Sol 48: (B) 8C1 + 8C1 × 7C1 = 64
Mistress

2 × 10 ×10!=Sol.20 10! Sol 49: (D) No. of books of algebra = No of books of

calculus
Sol 40: (D) S1 S3 S2
Sol 50: (D) No. of ways = Total ways – No letter is in
S 3S 1 S 2
wrong envelope = 5! – 1 = 119
Consider S1 S2 S3 identical & arrange
10! 10!
2× = Sol 51: (C) P1 P2 P3 P4
3! 3
4!
=3
Sol 41: (C) 310 – 1 (2!)2 2!
3 choices question its alternative & no question.
Total matches = 8C4 × 3

Sol 42: (C) 9 9 9 9 9 9 7 Sol 52: (B) 9C6 × 5 × 3! = 2520

9999988
Sol 53: (B) 6C1 ×21 × 25 + 6C3 × 23 × 23 + 6C5
7! 7!
+ f= 7 + 21 = 2s
6! 5! 2! × 25 × 21 = 26 (6C1 + 6C3 + 6C5)
26
9!
= 26 × = 211
Sol 43: (A) – 4! 3! = 6(7! – 4!) 2
2! 3!
Sol 54: (B) 2.6.10 ....... (4n – 2)
Sol 44: (C) 1000 = 23 × 53
n! (2n)! 2n
= 2n(1.3.5 ...... (2n –1)) × = = Pn
The product of even divisors of 1000 will be n! n!
( ) ( ) ( ) (
= 2 × 22 × 23 × ( 2 × 5 ) × 2 × 52 × 2 × 53 × 22 × 5 ) Sol 55: (E) No. of permutations
× (2 2
× 5 ) × (2 × 5 ) × (2 × 5) × (2 × 5 ) × (2
2 2 3 3 3 2 3
×5 )
3
(2n)! 2n . n![1.3.5......(2n – 3)(2n – 1)]
= 2nCn = =
n! n! n!
= (26)4 × (5 × 52 × 53) = (26)4 × (56)3 = 64 × 1018

Sol 45: (C) x1 + x2 + ........ x10 = 7 Sol 56: (D) n is odd

n+1
7 people are distributed to 10 floor 1, 2, 3 ......... ...... n
2
 M a them a ti cs | 5.57

n–1 (n – 1)2
Total A.P.S. = 0 + 1.....+ +....+1+ 0 = Pq Number of ways
2 4
R0r2 1 way
n is even
R1r21 way
n n
1, 2, ....... , + 1, ....... n
2 2 R2r0, r1, r23 ways
Total A.P.S ∴ Total number of ways to select r = 5.
 n  n(n – 2) Selection of s as under
= 2 ×  0 + 1 + ....... – 1  =
 2  4
s0s41 way
s1s41 way
Previous Years’ Questions s2s41 way
5 s3s41 way
Sol 1: (C) Here, 47C4 + ∑ 52– j
C3
s4s41 way
j=1

= 47C4 + 51C3 + 50C3 + 49C3 + 47C3 ∴ Total number of ways to select s = 9.

= (47C4 + 47C3) + 48C3 + 49C3 + 50C3 + 51C3 Similarly, the number of ways to select t = 5.
∴ Total number of ways = 5 × 9 × 5 = 2Sol.25
(using nCr + nCr–1 = n+1Cr)

= (48C4 + 48C3) + 49C3 + 50C3 + 51C3 Sol 6: (C) Arrange the letters of the word COCHIN as in
the order of dictionary CCHINO.
= (49C4 + 49C3) + 50C43 + 51C3
Consider the words starting from C.
= (50C4 + 50C3) + 51C3 = 51C4 + 51C3 = 52C4
There are 5! Such words. Number of words with the two
C’ s occupying first and second place = 4!.
Sol 2: (D) Since, the first 2 women select the chairs
amongst 1 to 4 in 4P2 ways Sol 7: (C) There are two possible cases
Now, from the remaining 6 chairs, three men could be
arranged in 6P3. Case-I Five 1’s , one 2’s, one 3’s
7!
∴ Total number of arrangements=4P2×6P3. Number of numbers = = 42
5!
Sol 3: (A) Since, a five digits number is formed using Case-II Four 1’s three 2’s
the digits {0, 1, 2, 3, 4 and 5} divisible by 3 ie, only 7!
possible when sum of the digits is multiple of three. Number of numbers = = 35
4! 3!
Case I : Using digits 0, 1, 2, 4, 5 Total number of numbers = 42 + 35 = 77
Number of ways = 4 × 4 × 3 × 2 × 1 = 96
Case II : Using digits 1, 2, 3, 4, 5 JEE Advanced/Boards
Number of ways = 5×4×3×2×1 = 120
∴ Total number formed =120+96=216 Exercise 1

Sol 4: (A) Since, 240 = 24 × 3 × 5 Sol 1:

∴ Total number of divisors = (4 +1) (2) (2) = 20
1/2/3/4/5/6
1/2/3
Out of these 2, 6, 10, and 30 are of the fomr 4n + 2. 1/2/3/4/54
Therefore, (a) is the answer. 1/2/3/4

3
× 3
× 3 ×3 × 2 = 81 × 2 = 162
Sol 5: (C) Since, r, s, t are prime numbers. Filling first last two places
4 places
∴ Selection of p and q are as under
5 . 5 8 | Permutations and Combinations

5! 120 Sol 8: n(A) – 2n(A ∩ Β) + 2n(A ∩ B ∩ C)

Sol 2: 9C1 × 8C2 × = 9 × 28 × = 7560
2! 2! 84 = 8! – 2 × 7! + 6! = (56 + 14 + 1
6! = 43 6!
Sol 3: 31 32 33 ........ 351 ........ 398 399 3100 3101
Fix the middle element of G.P. the find the number of
Sol 9: 9! – n(A ∪ B ∪ C)
G.P.S possible
0 +1 + 2 +......+ 49 +50 + 49 +.....+ 1 + 0 = 2500 360
Sol 10: Should be an integer.
k
Sol 4: 3/5 3/5 ∴ k is a factor of 360
4
360 = 32 × 23 × 5

2 8 7 4 8 7 4 Total factors = 4 × 3 × 2= 24

2 × 8 × 7 × 4 =448 8 × 7 × 5 = 280
Sol 11: (i) 6C4 = 15
0/2
(ii) All, 4 diff. 6C4 = 15
6 1 6
2diff, 2Alike 6C2 × 4C1 = 60
7 4 2 7 5 2 alike, 2alike6C2 = 15
1 diff, 3alike 2 × 6C2 = 30
7 × 4 = 282 × 7 × 5 = 70
4 alike 6C1 = 6
Total = 826
126
Sol 5: Case-I: 2 2 2 (iii)3 different flavours = 60
6! (iv) 2 or 3 different flavours =60 +15 + 30 = 105
= 90
(2!)3
Sol 12: (a) x = 21600
Case-II: 1 2 3
6! x = 63 × 100 = 25 33 52
× 3! = 360
1! 2! 3! No. of divisors = 6 × 4 × 3 = 72

Case-III: 0 3 3 Sum = (20 + 21+....+25)

6! (30+31 +....33)(50+51+52)= 60 × 40 × 31 = 78120

× 3! = 60
(3!)2 2! (b) x = 7056

Total = 90 + 360 + 60 = 510 x = 24 × 32 × 72

Total factors = 5 × 3 × 3 = 45
45 + 1
A Answer = = 23
2
Sol 6:
B C (c) 300300 = 7 × 11 × 13 × 102 × 3
= 22 × 3 × 52 × 7 × 11 × 13
n(A) = 8! = n(B) = n(C) 26
= 32
2
n(A ∩ B) = n(B ∩ C) = n(A ∩ C) = 7!
(d) 1010 157 1811
n(A ∩ B ∩ C) = 6!
210 × 510, 37 × 57, 211 × 322
Sol 7: 3 × n(A ∩ B) – 3n(A ∩ B ∩ C) HCF of 1010, 157 & 1811 = 1
3 × 7! –3 × 6! HCF of 1010 & 157 = 57
= (63 – 3)6! = 60(6!) HCF of 1010 & 1811 = 210
 M a them a ti cs | 5.59

HCF of 157 & 1811 = 37 Sol 20: Total wins = Total matches = 10 × 8C2
Total divisors = (11×11+8×8+12×23) – (8+11+8)+1=435 Wins of champion = A + 7d
5 8
[2A + 7d] = 280
Sol 13: ∑ (5 Cx )3 = 1 + 5 3
+ 103 + 103 + 53 + 1 = 2252 2
x =0
A = 70 – 7d
2
Sol 14: 18C9 – 10C5 × 8C4= 48620 – 252 × 70 = 30980 Now d ≠ 0 d = 2
A = 28
Sol 15: 52 – 1 = 24 ∴ 24C2 triangles
Wins of champion = 28 + 7 × 2 = 42
Sol 16: x + y + 2 + w = 13
S1 S2 S3 S4 S5
x ≤ 5y ≥ 2 Sol 21:
10
C2 + C2 +.... C2= 45 + 55 + 66 + 78 + 91 + 105 = 440
11 15
S1 = (1 + 2 + 4 + 5) × 4! = 288
S2 = S3 = S4 = S5 =(1 + 2 + 4 + 5) × 3 × 3! = 216
Sol 17: 2 digits should be odd or
Sum = S1 × 104 + S2(103 + 102 + 10 + 1)
2 digits should be even for average to be integer
= 288 × 104 + 216(1111) = 3119976
111 222 ......... 999 each repeats 3 times

C2× 5 C1 ×5 C1 +3C2× 4 C1 ×4 C1 + 2 C1 × 4 × 3 – 2
3
× 9 = 121 Sol 22: (a) 8C3 × 5C3 × 3! = 1680
    repetition 
odd even/0 zero 5! 5!
(b) 3C1 2 + 3C 2 × 3 × 2 × × 2!
3! 2! 1! 2! 2!
Sol 18: (a) 1 element 12C1 = 12 = 60 + 1080 = 1140
2 elements C2 = 45 10
a, b, c distinct
3 elements 8C3 = 56
Sol 23: {1, x, x} (5C1 + 5C2) = 15
4 elements 6C4 = 15
5! 5!
5 elements 0 {x, x, x} + = 25
1! 1! 3! 2! 1! 2! 2! 2!
Total = 128
Total = 15 + 25 = 40
(b) Select 3 elements
Each is this element is either present in S, T or both Sol 24: No. of integers
S and T
2 digit no. 89, 98 2
∴ Total = 6C3 × 33 = 540
3 digit no.
λ = 54
Zero included 890, 809 4

Sol 19: Sum at first places can be 6 at max. 980, 908

4 3 1 2 5 not allowed Zero excludes

First 2 digits Last 2 digits Permutations 2× 3C2 + 7C1 × 3!48
Sum 6: 15 43 4 4 digit no.
24 53 4 Tow zeroes 3C2 × 26
Sum5: 14 53/52 8 One zero 3C1 × (7C1 × 3! + 6)144
23 54/51 8 No zero 2 ×4C2×7×7+2×4C2×2×7 770+2×4C3+4C2= 974
Sum4: 13 54/52/42 12
Sum3: 12 54/53 12 Sol 25: A – 1B – 9 1
   Total 48 A – 2 B – 8 8C 1
5 . 6 0 | Permutations and Combinations

A – 3B – 78C2 Sol 2: (C)

A – 4B – 68C3
4
2 C2 2
A – 5B – 50
N = 2(1 + 8C1 + 8C2 + 8C3) 2 × 4C2 × 2 = 24
N = 186
Sol 3: (C) 20C2 – 10 – 5 × 9 = 190 – 10 – 45= 135
Sol 26: (i) MU LTI PLE
Sol 4: (B) r = 9C2 × 9C2 = 362
8!
– 1 = 3359 8 × 9 × 17
3! 2! s = 82 + 72 + 62 +........ 12 =
6
5!
(ii) – 1 = 59 s 17
2! =
r 108
5!
(iii)3! × – 1 = 359
2!
Sol 5: (A) 200,000,000
9!  28 – 1 
Sol 27: 3 digits 5C3 × = 16,800 28 + 28 + 27 + 26 +........ 21 = 28 + 2.   = 3. (2)8 –2
3! 3! 3!  2–1 
 
 9! 9! 
2 digits 2 × 5C2 ×  +  = 4,200
 3! 6! 4! 5!  y counters
1 digit 5C1 = 5 Sol 6: (A) ............
Total = 21005 x x x x
N
= 4201 xy – y
5

Sol 7: (B) M – n = 10C5 – 9C5 = 9C5

Sol 28: 3C2 × 9 × 8 + 9 × 3C2 × 8 × 8 + 9 × 3 × 9 × 8= 3888

Sol 8: (A) N1 = m+nC3 – mC3 – nC3

Sol 29: (i) 4 × 4! + 2 × 3 × 4! = 240
(ii) 4 × 64 × 3 = 15552 N2 = m+n+1C3 – m+1C3 – n+1C3

N1 m+n–2
=
N2 m+n
Exercise 2
Single Correct Choice Type Sol 9: (B) 10000 to 99999

90000
Number of numbers = = 45000
Sol 1: (D) We have 0 + 1 + 2 + 3 … + 8 + 9 = 45 2
To obtain an eight digit number exactly divisible by 9,
we must not use either (0, 9) or (2, 7) or (3, 6) or (4, 5). Sol 10: (B) AB D C E F G H
[Sum of the remaining eight digits is 36 which is exactly 7!
divisible by 9.] 2× = 5040
2!
When, we do not use (0, 9), then the number of required
8 digit number is 8!. 7!
Sol 11: (B) × 3! = 630
1! 2! 4!
When, one of (1, 8) or (2, 7) or (3, 6) or (4, 5) is not used,
the remaining digits can be arranged in 8! – 7! ways as
Sol 12: (A) 9C4 = 126
0 cannot be at extreme left.
Hence, there are 8! + 4(8! – 7!) = (36) (7!) numbers in
the desired category.
 M a them a ti cs | 5.61

Sol 13: (D) Case-I: 1 3 4 = 24 + 15 + 8 + 3 = 50

8! Rectangles which are not squares = 210-50 = 160
× 3!
1! 3! 4!
Sol 20: (B)
Case-II: 2 3 3
 {15 + 10 + 6 + 3 + 1} + 
8!  
× 3!
2! 3! 3! 2! 1 _ _ _ _ _ _  {10 + 6 + 3 + 1} =70
 
 + {6 + 3 + 1} + {3 + 1} + 1 
Case-III: 2 2 4  
2 3 _ _ _ _ _ 10 + 6 + 3 + 1 = 20 + 70 = 90
8!
× 3! 2 4 5 _ _ _ _ 3 + 2 + 1 = 6 + 90 = 96
2! 2! 4! 2!
2 4 6 7 8 = 97th
Total = 4620 = 22 × 7P3

Sol 14: (D) Pack 1 Pack 2 Sol 21: (B) nCn + n+1Cn + n+2Cn + ........ n+mCn

Peaches Apples Peaches Apples =nC0+n+1C1+n+2C2+.....n+mCm–n+1C0+ n+1C0 = n+m+1Cm

3122
1 1 m+n
Sol 22: (A) × × Cm(m – 1)(n – 1)!
5
C3 × 3C1 = 30 2 2
1 (m + n)!
Sol 15: (D) = ×
4 mn
× × × ×
n–3
1 x x
(n – 2) choices. select 3 Sol 23: (D) x 1 x 3
C1 = 3
Pn = C3
n–2
x x 1
Pn+1 – Pn = n–1C3 – n–2C3 = n–2C2 = 15 1 x x
n–2=6⇒n=8 x 0 x 3C 1 × 3C 2 = 9
x x 0
Sol 16: (A) n(2) = 50n(2 ∩ 3) = 16
Total = 12
n(3) = 33 n(3 ∩ 5)=6 n(2 ∩ 3 ∩ 5) =5
n(5) = 20n(2 ∩ 5) = 10 Sol 24: (C) 5 3 or 4 4
n(2 ∪ 3 ∪ 5)=(50 + 33 + 20) – (16 + 6 + 10)+3 8
C5 + 8C4 = 126
n( 2 ∪ 3 ∪ 5 ) = 100 – 74 = 26
Sol 25: (A) 100 = (80 + 50 + 30) – n + 5
6! n = 65
Sol 17: (B) 5C1 × = 1800
2! People reading exactly 2 magazines
Choose subject with two periods and then arrange.
= 65 – 3 × 5 = 50

Sol 18: (B) • • • • Sol 26: (B) 2(5! – 4! × 2) = 144

4
C2 × 2 × 2 × 10
Sol 27: (B)
240 Degree of 5 in prime factorization of 2002C1001 = 1
2002
C1001 is clearly divisible by 2
Sol 19: (A) Rectangles = 7C2 × 5C2 = 21 × 10 = 210
Squares = 6 × 4 + 5 × 3 + 4 × 2 + 3 ×1
5 . 6 2 | Permutations and Combinations

Sol 28: (C) No. of triangles = nC3 – [(n(n –4)) + n] Sol 37: (C) S1 S2 S3
n(n – 1)(n – 2)
= – [(n2 – 3n)] = 30 ⇒ n = 9
3! S1 = S3 = (2 + 4 + 6 + 8) × 10 = 200
S2 = (0 + 1 + 2 + ....... 9) × 4 = 180
Sol 29: (B) 11C3 – 5C3 + 1 = 156
Sum = 200 + 180 × 10 + 200 × 100 = 22000
Sol 30: (C)
Sol 38: (A) An = nC25 × 25!
2 5 5 10
An – An–1 = 25! (nC25 – n–1C25) = 25!(n–1C24)

3! + 3 × 2 × 2! 4C3 × 3! = 18 = 24 n = 50

Total no.s = 18 + 24 = 42
Sol 39: (C) (x1 + x2 + x3) (y1 + y2) = 77 = 7 × 11

Sol 31: (C) Pn – Qn x1 + x2 + x3 = 4 & x1 + x2 + x3 = 8

The difference in Pn & Qn is the number of ways in which y1 + y2 = 9y1 + y2 = 5

first and last person of the row is selected No. of possible solutions
Pn – Qn = n – 4 = 6 = 6C2 × 10C1 + 10C2 × 6C1 = 15 × 10 + 45 × 6
n = 10 = 150 + 270 = 420

Sol 32: (C) m = 10C4 × 4! Sol 40: (B) m = 34 – 3 = 78

n = C4; m = 24 n
10
n = 34 – [3(24 - 2) + 3] = 81 – 45 = 36

Sol 33: (C) No. of ways of selecting a committee of 2W m 78 13

Hence, = =
and 3M from 5W and 6M n 36 6
= 4C1 × 4C2 + 5C2 × 5C2 = 124
Sol 41: (A) Sum of digits at units place
Sol 34: (D) ABC, ACD, ABD = (1 +2 +.....+ 9) × 3 × 9 = 45 × 27 =1215
3! + 3! + 3! = 18 Sum of digits at ten’s place
= (1+ 4 + 9) × 9 × 9 = 14 × 81 = 1134
Sol 35: (D) Ways in which 2 are neighbours
Sum of digits at hundred’s place
= 2 × 97 + 97 × 96 = 98 × 97
= (1 + 2 + ...... 9 ) × 3 × 9 = 45 × 27 = 1215
ways in which all 3 are neighbours = 98
Required ways = 100C3 – 982 = 152096 = 98C3 1215
1134 ×
1215 × ×
Sol 36: (D) Make 3 groups of boys 1, 1, 2 Sum =
134055
4!
× 31
! ways to distribute
2! (11)2 2! Sol 42: (D) 3 possible distribution of wards for each
subject.
Identical marbles distribution
1 1 4
1 2 2– 3 ways
1 2 3
1 1 3 – 3 ways
4! 2 2 2
Total ways = × 3! × 6 = 216  6! 6! 6! 
2! 2! Total ways = 3!  + +  = 540
 4! (1!)2 2! 1! 2! 3! (2!)3 3! 
 
 M a them a ti cs | 5.63

Sol 43: (C) M = L × 2! 6!

(C) = 90
L=N ∴ 2L = M = 2N (2!)3

6!
(D) × 3! = 90
Sol 44: (C) There are 11 position (2!)3 3!
At the 6th position A should be present. In the 5 positions
left to 6th positions 2positions will have A. Comprehension Type
5
C2 ways Sol 52: (C) M I(4) S(4)P(2)
(i) 2C1 × 3C1 = 6
Sol 45: (D) 9C2 × 7C3 × 4C4
(ii) 2C1 × 2C1 = 4
9!
(A)
2! 3! 4! (iii) 2C1 × 3C1 = 6
9! (iv) 3C2 × 2 = 6
(D)
2! 3! 4!
(v) 3C1 = 3
Adding all these, we get = 25
Multiple Correct Choice Type
Sol 53: (B) Total ways in which all vowels are together
Sol 46: (A, B, D) n–1Cr–1 + n–1Cr = nCr
11! 8! 8!  165  8!.161
= – =  – 1 =
Sol 47: (B, C) 2 – 1 10 4! 4! 2! 4! 2! 4! 2!  4  4 4! 2!

Sol 48: (B, C, D) 2 2 1  10! 

Sol 54: (B) 6C2 × 8C4 × 5= 1 ×  4! 4! 
 
5! 120
× 3! = × 6 = 90
(2!) 2
1! 2! 8 16!
Sol 55: (A) No of ways =
(4!)5
Sol 49: (A, B) Let k = 2n + 1, then 2n+1Cr is maximum (1 × 3 × 5........ × 15) × 28 × 81
when r = n. Also 2n+1Cn = 2n+1Cn+1. Thus, kCr is maximum =
(4!)5
1 1
when
= r (k − 1) or =r (k + 1)
2 2 8
28 × 8 × 7 × 6 × 5 × 4!
= ∏ (2r – 1) ×
(4!)5
r =1
Sol 50: (B, D) (A) 4 vowels, 7 consonants
7
C2 × 6! = 3.7!
8
28 × 48 35 8
=35 ∏ (2r – 1) × = ∏ (2r – 1)
(24)4 27
15 r =1 r =1
(B) n = no of white balls
n!(15 – x)!
12! 12 × 11! 11!
12! Sol 56: (C) × 4!= =
(C) (3!) 4
4! 6 4 108
4! 5!

(D) 35
Match the Columns

Sol 51: (C, D) BULBUL Sol 57: A → r; B → s; C → q; D → p

6! (A) nCm (B) mn (C) mCn (D) nm
= 90
2! 2! 2!

(A) 4C2 × 6C2 = 6 × 15 = 90 Sol 58: A → t; B → r; C → p; D → q; E → s

6! (A) x1, x2, x3 & x4 are the students watching a particular

(B) = 15 movie
3
(2!) 3!
5 . 6 4 | Permutations and Combinations

x2 + x2 + x3 + x4 = 10 Number of ways = 3C3.3C3 = 1

xi ≥ 1 ∴ Total number of ways = 16 + 324 + 144 + 1 =485
9×8×7
9
C3 = 84
6 Sol 3: Case-I: When one black and two others ball S
are drawn
⇒ number of ways = 3C1 . 6C2 = 45
Case-II: When two black and one other balls are drawn
(B) T = 9C3 – 4 = 80
⇒ Number of ways = 3C2.6C1 = 18
S = 8C2 = 28
Case-III : When all three black balls are drawn
T – S = 52
⇒ Number of ways = 3C3 = 1
(C) 1 + 5C2 = 11
∴ Total number of ways = 45 + 18 + 1 = 64
(D) 12 = 1 × 2 × 2 × 3 = 1 × 1 × 4 × 3 = 1 × 1 × 2 × 6

4! 4! 4! Sol 4: Let the two sides be A and B. Assume that four

+ + = 36
2! 2! 2! particular guests wish to sit on side A. Four guests who
wish to sit on side A can be accommodated on nine
(E) 5C2 × 3C2 × 2 = 10 × 3 × 2 = 60
chairs in 9P4 ways and there guests who wish to sit on
M1M2 M1 M2 side B and be accommodated in 9P3 ways.
F 1 F 2 F 2F 1 Now, the remaining guests are left who can sit on 11
chairs on both the sides of the table in (11!) ways.
Hence, the total number of ways in which 18 persons
Previous Years’ Questions can be seated = 9P4 × 9P3 × (11)!.

Sol 1: Since, each box can hold five balls. Sol 5: There are 9 women and 8 men. A committee of
∴ Number of ways in which balls could be distributed 12, consisting of at least 5 women, can be formed by
so that none is empty are (2, 21) or (3, 1, 1). choosing:

ie, (5C2 3C2 1C1 + 5C3 2C1 1C1) × 3! (i) 5 women and 7 men
(ii) 6 women and 6 men
= (30 + 20) × 6 = 300
(iii) 7 women and 5 men
Sol 2: The possible cases are (iv) 8 women and 4 men

Case-I: A man invites 3 ladies and women invites 3 (v) 9 women and 3 men
gentlemen ∴ Total number of ways forming the committee
Number of ways = 4C3 . 4C3 = 16 = 9 C 5 × 8C 7 + 9C 6 × 8C 6 + 9C 7 × 8C 5 + 9C 8 × 8C 4 + 9C 9 × 8C 3
Case-II: A man invites (2 ladies, 1 gentlemen) and = 126 × 8 + 84 × 28 + 36 × 56 + 9 × 70 + 1 × 56 = 6062
women invites (2 gentlemen, 1 lady). (i) Clearly, women are in majority in (iii), (iv) and (v)
Number of ways cases as discussed above.

= (4C2.3C1) (3C1.4C1) = 324 (ii) So, total number of committees in which women are
in majority
Case-III: A man invites (1 lady, 2 gentlemen) and
= 9C 7 × 8C 5 + 9C 8 × 8C 4 + 9C 9 × 8C 3
women invites (2 ladies, 1 gentleman).
= 36 × 56 + 9 × 70 + 1 × 56 = 2702
Number of ways
Clearly, men are in majority in only (i) case as discussed
= (4C1.3C2).(3C2.4C1)= 144 above.
Case-IV: A man invites (3 gentlemen) and women So, total number of committees in which men are in
invites (3 ladies). majority
= 9C5 × 8C7 = 126 × 8 = 1008
 M a them a ti cs | 5.65

Sol 6: A → p; B → s; C → q; D → q

(A) If ENDEA is fixed word, then assume this as a single

letter.
Total number of letters = 5
Total number of arrangements = 5!

(B) If E is at first and last places, then total number of

7!
permutation of = 21 × 5!
2!
(C) If D, L, N are not in last five positions
← D, I, N, N → ← E, E, E, A, O →
Total number of permutation
4! 5!
= × = 2 × 5!
2! 3!
(D) Total number of odd position = 5
5!
Permutation of AEEEO are
3!
Total number of even positions = 4
4!
Number of permutations of N, N, D, L =
2!
5! 4!
Hence, total number of permutation = × = 2 × 5!
3! 2!