PERMUTATIONS & COMBINATIONS

IIT-JEE-Syllabus

Permutations and Combinations, circular permutation.

COUNTING PRINCIPLES

There are two fundamental counting principles viz. Multiplication principle and Addition principle.
There are certain other counting principles also as given below:
 Bijection principle
 Inclusion-exclusion principle

Multiplication Principle:

If one experiment has n possible outcomes and another experiment has m possible outcomes,
then there are m  n possible outcomes when both of these experiments are performed.
In other words, if a job has n parts and the job will be completed only when each part is
completed and the first part can be completed in a 1 ways, the second part can be completed in a 2
ways and so on …. the nth part can be completed in an ways, then the total number of ways of
doing the job is a1a2a3 ... an. This is known as the Multiplication principle.

Illustration 1. A college offers 7 courses in the morning and 5 in the evening. Find the possible
number of choices with the student if he wants to study one course in the
morning and one in the evening.

Solution: The student has seven choices from the morning courses out of which he can
select one course in 7 ways.
For the evening course, he has 5 choices out of which he can select one in 5
ways.
Hence the total number of ways in which he can make the choice of one course
in the morning and one in the evening = 7  5 = 35.

Illustration 2. A person wants to go from station A to station C via station B. There are three
routes from A to B and four routes from B to C. In how many ways can he travel
from A to C?

Solution: A  B in 3 ways
B  C in 4 ways
 A C in 3  4 = 12 ways

Remark:
 The rule of product is applicable only when the number of ways of doing each part is
independent of each other i.e. corresponding to any method of doing the first part, the
other part can be done by any method

FIITJEE Ltd., ICES House, 29-A, Kalu Sarai, Sarvapriya Vihar, New Delhi -16, Ph 26515949, 26854102, Fax 26513942
 RSM-78-P4-MA-PC 2

Illustration 3. How many (i) 5 – digit (ii) 3 – digit numbers can be formed by using 1, 2, 3, 4, 5
without repetition of digits.

Solution: (i) Making a 5-digit number is equivalent to filling 5 places.

Places: 1 2 3 4 5
5 4 3 2 1 Number of Choices:
The first place can be filled in 5 ways using anyone of the given digits.
The second place can be filled in 4 ways using any of the remaining 4 digits.
Similarly, we can fill the 3rd, 4th and 5th place.
No. of ways of filling all the five places
= 5  4  3  2  1 = 120  120 5-digit numbers can be formed.
(ii) Making a 3-digit number is equivalent to filling 3 places.
Places: 1 2 3
5 4 3 Number of Choices:
Number of ways of filling all the three places = 5  4  3 = 60
Hence the total possible 3-digit numbers = 60.

Addition principle:

If one experiment has n possible outcomes and another has m possible outcomes, then there are
(m + n) possible outcomes when exactly one of these experiments is performed. In other words, if
a job can be done by n methods and by using the first method, can be done in a 1 ways or by
second method in a2 ways and so on . . . by the nth method in a n ways, then the number of ways
to get the job done is (a1 + a2 + ... + an).

Illustration 4. A college offers 7 courses in the morning and 5 in the evening. Find the number
of ways a student can select exactly one course, either in the morning or in the
evening.

Solution: The student has seven choices from the morning courses out of which he can
select one course in 7 ways.
For the evening course, he has 5 choices out of which he can select one course
in 5 ways.
Hence he has total number of 7 + 5 = 12 choices.

Illustration 5. A person wants to leave station B. There are three routes from station B to A and
four routes from B to C. In how many ways can he leave the station B.

Solution: B  A in 3 ways
B  C in 4 ways
 He can leave station
B in 3 + 4 = 7 ways.
3 RSM-78-P4-MA-PC

Bijection Principle:

Generally it is not easy to count the numbers belonging to a very large collection(set) directly. Let
us assume that we have a set X and we want to count n(x) ( number of elements in X).
And we have another set Y and n(Y) can be counted(easily). Now if there exists one-one and
onto relationship from set X to set Y, then n(X) = n(Y) .
In other words, if X and Y are two finite sets such that there is a bijection ( i.e. one-one onto
map) from X to Y , then n(X) = n(Y).
For example let us take a simple case. The sitting capacity of a class is 30. On a particular day,
the class is full then, without actual counting, we can say that the total number of the students
present in the class is 30.

Inclusion-Exclusion Principle:

Let U be a finite set of m elements and p 1 , p2 , p3 , . . . ,pr be some properties which the objects
of U may or may not have,
Then the number of elements of U which have at least one of the properties p 1, p2, p3, …. ,pr is
given by
 r 
n  A i  = S1 – S2 + S3 – S4 + . . . +(–1)r-1Sr .

 
 i1 
and the number of elements of U which have none of the properties p 1, p2, p3 , . . . ,pr is given
 r c
by n  A i  = m – S1 + S2 – S3 + …. + (– 1) r Sr .

 i1 
Where Ai denotes the subset of U each of whose elements has the property p i( i = 1, 2, …. , r)
and A ic denotes the subset of U none of whose elements has the property p i
Ai  A j denotes the set of all elements of U having both properties p i and pj and so on. And S k
denotes the total number of elements of U having any k of the given r properties.
E.g. S1 = n(A1) + n(A2) + …. + n(Ar) ,
S2 = n(A1A2) + n(A1 A3) +…. + n(A1Ar) + n(A2A3) + . . . + n(A2Ar) + …. + n(Ar-1  Ar) .
In particular case:
For r =2 , n(A1A2) = n(A1) +n(A2) – n(A1A2)
For r = 3,
n(A1A2 A3) = n(A1) +n(A2) +n(A3) – n(A1A2) – n(A1A3) – n(A2A3) + n(A1  A2 A3).
For r = 4,
n(A1A2A3A4) = n(A1) +n(A2) +n(A3) + n(A4) – n(A1A2) – n(A1A3) – n(A1A4)
– n(A2A3) – n(A2A4) – n(A3A4)+ n(A1  A2 A3) + n(A1  A2 A4)
+ n(A1  A3 A4) + n(A2  A3 A4) – n(A1A2  A3 A4).

Illustration 6. Find the number of integers between 1 and 1000, both inclusive
(a) Which are divisible by either of 10, 15 and 25.
(b) Which are divisible by neither 10 nor 15 nor 25.

Solution: Let U denote the set of numbers between 1 and 1000 so that n(U) = 1000. Let A,
B and C denote the sets of integers divisible by 10, 15 and 25 respectively.
RSM-78-P4-MA-PC 4

1000 
Then n(A) =   =100,
 10 
1000  1000 
n(B) =   = 66, and n(C) =  25  = 40 .
 15   
S1 = n(A) +n(B) +n(C) = 100 + 66 + 40 = 206
Considering two of the three sets A, B, C, we have
A  B = set of integers divisible by 10 and 15
= set of integers divisible by 30 (L.C.M of 10 and 15)
1000 
 n( A  B) =    33 .
 30 
Similarly, B  C = set of integers divisible by 15 and 25
= set of integers divisible by 75 (L.C.M of 15 and 25)
1000 
 n( B  C) =    13 .
 75 
Similarly, A  C = set of integers divisible by 10 and 25
= set of integers divisible by 50 (L.C.M of 10 and 25)
1000 
 n( A  C) =    20 .
 50 
S2 = 33 + 13 + 20 = 66.
Finally, A  B  C = set of integers divisible by 10, 15 and 25
= set of integers divisible by 150 (L.C.M of 10, 15 and 25)
1000 
 n( A  B  C) =    6.
 150 
S3 = 6 .
(a) We have to find the number of integers divisible by either
of 10, 15, and 25 i.e. n(A BC)
n(A BC) = S1 – S2 +S3 = 206 – 66 + 6 = 146 .
(b) The number of integers divisible by neither 10 nor 15, nor 25
= n(U) – n(A BC) = 1000 – 146 = 854.

Remark:
n 
 The number of integers from 1 to n which are divisible by k is   ([ .] denotes the
k 
greatest integer function). e.g. the number of integers from 1 to 100 which are divisible
100  100 
by 2 and 3 individually are    50 and   = 33 respectively.
 2   3 
 The number of natural numbers from 1 to n, which are perfect kth powers, is [n 1/k]. e.g.
the number of perfect squares from 1 to 110 is [ 110 ] = 10.

Exercise 1:
i) Four dice are rolled once. Find the number of outcomes in which at least one die
shows 3.
ii) A die is rolled ten times find the no of ways so that out comes always contain
1, 2, 3.
5 RSM-78-P4-MA-PC

PERMUTATIONS (ARRANGEMENT OF OBJECTS)

The number of permutations of n objects, taken r at a time, is the total number of arrangements of
r objects, selected from n objects where the order of the arrangement is important.

Without repetition:
(a) Arranging n objects, taken r at a time is equivalent to filling r places from n things.
rPlaces: 1 2 3 4 r
n n-1
Number n-2 n-3
of Choices: n -(r-1)
The number of ways of arranging = The number of ways of filling r places
= n(n – 1) (n – 2) ….. (n – r + 1)
n(n- 1) (n- 2) .. (n- r  1) ((n- r)!) n! n
= =
 n  r !  n  r  ! = Pr
(b) The number of arrangements of n different objects taken all at a time = npn = n!

With repetition:

(a) The number of permutations (arrangements) of n different objects, taken r at a time, when
each object may occur once, twice, thrice …. upto r times in any arrangement
= The number of ways of filling r places where each place can be filled by any one of n objects.
rPlaces: 1 2 3 4 r
n
n n of Choices:
Number n n

The number of permutations = The number of ways of filling r places = (n) r

(b) The number of arrangements that can be formed using n objects out of which p are identical
(and of one kind), q are identical (and of another kind), r are identical (and of another kind) and
n!
the rest are distinct is .
p! q!r !

Illustration 7. How many 7 - letter words can be formed using the letters of the words
(a) BELFAST (b) ALABAMA

Solution: (a) BELFAST has all different letters.

Hence the number of words = 7P7 = 7! = 5040.
(b) ALABAMA has 4 A's but the rest are all different. Hence the number of words
7!
that can be formed is = 7 x 6 x 5 = 210.
4!

Illustration 8. (a) How many anagrams can be made by using the letters of the word
HINDUSTAN .
(b) How many of these anagrams begin and end with a vowel.
(c) In how many of these anagrams, all the vowels come together.
(d) In how many of these anagrams, none of the vowels come together.
(e) In how many of these anagrams, do the vowels and the consonants occupy
the same relative positions as in HINDUSTAN.
RSM-78-P4-MA-PC 6

Solution: (a) The total number of anagrams

9!
= Arrangements of nine letters taken all at a time = = 181440.
2!
(b) We have 3 vowels and 6 consonants, in which 2 consonants are alike. The
first place can be filled in 3 ways and the last in 2 ways. The rest of the places
7!
can be filled in ways.
2!
7!
Hence the total number of anagrams = 3  2  = 15120
2!
(c) Assume the vowels (I, U, A) as a single letter. The letters (IUA) H, D, S, T, N,
7!
N can be arranged in ways. Also IUA can be arranged among themselves in
2!
3! = 6 ways.
7!
Hence the total number of anagrams =  6 = 15120
2!
(d) Let us divide the task into two parts. In the first, we arrange the 6 consonants
6!
as shown below in ways.
2!
CCCCCC (C stands for consonants and  stands for blank
spaces in between them)
Now 3 vowels can be placed in 7 places (in between the consonants) in 7p 3
7!
= = 210 ways.
4!
6!
Hence the total number of anagrams =  210 = 75600.
2!
(e) In this case, the vowels can be arranged among themselves in 3! = 6ways.
Also, the consonants can be arranged among
6!
themselves in ways.
2!
6!
Hence the total number of anagrams =  6 = 2160.
2!

Illustration 9. How many 3 digit numbers can be formed using the digits 0, 1,2,3,4,5 so that
(a) digits may not be repeated
(b) digits may be repeated.

Solution: (a) Let the 3-digit number be XYZ

Position (X) can be filled by 1,2,3,4,5 but not 0. So it can be filled in 5 ways.
Position (Y) can be filled in 5 ways again. (Since 0 can be placed in this position).
Position (Z) can be filled in 4 ways.
Hence by the fundamental principle of counting, total number of ways is
5 x 5 x 4 = 100 ways.
(b) Let the 3 digit number be XYZ
Position (X) can be filled in 5 ways
Position (Y) can be filled in 6ways.
Position (Z) can be filled in 6 ways.
Hence by the fundamental principle of counting, total number of ways is
5 x 6 x 6 = 180.
7 RSM-78-P4-MA-PC

Exercise 2:
i) A code word consist of three letters follower by two digits. How many code words
can be made. If neither the letters nor the digits are repeated in any code.
ii) How many three digit numbers are such that
(a) at least one of the digit is 5.
(b) exactly one of the digits is 5.

CIRCULAR PERMUTATIONS

The arrangements we have considered so far were linear. There are arrangements in closed
loops also, called as circular arrangements.
Suppose n persons (a1, a2, a3,…,an) are to be arranged around a circular table. There are n! ways
in which they can be arranged in a row. On the other hand, all the linear arrangements depicted
by
a1, a2, a3, ……..., an
an, a1, a2,……….,an – 1
an – 1, an, a1, a2…..an – 2
…………………….
a2, a3, a4,……….,a1
will lead to the same arrangement for a circular table. Hence each circular arrangement
corresponds to n linear arrangements (i.e. in a row). Hence the total number of circular
n!
arrangements of n persons is = (n – 1)!.
n
In other words, the arrangement (permutation) in a row has a beginning and an end, but there is
nothing like beginning or end in circular permutation. Thus, in circular permutation, we consider
one object as fixed and the remaining objects can be arranged in (n – 1)! ways (as in the case of
arrangement in a row).

Distinction between clockwise and anti-clockwise Arrangements

A1
Consider the following circular arrangements: In figure A1

I, the order is clockwise whereas in figure II, the order A3 A2 A2 A3

is anti-clock wise.
I II

These are two different arrangements. When distinction is made between the clockwise and the
anti-clockwise arrangements of n different objects around a circle, then the number of
arrangements = (n – 1)!
But if no distinction is made between the clockwise and the anti-clockwise arrangements of n
different objects around a circle, then the number of arrangements is 1/2(n – 1)!
For an example, consider the arrangements of beads (all different) on a necklace as shown in
figures A and B.
Look at (A) having 3 beads x 1, x2, x3 as shown. Flip (A) over on
its right. We get (B) at once. However, (A) and (B) are really the x 1 x 1

outcomes of one arrangement but are counted as two different

arrangements in our calculation. To nullify this redundancy, the x 2 x 3 x 3 x 2

actual number of different arrangements is (n-1)!/2. A B

RSM-78-P4-MA-PC 8

Remarks:
 When the positions are numbered, circular arrangement is treated as a linear
arrangement.
 In a linear arrangement, it does not make difference whether the positions are numbered
or not.

Illustration 10. Consider 23 different coloured beads in a necklace. In how many ways can the
beads be placed in the necklace so that 3 specific beads always remain
together?

Solution: By theory, let us consider 3 beads as one. Hence we have, in effect, 21 beads,
'n' = 21. The number of arrangements = (n-1)! = 20!
Also, the number of ways in which 3 beads can be arranged between themselves
is 3! = 3 x 2 x 1 = 6.
Thus the total number of arrangements = (1/2). 20!. 3!.

Illustration 11. In how many ways 10 boys and 5 girls can sit around a circular table so that no
two girls sit together.

Solution: 10 boys can be seated in a circle in 9! ways. There

are 10 spaces in between the boys, which can be
occupied by 5 girls in 10p5 ways. Hence total
number of ways
9!10!
= 9! 10p5 = .
5!

( stands for boys)

COMBINATIONS

Meaning of combination is selection of objects.

Selection of objects without repetition:

The number of selections (combinations or groups) that can be formed from n different objects
n n!
taken r (0  r  n) at a time is Cr  .
r! n  r !

Explanation:

Let the total number of selections (or groups) = x. Each group contains r objects, which can be
arranged in r! ways. Hence the number of arrangements of r objects = x  (r!).
But the number of arrangements = npr
n
pr n!
 x  (r!) = npr.  x = x= = nCr .
r! r! n  r !
9 RSM-78-P4-MA-PC

Illustration 12. There are two boys B1 and B2. B1 has n1 different toys and B2 has n2 different
toys. Find the number of ways in which B1 and B2 can exchange their toys in
such a way that after exchanging they still have same number of toys but
not the same set.

Solution: Total number of toys = n1 + n2

Now let us keep all toys at one place and ask B 1 to pick up any n 1 toys out of
n1  n2
these n1 + n2 toys. He can do it in Cn1 ways Out of these ways there is one
way when he picks up those n1 toys which he was initially having.
n1  n2
Thus required number of ways are Cn1 -1.

Selection of objects with repetition:

The number of combinations of n distinct objects, taken r at a time when each may occur once,
twice, thrice,….. upto r times in any combination is n+r-1Cr .

Explanation:
Let the n objects be a1, a2, a3… an. In a particular group of r objects, let
a1 occurs x1 times,
a2 occurs x2 times
a3 occurs x3 times
………………….
………………….
an occurs xn times
such that x1 + x2 + x3 + ….. + xn = r …. (1)
0  xi  r  i  {1, 2, 3, …., n}
Now the total number of selections of r objects out of n
= number of non-negative integral solutions of equation (1)
= n + r – 1Cn – 1 = n + r – 1Cr.

Note:
 Details of finding the number of integral solutions of equation (1) are given on page18.

Illustration 13. Let 15 toys be distributed among 3 children subject to the condition that any child
can take any number of toys. Find the required number of ways to do this if
(i) toys are distinct. (ii) toys are identical.

Solution: (i) Toys are distinct

Here we have 3 children and we want the 15 toys to be distributed to the 3
children with repetition. In other words, it is same as selecting and arranging
children 15 times out of 3 children with the condition that any child can be
selected any no. of time, which can be done in 3 15 ways (n = 3, r = 15).
(ii) Toys are identical
Here we only have to select children 15 times out of 3 children with the condition
that any child can be selected any number of times which can be done in
3
H15 = 3 +15 - 1C15 = 17C2 ways (n = 3, r = 5).
RSM-78-P4-MA-PC 10

Restricted selection / Arrangement :

(a) The number of ways in which r objects can be selected from n different objects if k
particular objects are
(i) always included = n-k Cr-k
(ii) never included = n-k Cr
(b) The number of arrangements of n distinct objects taken r at a time so that k particular
objects are
(i) always included = n-k Cr-k .r!
(ii) never included = n-k Cr .r!
(c) The number of combinations of n objects, of which p are identical, taken r at a time is
= n-pCr + n-pCr-1 + n-pCr-2+ …… + n-pC0 if r  p and it is:
= n-pCr + n-pCr-1 + n-pCr -2+ ……+ n-pCr-p if r > p

Illustration 14. A delegation of four students is to be selected from a total of 12 students. In how
many ways can the delegation be selected
(a) If all the students are equally willing.
(b) If two particular students have to be included in the delegation.
(c) If two particular students do not wish to be together in the delegation.
(d) If two particular students wish to be included together only.
(e) If two particular students refuse to be together and two other particular
student wish to be together only in the delegation.

Solution: (a) Formation of delegation means selection of 4 out of 12. Hence the number of
ways = 12C4 = 495.
(b) If two particular students are already selected. Here we need to select only 2
out of the remaining 10. Hence the number of ways = 10C2 = 45.
(c) The number of ways in which both are selected = 45. Hence the number of
ways in which the two are not included together = 495 – 45 = 450.
(d) There are two possible cases
(i) Either both are selected. In this case, the number of ways in which the
selection can be made = 45.
(ii) Or both are not selected. In this case all the four students are selected from
the remaining ten students.
This can be done in 10C4 = 210 ways.
Hence the total number of ways of selection = 45 + 210 = 255.
(e) We assume that students A and B wish to be selected together and students
C and D do not wish to be together. Now there are following 6 cases.
(i) (A, B, C) selected, (D) not selected
(ii) (A, B, D) selected (C) not selected
(iii) (A, B) selected (C, D) not selected
(iv) (C) selected (A, B, D) not selected
(v) (D) selected (A, B, C) not selected
(vi) A, B, C, D not selected
For (i) the number of ways of selection = 8C1 = 8
For (ii) the number of ways of selection = 8C1 = 8
11 RSM-78-P4-MA-PC

For (iii) the number of ways of selection = 8C2 = 28

For (iv) the number of ways of selection = 8C3 = 56
For (v) the number of ways of selection = 8C3 = 56
For (vi) the number of ways of selection = 8C4 = 70
Hence total number of ways = 8 + 8 + 28 + 56 + 56 + 70 = 226.

Some results related to nCr

n
(i) Cr = nCn-r
(ii) If nCr = nCk , then r = k or n-r =k
n
(iii) Cr + nCr-1 = n+1Cr
n n
(iv) Cr = n-1Cr-1
r
n
Cr n r 1
(v) n

Cr 1 r
(vi) (a) If n is even , nCr is greatest for r = n/2
n 1 n 1
(b) If n is odd, nCr is greatest for r = , .
2 2

Illustration 15. How many triangles can be formed by joining the vertices of an n- sided polygon.
How many of these triangles have
(i) exactly one side common with that of the polygon
(ii) exactly two sides common with that of the polygon
(iii) no sides common with that of the polygon

Solution: Number of triangles formed by joining the vertices of the polygon

n(n  1)(n  2)
= number of selections of 3 points from n points = nC3 = .
3.2.1
Let the vertices of the polygon be marked as A1, A2,A3,…. An.
(i) Select two consecutive vertices A1, A2 of the polygon. For the required triangle,
we can select the third vertex from the points A 4,A5,….. An-1. This can be done in
n-4
C1 ways. Also two consecutive points (end points of a side of polygon) can be
selected in n ways . Hence the total number of required triangles
= n.n-4C1 = n(n – 4).
(ii) For the required triangle, we have to select three consecutive vertices of the
polygon. i.e. (A1 A2 A3), (A2 A3 A4), (A3 A4 A5), …. ,(An A1 A2). This can be done in
n ways.
(iii) Triangles having no side common + triangles having exactly one side
common + triangles having exactly two sides common (with those of the polygon)
= Total number of triangles formed
 Triangles having no side common with those of the polygon
n(n  1)(n  2)
= nC3 – n(n-4) –n = -n(n-4) –n
6
n 2 n 2 n(n  4)(n  5)
= n  3n  2  6n  24  6  = n  9n  20  = .
6 6 6
RSM-78-P4-MA-PC 12

Exercise 3:
i) To fill 12 vacancies, there are 25 candidates of which 5 are from scheduled caste. If
3 vacancies are reserved for scheduled caste candidates while the rest are open to
all. Find the number of ways in which a selection can be made.
ii) A train going from Delhi to Jaipur stops at 7 intermediate stations. Five persons
enter the train during the journey with five different tickets of the same class. How
many different sets of tickets they could had?
iii) Suppose n different games are to be given to n children. In how many ways can
this be done so that exactly one child gets no game.

ALL POSSIBLE SELECTIONS

Selection from distinct objects:

The number of selections from n different objects, taken at least one

= nC1 + nC2 + nC3 + …. + nCn = 2n – 1.
In other words, for every object, we have two choices i.e. either select or reject in a particular
group. Total number of choices (all possible selections) = 2.2.2 …. n times = 2 n .
But this also includes the case when none of them is selected and the number of such cases = 1.
Hence the number of selections, when at least one is selected = 2 n – 1.

Selection from identical objects:

(a) The number of selections of r objects out of n identical objects is 1.

(b) Total number of selections of zero or more objects from n identical objects is n + 1.
(c) The total number of selections of at least one out of a 1+a2+a3+…. +an objects, where
a1 are alike (of one kind ), a2 are alike (of second kind ) and so on …. a n are alike (of nth
kind ), is [(a1+1)(a2+1)(a3+1) ….. (an+1)] – 1.

Selection when both identical and distinct objects are present:

The number of selections taking at least one out of a 1+a2+a3+….+an+k objects, where a1 are alike
(of one kind), a2 are alike (of second kind) and so on ….. a n are alike (of nth kind), and k are
distinct = [(a1+1)(a2+1)(a3+1) …. (an+1)] 2k – 1.

Illustration 16. Let a person have 3 coins of 25 paise, 4 coins of 50 paise and 2 coins of 1
rupee. Then, in how many ways can he give none or some coins to a beggar?
Further find the number of ways so that
(i) he gives at least one coin of one rupee.
(ii) he gives at least one coin of each kind .

Solution: Total number of ways of giving none or some coins is

(3 + 1) (4 + 1) (2 + 1) = 60 ways
(i) Number of ways of giving at least one coin of one rupee
= (3 + 1) (4 + 1)  2 = 40
(ii) Number of ways of giving at least one coin of each kind
= 3  4  2 = 24.
13 RSM-78-P4-MA-PC

Total number of divisors of a given natural number:

To find number of divisors of a given natural number greater than 1 we can write n as
  
n = p1 1 p2 2 p3 3 ...pnn

where p1, p2, ... , pn are distinct prime numbers and 1, 2,...n are positive integers. Now any
divisor of n will be of the form
 
d = p11 p22 ...pnn ( where 0  i  i , i  I ,  i = 1, 2, 3, …. , n)

Here number of divisors will be equal to numbers of ways in which we can choose
i’s which can be done in (1 + 1)(2 + 1)...(n + 1) ways.
e.g. Let n = 360  n = 23.32.5
 No. of divisors of 360 = (3 + 1) (2 + 1) (1 + 1) = 24
Sum of all the divisors of n is given by
 p1 1  1  p 2 1  1  p3 1  1  pn 1  1
 1  . 2 . 3  ...  n 
 p1  1   p2  1   p3  1   pn  1 
       
 2 4  1   33  1   5 2  1 
As in above case, sum of all the divisors =        1170
 2 1  3 1  5 1 

Remark:
 The number of factors of a given natural number ‘n’ will be odd if and only if ‘n’ is a
perfect square.

Illustration 17. If n = 10800, then find the

(a) Total number of divisors of n.
(b) The number of even divisors.
(c) The number of divisors of the form 4m+2.
(d) The number of divisors which are multiples of 15.

Solution: n = 10800 = 24  33 52

Any divisor of n will be of the form 2a  3b  5c
where 0  a  4, 0  b  3, 0  c  2 . For any distinct choices of a,b and c ,
we get a divisor of n
(a) Total number of divisors = (4 + 1) (3 + 1) (2 + 1) = 60.
(b) For a divisor to be even, ‘a’ should be at least one. So 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.
RSM-78-P4-MA-PC 14

DIVISION AND DISTRIBUTION OF OBJECTS (with fixed number of objects in each group)

Into groups of unequal size (different number of objects in each group):

(a) Number of ways in which n distinct objects can be divided into r unequal groups
containing a1 objects in the first group, a2 objects in the second group and so on
n na n a a a n!
= Ca1 . 1 Ca2 . 1 2 Ca3 ..... r Car =
a1 ! a2 ! a3 ! ...... ar !.
Here a1 + a2 + a3 + … +ar = n.
(b) Number of ways in which n distinct objects can be distributed among r persons such that
first person gets a1 objects, 2nd person gets a2 objects…,rth person gets ar objects =
n!r !
.
a1 ! a2 ! a3 ! ..... ar !

Explanation:
Let us divide the task into two parts . In the first part, we divide the objects into groups. In
the second part, these r groups can be assigned to r persons in r! ways.

Into groups of equal size (each group containing same number of objects):

(a) Number of ways in which mn distinct objects can be divided equally into n groups
(mn)!
(unmarked) =
(m!)n n!
(b) Number of ways in which m n different objects can be distributed equally among n
persons (or numbered groups) = (number of ways of dividing into groups) (number of
(mn)!n! (mn)!
groups)! =  .
(m!)n n! (m!)n

Example:
If out of 50 players, 5 teams of 10 players each have to be formed this becomes a question on
 50  !
grouping and thus required number of ways to form such teams is .
 10! 5  5!

DERANGEMENT

Let S = {1, 2, 3, …. ,n}, then a function f from S to S known as derangement if f is a bijective

function and f(i)  i for any i  S.
In other words rearrangement of objects such that no one goes to its original place is called
derangement
If 'n' things are arranged in a row, the number of ways in which they can be deranged so that
 1 1 1 1
none of them occupies its original place is n!  1     ........  ( 1)n  .
 1! 2! 3! n! 
n
1
  1
r
= n! and it is denoted by D(n).
r 0
r!
15 RSM-78-P4-MA-PC

Note:
 The above result can be obtained by using inclusion exclusion principle. For this you can
refer to problem –13 on page 29.

Illustration 18: Suppose 4 letters are taken out of 4 different envelopes. In how many ways, can
they be reinserted in the envelopes so that no letter goes in to its original
envelope ?

Solution: Using the formula for the number of derangements that are possible out of 4
letters in 4 envelopes, we get the number of ways as :
 1 1 1  1 1 1 
4!  1  1      24  1  1     9.
 2! 3! 4!   2 6 24 

Exercise 4:
i) How many functions are possible from the set A = {1, 2, 3} in to itself if f(1)  1,
f(2)  2 and f(3)  3.
ii) 7 distinct toys are distributed among 4 boys in such a way that any three get each
2 toys and forth gets 3 toys. Find the NO of ways.

MULTINOMIAL THEOREM

Let x1, x2,...,xm be integers. Then number of solutions to the equation

x1 + x2 + ... + xm = n …. (1)
subject to the condition a1  x1  b1, a2  x2  b2, ..., am  xm  bm …. (2)
is equal to the coefficient of xn in
x a1
 x a1 1  ...  xb1 x a2
 
 x a2 1  ...  x b2 ... x am  x am 1  ...  x bm  …. (3)
This is because the number of ways, in which sum of m integers in (1) equals n, is the same as
the number of times xn comes in (3).
Note:
 We use the result that the coefficient of xr in the expansion of (1-x)-n = n+r-1Cr

Illustration 19. In how many different ways can 3 persons A, B, C having 6 one rupee coin, 7
one rupee coin, 8 one rupee coin respectively donate 10 one rupee coin
collectively?

Solution: The number of ways in which they can donate Rs. 10 is same as the number of
solutions to the equation x1 + x2 + x3 = 10
subject to the condition 0  x1  6, 0  x2  7, 0  x3  8
 Required number of ways
= coefficient of x10 in (1 + x + x2 + ...+x6) (1 + x + x2 + ... + x7)(1 + x + x2 +.. + x8)
= coefficient of x10 in (1 – x7) (1– x8) (1– x9) (1 – x)-3
= coefficient of x10 in (1 – x7 – x8 – x9) (1 + 3C1x + 4C2x2 + 5C3x3 + ... +12C10x10)
(ignoring powers higher than 10)
= 12C2 – 5C3 – 4C2 – 3C1 = 66 – 10 – 6 – 3 = 47.
RSM-78-P4-MA-PC 16

Different Cases of multinomial Theorem:

Case – I : If upper limit of a variable is more than or equal to the sum required and lower limit of
all the variables are non-negative, then upper limit of that variable can be taken as infinite .

Illustration 20. In how many ways the sum of upper faces of four distinct dies can be six.

Solution: Here the number of required ways will be equal to the number of solutions of
x1 + x2 + x3+ x4 = 6
1  x1, x2, x3, x4  6
Since the upper limit is six which is equal to the sum required, so upper limit can
be taken as infinite.
So number of solutions = coefficient of t6 in (1 + t + t2 + …. )4
= coefficient of t6 in t4(1– t)–4 = 10 .
Case – II: When coefficients of variables are not unity
The number of solutions of ax1 +bx2 +cx3 = n
Subject to the condition a1  x1  b1 , a2  x2  b2 , a3  x3  b3
Is coefficient of tn in

 
 a a1
               
a1 1 b1   a2 a2 1 b2   c a3 a3 1 b3 
 t  ta  ....  ta    tb  tb  ....  tb  t  tc  ....  t c .
     

Illustration 21. In how many ways can 15 identical blankets be distributed among six beggars
such that everyone gets at least one blanket and two particular beggars get
equal blankets and another three particular beggars get equal blankets.

Solution: The number of ways of distributing blankets is equal to the number of solutions of
the equation, 3a + 2b+ c = 15
a , b, c  1, which is equal to coefficient of t15 in
(t3 + t6 + t9 . . .)(t2 + t4 + . . .)( t + t2+ . . )
= coefficient of t9 in ( 1 + t3 + t6+ t9)( 1+ t2 + t4+ t6+ t8 )( 1+ t+ t2+ … +t9) (neglecting
higher powers)
= coefficient of t9 in (1+t2+ t3 + t4 + t5+ 2t6+ t7+ 2t8 +2t9)(1+ t+t2+….+ t9)
= 1 + 1+ 1+ 1+ 1 +2 + 1+2 + 2 = 12.

Case – III: When variables are distinct. In such a case, we introduce some new variables to
remove the condition of distinctness.

Illustration 22. In how many ways can 14 identical toys be distributed among three boys so that
each one gets at least one toy and no two boys get equal number of toys .

Solution: Let the boys get a, b and c toys respectively

a + b + c = 14, a, b, c  1 and a, b and c are distinct
let a < b < c and x1 = a, x2 = b – a, x3 = c – b
So, 3x1 + 2x2 + x3 = 14, x1, x2, x3  1
The number of solutions is equal to the coefficient of t 14 in
(t3 + t6 + t9 +. . .)(t2 + t4 + . . .)( t + t2+ . . )
17 RSM-78-P4-MA-PC

= coefficient of t8 in ( 1 + t3 + t6) (1+ t2 + t4+ t6+ t8 ) ( 1 + t + t 2+ . . . .+t8) (neglecting

higher powers )
=coefficient of t8 in (1+ t2+ t3+ t4+ t5 + 2t6+ t7+ 2t8 ) ( 1 + t + t2+ . . . .+t8)
= 1 + 1+ 1+ 1+1 +2+1+2 = 10
Since three distinct numbers can be assigned to three boys in 3! ways. So,
corresponding to each solution, we have six ways of distribution. So, total
numbers of ways = 10  6 = 60

Case – IV: When required sum is not fixed

To find the number of solutions of the equation
x1 + x2 + . . . . . + xm  n …(1)
We introduce a dummy variable xm+1 so that
x1 + x2 + . . . . + xm+1 = n, xm+1  0 …(2)
The number of solutions of (1) and (2) will be same

Illustration 23. In how many ways can we get a sum of at most 17 by throwing six distinct dies.

Solution: Let x1, x2,.…, x6 be the number that appears on the six dies.
Let us find the number of ways to get the sum less than or equal to 17. This will
be same as finding the number of solutions to the inequality
x1 + x2 + x3 + ... + x6  17
Introducing a dummy variable x7(x7  0), the inequality becomes an equation
x1 + x2 + ... + x6 + x7 = 17
Here 1  xi  6 where i = 1, 2, ..., 6 and x7  0
 No. of solutions
= coefficient of x17 in (x + x2 +...+x6)6 (1+ x + x2 + …)
= coefficient of x11 in (1 - x6)6 (1 - x)-7
= coefficient of x11 in (1 - 6x6) (1 - x)-7 = 17C6 –6 11C5.

Remark:
 To find the number of solutions of x 1 + x2 + …. + xn  n, (when the values of x 1, x2, ….,xn
are restricted), first find the number of solutions of x 1 + x2 + …. + xn  n – 1 and then
subtract it from total number of solutions.

Illustration 24. In how many ways we can get a sum greater than 17 by throwing six distinct
dies.

Solution: Let x1, x2, .…,x6 be the number that appears on the six dies.
Here 1  xi  6  i  { 1, 2, 3, 4, 5, 6}  total number of cases = 66
In Illustration 28 we already calculated the number of ways to get the sum less
than or equal to 17.
Which is 17C11 – 6.11C5
Hence number of ways to get a sum greater than 17
= 66 – (17C11 – 611C5 ).
RSM-78-P4-MA-PC 18

Applications of Multinomial Theorem:

Illustration 25. Find the number of ways in which 10 girls and 90 boys can sit in a row having
100 chairs such that no girls sit at the either end of the row and between any two
girls, at least five boys sit.

Solution: First we select 10 chairs which will be occupied by 10 girls under the given
condition. Now these 10 selected chairs will divide the remaining 90 chairs int o
11 parts

Therefore no of ways of selecting 10 chairs

 No of solutions of x1 + x2 + x3 + …. + x11 = 90
under the condition x1, x11  1, x2, x3, x4, …. , x10  5
= coefficient of t90 in ( t + t2 + t3+ …. )2 (t5 + t6 + ….)9
= coefficient of t43 in (1 + t + t2 +…. )11
= coefficient of t43 in (1 – t)-11 = 53C43
Hence the required number of ways is 53C43  10!  90! .

Illustration 26. In how many ways, two distinct natural numbers can be selected which are less
than or equal to 100 and differ by at most 10.

Solution: These two selected distinct natural a b

numbers ‘a’ and ‘b’ will divide the x1 x2 x2
remaining 98 numbers into three parts.
First we will find the number of ways of selecting a and b such that difference is
at least 11.
we have x1 + x2 +x3 = 98, x1, x3  0 , x2  10
The number of solutions will be equal to the coefficient of t 98 in
(1 + t + t2 + ….)2 (t10 + t11 + t12+ ….)
= coefficient of t88 in ( 1 – t)-3 =3+88-1C88 = 90C2
Now we will subtract this from the total number of ways.
So required number of ways = 100C2 – 90C2 .

Exercise 5:
i) In how many ways can five balls be taken out from a bag consisting of six
identical red balls, seven identical white balls and three identical green balls?
ii) In how many ways can 21 identical blankets be distributed among three beggars
so that exactly two of them get equal number of blankets.

Division and Distribution:

(Number of Objects in a group is not fixed)

(a) Distribution of n distinct balls in r distinct boxes and order is considered in the box
= n! n-1Cr-1, if blank (empty) boxes are not allowed.
And it is : = n! n+r-1Cr-1 if blank (empty) boxes are allowed.
19 RSM-78-P4-MA-PC

(b) Distribution of n identical balls into r distinct boxes

= n-1Cr-1, if blank (empty) boxes are not allowed.
And it is : = n+r-1Cr-1 if blank (empty) boxes are allowed.

(c) Distribution of n distinct balls into r distinct boxes and order is not considered in the box =
rn, if blank (empty) boxes are allowed
And it is: = rn – rC1(r – 1)n + rC2(r – 2)n – rC3(r – 3)n +….. +(– 1)r-1 rCr-1,
if blank (empty) boxes are not allowed.

Illustration 27. (i) In how many ways 10 passengers can board three buses if no bus remains
empty?
(ii) In how many ways 10 green balls of same size can be placed in 3 distinct
boxes, if no box remains empty?

Solution: (i) The number of ways = 310  3C1 210 + 3C2 110
(ii) The number of ways = 101C31 = 9C2.

Use of Series:

(a) If there are n1 objects of one kind, n2 objects of second kind and so on n k objects of kth
kind; then the number of ways of choosing r objects out of these objects is
= coeff of xr in (1+x+x2+…..+ xn1 )(1+x+x2+……+ xn2 )…….(1+x+x2+……+ xnk )
(b) If at least one object of each kind is to be included in selection of (1) , then the number of
ways of choosing r objects is:
= coeff of xr in (x+x2+……+ xn1 )(x+x2+……+ xn2 )…… (x+x2+……+ xnk )
(c) The number of possible arrangements / permutations of p objects out of n 1 identical
objects of kind 1, n2 identical objects of kind 2 and so on is
 x2 xn1   x2 xnk 
= p!  coefficient of xp in the expansion  1  x   ...   ... 1  x   ...  .
 2! n1 !   2! nk ! 

Illustration 28. Find the number of permutations of 4 letters out of the letters of the word
ARRANGEMENT.

Solution: This is 4! times the coeff of x4 in

4
 x2 
  1  x   As there are 2A's, 2R's, 2E's, 2N's, 1G, 1M and 1T  .
3
 1  x 
 2! 
 17 
 4!.   30  24  4   1596 .
 2 

Exercise 6:
i) In how many ways can 10 identical blankets be given to 3 beggars such that each
receives at least one blanket?
ii) Find the number of ways in which an examiner can assign 30 marks to 8
questions, giving not less than 2 marks to any question.
RSM-78-P4-MA-PC 20

ANSWERS TO THE EXERCISES

Exercise 1.

i) 671 ii) 310  3C1 210  3C2  110

Exercise 2.

i) 1404000

ii)(a) 252 (b) 225

Exercise 3.

5
i) C3  20 C9  5 C4  20 C8  5 C5  20 C7 ii) 10
C2 – 10

 n! 
iii) n(n – 1)  
2

Exercise 4

7!  4!
i) 4 ii)
(2!)3  (3!)2

Exercise 5.

i) 18 ii) 21

Exercise 6.

21
i) 36 ii) C7
21 RSM-78-P4-MA-PC

FORMULAE AND CONCEPTS AT A GLANCE

PERMUTATIONS:

 Without Repetition: arranging n objects, taken r at a time is equivalent to filling r places

from n things.
n! n
 n  r  ! = Pr
 The number of arrangements of n different objects taken all at a time = npn = n!
 With Repetition: The number of permutations (arrangements) of n different objects,
taken r at a time, when each object may occur once, twice, thrice …. upto r times in
any arrangement
= (n)r
 The number of arrangements that can be formed using n objects out of which p are
identical (and of one kind), q are identical (and of another kind), r are identical (and of
n!
another kind) and the rest are distinct is .
p! q!r !

Circular Permutations:
n!
The total number of circular arrangements of n persons is = (n – 1)!.
n
 If no distinction is made between the clockwise and the anti-clockwise arrangements of n
1
different objects around a circle, then the number of arrangements is (n – 1)!
2
COMBINATIONS

Meaning of combination is selection of objects.

Selection of Objects without Repetition
The number of selections (combinations or groups) that can be formed from n different
n n!
objects taken r (0  r  n) at a time is Cr  .
r! n  r !

Restricted Selection / Arrangement

 The number of ways in which r objects can be selected from n different objects if k
particular objects are
(i) always included = n-k Cr-k
(ii) never included = n-k Cr
 The number of arrangements of n distinct objects taken r at a time so that k particular
objects are
(i) always included = n-k Cr-k .r!
(ii) never included = n-k Cr .r!
 The number of combinations of n objects, of which p are identical, taken r at a time is
= n-pCr + n-pCr-1 + n-pCr-2+ … + n-pC0 if r  p and it is:
= n-pCr + n-pCr-1 + n-pCr -2+ …+ n-pCr-p if r > p
RSM-78-P4-MA-PC 22

ALL POSSIBLE SELECTIONS

Selection from Distinct Objects
The number of selections from n different objects, taken at least one
= nC1 + nC2 + nC3 + … + nCn = 2n – 1.
Selection from Identical Objects
 The number of selections of r objects out of n identical objects is 1.
 Total number of selections of zero or more objects from n identical objects is n + 1.
 The total number of selections of at least one out of a 1+a2+a3+…. +an objects, where
a1 are alike (of one kind ), a2 are alike (of second kind ) and so on …. a n are alike (of
nth kind ), is [(a1+1)(a2+1)(a3+1) … (an+1)] – 1.

Selection when both Identical and Distinct Objects are Present

The number of selections taking at least one out of a 1+a2+a3+….+an+k objects, where a1 are
alike (of one kind), a2 are alike (of second kind) and so on … a n are alike (of nth kind), and k
are distinct = [(a1+1)(a2+1)(a3+1) … (an+ 1)] 2k – 1.

Division and Distribution of Objects

(with fixed number of objects in each group)

Into groups of unequal size (different number of objects in each group)

 The number of ways in which n distinct objects can be divided into r unequal groups
containing a1 objects in the 1st group, a2 objects in the second group and so on
n na n a a a n!
= Ca1 . 1 Ca2 . 1 2 Ca3 . r Car =
a1 ! a2 ! a3 !  ar !.
Here a1+a2+a3+ ….+ar = n.
 The number of ways in which n distinct objects can be distributed among r persons such
that first person gets a1 objects, 2nd person gets a2 objects … , rth person gets ar objects =
n!r !
.
a1 ! a2 ! a3 ! ar !

Into groups of equal size (each group containing same number of objects)

 The number of ways in which mn distinct objects can be divided equally into n groups
(mn)!
(unmarked) =
(m!)n n!
 The number of ways in which m n different objects can be distributed equally among n
persons (or numbered groups) = (number of ways of dividing into groups)  (number of
(mn)!n! (mn)!
groups)! =  .
(m!)n n! (m!)n

MULTINOMIAL THEOREM
Let x1, x2,...,xm be integers. Then the number of solutions to the equation
x1 + x2 + ... + xm = n ... (1)
23 RSM-78-P4-MA-PC

subject to the condition a1  x1  b1, a2  x2  b2, ..., am  xm  bm ... (2)

is equal to the coefficient of xn in
x a1
 x a1 1  ...  xb1 x a2
 
 x a2 1  ...  xb2 ... x am  x am 1  ...  x bm  ... (3)
This is because the number of ways, in which the sum of m integers in (1) equals n, is the
same as the number of times xn comes in (3).
Note:
 We use the result that the coefficient of xr in the expansion of (1  x)-n = n+r-1Cr

Different Cases of Multinomial Theorem

Case I: If the upper limit of a variable is more than or equal to the sum required and lower
limit of all the variables are non-negative, then the upper limit of that variable can be taken
as infinite.
Case II: When coefficients of variables are not unity
The number of solutions of ax1 +bx2 +cx3 = n
Subject to the condition a1  x1  b1 , a2  x2  b2 , a3  x3  b3
Is coefficient of tn in

 
 a a1
               
a1 1 b1   a2 a2 1 b2   a a3 1 b3 
 t  ta  ......  ta    tb  tb  ......  tb  t
c 3
 tc  ......  t c 
     
Case III: When variables are distinct
In such a case, we introduce some new variables to remove the condition of distinctness
Case – IV: When the required sum is not fixed
To find the number of solutions of the equation
x1 + x2 + … + xm  n . . . (1)
We introduce a dummy variable xm+1 so that
x1 + x2 + … + xm+1 = n, xm+1  0 . . . . (2)
The number of solutions of (1) and (2) will be same.
RSM-78-P4-MA-PC 24

SOLVED PROBLEMS (SUBJECTIVE)

Prob 1. Let n1 = x1 x2 x3 and n2 = y1y2 y3 be two 3 digit numbers. How many pairs of n 1 and n2
can be formed so that n1 can be subtracted from n2 without borrowing.

Sol. Clearly n1 can be subtracted from n 2 without borrowing if y i ³ xi for i = 1, 2, 3. Let x i

= r, where r = 0 to 9 for i = 2 and 3
and r = 1 to 9 for i = 1.
Now as per our requirement yi = r, r +1,…. , 9.
Thus we have (10 – r) choices for yi.
Hence total ways of choosing yi and xi
2
 9  9 
     10  r    45.  55  .
2
= 10  r 
  
 r 1   r 0 

Prob 2. A colour box has 3 red colours of different shades, 2 white colours of different shades
and 7 green colours of different shades. In how many ways can 3 colours be taken
from the box if at least one of them is red?

Sol. We have got 3 red colours, 2 white colours and 7 green colours.
There are 3 ways to take 3 colours from the box.
(1) 1red 2 other
(1) 2red 1 other
(1) 3red 0 other
(1) Number of ways to choose 1red = 3C1
Number. of ways to choose 2 others = 9C2
(2) No. of ways to choose 2red = 3C2
No. of ways to choose 1 others = 9C1
(3) No. of ways to choose 3 red = 3C3
No. of ways to choose 0 others = 9C0
Hence the total number of ways is 3C1 x 9C2 + 3C2 x9C1 + 3C3 x9C0 .

Prob 3. In how many ways can the letters of the word CONCUBINE be arranged so that (a)
the C's are never together (b) C's are always together.

Sol. (a) Ignoring the C's we have the letter ONUBINE

No. of ways to arrange these is 7!/2!, since there are two Ns here.
Also, since the C's don't have to be together, we have the following arrangements:
X O X N X U X B X I X N X E X.
"C" can take the place of any of the positions marked X. Since, the number of such X
positions is 8 and there are 2 C's, the number of ways we can select them is 8C2.
Hence the total number of ways is (7!/2!) 8C2.
(b) When the C's are together, we consider them as 1 combined unit, say CC. Thus,
we have CC, O, U, B, I, N, E, N.
Number of ways we can arrange them is 8!/2! since there are 2 N’s again.
25 RSM-78-P4-MA-PC

Prob 4. Let Ai, i = 1, 2, 3, ……., 21 be the vertices of a 21-sided regular polygon inscribed in a
circle with centre O. Triangles are formed by joining the vertices of the 21-sided
polygon. How many of them are
(i) equilateral triangles, (ii) isosceles triangles.

Sol. (i) A triangle Ai, Aj, Ak (vertices) is equilateral if Ai, Aj, Ak are equally spaced. Out of A1,
A2, …., A21 we have only 7 such triplets.
A1A8A15, A2A9A16, ……….., A7A14A21. Therefore there are only 7 equilateral triangles.
(ii) Consider the diameter A1OB where B is the point where A 1O meets the circle. If we
have an isosceles triangle A1 as its vertex then A1B is the altitude and the base is
bisected by A1B. This means that the other two vertices, A j and Ak, are equally spaced
from B. We have 10 such pairs, so we have 10 isosceles triangle with A 1 as vertex of
which is equilateral.
Because proper isosceles triangle with A 1 as vertex (non-equilateral) are 9, with each
vertex Ai, i = 1, 2, ….., 21, we have such isosceles triangles.
So, total number of isosceles but non-equilateral triangles are 9 ´ 21 = 189.
But the 7 equilateral triangles are also to be considered as isosceles.
Hence total number of isosceles triangle are 196.

Prob 5. If out of 3n letters there are n As, n Bs and n Cs, show that the number of ways of
selecting r letters out of these is the same as the number of ways of selecting 3n –r
letters out of them. If n<r < 2n + 1, show that the number of ways selecting r letters is
1
given by (n+1)(n+2)+(r–n)(2n –r) and that the maximum number of such selections
2
1 3
is {3  n + 1  + 1} or  n + 1  according as n is even or odd.
2 2
4 4

Sol. Every time we select a total of ‘r’ letters, we are obviously left with (3n - r) letters.
Thus number of ways of selecting ‘r’ letters is simply equal to the number of ways of
selecting (3n – r) letters.
Let us assume that in the selection of ‘r’ letters we have x 1 As, x2 Bs and x3 Cs.
Þ x1 + x2 + x3 = r …. (1)
where 0 £ xi £ n and  i Î {1, 2, 3}
That means we have to just find the total number of non-negative integral solutions of
(1).
And this number is simply equal to the coefficient of xr in (1 + x + x2 + …. + xn)3
Þ x
r
(1  xn 1 )3 (1  x)3

Þ x
r
(1  3. xn 1  3.x 2n  2  x 3n 3 ) (1  x)3
Now, if 0 £ r £ n
(r  1) (r  2)
Required coefficient = x
r
(1  x)3 r  2 Cr  r  2 C2 =
2
If n  1  r  2n  1 ,
Required coefficient = x
r
(1  3.xn 1 ) (1  x)3
r 2 r n 1 r 2
= Cr 3. Cr n1 = C2  3 .r n1 C2
RSM-78-P4-MA-PC 26

(r  2) (r  1) 3(r  n  1) (r  n)
= 
2 2
Finally if 2n  2  r  3n , required coefficient
= x
r
(1  3.xn 1  3.x2n  2 ) (1  x)3 = r 2
C2  3. r n 1
C2 3. r  2n
Cr 2n 2
r 2 r n 1 r  2n
= C2  3 . C2  3 . C2
If rÎ (n, 2n +1) . Number of ways
2 2
1
I=  n  1  n  2    r  n   2n  r  = 1  n  1  n  2   n   r  3n 
2 2 4  2 
If n is even, I is maximum for r = 3n/2
1
Imax =  n  1  n  2  
2
n2
4

1
4

3  n  1  1
2

If n is odd, minimum value of (r – 3n/2)2 = 1/4
1 n2 1 3
Þ Imax =  n  1  n  2      n  1 .
2
2 4 4 4

Prob 6. Let S = {a1, a2, ….., a12}. Find the total number of sets which contain one or more of
the elements of set S (including the possibility of using all the elements of S) so that
the element in a specific set must be an integral multiple of the smallest number in the
set. Also generalise the result.

Sol. When the smallest number in the set is 1.

There are 11 elements other than 1. So the set with ‘a’ are, alone with one other
element, 2 other element,…… and with all the 11 other elements, that is we have to
choose a1 and 0, 1, 2, ……, 11 other elements 2, 3, ….., 12.
This could be done in n (S1) = 11C0 + 11C1 + 11C2 + ……. + 11C11= 211 ways.
If a set contain 2 as the smallest numbers, then besides 2, the set can have 4, 6, 8,
10, 12 other elements, none or one or more of them.
This could be done in n (S2) = 5C0 + 5C1 + 5C2 + 5C3 + 5C4 + 5C5 = 25 ways.
Similarly if a set contain 3, 4, 5 and 6 as the smallest element
n (S3) = 23, n (S4) = 22, n (S5) = 21, n (S6) = 21
for 7, 8, 9, 10, 11 and 12, there is just one subset. This is total upto 6.
So, the total number of acceptable set according to the candidate is
211 + 25 + 23 + 22 + 21 + 21 + 6 = 2102
If there are n elements in the set 1, 2, 3, ……, n then there
n multiples of 1
n 
 2  multiples of 2
 
n 
 3  multiples of 3
 
:
:
n 
 n  multiples of n
 
So total number of sets is given by
2n – 1 + 2[n/2] – 1 + 2[n/3] – 1 +……..+ 2[n/n] – 1.
27 RSM-78-P4-MA-PC

Prob 7. A and B are six digits numbers total numbers of ways of forming A and B so that
(i) these numbers can be added without carrying at any stage,
(ii) n2 can be subtracted from n1 without borrowing at any stage,
is equal to

Sol. A and B can be added without carrying at any stage if x i + yi £ 9

for position 6
x1 x2 x3 x4 x5 x6
y1 y2 y3 y4 y5 y6
x6 = 0, 1, 2, 3, …., 9 Þ y6 £ 9 – r
Þ y6 = 0, 1, 2, …., 9 – r
i.e. y6 can be selected in (10 – r) ways.
Hence total number of ways selecting x6 and y6 suitable
9
=  (10  r) = 10 + 9 + 8 + 7 + ….. + 1 = 55.
r 0

Similarly total number of ways selection (x 5, y5), (x4, y4), (x3, y3), (x2, y2), will
be 55.
For position 1 (x1, y1 ¹ 0)
x1 = r = 1, 2, 3, ….., 9
Þ y1 £ 9 – r
Þ y1 = 1, 2, 3, ….., 9 – r i.e. y1 can be selected in 9 – r ways
8
hence total number of ways of selecting x1 and y1 suitable =  (9  r)
r 1
= 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 36.
Thus total ways = 36 ´ (55)5.
(ii) B can be subtracted from A without borrowing at any stage if x i ³ yj
for position 6
Let x6= r (r = 0, 1, 2, ….., 9)
Þ y6 £ r Þ y6 = 0, 1, 2, ….., r
That mean y6 can be selected in (r + 1) ways
9
Þ total number of ways selecting x6 and y6 suitable =  (r  1)
r 0

= 1 + 2 + ….. + 10 = 55
Similarly total number of ways of selecting (x 5, y5), (x4, y4), (x3, y3), (x2, y2) is 55.
For position 1.
Let x1 = r (r = 1, 2, 3, ….., 9)
Þ y1 £ r Þ y1 = 1, 2, 3, …., r that mean y1 can be selected in r ways.
9
Þ total number of ways of selecting x1, y1 suitable = r
r 1
= 1 + 2 + 3 + …… + 9 = 45.

Thus total ways = 45 ´ (55)5.

Prob 8. There are n straight lines in a plane, no two of which are parallel and no three of
which pass through the same point. How many additional lines can be generated by
means of points of intersections of the given lines.
RSM-78-P4-MA-PC 28

Sol. Let AB be any one of the n straight lines and let it be intersected by some other line
CD at point E.
Note that line AB contains (n – 1) such points. It follows that there are n (n – 1) such
points of intersection. Since each of the points of intersection occurs in two of the n
1
lines, the number of such points is n(n  1) . We shall now find the number of
2
additional lines passing through these points. The number of additional lines passing
through points of the type E is equal to the number of points lying outside the line AB
and CD, because a new line is obtained through E only if the other point lies outside
AB and CD. Since AB and CD each contain (n – 2) new points, the number of new
1 1
points outside AB and CD is n(n  1)   (n  2)  (n  2)  1  n(n  1)  (2n  3) .
2 2
1 1
Thus, the number of lines through E is n(n  1) ( (2n  3) . Since there are n(n  1)
2 2
1 1 
new points, the number of new lines is n(n  1)  n(n  1)  (2n  3)
2 2 
But in this way each line is counted twice. Therefore, the required number of lines is
1 1 1 
. n(n  1)  n(n  1)  (2n  3)
2 2 2 
1
8
 2
 1
= n(n  1) n  n  4n  6  n(n  1) (n  2) (n  3) .
8

Prob 9. (a) In how many ways can 7 men and 7 women be seated around a circular table so
that no two men/no two women sit next to each other ?
(b). Suppose that at a sports dinner we have 16 cricketers and 6 tennis players. In
how many ways can we seat them at a long table if (i) none of the tennis players is
seated next to another tennis player and (ii) all tennis players are seated together.
(c) There are 20 persons among whom two are brothers. Find the number of ways
in which we can arrange them around a circle so that there is exactly one person
between the two brothers.
(d) A tea party is arranged for 2m people along two sides of a long table with m
chairs on each side. r men wish to sit on one particular side and s on the other. In how
many ways can they be seated? (Assume that r, s £ m.)
(e) A family consists of a grandfather, m sons and daughters and 2n grandchildren.
They are to be seated in a row for dinner. The grandchildren wish to occupy the n
seats at each end and the grandfather refuses to have a grandchild on either side of
him. In how many ways can the family be made to sit?

Sol. (a). First arrange the 7 men in 6! ways. Then there M

M W W
are 7 places in between the men which will be
M
occupied by 7 women in 7!, ways. So total no. of W
ways = 6! ´ 7!
(b). (i) First, 16 cricketers can be seated in 16! ways. W W
There are 17 places in between them out of which 6 M M
have to be occupied by tennis players. W W
M
No. of ways = 17P6
29 RSM-78-P4-MA-PC

\ Required no. of ways = 16! ´ 17P6

(ii) All tennis players can be treated as one set. So now we have a total of 17 players.
Their no. of permutations = 17 !
Also 6 tennis players can be arranged in 6! ways.
No. of ways = 17 ! ´ 6!
(c) We can arrange 18 persons around a circle in (18 –1)! = 17! ways. Now, there are
exactly 18 places where we can arrange the two brothers. Also the two brothers can
be arranged in 2! ways. Thus, the number of ways of arranging the persons subject to
the given condition is (17!) (18) (2!) = 2(18!).
(d) We can arrange r persons on m chairs on a particular side in mPr ways and s
persons on m chairs on the other side in mPs ways. We can arrange (2m –r –s )
persons on the remaining (2m –r –s ) chairs in 2m –r –s P2m –r –s ways. Thus, the number
of ways of arranging the persons subject to the given conditions is
2(mPr) (mPs) (2m –r –s P2m –r –s).
(e) The total number of seats required at the table is 1 + m + 2n. The grand children
can occupy the n seats on either side of the table in ( 2nP2n) ways. The grandfather can
occupy a seat in m –1P1 ways. The remaining seats can be occupied in mPm ways.
Therefore, the required numbers of ways is
(2nP2n) (mPm) (m –1 P1) = (2n!) m! (m –1)

Prob 10. (i.) In how many ways two distinct numbers n 1 and n2 can be selected from the
set {1, 2, 3, …. , 100} so that 7 n1  3 n2 is a multiple of 5.

(ii). Show that the number of ways in which three numbers in arithmetical progression
1 1
can be selected from 1, 2, 3, …., n is  n  1 2 or n  n  2  , according as n is
4 4
odd or even.

Sol. (i). 7n1  3n2

71 = 7, 31 = 3
2 2
7 = 49, 3 =9
3
7 = 343, 33 = 27
7 = 2401, 34 = 81
4

that means 74l will always end with 1, 74l-1 ends with 3, 74l-2 ends with 9, 74l-3 ends
with 7. Similarly 3 41 will always end with 7, 34l–1 will end with 7, 34l–2 will end with 9,
34l–3 will end with 3.
Now a number is divisible by 5 it it’s end digit 0 or 5.
Þ 7n1  3n2 will be divisible by 5 if
n1 = 4l–3, n2= 4l–3
n2 = 4l–2, n2= 4l
n1 = 4l–1, n2 = 4l–1
n1 = 4l, n2 = 4l–2
Now let us write {1,2, ----100} as under
1 5 96, 4l–3 ––– R1
2 6 98, 4l–2 ––– R2
RSM-78-P4-MA-PC 30

3 7 99, 4l–1 ––– R3

4 8 100, 4l ––– R4
That means we select, 2 numbers from R1, one from R2, one from R4,; 2 from R3; one
from R4 and one from R2
Þ Total number of ways = 2 . 25 C2  25 C1 . 25 C1  2 .25 C2  25 C1.25 C1
25
= 4 . C2  25 . 25 = 1200+625 = 1825

(ii). Case 1:
n = odd = 2l+1, (say)
In this case numbers at our disposal are, 1, 2, 3, 4, …, (2l+1).
Clearly if we select any three numbers from these numbers so that these are in A.P.,
then least common difference is 1 and largest common difference of the A.P. is l.
Let the common differences of the selected A.P. is d (1 £ d £ l), then selected triplet
can be, (1, d+1, 2d+1), (2, d+2, 2d+2), ……, (2l+1-2d, 2l+1-d, 2l+1).
That means there are 2(l-d)+1 ways

  (  1)  (n  1)2
Þ   2(  d)  1  (2  1)
d1
2 
 2 

= 2 
4
Case 2:
n = even = 2l (say)
Clearly in this case least value of d=1 and maximum value to d=(l –1).
Let the common difference of selected A.P. is d (1 £ d £ l -1), then selected triplet
can be, (1, d + 1, 2d + 1), …, (2l –2d, 2l –d, 2l).
That mean there are 2(l – d) ways.
1
n n  n
Þ Total ways = 2  (  d) = 
d1
(  1) 
2  2
 1 
 4
(n  2) .
31 RSM-78-P4-MA-PC

SOLVED PROBLEMS (OBJECTIVE)

Prob 1. A is a set containing n elements. A subset P of A is chosen. The set A is

reconstructed by replacing the elements of P. A subset Q of A is again chosen. The
number of ways of choosing P and Q so that P ÇQ contains exactly one elements is
(A) 4n (B) 3n –1
n
(C) 3 (D) n3n –1

Sol. The number of ways choosing one element out of n is nC1. The remaining
(n –1) elements will not belong to P Ç Q in 3n –1 ways. Thus, the number of ways of
choosing P and Q so that P Ç Q contains exactly one elements is (n) (3n –1 ) = n . 3n –1 .
Hence (D) is the correct answer.

Prob 2. A set contains (2n + 1) elements. The number of subset of the set which contain at
most n elements is
(A) 2n (B) 2n + 1
n –1
(C) 2 (D) 22n

Sol. The number of subsets of the set which contain at most n elements is
2n1
C0  2n1 C1  2n1 C2  .........  2n 1 Cn  N (say)
we have 2N  2  2n1
C0  2n1 C1  2n1 C2  .........  2n1 Cn 
  2n1
C0  2n 1
C2n1   2n 1
C1  2n1

C2n  ....   2n 1
Cn  2n1
Cn 1 
 n
Cr n Cnr 
2n1
 C0 2n1 C1  2n 1 C2  .....  2n1 C2n1  22n1  N  22n
Hence (D) is the correct answer.

Prob 3. The number of ways of arranging six persons (having A, B, C and D among them) in a
row so that A, B, C and D are always in order ABCD (not necessarily together) is
(A) 4 (B) 10
(C) 30 (D) 720

Sol. The number of ways of arranging ABCD is 4!. For each arrangement of ABCD, the
6!
number of ways of arranging six persons is same. Hence required number is  30 .
4!
Hence (C) is the correct answer.

Prob 4. A teacher takes 3 children from her class to the zoo at a time as often as she can, but
she does not take the same three children to the zoo more than once. She finds
that she goes to the zoo 84 times more than a particular child goes to the zoo. The
number of children in her class is
(A) 12 (B) 10
(C) 60 (D) none of these
RSM-78-P4-MA-PC 32

Sol. The number of times the teacher goes to the zoo = nC3.
The number of times a particular child goes to the zoo = n-1C2.
From the question , nC3 – n-1C2 = 84.
Or (n -1)(n –2)(n –3) = 6 ´ 84 = 9´ 8 ´ 7
Þ n – 1 = 9 Þ n = 10 .
Hence (B) is the correct answer.

Prob 5. There are three coplanar parallel lines. If any p points are taken on each of the lines,
the maximum number of triangles with vertices at these points is
(A) 3p2( p-1) +1 (B) 3p2( p-1)
(C) p2( 4p –3) (D) none of these

Sol. The number of triangles with vertices on different lines = pC1 ´ PC1 ´pC1 = p3 .
The number of triangles with two vertices on one line and the third vertex on
p  p  1
any one of the other two lines = 3C1 {pC2 ´2pC1} = 6p.
2
3 2 2
so, the required number of triangles = p + 3p (p -1) = p ( 4p – 3)
Hence (C) is the correct answer.

Prob 6. The number of ways in which 9 identical balls can be placed in three identical boxes is
9!
(A) 55 (B)
( 3 !)4
9!
(C) (D) 12
( 3 !)3

Sol. If number of balls is a, b and c in different boxes, then a + b + c = 9

Number of solutions is 11C2 = 55.55 ways include those ways in this
(i) a, b, c are same (ii) two of a, b, c are equal
(iii) all a, b, c are distinct
Now a, b, c are same in exactly one way (a= b = c = 3). Also three are 12 ways out of
12
55 ways in which exactly two of a, b, c are same. These 12 will be counted as =4
3
ways (as 3,3,1:3, 1, 3 and 1, 3, 3 are same ways. Thus total number of required ways
is 1+4+7 = 12.
Hence (D) is the correct answer.

Prob 7. In a certain test, there are n questions. In this test 2 n-i students gave wrong answers to
atleast i question, where i = 1, 2, ..., n .If the total number of wrong answers given
is 2047, then n is equal to
(A) 10 (B) 11
(C) 12 (D) 13

Sol. The number of students answering exactly i ( 1£ i £ n-1) questions wrongly is

2n-i – 2n-i-1. The number of students answering all n questions wrongly is 2 0 . Thus, the
total number of wrong answers is
1(2n-1 – 2n-2) +2( 2n-2 – 2n-3) + . . . + ( n-1)( 21 - 20) +n(20)
33 RSM-78-P4-MA-PC

= 2n-1 + 2n-2 + 2n-3 + . . . + 20 = 2n – 1

Thus 2n –1 = 2047 Þ 2n = 2048 = 211 Þ n = 11 .
Hence (B) is the correct answer.

Prob 8. The number of zeroes at the end of (127)! is

(A) 31 (B) 30
(C) 0 (D) 10

127  127  127 

Sol. Number of zeroes =     = 25 + 5 + 1 = 31.
 5   25  125 
Hence (A) is the correct answer.

Prob 9. The number of solutions of x1+x2+x3 = 51 (x1,x2,x3 being odd natural numbers) is
(A) 300 (B) 325
(C) 330 (D) 350

Sol. Let odd natural numbers be 2a – 1, 2b-1, 2c-1

where a, b, c are natural numbers
2a – 1+ 2b-1+2c-1=51 Þ a + b + c = 27
a ³ 1, b ³ 1, c ³ 1 ….(1)
No. of solutions of (1) is coefficient of x24 in (1-x)-3 = 26C2 = 13 x 25 = 325
Hence (B) is the correct answer.

Prob 10. A is a set containing n elements. A subset P of A is chosen. The set A is

reconstructed by replacing the elements of P. A subset Q of A is again chosen. The
number of ways of chosen P and Q so that P Ç Q = f is
(A) 22n – 2nCn (B) 2n
(C) 2n – 1 (D) 3n

Sol. Let A = { a1, a2, a3, . . . , an} . For ai Î A, we have the following choices:
(i) ai Î P and aiÎQ (ii) ai Î P and aiÏQ
(iii) ai ÏP and aiÎQ (iv) ai Ï P and aiÏQ
Out of these only (ii) , (iii) and (iv) imply a i Ï P Ç Q. Therefore, the number of ways
in which none of a1, a2, . . .an belong to P Ç Q is 3n.
Hence (D) is the correct answer.

Prob 11. Triplet (x, y, z) is chosen from the set {1, 2, 3,.... n }, such that x £ y < z. The number
of such triplets is
n( n  1)( n  1)
(A) (B) nC3
2
(C) nC2 (D) nC2+ nC3

Sol. Any three numbers x, y, z from {1, 2, 3, . . . .} can be chosen in nC3 ways and we
get unique triplet ( x, y, z) , x< y < z . Again any two numbers x, z can be chosen
from {1, 2, 3, . . . , n } in nC2 ways and we get the triplet ( x, x, z) , x< z . Hence total
number of required triplets is nC2+ nC3 .
Hence (A), (D) are the correct answer.
RSM-78-P4-MA-PC 34

Prob 12. Let A be the set of 4-digit numbers a1a2a3a4 where a1> a2> a3> a4, then n(A) is equal
to
(A) 126 (B) 10C4
(C) 210 (D) none of these

Sol. Any selection of four digits from the ten digits 0, 1, 2, 3, . . . , 9 gives one such
number. So, the required number of numbers = 10C4 = 210 .
Hence (B), (C) are the correct answer.

Prob 13. The number of ways in which a mixed double game can be arranged amongst 9
married couples if no husband and wife play in the same game is
(A) 756 (B) 1512
(C) 2 . 9C27C2 (D) none of these

Sol. We can choose two men out of 9 in 9C2 ways. Since no husband and wife are to play
in the same game, two women out of the remaining 7 can be chosen in 7C2 ways. If
M1, M2, W1 and W2 are chosen, then a team may consist of M 1 and W1 or M1 and W2.
Thus the number of ways of arranging the game is
98 76
(9C2) (7C2)(2) =   2 = 1512.
2 2
Hence (B), (C) are the correct answer.

Prob 14. Number of even divisions of 504 is

(A) 12 (B) 24
(C) 6 3C2 (D) 18

Sol. 504 = 23 ´ 32 ´ 7.. Any even divisor of 504 is of the form 2 i ´ 3i ´ 7k, where I £ i£ 3, 0 £ j
£ 2, 0 £ k£ 1. Thus total number of even divisors is
3 ´3´ 2 = 18
Hence (C), (D) are the correct answer.

Prob 15. In a plane there are two families of lines y = x +r, y = -x +r, where r Î {0, 1, 2, 3, 4}.
The number of squares of diagonals of length 2 formed by the lines is
(A) 9 (B) 16
3 4
(C)  C2 (D) none of these
2

Sol. There are two sets of five parallel lines at equal m5

4
distances. Clearly, lines like l1, l3, m1, m3 form a m4
m3
squares whose diagonal’s length is 2 3 m2
m1
So, the number of required squares = 3´ 3 2
l5
{since choices are (l1, l3), l4
1
l3
(l2, l4), (l3, l5) for one set, etc)
l2
Hence (A), (C) are the correct answer. O l1
35 RSM-78-P4-MA-PC

ASSIGNMENT PROBLEMS (SUBJECTIVE)

Level - I

1. Eighteen guest have to be seated. Half on each side of a long table. Four particular guest
desire to sit on one particular side and three others on the other side. Deter mine the
number of ways in which seating arrangements can be made.

2. A train going from station A to station B has 10 stations in between as halts. Nine
persons enter the train during the journey with nine different tickets of the same class.
How many sorts of tickets they may have had.

3. There are two bags, each containing m balls, A person has to select an equal number of
balls from both the bags. Find the number of ways in which he can select at least one ball
from each bag.
4. Find the number of three -digit natural numbers having digits in increasing order from left
to right

5. How many 4-letter words can be formed using a, b, c, d and e

(i) without repetition,
(ii) with repetition.

6. Find the total number of six digit numbers x1x2x3x4x5x6 having the property
x1 < x2 £ x3 < x4 < x5 £ x6.

7. Find the number of natural numbers which are less than 2 ´ 108 and are divisible by 3 and
which can be written by means of the digits 0, 1, 2.

8. (a) In how many ways can we form 8-digit numbers from the digits 0, 1, 2, 3, 4, 5, 6, 7?
(Repetition not allowed)
(b) How many of these are even?
(c) How many of these are divisible by 25?
(d) How many of these are less than 20000?
(e) Find the number of integers greater than 7000 that can be formed with the digits 3,
5, 7, 8 and 9, no digit is being repeated.

9. A zoo has 25 zebras, 14 giraffes, 16 lions and 2 tigers. In how many ways can a tourist
visit these animals so that he must see at least one tiger.

10. In how many ways can the letters in the English alphabet be arranged, so that there are 7
letters between the letters a and b.
RSM-78-P4-MA-PC 36

Fill in the blanks (Q11–15):

11. We have 4 balls of different colours and 4 boxes with colours the same as those of the
balls. The number of ways in which the balls can be arranged in the boxes so that no ball
goes into a box of its own colour are _____________.

12. A mathematics paper has 12 questions divided into 3 sections. A,B,C, each having 4
questions. The number of ways in which you can answer 5 questions selecting at least
one question from each part are ____________.

13. Three integers are selected from the integers 1,2,..., 1000. The number of ways in which
these integers can be selected such that their sum is divisible by 4 are _____________.

14. If n distinct things are arranged in a circle, The number of ways selecting three of these
things so that no two of them are next to each other is ____________.

15. A test has 4 parts. The first 3 parts carry 10 marks each and the 4th part carries 20
marks. Assuming that marks are not given in fractions, the number of ways in which a
candidate can get 30 marks out of 50 are____________-.
37 RSM-78-P4-MA-PC

Level – II

1. Prove that the number of ways to select n-objects form 3n objects of which n-are identical
2n 1 1 2n!
and rest are different, is 2 
2 (n!)2

2. Find the number of odd integers between 30000 and 80000 in which no digit is repeated.

3. How many 3 letter words can be formed from the letters of the word CALCUTTA?

4. There are 5 mangoes and 4 apples. In how many ways can a selection of fruits be
made if
(i) fruits of the same kind are different,
(ii) fruits of the same kind are identical.

5. Find the number of whole numbers formed on the screen of a calculator which can read
upside down (i.e. can be recognized as numbers with unique (correct) digits). It is given
that greatest number that can be formed on the screen of the calculator is 99999999.

k  k  1
6. Let n and k be positive integers such that n  . Find the number of solutions
2
 x1, x 2 , x3 ,......xk  , x1  1, x 2  2,.....x k  k, all integers satisfying the condition
x1  x 2  x 3  ....  xk  n .

7. Find the number of numbers of six digits that can be formed with the digits 1, 2, 3, 4, if all
the digits are to appear in the same number at least once.

8. Three persons A, B, C invite 2n guest to a party. All the people sit around a round table
such that A, B, C have their fixed seats (there is at least one seat between any two fixed
seats) and two particulars guests doesn’t sit together. Find the number of ways in which
they can be seated.

9. A, B and C are the set of all the positive divisors of 10 60, 2050 and 3040 respectively. Find
n (A È B È C).

10. How many three digit numbers xyz with x, z < y can be formed.

11. A person wants to hold as many different parties as he can out of 24 friends, each party
consisting of the same number. How many should he invite at a time? In how many of
these would the same man be found ?

12. A box contains two white balls, three black balls 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 included in
the draw.
RSM-78-P4-MA-PC 38

13. Suppose a crew of 43 people are used to steer a ship. There are 3 among them who can
steer and we need only 1 person to steer. Out of the remaining 40 people, 8 can row only
on one side and 3 people can only row on the other side. How many ways can the crew
be arranged in so that there are 20 rowers on each side of the ship?

14. There were two women participating in a chess tournament. Every participant played two
games with every other participant. The number of games that men played between them
selves proved to exceed by 66, compared to the number of games the men played with
women. How many participants were there? How many games were played?

15. Mr. A has x children by his first wife and Ms. B has x + 1 children by her first husband.
They marry and have children of their own. The whole family has 10 children. Assuming
that two children of the same parents do not fight, find the maximum number of fights that
can take place among children.
39 RSM-78-P4-MA-PC

ASSIGNMENT PROBLEMS (OBJECTIVE)

Level - I

1. Number of different garlands using 3 flowers of one kind and 12 flowers of second kind is
(A) 19 (B) 11! ´ 2!
(C) 14C2 (D) none of these

2. Eight chairs are numbered from 1 to 8.Two women and 3 men wish to occupy one chair
each. First the women choose the chairs from am angst the chairs marked from 1 to 4,
then the men select the chairs from am angst the remaining, the number of possible
arrangement is.
(A) 6 C4 4 C4 (B) 4 P2 4 P3
4
(C) C3 6 P3 (D) 4 P2 6 P3

3. A parallelogram is cut by two sets of m lines parallel to the sides, the number of
parallelograms thus formed is.

(A)
m2
(B)  m  1 2
4 4

(C)  m  2 2
(D)  m  2  2  m  1 2
4 4

4. The number of flags with three strips in order, that can be formed using 2 identical red, 2
identical blue and 2 identical white strips is
(A) 24 (B) 20
(C) 90 (D) 8

5. The sides AB, BC, CA of a triangle ABC have 3, 4 and 5 interior points respectively on
them. The total number of triangles that can be constructed by using these points as
vertices is
(A) 220 (B) 204
(C) 205 (D) 195

6. The number of ways in which 4 letters of the word MATHEMATICS can be arranged is
given by
(A) 136 (B) 192
(C) 1680 (D) 2454.

7. In a group of boys, two boys are brothers and in this group 6 more boys are three. In how
many ways can they sit if the brothers are not to sit along with each other
(A) 2  6! (B) 7P2  6!
(C) 7C2  6! (D) None of these
RSM-78-P4-MA-PC 40

8. Seven women and seven men are to sit round a circular table such that there is a man on
either side of every woman, then the number of seating arrangements is
(A) (7!)2 (B) (6!)2
(C) 6!´ 7! (D) 7!

9. There are k different books and l copies of each in a college library. The number of ways
in which a student can make a selection of one or more books is
(A) (k+1)l (B) ( l+1)k
(C) (k+1)l -1 (D) (l +1)k-1

5
10. The value of the expression 47C4+ 
j 1
52  j
C3 is equal to

(A) 52C4 (B) 52C5

(C) 52C6 (D) none of these

11. Number of natural numbers < 2 .10 4 which can be formed with the digits 1, 2, 3 only is
equal to
35  2.34  3 35  2.3 4  3
(A) (B)
2 2
37  1
(C) (D) none of these
2

12. There are 10 lamps in a hall each one of them can be switched on independently. The
no of ways in which the hall can be illuminated is
(A) 102 (B) 1023
(C) 210 (D) 10!

13. The number of permutations of the letters of the word HINDUSTAN such that neither the
pattern ‘HIN’ nor ‘DUS’ nor ‘TAN’ appears, are
(A) 166674 (B) 169194
(C) 166680 (D) 181434

14. Nine hundred distinct N-digit numbers are to be formed by using 6, 8 and 9 only. The
smallest value of N for which this is possible, is
(A) 6 (B) 7
(C) 8 (D) 9

15. The number of 3 digit odd numbers that can be formed using the digits 1, 2, 3, 4, 5, 6
when the repetition is allowed is.
(A) 60 (B) 108
(C) 36 (D) 3

16. Consider a set P consisting of n elements. A sub set ‘A’ of P is chosen thereafter set ‘P’
is reconstructed and finally another sub set ‘B’ is chosen from P. The number of ways of
choosing ‘A’ and ‘B’ such that (AÈB)ÌP is ;
(A) 4n (B) 4n –3n
(C) 4n –2n (D) None of these
41 RSM-78-P4-MA-PC

17. If 56Pr+6 : 54Pr+3= 30800 :1, then the value of r is

(A) 40 (B) 41
(C) 42 (D) none of these

m
18. 
r 0
n r
Cn is equal to

(A) n+m+1Cn+1 (B) n+m+2Cn

(C) n+m+3Cn-1 (D) none of these

19. Everybody in a room shakes hand with everybody else. The total number of hand shakes
is 153. The total number of persons in the room is
(A) 16 (B) 17
(C) 18 (D) 19

20. Along a railway line there are 20 stations. The number of different tickets required in
order so that it may be possible to travel from every station to every station is
(A) 380 (B) 225
(C) 196 (D) 105

n
21. Cr  2 n Cr 1 n Cr  2 is equal to (2 ≤ r ≤ n)
n1
(A) 2 n Cr  2 (B) Cr 1
n 2
(C) Cr  2 (D) None of these

22. How many different nine digit numbers can be formed from the number 223344888 by
rearranging its digits so that odd digits occupy even places
(A) 16 (B) 36
(C) 60 (D) 180

p
23. The number of rational numbers , where p, q Î {1, 2, 3, 4, 5, 6,} is
q
(A) 23 (B) 32
(C) 36 (D) none of these

24. The number of ordered pairs (m, n) (m, n Î {1, 2, …., 20} ) such that 3 m + 7n is a multiple
of 10, is
(A) 100 (B) 200
(C) 4! ´ 4! (D) none of these

25. The number of arrangement of the letters of the word ‘BANANA’ in which two N’ and do
not appear adjacently is
(A) 40 (B) 60
(C) 80 (D) 100
RSM-78-P4-MA-PC 42

26. The number of positive integral solutions of the equation x 1 x2 x3 = 60 is

(A) 54 (B) 27
(C) 81 (D) None of these.

27. The number of permutations of the letters a, b, c, d, e, f, g such that neither the pattern
‘beg’ nor the pattern ‘cad’ appears is
(A) 4106 (B) 4806
(C) 4776 (D) 5120

28. The number of non-negative integral solutions of x1 + x2 + x3 + 4x4 = 20 is

(A) 236 (B) 336
(C) 436 (D) 536

29. The number of ordered triplets of positive integers which are solutions of the equation x +
y + z = 100 is
(A) 5081 (B) 6005
(C) 4851 (D) none of these.

30. The number of numbers less than 1000 that can be formed out of the digits 0, 1, 2, 3, 4,
and 5, no digit being repeated, is
(A) 130 (B) 131
(C) 156 (D) none of these.

31. Let (0, 0), (21, 0) and (0, 21) be the vertices of a triangle. The number of points having
integral co-ordinates which are strictly inside the given triangle are
(A) 231 (B) 105
(C) 190 (D) 133

32. The sum of the digits in the unit place of all the numbers formed with the help of 3, 4, 5, 6
taken all at a time is.
(A) 18 (B) 108
(C) 432 (D) 144.

33. ‘m’ men and ‘n’ women are to be seated in a row so that no two women sit together. If m>
n, then the number of ways in which they can be seated is
m !n ! m ! (m  1) !
(A) (B)
 m  n !  m  n  1 !
m ! m !
(C) (C) none of these
 m  n  1 !

34. The total number of all proper factors of 75600 is

(A) 120 (B) 119
(C) 118 (D) none of these
43 RSM-78-P4-MA-PC

35. The number of ways in which a batsman can score 14 runs in 6 balls not scoring more
than 4 runs in any ball is
(A) 19C5 - 6.14C5 + 15.9C5 (B) 19C5 + 6.14C5 - 15.9C5
(C) 386 (D) 286

36. How many six digits numbers can be formed in decimal system in which every
succeeding digit is greater than its preceding digit
(A) 9P6 (B) 10P6
9
(C) C3 (D) none of these

37. There are n numbered seats around a round table. In how many ways can m (< n)
persons sit around the round table
(A) nCm.m! (B) nCm.(m –1)!
n
Cm .(m-1)!
(C) (D) none of these
2

38. The number of n-digit numbers which contain the digits 2 and 7, but not the digits 0, 1, 8,
9 is
(A) 2n + 2n/2 - 2n/4 (B) 6n - 2.5n + 4n
n n n
(C) 6 - 2.4 + 5 (D) 6n - 2.4n + 5n

39. The number of n-digit numbers, no two consecutive digits being the same, is
(A) n! (B) 9!
(C) 9n (D) n9

40. The number of divisors of 3630, which have a remainder of 1 when divided by 4, is
(A) 12 (B) 6
(C) 4 (D) none of these.

41. Total number of ways of factorising the number of 676 in to two factors, that are prime to
each other is equal to
(A) 2 (B) 4
(C) 1 (D) none of these

42. There are 10 greetings cards, each of a different colour and 10 envelopes of the same
ten colours. The number of ways in which the cards can go to the envelopes such that
exactly 6 cards go into the envelopes of the corresponding colour is
(A) 2520 (B) 151200
(C) 1890 (D) none of these
43. The number of selections of n things from three piles, one consisting of n identical things
of one type, second consisting of n identical things of second type and third consisting of
n different things, is equal to
(A) n.2n (B) (n+2)2n– 1
n– 1
(C) n2 (D) none of these

44. A seven digit number made up of all distinct digits 8, 7, 6, 4, 2 , x and y is divisible by 3.
Then possible number of order pair (x, y) is
(A) 4 (B) 8
(C) 2 (D) none of these
RSM-78-P4-MA-PC 44

45. The number of integers between 1 and 1000 having their sum of digits equal to 12 is
(A) 405 (B) 410
(C) 415 (D) 420

46. Number of positive unequal integral solution of the equation x + y + z = 6 is

(A) 4 ! (B) 3 !
(C) 5 ! (D) 2 ´ 4 !

47. The number of six digit numbers can be formed by using the digits 1, 2, 3, 4, 5, 6 and 7
so that digits are not repeat and the terminal digits are even is
(A) 120 (B) 240
(C) 360 (D) 720

48. The number of ordered pairs (m, n) (m, n Î {1, 2,…, 20} ) such that 3m + 7n is a multiple
of 10, is
(A) 100 (B) 200
(C) 4! ´ 4! (D) none of these

49. Number of divisors of N = 22 . 33 . 53 . 75 of the form 4n + 2, n Î N is

(A) 96 (B) 97
(C) 95 (D) none of these

50. Let n1 and n2 be any two three digit numbers total number of pairs of n 1 and n2 so that n1
and n2 can be added with out carrying is equal to;
(A) 36 . 552 (B) 45 . 552
(C) 553 (D) none of these

51. Let N be any five digit number say y1y2y3y4y5, then maximum value of
N
is equal to
y1  y 2  y 3  y 4  y 5
11111
(A) (B) 10000
5
(C) 8000 (D) none of these

52. A chess board having n´n square, the ratio of total number of rectangles formed and total
number of squares formed is 10 : 3 then n is equal to
(A) 2 (B) 3
(C) 4 (D) 5

53. If the number of ways of selecting k coupons out of an unlimited number of coupons
bearing the letters A, T, M so that they cannot be used to spell to the used MAT is 93,
then k equals to
(A) 3 (B) 5
(C) 7 (D) none of these

54. The total number of different n-digit numbers that can be formed using the digits 1, 2 and
3 with the condition that the digit 2 occurs exactly twice in each number is
(A) n(n - 1)2n-1 (B) n(n - 1)2n-2
n-3
(C) n(n - 1)2 (D) none of these

55. The number of integral solutions of x + y + z = 0 with x, y, z ³ -4 is

(A) 14C2 (B) 15C10
17
(C) C15 (D) 17C10
45 RSM-78-P4-MA-PC

Level – II

1. The number of subsets of a set containing n distinct elements is

(A) nP0 + nP1 + nP2 + … + nPn (B) nC0 + nC1 + nC2 + … + nCn
n
(C) 2 (D) none of these

2. The number of all 5 digited numbers which can formed by using the digits 0, 1, 2, 3, 4, 5;
no digit being repeated in any number and which are divisible by 3 is
(A) 5! + 4. 4! (B) 5!
(C) 4. 4! (D) 216

3. The number of ways of arranging n ( > 2) distinct objects in a line so that two particulars
objects are never together is
(A) (n 2)! n1P2 (B) 2(n 1)!
(C) n!  2(n  1)! (D) none of these

4. The number of ways of selecting one or more objects from n distinct objects is
(A) nC1 + nC2 + … + nCn (B) nP1 + nP2 + … + nPn
(C) 2  1
n
(D) none of these

5. The number of diagonals of an n-sided convex polygon is

(A) nC2 (B) nC2  n
n  n  3
(C) (D) none of these
2

6. The number 24! Is divisible by

(A) 222 (B) 247
(C) 310 (D) 1210

7. If n is a positive integer and r is a whole number not exceeding n, then

n 1n
(A) nCr + nCr1 = n+1Cr (B) n+1Cr+1 = Cr
r 1
n
nr n Pr
(C) nCr+1 = Cr (D) n
 r!
r 1 Cr

2n
8. Cn is equal to
 2n  ! 2n
Pn
(A) (B)
n!n! n!
 n  1  n  2   n  3  ...  2n  1.3.5....  2n  1
(C) (D) .2n
n! n!

9. If nC4, nC5, nC6 are in AP, then a value of n is

(A) 7 (B) 21
(C) 14 (D) none of these
RSM-78-P4-MA-PC 46

10. A persons wants to invite one or more of his friend for a dinner party. In how many ways
can he do so if he has eight friends?
(A) 28 (B) 28  1
(C) 82 (D) 8C1 + 8C2 + … + 8C8

11. In an examination, a candidate is required to pass in all the four subjects he is studying.
The number of ways in which he can fail is
(A) 4P1 + 4P2 + 4P3 + 4P4 (B) 44  1
(C) 24  1 (D) 4C1 + 4C2 + 4C3 + 4C4

12. The number of diagonals of a convex polygon is 15 less than 4 times the number of its
sides. The number of sides of the polygon be
(A) 5 (B) 6
(C) 7 (D) 8

35
13. If Cn+7 = 35C4n2, then the value of n is
(A) 3 (B) 4
(C) 5 (D) 6

14. Let N denote the greatest number of points in which m straight lines and n circles
intersect. Then
(A) n divide (N  mC2) (B) m divides (N  nP2)
(C) N  mC2 is an even integer (D) N  mC2  nP2 is an even integer.

15. If n < p < 2n and p is prime and N = 2nCn, then

(A) p divides N (B) p does not divide N
(C) p2 divides N (D) p2 does not divide N

16. Let k denote the number of ways in n boys sit in a row such that three particular boys are
repeated. Then
(A) 3! Divides k (B) (n  2)! Divides k
(C) n2
C3 divides k (D) (n3)2 (n  4)2 divides k

17. 10 distinct balls are arranged in a row. The number of ways of selecting three of these
balls so that no two of them are next to each other is
1
(A) 8 76 (B) 8C3
6
(C) 7C3 + 7C2 (D) none of these

18. Let the exponent of 7 in 100C50 is t. Then t will be

(A) divisible by 7 (B) divisible 50
(C) divisible 100 (D) none of these
47 RSM-78-P4-MA-PC

19. Which of the following is true

(A) Number of combinations of the letters of word ‘PARALLEL’ taken four together is 22.
(B) The no. of different signals made by flying 5 different flags on 3 masts is 2520.
(C) No. of combination of n things taken r at a time, when each may be taken any
number of times is n+r1Cr.
(D) The number of ways in which 5 different books be distributed among 3 persons, if
each person is to have atlest one book is 150.

20. A class has 30 students. The following prizes are to be awarded to the students of this
class  first and second in Mathematics, first and second in Physics, first in Chemistry
and first in Biology. If N denote the number of ways in which this can be done, then
(A) N is divisible by 400 (B) N is divisible by 600
(C) N is divisible by 8100 (D) N is divisible by 4 distinct prime No.

21. A letter lock consists of three rings marked with 15 different letters. If N denotes the
number of ways in which it is possible to make unsuccessful attempts to open lock, then
(A) 482 dives N (B) N is product of 3 distinct prime No.
(C) N is product of 4 distinct prime No. (D) none of these

22. If n objects are arranged in a row, then the number of ways of selecting three of these
objects so that no two of them are next to each other is
 n  2  n  3  n  4
(A) (B) n2C3
6
(C) n3C3 + n3C2 (D) none of these

23. If n is a positive integers, the value of

E = (2n + 1) nC0 + (2n  1) nC1 + (2n  3)n C2 + … + 1. nCn is
(A) (n + 1) .2n (B) f(2) where f(x) = xn+1
n
(C) 3 (D) none of these

COMPREHENSIONS

Comprehension I:
Read the following passages and answer the following questions (1  3)

If 25 identical things be distributed among 5 persons then

1. The number of ways each receives atleast one is

(A) 24C4  5 (B) 24C4  5 13C4
(C) 24C4  5 13C4 (D) 24C4

2. The number of ways each receives odd number of things

(A) 14C4 (B) 15C4
16
(C) C4 (D) none of these

3. The number of ways each receives at least one thing but not more than eleven is
(A) 24C4  5 12C4 (B) 24C4  5
(C) C4  5 C4
24 13
(D) none of these
RSM-78-P4-MA-PC 48

Comprehension II:

Read the following passages and answer the following questions (4  5)

Let S = {1, 2, 3, …, n} be a set of first n natural number. A subset A of S is formed by choosing

the elements from the set S.
Suppose |A| represents cardinality of the set A and (min A) represents the least number among
the elements of the set A for eg. If A = {5, 6, 7, 10}, then (min A) = 5.

4. The greatest of (min A) which occur in any of the subsets A under the condition that
|A| = r, 1  r  n; is
(A) r (B) n  r
(C) n r + 1 (D) r + 1

5. The number of subsets A with cardinality r and (min A) = k is

(A) nkCr1 (B) nCr1
nk+1
(C) Cr1 (D) k. nkCr1

Comprehension III:

Read the following passages and answer the following questions (6  8)

Let N = p11 p2 2    pnn be a natural number where p i (1 £ i £ n) is a prime number. The total
number of divisors of N is (a1 + 1)(a2 + 1)…(an + 1). The sum of all divisors is
 p1 1  1  p2 1  1   pn 1  1
 1  2   n  . The number of ways in which N can be resolved in two
 p1  1  p2  1   pn  1 
    
(1  1)( 2  1)    (n  1)  1 (  1)( 2  1)    (n  1)
factors is or 1 as N is a perfect square or not.
2 2
Number of ways of resolving N in two coprime factors is 2n-1.

6. The number of ways in which 420 can be factorised in two non coprime factors is
(A) 24 (B) 8
(C) 12 (D) 4

7. The number of positive integral solution of x1x2x3x4 = 420 is

(A) 420 (B) 240
(C) 640 (D) none of these

8. The sum of all the even divisors of 420 is

(A) 860 (B) 192
(C) 1344 (D) 1152

Comprehension IV:

Read the following passages and answer the following questions (9  11)

One of the most important techniques of counting is the principle of exclusion and inclusion. Let
A1, A2, … , Am be m sets and n(Ai) represents the cardinality of the set A i (the number of elements
in the set Ai), then according to the principle of exclusion and inclusion
49 RSM-78-P4-MA-PC

n(A1ÈA2È…ÈAm)
m
=  n(A )   n(A
i1
i
i j
i  Aj )   n(A
i jk
i  A j  A k )    ( 1)m1n(A1  A 2    A m )

In particular, if A, B, C are three sets, then

n(AÈBÈC) = n(A) + n(B) + n(C) - n(AÇB) - n(BÇC) - n(CÇA) + n(AÇBÇC).
Principle of exclusion and inclusion must be applied whenever there is a chance of repeated
counting of some of the samples.

9. The number of numbers from 1 to 100, which are neither divisible by 3 nor by 5 nor by 7
is
(A) 67 (B) 55
(C) 45 (D) 33

10. A six letters word is formed using the letters of the word ALMIGHTY with or without
repetition. The number of words that contain exactly three different letters is
(A) 15600 (B) 30240
(C) 8 P6  8P3 (D) none of these

11. The number of natural numbers less than or equal to 2985984, which are neither perfect
squares nor perfect cubes is
(A) 2984124 (B) 2984244
(C) 2959595 (D) none of these

MATCH THE FOLLOWING

1. Match the following:
List I List - II
(A) Number of integral solutions of x + y + z = 1, x ³ – 4, y ³ – 4, (i) 132
z ³ – 4, is

4  1 
12 (ii) 99
(B). Greatest term in the expansion of 1   is
3 2 2
99
aiai1 (iii) 105
(C). If a1, a2, a3, …, a100 are in H.P. then value of a a
i 1 1 100
is

(D). If 8 points out of 11 points are in same straight line then (iv) 109
number of triangles formed is

2. Match the following:

List – I List - II
(A). If x, y, z Î N then number of ordered triplet (x, y, z) (i) 19
satisfying xyz = 243 is
(B). The number of terms in the expansion of (x + y + z) 6 is (ii) 28
(C). If x Î N, then number of solutions of x + x – 400 £ 0 is
2
(iii) 21
(D). If x, y, z Î N, then number of solution of x + y + z = 10 (iv) 36
RSM-78-P4-MA-PC 50

ANSWERS TO ASSIGNMENT PROBLEMS (SUBJECTIVE)

Level - I

1 11
C5  (9!)2 2. 55
C9
3. 84
n2  n  2
4(i). (ii). n2 – n + 2
2
5.(i) 120 (ii) 625
n
6. 11
C6 7. 
r 1
2n
Cnr

8(a). 7  7! (b). 7! + 18  6!
(c). 10  5! (d). 2661
(e). 190
9. 3  255 10. 18  2  24!
11. 9 12. 624
1
13. 41541750 14. n  n  4  n  5
6
15. 1111

Level – II

2. 7392
3(i). 7 (ii). 196
4(i). 24 (ii). 29
k(k  1)
5. 6  77 + 1 6. m+k1
Ck1, where m=n
2
7. 46  4C1 36 + 4C2 26  4C3 8. (4n2 – 6n + 6)(2n – 2)!
9. 73001 10. 240
23
11. C11
3
12. 64 ways 13. C1 . 29C12 . 17C17 . 20! . 20!
14. 156 15. 33
51 RSM-78-P4-MA-PC

ANSWERS TO ASSIGNMENT PROBLEMS (OBJECTIVE)

Level - I

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

Level – II

1. B, C 2. A, D 3. A, C 4. A, C
5. B, C 6. A, B, C, D 7. A, B, C, D 8. A, B, C, D
9. A, C 10. B, D 11. C, D 12. A, B
13. A, D 14. A, C, D 15. A, D 16. A, B, C, D
17. A, B, C 18. A, B, C 19. A, B, C, D 20. A, B, C, D
21. A, B 22. A, B, C 23. A, B

ANSWERS TO COMPREHENSION

1. D 2. A 3. C
4. C 5. D 6. D
7. C 8. D 9. C
10. B 11. A

ANSWERS TO MATCH THE FOLLOWING

1. (A) (iii) (B) (i) (C) (ii) (D) (iv)

2. (A) (iii) (B) (ii) (C) (i) (D) (iv)