Page 1 of 69

Percentile Classes
Permutation and Combination
Table of Content

Theory……………………………………..….02
Exercise 01 : Combination….....…….09
Exercise 02 : Permutation……..……..16
Exercise 03 : P n C ……….……..……….23
Exercise 04 : Advance Level………….26
Exercise 05 : Short Answers………….30
Exercise 06 : Extra Questions ……….53
Exercise 07 : OLD is GOLD 15……62

[Type here] [Type here]

 Page 2 of 69

Permutation and Combination

Fundamental Principle of Counting
(i) Multiplication: If one operation can be performed in W ways and corresponding to
each way of performing the first operation a second operation can be performed in n
ways, then the two operations together can be performed in m x n ways.

If after two operations are performed in any one of the m x n ways a third operation can
be performed in p ways, then the three operations together can be performed in m x n x p
ways and so on.
In general if there are n jobs (works/operations) j1, j2 j3 ……jn such that ji can be
performed to dependently in m1 ways. (𝑖 = 1,2,3,..n). Then the total number of ways in
which all the jobs can be performed is m1 x m2 x w3 x...x mn.

Here the different jobs/operations are mutually inclusive. It implies that all the jobs are
being done in succession. In this case we use the word 'and' to complete the all stages of
operation and the meaning of 'and' is multiplication.
e.g., A student has to select a letter from vowels and another letter from consonants, then
in how many ways can he make this selection?

(ii) Addition: If there are two jobs such that they can be performed independently in m
and n ways respectively, then either of the two jobs can be performed in (m + n) ways.

In general if there are various jobs which are mutually exclusive, then they can be
performed in m1 +m2 +m3 +...+ mn ways.
In this case we use the word 'or' between various jobs and the meaning of 'or' is
addition.
e.g. A student has to select a letter either from vowels 'or' from consonants, then in
how many ways can he make this selection?

Permutation
Each of the different “arrangements” that can be made out of a given number of things by
taking some or all of them at a time is called “permutation”.

Thus the permutations of three letters (say) a, b, c taken two at a time are
ab, ba, bc, cb, ac, ca

Therefore the number of permutations of three different things taken two at a time in 3P2
=6
𝑛!
• Permutations of n different things taken r at a time = nPr = (𝑛−𝑟)!
• Permutations of n different things taken all at a time nPn = n!
[Type here] [Type here]
 Page 3 of 69

• Permutations of n different things taken r at a time, when a particular things always

occurs = r .(n-1)P(r-1)
• Permutations of n different things taken r at a time when a particular thing never
occurs = (n-1)P(r)

Permutations of n things not all different:

• Number of permutations of n things, take all at a time, of which p are alike of one
kind, q are alike of second kind , r are alike of third kind and rest are different
𝑛!
=
𝑝!𝑞!𝑟!

• Number of permutations of n things, of which P1 are alike of one kind, P2 are alike of
second kind, P3 are alike of third kind ….Pr are alike of rth kind such that
𝑛!
𝑃1 + 𝑃2 + 𝑃3 + …. + 𝑃𝑟 = n is
𝑃1 ! 𝑃2 ! 𝑃3 !…𝑃𝑟 !

Permutations where repetitions are allowed

• The number of permutations of n different thing taken r at a time, when each may be
repeated any number of times in each arrangement is ‘n’.

Circular permutations:
In the previous articles we have learned linear permutations, Now we have to know
about circular permutations, in circular permutation things are to be arranged in the
form of a ring or a circle, e.g., arrangements of persons around circular dinning table,
conferencing table, garland etc,
Since in the circular permutation there is no any each point i.e, we can not say which
one is the beginning article or ending article in the possible arrangements.
𝑛!
Hence the number of circular permutations of n objects = = (n-1)!
𝑛
Thus in a circular permutation one thing is kept fixed and the remaining (n-1) things
are arranged in (n-1) ways.
• If the clockwise and counter clockwise orders are not distinguishable, then the
1
number of ways = {(n-1)!}
2

Combination:
Let A, B, C be three letters, then we can combine any two of them in the following ways:

AB, BC, AC
Similarly if A, B, C, D are four letters, then we can combine any two of them in the
following manner:
AB, AC, AD, BC, BD, CD
Similarly we can combine any 3 of A, B, C, D as:
ACB, ABD, ACD, BCD
[Type here] [Type here]
 Page 4 of 69

Note: In the combinations order of the letters (or things) is not considered.
Here AB, BA are same and BC, CB are also same and so on.
Hence ABC, ACB, BAC, BCA CAB and CBA are same and counted as a single
combination of A, B, C.

Note: The word combination is generally used form selection of thing and the world
permutation is used for arrangements of things.

Combinations of ‘n’ different things taken ‘r’ at a time

The number of all combinations of n distinct things taken r at a time (r < n) is

n 𝒏!
Cr = (𝒏−𝒓)!𝒓!, C denotes combination,

Properties

1. nCr = (nPr)/(r!)

2. nC0 = nCn = 1

3. nCr = nCn-r (0≤r≤n)

4. nCx = nCy if x + y = n or x = y (x, y𝝐𝑾)

5. nCr-1 + nCr = n+1Cr

𝒏
6. If n is even, the greatest value of nCr = nCm when m = .
𝟐

(𝒏−𝟏) (𝒏+𝟏)
7. If n is odd, the greatest value of nC0 = nCm when m = or =
𝟐 𝟐

8. rCr+ r+1Cr+ r+2Cr+…..+ nCr= n+1Cr+1;r≤ 𝒏

9. nC0 + nC1+ nC2+ nC3 +…….+ nCn=2n

10. n
C1 + nC2+ nC3+ ….+ nCn=2n-1
n
11. C0 + nC2+ nC4…………..=22n

Restricted Combination
1. Number of combinations of n thing taken ‘r’ at a time in which x particular
always occur is n-xCr-x.
[Type here] [Type here]
 Page 5 of 69

2. Number of combinations of n things take ‘r’ at a time in which x particular

ting never occur is n-xCr.

3. Number of ways of selections of zero or more things from a group of ‘n’

distinct things is 2n.
i.e, “C0+nC1+nC2+nC3+…+nCn=2n

4. Number of ways of selections of one or more things from a group of ‘n’

distinct things is 2n-1.
i.e, nC1+nC1+nC3+…+nCn=2n-1
(nC0=1)

5. Number of ways of selection of ‘r’ things out of ‘n’ identical things is 1. (r≤n)

6. Number of ways of selections of zero or more thing from a group of ‘n’

identical things is (n+1).

7. Number of ways of selection of some of all things i.e. atleast 1 out of

(p+q+r+…) things of which p are alike of one kind, q are alike of second kind
r are alike of third kind and so on, is [(p+1) (q+1) (r+1)…)]-1.

8. Total number of ways of selecting one or more things from ‘p’ identical
things of one kind, ‘q’ identical thing of second kind, ‘r’ identical things of
third kind and n different things is ((p+1)(q+1)(r+1)2n)-1

9. Number of selections of k consecutive things out of n things in a row is (n-

k+1).

10. Number of selections of k consecutive things out of n thing in

𝒏 𝒘𝒉𝒆𝒏 𝒌 < 𝒏
a circle = {
𝟏 𝒘𝒉𝒆𝒏 𝒌 = 𝒏

Division of items into Groups of Unequal Size

1. The number of ways on which (m+n) different things can be divided into two
(𝒎+𝒏)!
groups containing m and n things respectively is
𝒎!𝒏!

Since m things can be selected out of (m+n) things in m+nCm ways and each
time when m things are taken, n things left out to form the other group of n
things in nCn ways i.e., in 1 way only.

Hence the required number of ways

(𝒎+𝒏)!
= m+nCm=
𝒎!𝒏!
[Type here] [Type here]
 Page 6 of 69

2. The number of ways in which (m+n+p) different things can be divided into
three groups containing m,
(𝒎+𝒏+𝒑)!
Respectively is
𝒎!𝒏!𝒑!

Similarly: If (m+n+p) things are distributed among three persons in the

groups of m, n and p things then then number of ways
(𝒎+𝒏+𝒑)!
= × 𝟑!
𝒎!𝒏!𝒑!

3. The number of ways in which ‘n’ distinct thing can be distributed to r

different persons = rn.

Division of items into Groups of Equal Size.

The number of ways on which mn different things can be divided equally into
groups, each group containing n thing
(𝒎𝒏)! 𝟏
=(
𝒏!
) 𝒎!

The number of ways on which mn different things can be distributed equally

(𝒎𝒏)!
into m groups, each group containing things = (𝒏!)𝒎

Note: The distribution order is important hence the divisible thing can be arranged
in m ways.
Since things are divided into m groups.

1. The number of ways of dividing n identical thing among r person (or groups)
each of whom, can receive zero or more things is n+r-1Cr-1 where 0≤r≤n

2. The number of ways of dividing n identical thing among r persons, each one
of whom receives at least one item is n-1Cr-1 where 1≤r≤n.

3. The number of ways in which ‘n’ identical thing can be divided into r groups
so that no group contains less then m items and more than k (where m<k) is
coefficient of xn in the expansion of (xn+xm+1+….+xk)r.

Some Important Results

1. Number of squares in a square of having ‘n’ columns and ‘n’ rows

=12+22+32+….+n2
𝑛(𝑛+1)(2𝑛+1)
=
6
[Type here] [Type here]
 Page 7 of 69

2. Number of rectangles in a square having ‘n’ columns and ‘n’ rows

𝑛(𝑛+1) 2
= 13+23+33+….+n3= [ ]
2

3. Number of squares in a rectangle having ‘m’ columns and ‘n’ rows

= m.n + (m-1)(n-1)+(m-2)(n-2)+……..0.

4. Number of rectangles in a rectangle having ‘m’ columns and ‘n’ rows.

=(1+2+3+…+m).(1+2+3+…+n).

5. Number of quadrilaterals if m parallel lines intersect ‘n’ parallel lines = mC2 × nC2.

6. Number of terms in (a1+a2+…+an)m is m+n-1Cn-1.

7. Number of terms in (1+x+x2+….+xn)m is mn+1.

Permutation and Combination in Geometry

It is quite difficult to quantify the importance of P and C in Geometry. A considerable

number of P and C questions that use the concepts of geometry (and vice versa) have
been asked in the IPMAT and other premier B-school exams.

Example. How many diagonals will be there in an n sided regular polygon?

Solution: An n-sided regular polygon will have n vertices. When we join any of these two
vertices (nC2)we get a straight line, which will be either a side or a diagonal.

So, nC2 = number of sides + number of diagonals = n + number of diagonals

𝑛(𝑛−3)
Hence the number of diagonals = nC2 – n =
2
The above result can be used as a formula also.

Example. Ten points are marked on a straight line and 11 points are marked on another
parallel straight line. How many triangles can be constructed with vertices among these
points?
Solution: Triangles will be constructed by taking one point from the 1st straight line and
two more points from the 2nd straight line, and vice versa.
So, the total number of A formed = 10C2 x 11C1 x 11C2 x 10C1 = 1045

Example: There is an n sided polygon (n>5). Triangles are formed by joining the vertices
of the polygon. How many triangles can be constructed that will have no side common
with the polygon?

[Type here] [Type here]

 Page 8 of 69

Solution: An n sided polygon will have n vertices. Triangles constructed out of these n
vertices will be of the following three types:

(i) Having two sides common with the polygon

(ii) Having one side common with the polygon
(iii) Having no side common with the polygon and the total number of triangles
formed will be nC3
a. Having two sides common with the polygon-out of total n vertices any
combination of three c consecutive vertices will give us the triangle that
has two sides common with polygon = n.
b. Having one side common with the polygon Number of selection of three
vertices out of which two are consecutive (if we select A5 and A6 as the two
vertices then A7 or A4 should not be the third vertex because it will
constitute the two sides of the common triangles) = n x (n-4)C1
c. So, the total number of triangles having no side common with polygon =
n
C3 – n x (n-4)C1 - n

Some Important Results

1. Maximum number of points of intersection among n straight lines = nC2
2. Maximum number of points of intersection among n circles = nP2

Some more results

1. Number of terms in (a1 + a2 + …+ an)m is m+n-1Cn-1
Illustration: Find the number of terms in (a+b+c)2.
Solution: n = 3, m = 2
m+n-1
Cn-1 = 4C2 = 6

Corollary Number of terms in

(1+ x + 𝑥 2 + ….. 𝑥 𝑛 )m is mn + 1

[Type here] [Type here]

 Page 9 of 69

Exercise – 01
Combination

1. Find the value of 8C3.

(a) 56 (b) 8! (c) 65 (d) 38

2. Find the value of 10C5.

(a) 525 (b) 126 (c) 252 (d) 50

17
3. Cr = 17Cr+3. Find the value of r.
(a) 17 (b) 6 (c) 7 (d) 13

4. What is the value of x when 11Cx is maximum?

(a) 7 (b) 6 (c) 5 (d) both 6 and 5

5. For what value of x, 14CX is maximum?

(a) 5 (b) 6 (c) 7 (d) 8

6. How many different committees of 5 members may be formed from 6

gentlemen and 4 ladies?
(a) 181 (b) 357 (c) 603 (d) 252

7. Droupdi has 5 friends. In how many ways can she invite one or more of
them to a dinner?
(a) 31 (b) 55 (c)13 (d)25

8. In How many ways can a committee of 6' members be formed from 7 men
and 6 ladies consisting of 4 men and 2 ladies?
(a) 252 (b) 525 (c) 625 (d) 256

9. A committee of 5 persons is to be formed from a group of 6 gentlemen and

4 ladies. In how many ways can this be done if the committee is to be
included at least one lady?
[Type here] [Type here]
 Page 10 of 69

(a) 123 (b)113 (c) 246 (d) 945

10. A committee of 7 persons is to be chosen from 13 persons of whom 6 are

Americans and 7 are Indians. In how many ways can the selection be
made so as to retain a majority of Indians?
(a) 945 (b) 1057 (c) 923 (d)1056

11. In how many ways 7 members forming a committee out of 11 be selected

so that 3 particular members must be included.
(a) 60 (b) 130 (c) 80 (d) 70

12. A committee of 3 experts is to be selected out of a panel of 7 persons,

three of them are engineers, three of them are managers and one is both
engineer and manager. In how many ways can the committee be selected
if it must have at least an engineer and a manager?
(a) 33 (b) 22 (c) 11 (d) 66

13. A committee of 5 persons is to be formed out of 6 gents and 4 ladies. In

how many ways this can be done, when at most two ladies are included?
(a) 186 (b) 168 (c) 136 (d)169

14. In an election, a voter may vote for any number of candidates not greater
than the number to be chosen. There are 7 candidates and 4 members
are to be chosen. In how many ways can a person vote?
(a) 89 (b) 98 (c) 79 (d) 101

15. A question has two parts, Part A and Part B, each containing 8 questions.
If the students has to choose 6 from part A and 5 questions from part B, in
how many ways can he choose the questions?
(a) 1268 (b) 1788 (c) 1024 (d) 1568

16. An examination paper consists of 12 questions divided into two parts, part
A and part B. Part A contains 7 questions and part B contains 5 questions,

[Type here] [Type here]

 Page 11 of 69

A candidate is required to attempt 8 questions, selecting atleast 3 from

each part. In how many ways can he select the questions?
(a) 240 (b) 60 (c) 420 (d) 480

17. Mr. Daruwala has 18 acquaintances of whom 13 are relatives. In how

many ways he may invite 10 guests of that 8 of whom are relatives?
(a) 12870 (b) 22022 (c) 20222 (d) 12780

18. Amitabh has a list of 24 friends. He wishes to invite some of them in such
a manner that he can enjoy maximum number of parties, but in each party
the number of friends (i.e., invitees) be same and each party must have
different set of persons. Then how many parties can Amitabh enjoy?
(a) 2704156 (b) 357600 (c) 235763 (d) 270156

19. In a meeting everyone had shaken hands with everyone else, it was found
that 66 handshakes were exchanged. How many members were present
in the meeting?
(a) 10 (b) 14 (c)12 (d) 8

20. A cricket team of 11 players is to be formed from 16 players including 4

bowlers and 2 wicket keepers. In how many different ways can a team be
formed so that the team has atleast 3 bowlers and atleast one wicket
keeper?
(a) 2472 (b) 2274 (c) 2427 (d) 1236

21. A cricket team of 11 players is to be formed from 20 players including 6

bowlers and 3 wicket keepers. In how Many different ways can a team be
formed so that the team has exactly 2 wicket keepers and atleast 4
bowers?
(a) 22725 (b) 27225 (c) 22275 (d) none of (a), (b), (c)

22. Out of 3 books on Economics, 4 books on Corporate Strategy and 5 books

on Philosophy, how many collection consists of exactly one book on each
subject?
[Type here] [Type here]
 Page 12 of 69

(a) 40 (b) 36 (c) 60 (d) 120

23. A box contains 7 red, 6 white and 4 blue balls. How many selection of
three balls can be made so that all three are red balls?
(a) 35 (b) 70 (c)42 (d)17

24. An urn contains 5 different red and 6 different green balls. In how many
ways can 6 balls be selected so that there are at least two balls of each
color?
(a) 425 (b) 245 (c) 125 (d) 625

25. How many different straight lines can be formed by joining 12 different
points on a plane of which 4 are collinear and the rest are non-collinear?
(a) 16 (b) 32 (c) 61 (d) 64

26. Find the number of diagonals in a decagon,

(a) 25 (b) 35 (c) 45 (d) nC2 – n

27. Find the number of diagonals in an n-sided polygon.

𝑛(𝑛−3)
(a) 𝑛2 (b) (c) n! (d) 2𝑛
2

28. A polygon has 54 diagonals. Find the number of sides.

(a) 6 (b) 12 (c) 27 (d) 18

29. Find the number of triangles formed by joining 12 different points on a

plane, no three of them being collinear (with the exception of 4 points
which are collinear).
(a) 126 (b) 216 (c) 220 (d) 222

30. Two parallel lines each have a number of distinct points marked on them.
On one line there are 2 points P and 0. On the other line there are 8
points. Find the number of different triangles which could be formed
having 3 of the 10 points as vertices.
[Type here] [Type here]
 Page 13 of 69

(a) 216 (b)126 (c) 64 (d) 32

31. If 20 straight lines be drawn in a plane, no two of them being parallel and
no three of them concurrent, how many points of intersection will there be?
(a) 95 (b) 380 (c) 400 (d) 190

32. Find the number of different straight lines obtained by joining n points on a
plane, no three of which are collinear.
𝑛(𝑛−1)
(a) n3 (b) (c) n! (d) 24
2

33. There are n points in a plane no three of which are in the same straight
line with the exception of them m(m < n) points which are all in the same
straight line. Find the number of triangles formed by joining them,
(a) n-mC3 (b) n𝐶3 - m𝐶3 (c) n𝐶𝑚 (d) none of (a), (b), (c)

34. If m parallel lines in plane are intersected by a family of n parallel lines.

Find the number of parallelograms formed
(𝑚−𝑛) 𝑚𝑛(𝑚−1)(𝑚−1)
(a) 𝑚𝑛 (b) (m+1) (n+1) (c) (d)
𝑛! 4

35. In a plane there are 37 straight lines, of which 13 pass through the point A
and 11 pass through the point B. Besides, no three lines pass through one
point, no line passes through both points A and B, and no two are parallel.
Find the number of points of intersection of the straight lines.
(a) 535 (c) 235 (b) 525 (d) 355

36. Find the number of ways of selecting 4 letters from the word
EXAMINATION.
(a) 136 (b) 126 (c) 252 (d) 525

37. Eighteen guests have to be seated half on each side of a long table. Four
particular guests desire to sit on one particular side and three others on
other side. Determine the number of ways in which the sitting,
arrangements can be made.
[Type here] [Type here]
 Page 14 of 69

(a) 18! (b) 462 x (9!)2 (c) (9!)2 (d) 7! x (9!)2

38. Given 3 different red dyes, 4 different blue dyes, and 5 different green
dyes, how many combinations of dyes can be made taking at least one
green and one blue dye?
(a) 2300 (b) 31 (c) 3720 (d) 3560

39. In how many ways can a pack of 52 cards' be divided equally among four
players in order?
52!
(a) (52!)4 (b) 4 x (13!) (c) (d) none of these
(13!)4

40. In how many ways can a pack of 52 cards be divided equally into four
groups?
52! 52! 52!
(a) (b) 4! [(13!)4 ] (c) (d) None of these
(13!)4 x 4! (13!)4

41. Find the number of non negative integral solutions of:

𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 44
(a) 44C4 (b) 43C3 (c) 47C3 (d) none of these

42. How many integral solutions are there to a + b + c = 18 when a ≥ 1, b≥2, c

≥3?
(a) 19C3 (b) 17C2 (c) 15C3 (d) 14C2

43. In how many ways can 10 identical presents be distributed among 6

children so that each child gets at least one present?
(a) 15C5 (b) 16C6 (c) 9C5 (d) 610

44. A captain and a vice-captain are to be chosen out of a team having eleven
players. How many ways are there to achieve this?
(a) 10.9 (b) 11C2 (c) 110 (d) 10.9!

45. In how many ways can Ram choose a vowel and a consonant from the
letters of the word ALLAHABAD?
[Type here] [Type here]
 Page 15 of 69

(a) 4 (b) 6 (c) 9 (d) 5

46. There are three rooms in a motel: one single, one double and one for four
persons. How many ways are there to house seven persons in these
rooms?
(a) 7!/1!2!4! (b) 7! (c) 7!/3 (d) 7!/3!

47. There are 8 consonants and 5 vowels in a word jumble. In how many ways
can we form 5-letter words having three consonants and 2 vowels?
(a) 67200 (b) 8540 (c) 720 (d) None of these

48. There are 5 different Jeffrey Archer books, 3 different Sidney Sheldon
books and 6 different John Grisham books. The number of ways in which
at least one book can be given away is
(a) 210 - 1 (b) 211- 1 (c) 212 -1 (d) 214-1

49. A cricket team of 11 is to be chosen from 8 batsmen, 6 bowlers, and 2

wicket-keepers. In how many ways can the team be chosen if there must
be at least four batsmen,, at least four bowlers, and exactly one wicket-
keeper?
(a) 1681 (b)5304 (c) 1652 (d) None of these

50. From a group of persons, the number of ways of selecting 5 persons is

equal to that of 8 persons. The number of persons in the group is:
(a) 13 (b) 40 (c) 18 (d) 21

[Type here] [Type here]

 Page 16 of 69

Exercise – 2
Permutation
1. Find the value of 9P3
(a) 504 (b) 309 (c) 405 (d) 600

2. If 56𝑃𝑟+6 : 54𝑃𝑟+3 = 30800 : 1 find r,

(a) 14 (b) 20 (c) 41 (d) 21

3. How many even numbers less than 10,000 can be formed with the digits
3,5, 7,8, 9 without any repetition?
(a) 32 (b) 16 (c) 44 (d) 41

4. How many numbers with different digits each greater than 4000 can be
formed from the digits 0,2, 5, 7,8 ?
(a) 160 (b) 168 (c) 320 (d) 270

5. How many 6 digit telephone numbers can be constructed with the digits 0,
1,2, 3, 4, 5, 6, 7, 8, 9 if each number starts with 35 and no digit appears
more than once?
(a) 1600 (b) 1680 (c) 900000 (d) 9000

6. Find the sum of all the four digit numbers which are formed by the digits 1,
2, 5, 6.
(a) 933510 (b) 93324 (c) 65120 (d) 8400

7. How many numbers each lying between 100 and 1000 ' can be formed
with the digits 0, 2, 3, 4, 5 (no digit being repeated)?
(a) 24 (b) 48 (c) 72 (d) 96

8. If all the words formed by the letters of word RAINBOW are arranged in a
dictionary form, then what is the position of the word RAINBOW in that
dictionary?
[Type here] [Type here]
 Page 17 of 69

(a) 3136 (b) 3631 (c) 3361 (d) 1363

9. How many different words can be formed with the letters of the word
RAINBOW so that the vowels occupy odd paces?
(a) 676 (b) 625 (c) 343 (d) 576

10. In how many ways can the letters of the word RAINBOW be arranged so
that only two vowels always remain together?
(a) 2880 (b) 1440 (c) 3200 (d) none of these

11. Four men and three women are to be seated for a dinner such that no two
women sit together and no two men sit together. Find the number of ways
in which this can be arranged.
(a) 144 (b) 72 (c) 36 (d) none of these

12. In how many ways 6 students and 4 teachers be arranged in a row so that
no two teachers are together?
(a) 604800 (b) 24680 (c) 25860 (d) None of these

13. In how many different ways can 8 examination papers be arranged in a

row, so that the best and the worst papers may never come together?
(a) 30240 (b) 23400 (c) 12340 (d) None of these

14. A person has 3 shirts 4 coats and 6 ties. In how many ways can he wear
them?
(a) 27 (b) 36 (c) 72 (d) 130

15. How many different signals can be made by taking 3 different colored flags
at a time from 5 different colored flags?
(a) 120 (b) 60 (c) 15 (d) 125

16. There are 10 stations on a certain railway line many different kinds of
tickets of class 2nd must be printed in order that a passenger may go from
one station to any other by purchasing ticket?
[Type here] [Type here]
 Page 18 of 69

(a) 90 (b) 45 (c) 135 (d) 100

17. Find the number of ways in which 12 different books can be arranged on a
shelf so that three particular book shall not be together,
(a) 126 x 10! (b) 125000 (c) 357500 (d) 123040

18. In how many ways can the letters of the word REPEAT be arranged ?
(a) 2240 (b) 232230 (c) 360 (d) 235760

19. In how many ways can the letters of the word ASSASSINATION be
arranged?
(a) 181800 (b) 818100 (c) 108108 (d) 10810800

20. How many arrangements can be made out of the letters of the word
COMMITTEE, taken all at a time, such that the four vowels do not come
together?
(a) 216 (b) 45360 (c) 1260 (d) 43200

21. How many words can be made from the word MATHEMATICS in which
vowels are together?
(a) 12960 (b) 120960 (c) 15400 (d) none of these

22. If all the letters of the word SEQUESTERED be arranged as in a

dictionary, what is 50th word?
(a) DEEEEQURSTS (b) RUQDESTESEE
(c) ESSTREEUQDE (d) DQUESTREEES

23. How many 6 digit numbers can be formed out of the number 567724,
which are even?
(a) 360 (b) 480 (c) 180 (d) 220

24. How many numbers of 5 digits can be formed with the digits 0, 2, 3, 4 and
5 if the digits may repeat?
(a) 2500 (b) 250 (c) 120 (d) 2400
[Type here] [Type here]
 Page 19 of 69

25. How many of the numbers from 1000 to 9999 (both inclusive) do not have
four different digits?
(a) 4446 (b) 4664 (c) 4464 (d) 6444

26. In how many ways can 5 prizes be given away to 4 boys, when each boy
is eligible for all the prizes?
(a) 1024 (b) 20 (c) 625 (d) 540

27. In how many ways can n balls be randomly distributed in n cells?

(a) n! (b) 𝑛𝑛 (c) n(n-1) (d) 2𝑛

28. In how many ways can 5 letters be posted in 4 letter boxes?

(a) 512 (b) 1024 (c) 625 (d) 20

29. In how many ways can 6 boys form a ring?

(a) 120 (b) 720 (c) 119 (d) none of these

30. In how many ways can 6 beads be strung into a necklace?

(a) 60 (b) 360 (c) 720 (d) 120

31. In how many ways can 5 men and 2 ladies be arranged at a round table if
two ladies are never together?
(a) 5040 (b) 480 (c) 240 (d) 720

32. 7 sisters dine at a round table. They dine together till each of them dine
with different neighbours i.e., they do not like to dine with same
neighbours in any two arrangements. In a year how many days they dine
together?
(a) 180 (b) 504 (c) 720 , (d) 360

33. Find the number of ways in which 10 different flowers can be strung to
form a garland so that 3 particular flowers are always together.
(a) 30240 (b) 30420 (c) 23400 (d) none of (a), (b), (c)
[Type here] [Type here]
 Page 20 of 69

34. In how many ways can 7 Indians, 5 Pakistanis and 6 Dutch be seated in a
row so that all persons of the same nationality sit together?
(a) 3! (b) 7!5!6! (c) 3!.7!.5!.6! (d) 182

35. In how many ways can the letters of the word PATNA be rearranged?
(a) 60 (b) 120 (c) 118 (d) 59

36. If 10Pr = 720, find r.

(a) 4 (b) 5 (c) 3 (d) 6

37. How many numbers of four digits can be formed with the digits 0, 1, 2, 3
(repetition of digits being allowed?
(a) 12 (b) 108 (c) 256 (d) 192

38. How many new words are possible from the letters of the word
PERMUTATION?
(a) 11!/2! (b) (11!/2!) - 1 (c) 11!-1 (d) None of these

39. In how many ways can 12 papers be arranged if the best and the worst
paper never come together?
(a) 12!/2! (b) 12!-11! (c) (12!- 11!)/2 (d) 12!-2.11!

40. In how many ways can the letters of the word 'EQUATION' be arranged so
that all the vowels come together?
(a) 9C4 , 9C5 (b) 4!.5! (c) 9!/5! (d) 9!-4!5!

41. How many 7-digit numbers are there having the digit 3 three times & the
digit 5 four times?
(a) 7!/(3!)(5!) (b) 35x55 (c) 77 (d) 35

42. From 4 gentlemen and 4 ladies a committee of 5 is to be formed. Find the

number of ways of doing so if the committee consists of a president, a
vice-president and three secretaries?
[Type here] [Type here]
 Page 21 of 69

(a) 8𝑃5 (b) 1120 (c) 4C2 x 4C3 (d) None of these

43. In a letter lock, each of the three rings is marked with 15 letters. What is
the maximum number of unsuccessful attempts that one has to make
before the lock is opened?
(a) 3374 (b) 5284 (c) 8457 (d) 8101

44. From 3 different soft drinks, 4 Chinese dishes, and 2 ice-creams, how
many different meals are possible if at least one of each of the three items
is to be included, depending upon the number of people likely to turn up?
(a) 315 (b) 282 (c) 864 (d) None of these

45. Akshay is planning to give a birthday party at his place. In how many ways
can he invite one or more of five friends and seat them at a circular table?
(a) 84 (b) 89 (c) 78 (d) 81

46. How many new words can be formed from the letters of the word 'Circle'
taken together?
(a) 720 (b) 719 (c) 360 (d) 359

47. How many words can be formed out of the letters of the word 'Article' so
that the vowels occupy the even places?
(a) 72 (b) 144 (c) 288 (d) 36

48. How many signals can be made by hoisting 2 blue, 2 red, and 5 black
flags on a pole at the same time?
(a) 378 (b) 1512 (c) 756 (d) None of these

49. Five men, 6 boys, and 7 women are to be seated in a row so that the men,
women, and boys may not be separated in:
(a) 5! x 6! x 7! ways (b) 6!6!7! ways
(c) 2!5!6!7! ways (d) 3!5!6!7! ways

[Type here] [Type here]

 Page 22 of 69

50. How many numbers between 100 and 1000 can be formed with the digits,
1, 2, 3, 4, 5, 6, and 7, with no digit being repeated?
(a) 210 (b) 420 (c) 105 (d) 320

[Type here] [Type here]

 Page 23 of 69

Exercise 3
Permutation and Combination

1. If a + b + c = 21, what is the total number of non-negative integral

solutions?
(a) 123 (b) 253 (c) 321 (d) 231

2. If a + b + c = 21 what is the total number of positive integral solutions?

(a) 109 (b) 190 (c) 901 (d) 910

3. In how many ways can 8 identical apples be divided among 3 sisters?

(a) 25 (b) 65 (c) 45 (d) 24

4. In how many ways can 100 soldiers be divided into 4 squads of 10, 20, 30,
40 respectively?
(a) 1700 (b) 18! (c) 190 (d) none of these

5. In how many- ways can 16 books on different subjects be divided equally

into 4 groups?
16! 16!
(a) (b) 4! x (16!) (c) (d)none of these
(4!) (4!)5

6. The number of squares on a chessboard is:

(a) 102 (b) 108 (c) 216 (d) 204

7. The number of integral solutions for the equal a+b + c + d = 12, where (a,
b, c, d)≥-1 is:
(a) 19C3 (b) 18C4 (c) 20C4 (d) none of these

8. The number of non-negative integral solutions of 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ≤ n

(where n is a positive integer) is:
(a) n+3C3 (b) n+2C3 (c) n+4C4 (d) n+4C3

[Type here] [Type here]

 Page 24 of 69

9. The letters of the word ALLAHABAD are rearranged to form new words
and put in a dictionary. If the dictionary has only these words and one
word on every page in alphabetical order then what is the page number on
which the word LABADALAH comes?
(a) 6269 (b) 6088 (c) 6087 (d) 6086
can be repeated
10. If x, y and z can only take the values 1, 2, 3, 4, 5, 6, 7 then find the
number of solutions of the equation x + y + z= 12.
(a) 36 (b) 37 (c) 38 (d) 31

11. There are nine points in a plane such that no three are collinear. Find the
number of triangles that can be formed using these points as vertices,
(a) 81 (b) 90 (c) 9 (d) 84

12. There is a number lock with four rings. How many attempts at the
maximum would have to be made before getting the right number?
(a) 104 (b) 255 (c) 104-1 (d) None of these

13. How many rectangles can be formed out of a chessboard?

(a) 204 (b) 1230
(c) 1740 (d) None of these

14. 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 are
(a) 212 (b) 210 (c) 205 (d) 190

15. The number of positive integral solutions of x + y + z = n, n ϵ N, n > 3 is:

(a) n-1C2 (b) n-1P2 (c) n(n - 1) (d) None of these

16. The total number of nine-digit numbers of different digits is:

(a) 10(9!) (b)8(9!) (c) 9(9!) (d) None of these

[Type here] [Type here]

 Page 25 of 69

17. If x, y, and z are integers and x ≥ 0, y ≥ 1, z ≥ 2, x+y+z=15, then the

number of values of the ordered triplet (x,y,z) is:
(a) 91 (b) 455 (c) 17C15 (d) None of these

18. The product of r consecutive integers is necessarily divisible by:

(a) r (b) ∑𝑟−1
𝑘=1 𝑘 (c) (r+1)! (d) None of these

19. Find the number of integral solutions of equation x+y + z + t = 29, x>0,y>1,
z>2 and t ≥ 0.
(a) 27C3 (b) 28C3 (c) 2600 (d) 29C4

20. Find the number of non-negative integer solutions to the system of

equations a + b + c + d + e = 20 and a + b + c = 5.
(a) 240 (b) 336 (c) 672 (d) 1008

[Type here] [Type here]

 Page 26 of 69

Exercise 4
Advanced Level
1. A letter lock consists of 4 rings, each ring contains 9 non-zero digits. This
lock can be opened by setting a 4 digit code with the proper combination
of each of the 4 rings. Maximum how many codes can be formed to open
the lock?
(a) 49 (b) 9P4 (c) 94 (d) none of these

2. A group consists of 4 couples in which each of the 4 persons have one

wife each. In how many ways could they be arranged in a straight line
such that the men and women occupy alternate positions?
(a) 1152 (b) 1278 (c) 1296 (d) none of these

3. If all C's occur together and all U’s also occur together, then how many
arrangements are possible of the word SUCCESSFUL?
(a) 5745 (b) 2760 (c) 6720 (d) 5432

4. What is the sum of all 5 digit numbers which can be formed with the digits
0,1, 2, 3,4 without repetition?
(a) 2599980 (b) 235500 (c) 923580 (d) 765432

5. There are 16 executives including two brothers, Lehman and Mckinsey. In

how many ways can they be arranged around the circular table if the two
brothers can not be seated together?
14!
(a) (14!) .13 (b) (14!) (c) (d) none of these
3!

6. What is the total number of ways of selecting atleast one item from each of
the two sets containing 6 different items each?
(a) 2856 (b) 3969 (c) 489 (d) none of these

7. In how many ways can 4 books be arranged out of 16 books on different

subjects?
[Type here] [Type here]
 Page 27 of 69

(a) 34650 (b) 43680 (c) 43890 (d) none of these

8. Four dice are rolled. The number of possible outcomes in which at least
one die shows 4 is:
(a) 671 (b) 168 (c)176 (d) none of these

9. How many 5 digit numbers divisible by 3 can be formed using the digits
0,1, 2, 3, 4 and 5, without repetition?
(a) 108 (b) 216 (c) 810 (d) 180

10. In how many ways can a committee of 4 women and 5 men be chosen
from 9 women and 7 men, if Mr, A refuses to serve on the committee if
Ms. B is a member?
(a) 1608 (b) 1860 (c) 1680 (d)1806

11. How many 4 digit numbers divisible by 4 can be formed without using the
digits 0,6,7,8,9 if the repetition of digits is not allowed?
(a) 67 (b) 68 (c) 24 (d) 48

12. The number of ways in which 4 pictures can be hung from 6 picture nails
on the wall is :
(a) 46 (b) 4P6 (c) 6P4 (d) 64

13. The number of ways in which a team of eleven players can be selected
from 22 players including 2 of them and excluding 4 of them is:
(a) 15C10 (b) 16C10 (c) 16C9 (d) none of these

14. How many 10 digits numbers can be formed by using die digits 2 and 3?
(a) 210 (b) 102 (c) 10! (d) none of these

15. How many different four digit numbers can be formed with die digits 1, 2,
3, 4, 5, 6, 7, 8 and 9 such that the digit 5 appears exactly once?
(a) 1024 (b) 2048 (c) 4096 (d) none of these

[Type here] [Type here]

 Page 28 of 69

16. How many different eight digit numbers can be formed using only four
digits 1, 2, 3,4 such that the digit 2 occurs twice?
(a) 20412 (b) 12042 (c) 25065 (d) none of these

17. Ajay has 7 relatives, 3 men and 4 women. His wife Kajol also has 7
relatives, 3 women and 4 men. In how many ways can they invite 3 men
and 3 women so that 3 of them are the Aja/s relatives and 3 his wife
Kajol's?
(a) 485 (b) 458 (c) 365 (d) none of these

18. There are 6 pups and 4 cats. In how many ways can they be seated in a
row so that no cats sit together?
(a) 64 (b) 10!/(4!).(6!) (c) 6!x7P4 (d) None of these

19. How many new words can be formed with the word MANAGEMENT all
ending in G?
(a) 10!/(2!)4-1 (b) 9!/(2!)4 (c) 10!/(2!)4 (d) None of these

20. In how many ways 5 MBA students and 6 Law students can be arranged
together so that no two MBA students are side by side?
7!6!
(a) (b) 6!.6! (c) 5!.6! (d) 11C5
2!

21. How many 10-digit numbers have at least 2 equal digits?

(a) 9 x 10C2 x 8! (b) 9.109 - 9.9! (c) 9x9! (d) None of these

22. How many different 7-digit numbers can be written using only three digits
1, 2 and 3 such that the digit 3 occurs twice in each number?
(a) 7C2.25 (b) 7!/(2!) (c) 7!/(2!)3 (d) None of these

23. Seven different objects must be divided among three people. In how many
ways can this be done if one or two of them must get no objects?
(a) 381 (b) 36 (c) 84 (d) 180

[Type here] [Type here]

 Page 29 of 69

24. How many 4-digii number, that are divisible by 4 can be formed from the
digits 1. 2, 3, 4 and 5.
(a) 36 (b) 72 (c) 24 (d) None of these

25. How many even natural numbers divisible by 5 can be formed with the
digits 0, 1, 2, 3, 4, 5, 6 (if repetitions of digits not allowed)?
(a) 1957 (b) 1956 (c) 1236 (d) 1235

26. If nC4, nC5, and nC6 are in an AP, then find n is :

(a) 8 (b) 9 (c) 14 (d) 10

27. A tea party is arranged for 16 people along the two sides of a long table
with 8 chairs on each side. Four men wish to sit on one particular side and
two on the other side. In how many ways can they be seated?
(a) 10
C4 x 8! (b) 10P4 x (8!)2
(c) 10
C4 x (8!)2 (d) 4! x 2! x (8!)2

28. There are 4 letters and 4 directed envelopes. The number of ways in
which all the letters can be put in the wrong envelope is:
(a) 8 (b) 9 (c) 16 (d) None of these

[Type here] [Type here]

 Page 30 of 69

Exercise – 05
TITA / Short Answer
1. Find the number of ways in which 21 balls can be distributed among 3
persons such that each person does not receive less than 5 balls,

2. How many different words can be made using the letters of the word
'HALLUCINATION if all consonants are together?

3. In bow many different ways can 6 different balls be distributed to 4

different boxes, when each box can hold any number of bail?

4. How many 5 digit numbers contain exactly two 7 in them?

5. There are 4 different monitors and 6 different mother boards. How many
different arrangements can be made to purchase a monitor and a
motherboard?

6. 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:

7. Maximum number of points of intersection of 6 straight lines is:

8. The number of rectangles excluding squares from a rectangle of size of 12

x 8 is :

9. The number of ways in which 9 identical balls can be placed in three

identical boxes is :

10. The number of different selection of 5 letters from 1A, 2 B's, 3C's, 4D's
and 5E’s is:

[Type here] [Type here]

 Page 31 of 69

11. How many straight lines can be formed from 8 non-collinear points on the
X-Y plane?

12. Let n be the number of different 5-digit numbers, divisible by 4 that can be
formed with the digits 1, 2, 3, 4, 5 and 6, with no digit being repeated.
What is the value of n?

13. How many numbers can be formed with odd digits 1, 3, 5, 7, 9 without
repetition?

14. How many different 4-digit numbers can be written using the digits 1, 2, 3,
4, 5, 6, 7 and 8 only once such that the number 2 is contained once,

15. In how many ways a cricketer can score 200 runs with fours and sixes
only?

16. Five boys and three girls are sitting in a row of eight seats. In how many
ways can they be seated so that not all girls sit side by side?

17. There are 8 different locks, with exactly one key for each lock. All the keys
have been mixed up. What is the maximum number of trials required in
order to determine which key belongs to which lock?

18. The number of ways of painting the faces of a cube with six different
colour is:

[Type here] [Type here]

 Page 32 of 69

Answer Key & Explanations

Exercise – 1
1. Ans. (a) ∴1 friend can be selected out of 5 in
8! 8𝑥7𝑥6 5
C1 ways
Solution: 8C3 = = = 56
3!5! 6
2 friends can be selected out of 5 in
2. Ans. (c) 5
10 𝑥 9 𝑥 8 7 𝑥 6 𝑥 5! C2 ways
Solution: 10C5 = =
5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 𝑥 (5!) 3 friends can be selected out of 5 in

252 5
C3 ways
3. Ans. (c) 4 friends can be selected out of 5 in

Solution: 5
C4 ways
➔ Either r = r + 3 or r + r + 3 = 5 friends can be selected out of 5 in

17 5
C5 ways Hence the required
But since r ≠ r + 3 number of ways
∴ r + r + 3 = 17 ➔ r = 7 = 5C1 + 5c2 + 5c3 + 5c4 + 5c5
4. Ans. (d) = 5+10 + 10 + 5+1 = 31
Solution: If n is odd, the greatest
value of nCr = nCm Alternatively: 5C1 + 5C2 + 5C3 + 5C4
(𝑛−1) (𝑛+1) + 5C5 = 25 -1 = 32
When m = or m =
2 2
(11−1) (11+1) Since, nC1 + nC2 + nC3 +...+nCn =2n-1
x= = 5 or x = =6 8. Ans. (b)
2 2
Hence (d) is the correct choice Solution: 4 men can be selected out
5. Ans. (c) of 7 men in 7C4 ways
Solution: 14Cx is maximum when x = and 2 ladies can be selected out of
14
=7 6 ladies in 6C2 ways Hence, the
2
Alternative: Go through options. required number of ways = 7C4 x
6
6. Ans. (d) C2
Solution: Since there are total 10 = 35 x 15 = 525
persons and out of these 10 9. Ans. (c)
persons we have to select any 5 Solution: A committee of 5 persons
persons which can be done in 1OCS is to be formed from 6 gentlemen
ways. and 4 ladies by taking.
10! (i) 1 lady out of 4 and 4 gentlemen
10
C5 = = 252
5! 𝑥 5! out of 6.
7. Ans. (a) (ii) 2 ladies out of 4 and 3
Solution: She may invite one or gentlemen out of 6.
more friends by selecting either 1 or (iii) 3 ladies out of 4 and 2
2 or 3 or 4 or 5 friends out of 5 gentlemen out of 6.
friends. (iv) 4 ladies out of 4 and 1
[Type here] [Type here]
 Page 33 of 69

gentleman out of 6. 12. Ans. (a)

Solution: 3 experts including atleast
In case II the number of ways = 4C1 an engineer and a manager can be
x 6C4 = 4 x 15 = 60. selected by taking.
In case II the number of ways = 4C2 (i) 2 managers out of 3 and 1 engineer

x 6C3 = 6 x 20 = 120. out of 3.

Incase III the number of ways = 4C3 (ii) 1 manager out of 3 and 2 engineer

x SC2 =4x15=60 out of 3.

In case IV the number of ways = 4C4 (iii) 2 persons out of 6 (3
x 6C1 = 1 x 6 = 6 managers and 3 engineers) and 1
Hence, the required number of ways person out of one who is both
= 60 + 120 + 60 + 6 = 246 engineer and manager.
10. Ans. (b) In case I, the number of ways = 3C2
Solution: A committee of 7 persons x 3C1 = 9
retaining a majority of Indians can be In case II, the number of ways = 3C1
made from 6 Americans and 7 x 3C2 = 9
Indians by taking In case III, the number of ways = 6C1
(i) 1 American out of 6 and 6 Indians x 1C1 = 15
out of 7. Hence, the required number of
(ii) 2 Americans out of 6 and 5 Indians ways = 9 + 9+15=33
out of 7. 13. Ans. (a)
(iii) 3 Americans out of 6 and 4 Solution: A committee of 5 persons,
Indians out of 7. consisting of at most two ladies, can
In case I the number of ways = 6C1 x be formed in the following ways.
7
C6 = 6 x7 = 42 (i) selecting 5 gents only out of 6.

In case II the number of ways = 6C2 (ii) selecting 4 gents only out of 6 and

x 7C5 = 15 x 21 = 315 one lady out of 4.

In case III the number of ways = 6C3 (iii) selecting 3 gents only out of
X 7C4 = 20x35=700 6 and two ladies out of 4.
Hence, the required number of ways In case I, the number of ways = 6C5
= 700 + 315+42=1057 In case II, the number of ways = 6C4
11. Ans. (d) x 4C1
Solution: Since 3 particular members In case III, the number of ways = 6C3
are already selected, then we are x 4C2
required to select only 4 members Required number of ways =6C5 +6C4
out of the remaining 8 members. x 4C1 + 6C3 + 4C2
It can be done in 8C4 ways. = 6 + 60 + 120 = 186
8
C4=70 14. Ans. (b)

[Type here] [Type here]

 Page 34 of 69

Solution: A voter may cast vote for 19. Ans. (c)

either 1 candidate or 2 candidates or Solution: Let there were n persons
3 candidates or 4 candidates out of in the meeting, then number of
7. handshakes = nC2
n
The voter may cast vote for 1 C2 = 66
candidate in 7C1 ways 20. Ans. (a)
The voter may cast vote for 2 Solution: Total number of bowlers =
candidates in 7C2 ways 4
The voter may cast vote for 3 Total number of wicket keepers = 2
candidates in 7C3 ways Rest (normal) players = 10
The voter may cast vote for 4 Possible Combinations :
candidate in 7C4 ways Wicket Normal
Bowlers
Hence, the required number of ways Keepers Player
3 1 7
= 7C1 + 7C2 + 7C3 + 7C4 3 2 6
=7 + 21 + 35 + 35= 98 4 1 6
4 2 5
15. Ans. (d)
Solution: Required number of ways ∴ Required number of ways
= 8C6 x 8C5
= (4C3 x 2C1 x 10C7) + (4C3 x 2C2
= 28 x 56 = 1568
x 10C6) + (4C4 x 2C1 x 10C6) + (4C4 x
16. Ans. (c) 2
C2 x 10C5)
Solution: Required number of ways
= (3x 1 x 7) + (3 x 2 x 6) + (4 x
= 7C3 x 5C5 + 7C4 x 5C4 + 7C5 x 5C3
1 x 6) + (4 x 2 x 5)
= 35 x 1 + 35 x 5 + 21 x 10
= 35+175+210=420 = 960 + 840 + 420 + 252 =
17. Ans. (a) 2472
Solution: Required number of ways 21. Ans. (b)
= 13C8 x 5C2 Solution: Total number of bowlers =
= 1287x10 6
= 12870 Total number of wicket keepers = 3
18. Ans. (a) Total number of normal players = 11
Solution: If n is even, nCr is [20 - (6 + 3)]
𝑛
maximum when r = Possible combinations:
2
∴ Number o invitees in a party = Bow Wic Nor
24 lers ket mal
= 12 4 2 5
2 5 2
Keep 4
Play
And maximum possible number 6 2
ers
3
ers
of parties = 24C12
= 2704156 Required number of ways
= (6C4 x 3C2 x 11C5) + (6C5 x 3C2 x
[Type here] [Type here]
 Page 35 of 69

11
C4) + (6C6 x 3C2 X 11C3) Number of lines formed by 4 points
= 20790 + 5940 + 495 = 27225 = 4C2
22. Ans. (c) ∴ Required number of lines = Total
Solution: 1 book on Economics can lines formed by 12 points
be collected out of 3 in 3C1 ways ∴ number of lines formed by 4
1 book on Corporate strategy can be collinear points + 1
collected out of 4 in 4C1 ways 1 book = 12C2 - 4C2 + 1 = 61
on Philosophy can be collected out
of 5 in 5C1 ways Hence the required Explanation: If no three points are
number of collections each of which collinear, a straight line can be
consists of exactly one book on each formed by joining any two points out
subject of given non- collinear points. But
= 3C1 x 4C1 x 5C1 since if some points are collinear
= 3 x 4 x 5= 60 then some lines become
overlapped.
23. Ans. (a)
Here 12 points can make 12C2 lines,
Solution: Since all the three balls
but since 4 points are collinear, we
are red which can be selected from
can find only one line by joining
7 red balls only.
these 4 collinear points where as
∴ Required number of selections
we have considered 4C2 lines # 12C2
= 7C3 = 35
lines.
24. Ans. (a)
Hence the required number of
Solution: Total number of red balls
straight lines
=5
= 12C2 – 4C2 + 1 = 61
Total number of green balls = 6
26. Ans. (b)
Possible combinations are:
Solution: A decagon has 10 vertices
i.e., 10 non-collinear points. Hence
Red Green
the total number of lines formed by
2 4
10 non-collinear point' = 10C2 = 45
3 3
But since out of 45 lines 10 lines are
4 2
the sides of the decagon and the
remaining 35 lines are diagonals of a
∴ Required number of selections
decagon.
= (5C2 x 6C4) +
Alternatively : Number of
(5C3 x 6C3) + (5C4x 6C2) = 425
diagonals = nC2-n
25. Ans. (c)
Solution: Total number of lines 27. Ans. (b)
formed by 12 points = 12C2 Solution: Number of diagonals in an
n sided polygon
[Type here] [Type here]
 Page 36 of 69

= Number of total lines – number Solution: An intersection point is

of sides formed by the intersection of two
= nC2 - n lines. Hence number of intersection
𝑛(𝑛−1) 𝑛(𝑛−3) points is equal to the number of
= -n=
2 2
ways of selecting 2 lines out of the
28. Ans. (b)
given 20 non-parallel and non-
Solution: Number of diagonals = nC2
concurrent lines.
– n = 54
𝑛(𝑛−1) i.e, Required number of points =
= – n = 54 20
C2 = 190.
2
𝑛(𝑛−3)
= = 54 32. Ans. (b)
2
= n = 12 Solution: Number of straight line
Alternatively: Go through options. formed by ‘n’ non-collinear points
𝑛(𝑛−1)
29. Ans. (b) = nC2 =
2
Solution: Number of triangles that 33. Ans. (b)
can be formed if no three points are Solution: Number of triangles
collinear = 12C3 = 220. formed by ‘n’ non-collinear points is
But since 4 points are collinear, we n
C3.
cannot form any triangle from these But since m points are in a straight
4 points by joining any three of them line therefore from these m points
where as we have taken 4C3 m
C3 triangles can not be formed.
triangles in the above result Hence required number of triangles
(i.e.,12C3). = nC3 – mC3.
Hence the required number of 34. Ans. (d)
triangles = 12C3 - 4C3 Solution: A parallelogram is formed
= 220 - 4 = 216 by choosing two straight lines. From
30. Ans. (c) the set of m parallel lines and two
Solution: A triangle can be formed by straight lines from the set of n
selecting 1 point out of P and Q and parallel lines.
selecting 2 points out of 8 points on Two straight lines from the set of m
the other parallel line. parallel lines can be chosen in mC2
or a triangle can be formed by ways and two straight lines from the
selecting 2 points out of 2 points (P set of n parallel lines can be chosen
and Q) and selecting 1 point out of 8 in nC2 ways. Hence the number of
points. parallelograms formed
∴ Required number of triangles = = mC2 x nC2 =
𝑚(𝑚−1)
x
𝑛(𝑛−1)
2 2
(2C1 x 8C2) + (2C2 x 8C1)
= (2 x 28) + (1 x 8)= 64 𝑚𝑛 (𝑚−1)(𝑛−1)
31. Ans. (d) =
4

[Type here] [Type here]

 Page 37 of 69

35. Ans. (a)

Solution: The number of points of
intersection of 37 lines is 37C2. But 13
straight lines out of the given 37
straight lines pass through the same Solution: Hence we are left with 11
point A. Therefore instead of getting guests only out of which we choose
13
C2 points, we get only one point A. 5 guests for the side A in 11C5 ways
Similarly 11 straight lines out of the and remaining 6 guest can be
given 37 straight lines intersect at selected for the side B in 6C6 ways.
point B. Therefore instead of getting Further in each side 9 guests can
11
C2 points, we get only one point B. be arranged in 9! ways.
Hence the number of intersection Hence the required number of
points of die lines is arrangements
37
C2 - 13C2 - 11C2 + 2= 535 = 11C5 x 6C6 x 9! X 9! = 462 x
36. Ans. (a) (9!)2
Solution: There are 11 letters in the 38. Ans. (c)
given word of which 2 are A’s. 2 are Solution: Atleast 1 green dye can be
I’s, 2 are N’s and the remaining 5 selected out of 5 green dyes in (25 -
letters are different, thus we have 11 1) i.e., 31 ways.
letters of 8 different kinds (A, A), (I, Similarly, atleast on blue dye can
I), (N, N), E, X, M, T, O. be selected out of 4 in (24 - 1) i.e.,
A group of 4 letters can be classified 15 ways.
as follows: And atleast 1 red or no red dye
(i) Two alike of one kind and two can be selected out od 3 red dyes in
alike of another find. 23 i.e, 8 ways.
(ii) Two alike and the other two Hence the required number of
different. ways = 31 x 15 x 8 = 3720.
(iii) All four different. 39. Ans. (c)
In case I, the number of ways = 3C2 Solution: It mean each player can
=3 receive 13 cards. .
In case II, the number of ways = 3C1 ∴ First player can get 13 cards in
52
x 7C2 = 63 C13ways.
In case III, the number of ways = 8C4 Second player can get 13 cards in
39
= 70 C13 ways.
Hence, the required number of ways Third player can get 13 cards in
26
= 3 + 63 + 70 = 156 C13 ways
37. Ans. (b) Fourth player can get 13 cards in
13
C13 ways.

[Type here] [Type here]

 Page 38 of 69

Hence the total number of ways ∴ Total number of solutions of

52! this equations is
= 52C13 x 39C13 x 26C13 x 13C13 =
(13!)4 12+3-1
C3-1 = 14C2
Alternatively: 52 cards can be 43. Ans. (c)
divided equally among 4 players in Solution: This is a typical case for the
51!
ways. use of the formula n-1Cr-1 with n = 10
(13!)4 𝑥 (4!)
and r = 6. So the answer would be
given 9C5.
But since order is important, hence
44. Ans. (c)
the required number of ways
52! x 4! 52! Solution: 11C1 x 10C1 = 110.
= =
(13!)4 x (4!) (13!)4 Alternately, 11C2 x 2!
40. Ans. (a) 45. Ans. (a)
Solution: Required number of ways 46. Ans. (a)
52!
= Solution: Choose 1 person for the
(13!)4 x (4!)
single room & from the remaining
41. Ans. (c)
choose 2 people for the double room
Solution: Total number of non-
& from the remaining choose 4
negative integral Solutions of the
people for the 4 persons room → 7C1
given equations is same as the
x 6C2 x 4C4.
number of ways of distributing 44
47. Ans. (a)
items among 4 persons such that
Solution: 8C3 x 5C2 x 5! = 67200
each person can receive any
48. Ans. (d)
number of items.
Solution: For each book we have
Hence, total number of solutions =
44+4-1 two options, give or not give. Thus,
C4-1 = 47C3.
we have a total of 214 ways in which
42. Ans. (d)
the 14 books can be decided upon.
Solution: Let u ≥ 0, v ≥ 0, w ≥ 0,
Out of this, there would be 1 way in
then
which no book would be given.
a ≥ u +1, b ≥ v + 2, c ≥ w + 3
Thus, the number of ways is 214 - 1.
∴ a + b + c = 18
Hence, Option (d) is correct.
49. Ans. (d)
➔ u + 1 + v + 2 + w + 3 = 18
50. Ans. (a)
➔ u + v + w = 12

Exercise – 2

1. Ans. (a)
9! 𝑛! 9 x 8 x 7 x 6!
Solution: 9P3 = (∴ nPr = (𝑛−𝑟)!) =
6! 6!
[Type here] [Type here]
 Page 39 of 69

= 9 x 8 x 7 = 504 even digit then the whole number is

2. Ans. (c) an even number.
56𝑃𝑟+6 30800 4. Ans. (b)
Solution: =
56𝑃𝑟+3 1
Solution:
56!
(50−𝑟)! 30800
54!
3 4 3 2 =
1
(51−𝑟)!

=3x4x3x2=
56 x 55 x (51−r)! 30800 72
➔ (50−𝑟)!
=
1
Thousands place can assume
(51−𝑟) x (50−𝑟)! 10
only 3’ values viz., 5,7,8. Since
➔ (50−𝑟)!
= required numbers are greater than
1
= 51 – r = 10 4000.
4 4 3 2 1 r
= 41
Alternatively: Go through options. = 4 x 4 x 3 x 2 x 1 = 96
3. Ans. (d) and 98)
Solution: Case 1. There is only one Ten thousands place can
even number of one digit. assume all the remaining non-
Case 4 1 2: zero digits and thousands place
=4x 1=4 can assume zero also except
There are only 4 even numbers the digit which has been filled
of two digit up at thousands placed
(Numbers are 38, 58, 78 and 98) Therefore total required
Case 3. numbers
4 3 1 = number of 4 digit numbers +
number of 5 digit numbers =
= 4 x 3 x 1 = 12 72+ 96 = 168
There are only 12 even numbers 5. Ans. (b)
of 3 digit. Solution:
Case 8 7 6 5 4.
4 3 2 1
= 8 x 7 x 6 x 5 = 1680
= 4 x 3 x 2 x 1 = 24 3 and 5 have been already
There are 24 even numbers of 4 used, so we have 8 digits for
digits thus ther are total 1 + 4 + 12 + thousands place, then 7 digits
24 = 1 even numbers. for hundreds place, 6 digits for
Note: In each case 8 is fixed at unit tens digit and remaining 5 digits
place, since if the unit digit is an for unit place.

[Type here] [Type here]

 Page 40 of 69

Alternative: Number of words begin with

8 8! 8 x 7 x 6 x 5 x 4! RA/B = 3!
P4 = = =8x7x6
4! 4!
Now the next word is
x 5 = 1680
RAINBOW (it is the first word
6. Ans. (b)
which begins with RAIN)
Solution:
So the ranking of the word
4 3 2 1 RAINBOW
=5 x 6!+ 4!+ 3!+1 = 3631
= 4 x 3 x 2 x 1 = 24
9. Ans. (d)
There are total 24 numbers of 4
Solution: 1 2 3 4 5 6 7
digit.
First of all arrange any 3
Since we have only 4 digits it
consonants at even places in
means we use each of the digit 4
24 P3 ways. Now the newly
6 (= ) times in each of the created four odd places can be
4
unit, tens hundreds filled by the remaining letters
and thousands place. which includes 3 vowels and 1
7. Ans. (b) consonants, which can be
Solution: done in 4P4 ways. Hence the
4 4 3 required number of
= 48 permutation
Hundred’s place can not assume = 4P3 x 4P4 = 24 x 24 = 576
0. 10. Ans. (a)
8. Ans. (b) Solution: First of all arrange all the
Solution: The correct order of the four consonants R, N, B, W in 4!
letters is as follows: ways.
A, B, I, N,O,R,W Then there are 5 places to be
Number of words begin with A = filled up by the vowels. But any
6! two vowels are always together
Number of words begin with B then we assume that there are
~ 61 only two vowels which can be
Number of words begin with I = filled in 5 places in 5P2 ways. But
6! we have to take any two vowels
Number of words begin with N together out of 3 vowels then this
= 6! can be done in 3P2 ways.
Number of words begin with 0 = Hence the total number of
6! permutation = 5P2 x 3P2 x 4!
Number of words begin with = 20 x 6 x 24 = 2880
RAR = 4! Alternatively: Since there can be

[Type here] [Type here]

 Page 41 of 69

only 3 cases Number of arrangements when

(i) When A, 𝑙 and 0 are best and worst papers are
separate from each other together = 7!x2! =10080
(ii) When A, 𝐼 and 0 can always Number of arrangements in
together which best and worst papers are
(iii) When any two vowels out of not together = 40320 - 10080 =
three vowels A, 𝑙 and 0 are 30240
together. 14. Ans. (c)
Now we need to calculate the Solution: The required number of
value of Case (iii). permutation = 3x4x6 = 72
Required number of 15. Ans. (b)
permutations Solution: Required number of
= Total number of signals = 5P3 = 60
permutations - (Case (i) + Case (ii)] 16. Ans. (a)
7! - (1440 + 720) = 5040 - Solution: A passanger from any
(2160) = 2880 station may purchase ticket for
11. Ans. (a) anyone of the other 9 stations.
Solution: Since no two men or two Therefore, there must be 9 tickets in
women sit together it means they sit each station.
on the alternate positions. Therefore total number of different
Therefore first of all we arrange tickets = 9 x 10 = 90
3 women in 3! ways then we 17. Ans. (a)
arrange 4 men in newly created Solution: Total number of
4 places in 4P4 ways. permutations = 12!
Thus the total number of Number of permutations when three
arrangements = 3! x 4P4 particulars books are1 together =
= 6x24=144 ' 10! x 3!
12. Ans. (a) Number of permutations when three
Solution: First of all the 6 students particular books are not
can be arranged in 6! ways then 4 together=12! -10! x 3!
teachers can be arranged in 7 places = 10! (12 x 11-6)
in 7P4 ways. = 10! X 126 = 457228800
Hence, the required number of 18. Ans. (c)
arrangements = 6! x 7P4 Solution: In the given word there are
= 720 x 840 = 604800 6 letters of which E occurs 2 times.
13. Ans. (a) Hence the required number of
6!
Solution: Total number of ways =
2!
arrangements = 8!=40320

[Type here] [Type here]

 Page 42 of 69

6x5x43x2x1 Number of words begin with

= = 360
2
DEEEEQS = 4! = 24
19. Ans. (d)
Number of words begin with
Solution: Required number of 4!
13! DEEEEQT = = 12
permutations = 2!
3!.4!.2!.2!
Now, the next two words are
= 10810800
DEEEEQURSST and
20. Ans. (d)
DEEEEQURSTS
Solution: There are total 9 letters in
Hence the 50th word is
the word COMMITTEE in which
DEEEEQURSTS
there are 2M’s 2T’s, 3E’s.
23. Ans. (c)
∴ The number of ways in which 9
Solution:
letters can be arranged
9! 5 32 1 3
= = 45360 = 3.(5!) 4
2!𝑥 2!𝑥 2!
There are 4 vowels O,I, E, E in Unit place can assume any of the
the given word. If the four three even digits viz,2,4,6 and rest
vowels always come together, of the places can be filled up in 5!
taking them as one letter we ways.
have to arrange 5+1 = 6 letters But since digit 7 occurs 2 times.
which include 2Ms and 2Ts 6! 3.(5!)
Required number of numbers =
6! 2!
and this be done in = 180 = 180
2! x 2!
ways. 24. Ans. (a)
21. Ans. (b) Solution: Ten thousands place can
Solution: 𝑀,
⏟ 𝑀, 𝑇, 𝑇, 𝐻, 𝐶, 𝑆 𝐴,
⏟ 𝐴, 𝐸, 𝐼 assume only non zero digits hence
When all the vowels are together ten thousands place can be filled up
then n = 7 + 1 = 8 in 4 ways and thousands place can
∴ required number of be filled up in 5 ways since
8!𝑥 4! repetition is allowed (and 0 can be
permutation = = 120960
2!𝑥 2!𝑥 2! filled up in this place). Similarly
Note: (M, T and A occur 2 times hundreds, tens and unit places can
and A A E I can be arranged be filled up in 5 ways each.
4!
mutually in ways) . .The required number of numbers
2!
22. Ans. (a) = 4 x 5 x5 x 5 x'5= 2500
Solution: The correct order of letters 25. Ans. (c)
is D, E, E, E, E, Q, R, S, S, T, U. Solution: Number of numbers of 4
Number of words begin with digit in which repetition allowed
DEEEEQR=
4!
= 12 = 9x10x10x10 = 9000
2!
Number of numbers of 4 digit in
which repetitions is not allowed
[Type here] [Type here]
 Page 43 of 69

= 9 x 9 x 8 x 7 = 4536 Solution: Required number of

Hence the required number of permutations = 5! = 120
numbers of 4 digit 30. Ans. (a)
= 9000 - 4536 = 4464 31. Ans. (b)
26. Ans. (a) Solution: Total number of
Solution: First prize can be given arrangements = 6! = 720
away to 4 boys in 4 ways. Number of arrangements in which
Similarly second, third, fourth and two ladies are together = 2x5!=240
fifth prizes can also be given away ∴ Number of arrangements in
to four boys in 4 ways. which two ladies are never together
Hence die required number of way = 720 - 240 = 480
in which all the 5 prizes can be Alternatively: First of all place the
given away to 4 boys five men in 4! ways, then place the
= 4 x 4 x 4 x 4x4 = 1024 two ladies in any 5 spaces in 5P2
27. Ans. (b) ways.
Solution: The first ball can be Hence, the required number of
placed in any one of then cells inn ways = 4! x 5P2 = 480
ways. The second ball can also be 32. Ans. (d)
placed in any one of die n cells in n Solution: Clearly 7 sisters can sit
ways. around a table in 6! ways. But in
∴ The first and second balls can clockwise and anticlockwise
be placed in n cells in n x n…. n2 arrangements each of the ladies
ways. have the same neighbours.
Similarly each of the rest balls 1
So, the required number of ways =
2
can be placed in n ways. Hence
x (6!) = 360
the required number of ways =
Hence they dine together only 360
n x n x... x n times = 𝑛𝑛
days.
28. Ans. (b)
33. Ans. (a)
Solution: First letter can be posted
Solution: Since 3 particulars flowers
in 4 letter boxes in 4 ways.
are together
Similarly second letter can be
Hence there can be total (10 - 3) +1
posted in 4 letter boxes in 4 ways
= 8 flowers.
and so on.
These 8 flowers can be arranged 7!
Hence all the 5 letters can be
ways but the 3 flowers which are
posted in
together can be arranged mutually
= 4 x 4 x 4 x 4 x 4 = 1024
in 3! ways.
29. Ans. (a)
Hence, the required number of
ways = 3!x7!
[Type here] [Type here]
 Page 44 of 69

= 6 x 5040 total words -1 = 11!/2!-1

= 30240 39. Ans. (d)
Solution: All arrangements -
34. Ans. (c) Arrangements with best and worst
Solution: We need to assume that paper together = 12! - 2! x 11!.
the 7 Indians are 1 person, so also 40. Ans. (b)
for the 6 Dutch and the 5 Pakistanis. Solution: The vowels EUAIO need to
These 3 groups of people can be be considered as 1 letter to solve
arranged amongst themselves in 3! this. Thus, there would be 4! ways of
ways. Also, within themselves the 7 arranging Q, T and N and the 5
Indians the 6 Dutch and the 5 vowels taken together. Also, there
Pakistanis can be arranged in 7!, 6! would be 5! ways of arranging the
And 5! ways respectively. Thus, the vowels amongst themselves. Thus,
answer is 3! x 7! x 6! x 5!. we have 4! x 5!.
35. Ans. (d) 41. Ans. (d)
Solution: Rearrangements do not Solution: 7!/3! X 4! = 35
count the original arrangements. 42. Ans. (b)
Thus, 5!/2! - 1 =59 ways of Solution: From 8 people we have to
rearranging the letters of PATNA. arrange a group of 8 in
36. Ans. (c) 8𝑃5 8𝐶5 x 5!
Which three are similar or
3! 3!
Solution: 10P3 would satisfy the value
43. Ans. (a)
given as l0P3 = 10 x 9 x 8 = 720.
44. Ans. (a)
37. Ans. (d)
45. Ans. (b)
Solution: 3 x 4 x 4 x 4 = 192
46. Ans. (d)
38. Ans. (b)
47. Ans. (b)
Solution: Number of 11 letter words
48. Ans. (c)
formed from the letters P, E, R, M, U,
49. Ans. (d)
T, A, T, I, O, N = 11/2!.
50. Ans. (a)
Number of new words formed =

Exercise – 3

1. Ans. (b) 2. Ans. (b)

Solution: Number of non-negative Solution: Number of positive integral
integral solutions = n+r-1Cr-1 solutions = n-1Cr-1
= 21+3-1C3-1 = 21-1C3-1 = 20C2
= 23C2 = 253 = 20C2

[Type here] [Type here]

 Page 45 of 69

= 190 Solution: ∴ a ≥ - 1, b ≥ - 1, c ≥ -1, d

≥ - 1.
3. Ans. (c) Let u ≥ 0, v ≥ 0, w ≥ 0, x ≥ 0.
Solution: Using n+r-1Cr-1, we get 8+3- ∴ a + b + c + d = 12
1
C3-1, = 10C2 = 45 ➔ (u-1) + (v-1) + (w-1) + (x-1) = 12
4. Ans. (d) ➔ u + v + w + x = 16
Solution: 100C10 x 90C20 x 70C30 x
100!
40
C40 = ∴ Required number of solutions =
10!x 20!30!x 40! 16+4-1
5. Ans. (c) C4-1 = 19C3
1 8. Ans. (c)
Solution: 16C4 x 12C4 x 8C4 x 4C4 x
4! Solution: Let x5 be such that
16!
=
(4!)5
𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 + 𝑥5 = n
6. Ans. (d) The number of required solutions =
n+5-1
Solution: In a chess board there are C5-1 = n+4C4
8 columns and 8 rows. 9. Ans. (a)
Solution: No. of words starting with A
= 8!/ 2!3! = 3360.
No. of words starting with B = 8!/
214! = 840
No. of words starting with D = 8!/2!4!
= 840
No. of words starting with H = 8!/2!4!
= 840 Now words with L start.
No. of words starting with LAA =
Since number of columns = 6!/2! = 360
number of rows Now LAB starts and first word
Hence it is considered as a starts with LABA.
square. No. of words starting with LABAA
∴ Hence required number of = 4! = 24
squares After this the next words will be
= 12 + 22 + 32 + … + 82 LABADAAHL, LABADAALH,
8 𝑥 9 𝑥 17
= = 204 LABADAHAL, LABADAHLA and
6
hence, Option (a) is the answer.
[∴ ∑ 𝑛2 =
10. Ans. (b)
𝑛(𝑛+1)(2𝑛+1)
] Solution: We will consider x = 7 to x
6
= 1.
7. Ans. (a) For x = 7, y + z = 5. No. of solutions
=4

[Type here] [Type here]

 Page 46 of 69

For x = 6, y + z = 6. No. of solution 9x9x8x7x6x5x4x3x2=9x

=5 9!
For x = 5, y + z = 7. No. of 17. Ans. (a)
solutions = 6 Solution: This question can be
For x = 4, y + z = 8. No. of rewritten as x > 0, y > 0, z > 0, x +y
solutions = 7 +z = 12. So, we have already given
For x = 3, y = z = 9. No. of 1 to y and 2 to z. Now, number of
solutions = 6 non-negative solutions is n+r-1Cr-1 p
For x = 2, y + z = 10. No. of where a =12 and r = 3. So, number
solutions = 5 of possible triplets is 12+3-1C3-1= 14C2
For x = 1, y + z = 11. No. of = 91
solutions = 4 Hence, the correct option is (a).
Hence number of solutions = 37 18. Ans. (a)
Hence, Option (b) is the answer. 19. Ans. (c)
11. Ans. (d) Solution: It is similar to x+y + z + r
Solution: As no three points are = 26 where x>0,y>0,z>0, and t > 0.
collinear, therefore every com- Now, we can first find the number of
bination of 3 points out of the nine cases;
points will give us a triangle. Hence, when all of x, y, z, and t are more
the answer is 9C3 or 84. Hence, than 0. Then, we can add the cases
Option (d) is correct. when t = 0.
12. Ans. (c) Case 1: x+y+z+t=26 and it must be
Solution: Total number of attempts = positive integral ; solution, that is, all
104 out of which one is correct. of the variables are greater than 0.
13. Ans. (d) Number of possible solutions =n-1Cr-
26-1
Solution: A chess board consists 9 1 (where r = 4 and n = 26) = C4-1_
25
parallel lines X 9 parallel lines. For a = C3 = 2300
rectangle we need to select 2 Case II t = 0. Then, x+y+z=26,
parallel lines and two other parallel where all are positive integers = n-
1
lines that are perpendicular to the Cr-1 = 26-1C3-1 = 25C2 = 300
first set. Hence, 9C2 x 9C2 So, total number of possible cases
14. Ans. (c) = 2300 + 300 = 2600;
15. Ans. (a) Hence, the correct option is (c). :
16. Ans. (c)
Solution: it will be a number of 9 20. Ans. (b)
digits with the following box Solution: Given a + b + c + d + e =
diagram: 20 (i)

[Type here] [Type here]

 Page 47 of 69

a+b+c=5 Number non-negative integral

(ii) solutions of equation (iii)
Given system of equation is = n+r-1Cr = 3+5-1C5 = 7C5
equivalent to a + b + c + = 5 Number of non-negative integral
(iii) solution of equation (iv)
And d + e = 15 = n+r-1Cr = 2+15-1C15 = 16C15
(iv) ∴ Required number = 7C5. 16C15 =
336

Exercise – 4

1. Ans. (c) = (1+2+3+4) x 3! X (1111) = 66660

Solution: 9 x 9 x 9 x 9 = 94 Hence the sum of the required
2. Ans. (a) numbers
Solution: Case I. MW MW MW MW = sum of all 5 digit numbers
Case II. WM WM WM WM including those numbers which
Let us arrange 4 men in 4! ways, begin with zero – sum of all 5 digit
then we arrange 4 women in 4P4 numbers which begin with zero =
ways at 4 places either left of the 2666640 – 66660 = 2599980
men or right of the men. Hence 5. Ans. (a)
required number of arrangements Solution: Total number of ways of
= 4!x 4P4 + 4! x 4P4 = 2 x 576 = 1152 arranging 16 people = 15! Ways
3. Ans. (c) Number of ways in which two
Solution: (C, C), (U, U), S, S, S, E, brothers are together = 14! x 2
F, L ∴ Number of ways in which two
These 8 letters now can be brothers are never together
arranged in
8!
ways. = 15! – 14! X 2
3!
= 14! (15-2) = 14! X 13
4. Ans. (a)
6. Ans. (b)
Solution: Total number of 5 digit
Solution: We can select atleast one
numbers (including which begins
item from 6 different items = (26-1)
with zero) = 5! = 120.
Similarly we can select atleast one
Number of 5 digit numbers which
item from other set of 6 different
begin with zero = 4! = 24.
items in (26 - 1) ways.
Sum of all 5 digit numbers.
Required number of ways = (26 -1)
= (0 + 1 + 2 + 3 + 4) x 4! X (11111)
(26 -1)6!
= 240 x 11111 = 2666640
= (26 - 1)2 = 3969
Sum of all five digit numbers which
7. Ans. (b)
begin with zero
[Type here] [Type here]
 Page 48 of 69

Solution: 16P4 = 43680 Alternatively: Total number of ways

8. Ans. (a) of selecting 4 women and 5
Solution: Total number of possible men = 9C4 x 7C5 = 2646.
outcomes = 64. Number of ways of selecting 4
The number of possible outcomes women and 5 men in which Ms.
in which 4 does not appear on any B and Mr. A re not present
die is 54. together
Therefore the number of possible = 8C3 x 6C4 = 840
outcomes in which atleast one Hence the number of ways in which
die shows digit 4 = 64 – 54 = Ms. B and Mr. A do not serve
671 together = 2646 – 840 = 1806
9. Ans. (b) 11. Ans. (c)
Solution: Case I: 0,1, 2, 4, 5 Solution: Available digits are 1, 2, 3,
Case II: 1, 2, 3, 4, 5 4 and 5. Now since we know that a
Since we know that a number is number is divisible by 4 if and only if
divisible by 3, if and only if the sum the number formed by last two digits
of its digits is divisible by 3. is divisible by 4. So the following
Case I, number of 5 digit numbers = cases are possible
4 x 4 x 3 x 2 = 96
Case II, number of 5 digit numbers Thousan Hundre Ten Un
= 5 x 4 x 3 x 2 = 120 ds ds s it
Total required numbers = 216 𝑥 𝑦 1 2
10. Ans. (d) 𝑥 𝑦 2 4
Solution: The number of ways of 𝑥 𝑦 3 5
choosing the committee when Ms, 𝑥 𝑦 5 2
Bs a member (when Mr. A refuses In each case thousands and
to serve) hundreds place can be filled up in
= 8C3 x 6C5 3
P2 ways.
= 56 x 6 = 336 Hence the required number of ways
The number of ways of choosing = 3P2 x 4 = 24.
the committee when Ms. Bs not a 12. Ans. (c)
member (when Mr. A can seve) Solution: Required number of ways
= 8C4 x 7C5 = 6P4.
= 70 x 21 = 1470 13. Ans. (c)
Thus the required number of ways = Solution: Required number of ways
336 + 1470 = 1806. = 16C9.
14. Ans. (a)

[Type here] [Type here]

 Page 49 of 69

Solution: Since each digit of a 10 = 485

digit number can be written as .
either 2 or 3, therefore required 18. Ans. (c)
number of 10 digit number is 210. Solution: First arrange 6 pups in 6
15. Ans. (b) places in 6! ways.
Solution: Digit 5 can be placed in This will leave us with 7 places for 4
any one of the 4 places in 4 way cats. Answer = 6! x 7𝑝4
Now the remaining 3 places can be 19. Ans. (b)
filled up with remaining 8 digits in 83 Solution: Arrangement of M, A, N,
ways. A, E, M, E, N, T is
Hence, the required number of 9!
=
2!x 2! x 2!x 2!
ways = 4 x 83 = 2048.
20. Ans. (a)
16. Ans. (a)
Solution: First make the six law
Solution: Digit 2 can be arranged in
8𝑃2
students sit in a row. This can be
two places out of 8 places in done in 6! Ways. Then, there would
2!
Ways. be 7 places for the MBA students.
Now, the remaining 6 places can be We need to select 5 of these 7
filled by the rest 3 digits in 36 ways. places for 5 MBA students and then
Hence, the required number of arrange these 5 students in those 5
8𝑃2 places. This can be done in 7C5 x 5!
ways = X 36
2!
Ways.
Thus, the answer is: 6! x 7C5 x 5!
= 8C2 x 36 = 20412
= 7! x 6!/2!
17. Ans. (a)
21. Ans. (b)
Solution: There are four possible
Solution: “Total number of all 10-
cases.
digits numbers - Total number of all
10-digits numbers with no digit
repeated” will give the required
answer.
= 9 x 109’ - 9 x 9P8
22. Ans. (a)
Hence, the required number of
Solution: Select the two positions
ways.
for the two 3’s. after that the
= (4C3 x 4C3) + (3C1 x 4C2) (4C2 x
3 remaining 5 place have to be filled
C1) + (4C2 x 4C1) (4C1 x 3C2) +
using either 1 or 2.
(3C3 x 3C3)
Thus, 7C2 x 25
= (4 x 4) (3 x 6 x 6 x 3) + (3 x 4 x
23. Ans. (a)
4 x 3) + (1 x 1)

[Type here] [Type here]

 Page 50 of 69

Solution: Let the three people be A, side A) and 2 persons on the other
B and C. side (assume side B). So, we are
If 1 person gets no objects, the 7 supposed to select 4 persons for
objects must be distributed such side A from the remaining 10
that each of the other two get 1 persons and remaining 6 per sons
object at least. will be sitting on side B.
This can be done as 6 & l, 5 & 2, Number of ways 4 persons can be
4 & 3 and their rearrangements. selected from 10 per sons = 10C4
The answer would be Number of ways 6 persons can be
(7C6 + 7C5 + 7C4) x 3! selected from the remaining 6
= 378 persons = 6C6
Also, two people getting no Number of ways 8 persons can be
objects can be done in ways, arranged on side A = 8!
Thus, the answer is 378 + 3 = 381 Number of ways 8 persons can be
24. Ans. (c) arranged on side B = 8!
Solution: Natural numbers which Total number of ways = 10C4 x 6C6 x
consist of the digits 1,2,3, 4. and 5 8! x 8!
and are divisible by 4 must have 28. Ans. (b)
either 12, 24,32 or 52 in the last two Solution: It is the simple case of
places. For the other two places we derangement with n = 4.
have to arrange three digits in two Use the following formula:
places. 1 1 1
𝑛(1 − + − +
1! 2! 3!
25. Ans. (b) 𝑛 1
⋯ . +(−1) )
26. Ans. (c) 𝑛!
27. Ans. (c) Hence answer = 4! (1-1 + ½ -1/6 +
Solution: Four persons have chosen 1/24) = 9
to sit on one particular side (assume

Exercise – 5
1. 28 ➔u+v+w=6
Solution: Let x, y , z be the number ∴ Total number of solutions = 6+3-
1
of balls received by the three C3-1 = 8C2 = 28
persons, then 2. Ans. 1587600
x ≥ 5, y ≥ 5, z ≥ 5 and x + ty+ z = Solution: H L C N T
21 A U I O
Let u ≥ 0, v ≥ 0, w ≥ 0, then L N A I
∴ x + y + z = 21 There are total 13 letters out of
➔ u + 5 + v + 5 + w + 5 = 21 which 7 are consonants and 6

[Type here] [Type here]

 Page 51 of 69

are vowels. Also there are 2L's, Solution: Total number of points =
2N's, 2A's, and 21' s. 12
If all the consonants are together Total number of triangles = 12C3
then the number of But there are 3 cases which must
7! be excluded for the required
arrangements =
2!.2!
number of triangles.
But the 7 consonants can be
Case 1. The number of triangles
arranged themselves in =
7! formed by 3 points on
𝑤𝑎𝑦𝑠 AB = 3C3=1
2!.2!
= (1260)2 = Case 2. The number of triangles
1587600 formed by 4 points on
3. Ans. 4096 BC = 4C3 = 4
Solution: Every ball can be Case 3. The number of triangles
distributed in 4 ways. formed by 5 points on
Hence the required number of ways CA = 5C3 = 10
= 4 x 4 x 4 x 4 x 4 x 4 = 46 = 4096 Hence, the required number of
4. Ans. 6804 triangles = 220 - (10 + 4 + 1)
Solution: = 205
7. Ans. 15
Solution: 6C2 = 15.
8. Ans. 2460
Solution: Total number of rectangles
= (1 + 2 + 3 + …..
+ 12) x (1 + 2 + … + 8)

12 𝑥 13 8𝑥9
= x = 2808
2 2
Total number of squares
= (12x8) +.(11x7) + (10 x 6) +. ..
+ (5 x 1) = 348
Hence the required number of ways
∴ Required number of rectangles
= 4 x 93 + 6 x 8 x 92
= 2808 - 348 = 2460
= 92 (36 + 48)
Hint: Number of squares =
= 81 x 84 = 6804 8
∑𝑟=1(13 − 𝑟)(9 − 𝑟)
5. Ans. 24
9. Ans. 12
Solution: 4 x 6 = 24
Solution: There are 12 ways' as
follows :
6. Ans. 205

[Type here] [Type here]

 Page 52 of 69

(9, 0, 0), (8,1, 0), (7, 2,0), (6, 3, 0), Thus the number of numbers is
(5,4,0), (7,1,1), (6, 2,1), (5, 3,1), 24 x 8 = 192
(5,2, 2), (4,4,1) (4, 3, 2), (3,3,3). 13. Ans. 325
10. Ans. 71 Solution: One digit no. = 5;
Solution: Two digit no = 5 x 4 = 20;
Three digit no = 5x4x3 = 60;
Number Number Number of four digit no = 5 x 4 x 3x2 = 120;
of Similar of Selections Five digit no.= 5 x 4 x 3 x 2 x 1 = 120
letters Different Total number of no = 325.
Letters 14. Ans. 1260
5 0 1
C1 = 1 Solution: 4C1 x 7C3 x 3! = 840
4 1 4
C1 x 2C1 = 15. Ans. 17
8 Solution: 200 runs can be scored by
3 2 3
C1 x 4C2 = scoring only fours or through a
18 combination of fours and sixes.
3 0 3
C1 x 3C1 = Possibilities are 50 x 4, 47 x 4 + 2 x
2 9 6, 44 x 4 + 4 x 6 … A total of 17 ways.
2 1 4
C2 x 3C1 = 16. Ans. 36000
2 18 Solution: Required permutations =
2 3 4
C1 x 4C3 = Total permutations with no condition
16 - permutations with the conditions
0 5 5
C5 = 1 which we do not have to count.
17. Ans. 28
Hence the total number of :
selections 18. Ans. 1
= 1 + 8 + 18 + 9 + 18 + 16 + 1 = 71
11. Ans. 28
Solution: For a straight line we just
need to select 2 points out of the 8
points available. 8C2 would be the
number of ways of doing this.
12. Ans. 192
Solution: With the digits 1, 2, 3, 4, 5
and 6 the numbers divisible by 4 that
can be formed are numbers ending
in: 12, 16, 24, 32, 36, 52, 56 and 64.
Number of numbers ending in 12
are: 4 x 3 x 2 = 24
[Type here] [Type here]
 Page 53 of 69

Percentile Classes
Permutation and Combination

Exercise 06
Extra Practice
1. If the best and the worst paper never appear together, then six examination papers can be arranged in how
many ways

2. The number of seven digit integers, with sum of the digits equal to 10 and formed by using the digits 1, 2
and 3 only, is
(a) 55 (b) 66 (c) 77 (d) 88

3. The number of ways in which 6 rings can be worn on the four fingers of one hand is
(a) 46 (b) 6
C4 (c) 64 (d) None of these

4. How many numbers can be formed from the digits 1, 2, 3, 4 when the repetition is not allowed
4 4 4
(a) p4 (b) p3 (c) p1 + 4 p2 + 4 p3 (d) 4
p1 + 4 p2 + 4 p3 + 4 p4

5. How many numbers greater than 24000 can be formed by using digits 1, 2, 3, 4, 5 when no digit is repeated

6. Total number of four digit odd numbers that can be formed using 0, 1,2, 3, 5, 7 are
(a) 216 (b) 375 (c) 400 (d) 720

7. Numbers greater than 1000 but not greater than 4000 which can be formed with the digits 0, 1, 2, 3, 4
(repetition of digits is allowed), are

8. The number of numbers that can be formed with the help of the digits 1, 2, 3, 4, 3, 2, 1 so that odd digits
always occupy odd places, is
(a) 24 (b) 18 (c) 12 (d) 30

9. If eleven members of a committee sit at a round table so that the President and Secretary always sit together,
then the number of arrangements is
(a) 10!  2 (b) 10! (c) 9!  2 (d) None of these

10. The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit
together is given by
(a) 6!  5! (b) 30 (c) 5!  4! (d) 7!  5!

11. The number of ways four boys can be seated around a round-table in four chairs of different colors' is
(a) 24 (b) 12 (c) 23 (d) 64

12. The number of ways that 8 beads of different colors be string as a necklace is

13. In how many ways a garland can be made from exactly 10 flowers
9!
(a) 10! (b) 9! (c) 2 ( 9!) (d)
2

14. A man has 7 friends. In how many ways he can invite one or more of them for a tea party
(a) 128 (b) 256 (c) 127 (d) 130

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 54 of 69

15. There are 12 volleyball players in all in a college, out of which a team of 9 players is to be formed. If the
captain always remains the same, then in how many ways can the team be formed

15
16. The value of C3 + 15C13 is
16 30 15 15
(a) C3 (b) C16 (c) C10 (d) C15

17. In a city no two persons have identical set of teeth and there is no person without a tooth. Also no person
has more than 32 teeth. If we disregard the shape and size of tooth and consider only the positioning of the
teeth, then the maximum population of the city is
(a) 232 (b) ( 32 )2 − 1 (c) 232 − 1 (d) 232−1

18. In a mathematics paper there are three sections containing 4, 5 and 6 questions respectively. From each
section 3 questions are to be answered. In how many ways can the selection of questions be made.

19. A person is permitted to select at least one and at most n coins from a collection of ( 2n + 1) distinct coins.
If the total number of ways in which he can select coins is 255, then n equals

20. How many numbers of 6 digits can be formed from the digits of the number 112233
(a) 30 (b) 60 (c) 90 (d) 120

21. In how many ways can 5 red and 4 white balls be drawn from a bag containing 10 red and 8 white balls
8
(a) C5  10C4 (b) 10
C5  8C4 (c) 18
C9 (d) None of these

22. In an election the number of candidates is 1 greater than the persons to be elected. If a voter can vote in
254 ways, then the number of candidates is

23. A student is allowed to select at most n books from a collection of ( 2n + 1) books. If the total number of ways
in which he can select one book is 63, then the value of n is
(a) 2 (b) 3 (c) 4 (d) None of these

24. The number of triangles that can be formed by 5 points in a line and 3 points on a parallel line is
8 8
(a) C3 (b) C3 − 5C3 (c) 8
C3 − 5C3 − 1 (d) None of these

25. The number of diagonals in a octagon will be

(a) 28 (b) 20 (c) 10 (d) 16

26. If a polygon has 44 diagonals, then the number of its sides are
(a) 7 (b) 11 (c) 8 (d) None of these

27. How many triangles can be formed by joining four points on a circle
(a) 4 (b) 6 (c) 8 (d) 10

28. The number of straight lines that can be formed by joining 20 points no three of which are in the same straight
line except 4 of them which are in the same line

29. The number of diagonals of a polygon of m sides is

1 1
(a) m (m − 5) (b) m ( m − 1)
2! 2!
1 1
(c) m (m − 3) (d) m ( m − 2)
2! 2!

30. Given six line segments of lengths 2, 3, 4, 5, 6, 7 units, the number of triangles that can be formed by these
lines is

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 55 of 69

6 6 6 6
(a) C3 − 7 (b) C3 − 6 (c) C3 − 5 (d) C3 − 4

31. The number of triangles that can be formed by choosing the vertices from a set of 12 points, seven of which
lie on the same straight line, is

32. There are n points in a plane of which p points are collinear. How many lines can be formed from these
points
(a) (
n−p)
C2 (b) nC2 − pC2
n
(c) C2 − pC2 + 1 (d) n
C2 − pC2 − 1

33. Let Tn denote the number of triangle which can be formed using the vertices of a regular polygon of n
sides. If Tn +1 − Tn = 21, then n equals
(a) 5 (b) 7 (c) 6 (d) 4

34. The number of parallelograms that can be formed from a set of four parallel lines intersecting another set of
three parallel lines is
(a) 6 (b) 18 (c) 12 (d) 9

35. Six points in a plane be joined in all possible ways by indefinite straight lines, and if no two of them be
coincident or parallel, and no three pass through the same point (with the exception of the original 6 points).
The number of distinct points of intersection is equal to
(a) 105 (b) 45 (c) 51 (d) None of these

36. There are n straight lines in a plane, no two of which are parallel and no three pass through the same point.
Their points of intersection are joined. Then the number of fresh lines thus obtained is
n ( n − 1)( n − 2 )
(a)
8
n ( n − 1)( n − 2 )( n − 3 )
(b)
6
n ( n − 1)( n − 2 )( n − 3 )
(c)
8
(d) None of these

37. A parallelogram is cut by two sets of m lines parallel to its sides. The number of parallelograms thus formed
is

( mC2 ) ( m+1C2 ) ( m+2C2 )

2 2 2
(a) (b) (c) (d) None of these

38. In a plane there are 37 straight lines of which 13 pass through the point A and 11 pass through the point B
Besides no three lines pass through one point, no line passes through both points A and B and no two are
parallel. Then the number of intersection points the lines have is equal to
(a) 535 (b) 601 (c) 728 (d) None of these

39. How many numbers lying between 10 and 1000 can be formed from the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 (repetition
is allowed)
(a) 1024 (b) 810 (c) 2346 (d) None of these

40. The number of ways in which the letters of the word TRIANGLE can be arranged such that two vowels do
not occur together is
(a) 1200 (b) 2400 (c) 14400 (d) None of these

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 56 of 69

41. There are four balls of different colours and four boxes of colours same as those of the balls. The number of
ways in which the balls, one in each box, could be placed such that a ball does not go to box of its own
colour is
(a) 8 (b) 7 (c) 9 (d) None of these

42. Ten different letters of an alphabet are given. Words with five letters are formed from these given letters.
Then the number of words which have at least one letter repeated is

43. The number of ways of dividing 52 cards amongst four players so that three players have 17 cards each and
the fourth player just one card, is
52! 52!
(a) (b) 52! (c) (d) None of these
(17!)3 17!

44. The number of ways in which the letters of the word ARRANGE can be arranged such that both R do not
come together is
(a) 360 (b) 900 (c) 1260 (d) 1620

45. 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
(a) 64 (b) 45 (c) 46 (d) None of these

46. A five digit number divisible by 3 has to be formed using the numerals 0, 1, 2, 3, 4 and 5 without repetition.
The total number of ways in which this can be done is

47. The number of times the digit 3 will be written when listing the integers from 1 to 1000 is

48. The number of ways in which an examiner can assign 30 marks to 8 questions, awarding not less than 2
marks to any question is
21 30 21
(a) C7 (b) C16 (c) C16 (d) None of these

49. How many words can be made out from the letters of the word INDEPENDENCE, in which vowels always
come together

50. The letters of the word COCHIN are permutated and all the permutations are arranged in an alphabetical
order as in an English dictionary. The number of words that appear before the word COCHIN is
(a) 360 (b) 192 (c) 96 (d) 48

Practice Exercise
Solutions
1. Sol Answer ; 480 If the 7!
Number of numbers = = 35
best and the worst appear always together, the 4!3!
number of ways 5!  2. Therefore required Total number of numbers = 42 + 35 = 77.
number of
ways are 6!− 5!  2 = 480. 3. Sol (a) Starting with the
first rings. Number of ways it can be
2. Sol (c) There are two worn are 4 as. Now for the second ring it can
possible cases also be
` Case I : Five 1' s, one 2' s, one 3' s, worn in any of the four fingers so number of
ways are 4
7!
Number of numbers = = 42 and this is similar for all the six rings. So
5! number of
Case I I : Four 1' s, three 2' s,
ways are 4  4  4  4  4  4 = 46

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 57 of 69

be arranged in the three even places in

4. Sol (d) Number of 1 digit 3!
4
= 3 ways.
numbers = P1 2!
Hence the required number of ways
Number of 2 digit numbers = 4P2
= 6  3 = 18.
Number of 3 digit numbers = 4P3
Number of 4 digit numbers = 4P4
9.Sol (c) Required number of
Hence the required number of ways
ways 9! 2.
= 4P1 + 4P2 + 4P3 + 4P4 . {By fundamental property of circular
permutation}.
5.Sol Answer ; 84
The digits are 1, 2, 3, 4, 5. We have to form number 10. Sol (a) No. of ways in which
greater than 24000. 6 men can be arranged at a round table
Required number will be = (Total) - (Those = ( 6 − 1)!
beginning with 1) - (Those beginning with 21) -
(Those beginning with 23)
= 5!− 4!− 3!− 3! = 120 − 24 − 6 − 6 = 84
Alter: No starting with 24   = 3 = 6 
No. starting with 25   = 6
No. starting with 3  ,4    and
5    3  [4 = 72
Total Numbers = 72 + 12 = 84

6.Sol (d) The last place can

be filled by 1, 3, 5, 7 as the number is to be
odd. Therefore, the digit at the extreme right
can be filled by 4 ways. The digit at the Now women can be arranged in 6 p5 = 6! ways.
extreme left can be filled by 5 ways as zero
has to be excluded and the remaining II and 11. Sol (a) No. of ways in which
III positions can be filled by 6 ways each. 4 boys can be be seated = ( 4 − 1)! = 3! = 6
Hence total no. of ways are  Chairs of different colour = 4
5  6  6  4 = 720.  Total number of ways = 6  4 = 24.

7.Sol Answer ; 375 12. Sol Answer ; 2520

Numbers greater than 1000 and less than or equal 8 different beads can be arranged in circular from in
to 4000 will be of 4 digits and will have either 1 (8 - 1)! = 7! ways. Since there is no distinction
(except 1000) or 2 or 3 in the first place with 0 between the clockwise and anticlockwise
in each of remaining places. arrangement. So the required number of
After fixing l a place, the second place can be 7!
filled by any of the 5 numbers. Similarly third arrangement = = 2520.
2
place can be filled up in 5 ways and 4 th place
can be filled up in 5 ways. Thus there will be
13. Sol (d) A garland can be
5  5  5 = 125 ways in which 1 will be in first
1
place but this include 1000 also hence there will made from 10 flowers in ( 9!) ways.
be 124 numbers having 1 in the first place. 2
Similarly 125 for each 2 or 3. One number will { n flowers' garland can be made in
1
be in which 4 in the first place and i.e. 4000. ( n − 1)! ways}
Hence the required numbers are 124 +125 2
+125 +1 = 375 ways.
14. Sol (c) Required number of
8.Sol (b) The 4 odd digits 1, ways = 27 − 1 = 127.
3, 3, 1 can be arranged in the 4 odd places in {Since the case that no friend be invited i.e.,
4!
= 6 ways and 3 even digits 2, 4, 2 can 7
C0 is excluded}.
2!2!

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 58 of 69

15. Sol Answer ; 165  2n = 28  n = 8.

Required number of ways = 11C8 = 165.
{Since, captain already be chose, so now from 23. Sol (b) Since the student is
11 players 8 are to be chosen.} allowed to select at most n books
out of ( 2n + 1) books, therefore in order to
16. Sol (a) select one
15 15 15 15 16
C3 + C13 = C3 + C2 = C3 book he has the choice to select one, two,
three, ....., n books.
17. Sol (c) We have 32 places Thus, if T is the total number of ways of
for teeth. For each place we have selecting one
book then
two choices either there is a tooth or there is no
tooth. T = 2n +1C1 + 2n +1C2 + ... + 2n +1Cn = 63 ........ (i)
Therefore the number of ways to fill up these Again the sum of binomial coefficients
places is
232. As there is no person without a tooth, the 2n +1 2n +1 2n +1 2n +1 2n +1
C0 + C1 + C2 + ... + Cn + Cn +1
32
maximum population is 2 −1

18. Sol Answer ; 800 2n +1

+ 2n +2Cn +2 + .... + C2n +1 = (1 + 1)
2n +1
= 22n +1
Mathematics paper has three sections.
A → 4 Question, B → 5 Question, C → 6 or
Question
Each section we have to select 3 question.
2n +1
C0 + 2 ( 2n+1C1 + 2n+1C2 + ...... + 2n+1Cn ) + 2n+1C2n+1
22n +1
 Total no. of ways = 4C3 . 5C3 . 6C3 = 800.  1 + 2 (T ) + 1 = 22n +1  1 + T = = 22n
2
19. Sol Answer ; 4  1 + 63 = 22n  26 = 22n  n = 3.
Since the person is allowed to select at most n coins
out 24. Sol (c) The required
of ( 2n + 1) coins, therefore in order to select 8
number of ways = C3 − C3 − C3 . 5 3

one, two, {Since total points are 8, but 5 are collinear and
three, ...., n coins. Thus, If T is the total other
number of three are also collinear}.
2n +1 2n +1 2n +1
T = C1 + C2 + ..... + Cn = 255
Again the sum of binomial coefficients 25. Sol (b) Required number of
8
ways are = C2 − 8 = 20.
2n +1
= 2n +1
C0 + 2n +1
C1 + 2n +1
C2 + .... + 2n +1
Cn + 2n +1
Cn +1 + 2n +1
Cn +2 + ... + C2n +1 = (1 + 1)
2n +1
= 255
26. Sol (b) Since

( 2n+1C1 + 2n+1C2 + ... + 2n+1Cn ) + 2n+1C2n+1 = 2n+1C=2n+C12=−2n2n=+144  n = 11.

2n +1 n
 C0 + 2

22n +1
 1 + 2 (T ) + 1 = 22n +1  1 + T = = 22n 27. Sol (a) Required number of
2
ways = 4C3 = 4.
2n 2n 8
 1 + 255 = 2 2 = 2  n = 4.
28. Sol Answer ; 185
20. Sol (c) Required number of
6! Required number = 20C2 − 4C2 + 1
ways = = 90.
2!2!2! 20  19 4  3
= − + 1 = 190 − 6 + 1 = 185.
2 2
21. Sol (b) Required number
10 8 29. Sol (c) Required number of
= C5  C4
m
diagonals = C2 − m
22. Sol Answer ; 8 m ( m − 1) m
let there are n candidates then = − m = ( m − 3 ).
2! 2!
n
C1 + nC2 + .... + nCn −1 = 254  2n − 2 = 254

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 59 of 69

30. Sol (a) = 6C3 − 7 excluding therefore n straight lines intersect at nC2 = N
( 2,3,5 )( 2,3,6 )( 2,3,7 )( 2,4,6 )( 2,4,7 )( 2,5,7 )(3,4,7 ). (say) points. Since two points are required to
determine a straight line, therefore the total
31. Sol Answer ; 185 number of lines obtained by joining N points
N
Required number of ways 12
C3 − 7C3 C2 .But in this each old line has been
= 220 − 35 = 185. counted n −1C2 times, since on
each old line there will be n − 1 points of
intersection made by the remaining ( n − 1)
32. Sol (c) Given, total number
of points = n and number of
lines.
collinear points = p. We know that one line has
Hence the required number of fresh lines is
two
N ( N − 1) n ( n − 1)( n − 2 )
end points. Therefore total number of lines N
C2 − n. n −1C2 = −
n 2 2
C2 .
Since p points are collinear, therefore total
number of
n
C2 ( nC2 − 1) − n ( n − 1)( n − 2) = n (n − 1)(n − 2)(n − 3)
lines drawn from collinear points PC2 . We also 2 2 8
know that, corresponding to the line of
37. Sol (c) Each set is having
collinearity, one
m + 1 parallel lines and each parallelogram is
will also be added.
formed by choosing two straight lines from
Therefore number of lines = nC2 − PC2 + 1 the first set and two straight lines from the
second set. Two straight lines from the first
33. Sol (b) Clearly, nC3 = Tn . set can be chosen in m + 2C2 ways and two
So, straight lines from the second set can be
n +1 n
C3 − C3 = 21  ( n n
) n
C3 + C2 − C3 = 21 chosen in m + 2C2 ways.
 nC2 = 21or n ( n − 1) = 42 = 7.6  n = 7 Hence the total number of parallelograms

( m+2C2 )
2
m+2
formed = C2 . m +2C2 = .
34. Sol Answer ; 18
Required number of ways 4C2  3C2 = 18. 38. Sol Answer ; 535
The number of points of intersection of 37 straight
35. Sol Answer ; 51 lines is 37C2 But 13 of them pass through the
Number of lines from 6 points 6C2 = 15 . Points of
point A . Therefore instead of getting 13C2
intersection obtained from these lines
points we get merely one point.
15
C2 = 105 Similarly 11 straight lines out of the given 37
Now we find the number of times, the original 6 straight lines intersect at B . Therefore instead
points come. Consider one point say A1 . of getting 11C2 points, we get only one point.
Joining A1 to remaining 5 Hence the number of intersection points of the
points, we get 5 lines, and any two lines from lines is 37C2 − 13C2 − 11C2 + 2 = 535.
these 5
lines give A1 as the point of intersection
39. Sol (b) Between 10 and
5
 A1 come C2 = 10 times in 105 points of 1000, the numbers are of 2 digits and 3 digits.
intersections. Since repetition is allowed, so each digit can be
 Similar is the case with other five points. filled in 9 ways.
 6 original points come 6  10 = 60 times in Therefore number of 2 digit numbers
points of = 9  9 = 81
= 105 − 60 + 6 = 51 and number of 3 digit numbers
= 9  9  9 = 729
36. Sol (c) Since no two lines Hence total ways = 81 + 729 = 810
are parallel and no three are concurrent,
40. Sol (c) •T • R • N • G • L

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 60 of 69

Three vowels can be arranged at 6 places in (iii) 3 black balls and no other = 3C3 = 1
6
P3 ways = 120 ways. Hence the required  Total numbers of ways = 45 + 18 + 1 = 64.
number of Alter : Number of ways in which atleast one
arrangements = 120  5! = 14400. black ball can be taken
= Total ways - ways in which no black ball can
41. Sol (c) Since number of be taken out
derangements in such a problems is = 9C3 − 6C3 = 84 − 20 = 64
 1 1 1 1 n 1
given by n ! 1 − + − + − ....... ( −1) 
 1! 2! 3! 4! n!  46. Sol Answer ; 216
 Number of derangements are We know that a five digit number is divisible by 3, if
1 1 1 and only if sum of its digits is divisible by 3,
= 4  − +  = 12 − 4 + 1 = 9 therefore we should not use 0 or 3 while
 2! 3! 4! 
forming the five digit numbers. Now, (i) In case
we do not use 0 the five digit number can be
42. Sol Answer ; 69760
Number of words in which all the 5 letters are formed (from the digit 1, 2, 3, 4, 5) in 5P5 ways
repeated (ii) In case we do not use 3, the five digit
= 105 = 100000 and the number of words in number can be formed (from the digit 0, 1, 2, 4,
5) in
which no letter is repeated are 10P5 = 30240.
= 5P5 − 4P4 = 5!− 4! = 120 − 24 = 96
Hence the required number of ways are
 The total number of such 5 digit number
100000 − 30240 = 69760
= 5P5 + ( 5P5 − 5P5 − 4P4 ) = 120 + 96 = 216.
43. Sol (a) For the first set
52
number of ways are C17 . Now out of 35 47. Sol Answer 300
cards left 17 cards can be put for second in Numbers between 1 to 1000 will be one digit, two
35 18 digit and three digit nos. Hence no. of single
C17 ways similarly for 3rd in C17 One
digit nos. will be = l.
card for the last set can be put in only one Number of two digit no. will be
way. Therefore the required number of ways (i) When 3 is at the unit place then fens place
for the proper distribution can be filled by 9 ways hence 9  1 = 9 ways.
52! 35! 18! 52! (ii) When 3 is at the tens place then unit place
=    1! =
35!17! 18!17! 17!1! (17!)3 can be filled by 10 ways hence 1 10 = 10
ways.
Number of 3 digit nos.
44. Sol (b) The word
ARRANGE, has AA, RR, NGE letters, that is (i) 9 10 1 so9  10 = 90 ways
two A's, two R's and N, G, E one each (ii) 9 1 10 so9  10 = 90 ways
 The total number of arrangements (iii) 110 10 = 100 ways
7!
= = 1260 So, 100 + 90 + 90 = 280.
2!2!1!1!1! Total nos. of times in. which 3 is used
But, the number of arrangements in which both = 1 + 19 + 280 = 300
RR are together as one unit
6!
= = 360 48. Sol (a) Since the minimum
2!2!1!1!1!1! marks to any question is two, the maximum
 The number of arrangements in which both R marks that can be assigned to any questions
is do not come together = 1260 − 360 = 900. is 16 ( = 30 − 2  7 ) , n1 + n2 + .... + n8 = 30. If

45. Sol Answer 64 ni are the marks assigned to ith questions,

A selection of 3 balls so as to include at least one then n1 + n2 + ....... + n8 = 30 with 2  n1  16
black ball, can be made in the following 3
for i = 1,2,......,8 . Thus the required number
mutually exclusive ways
(i) 1 black ball and 2 others of ways
= the coefficient of
= 3C1  6C2 = 3  15 = 45
( )
8
(ii) 2 black balls and one other x 30 in x16 x 2 + x 3 + .... + x16
= 3C2  6C1 = 3  6 = 18

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 61 of 69

( )
8
= the coefficient of x 30 in x16 1 + x + .... + x14
8
30 16
 1 − x15 
= the coefficient of x in x  
 1− x 
 

( )
−8 8
= the coefficient of x14 in (1 − x ) . 1 − x15

= the coefficient of x14 in

 8
1 + x +
 1!
8.9 2 8.9.10 3
2!
x +
3!


(
x + .... 1 − 8C1x15 + ....... )
= the coefficient

x14 in 1 + 8C1x + 9C2 x 2 + 10C3 x 3 + .... 
since the second bracket has powers of x 0 , x15
etc.
21 21
C14 = C7
Alter: First assign 2 marks to each question.
Now remaining marks are 14 and they have to
assign 8 questions. So, no. of ways
8 +14 −1 21
C8−1 = C7

49. Sol Answer ; 16800

8! 5!
Required number of ways are  = 16800.
2!3! 4!
{Since IEEEENDPNDNC = 8 letters}.

50. Sol Answer : 96

According to dictionary
CC HINO ⎯⎯→ 4!
CH CINO ⎯⎯→ 4!
CI CHNO ⎯⎯→ 4!
CN CHIO ⎯⎯→ 4!
CO CHIN ⎯⎯→ it self
Total ways=44!=96

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 62 of 69

Percentile Classes
OLD is GOLD 15
Permutation Combination Probability
Exam (Indore) IPM (I) 2019 IPM (I) 2020 IPM (I) 2021 IPM (I) 2022 IPM (I) 2023 Total
Number of 03 02 01 05 07 18
Questions

Exam (JIPMAT) JIPMAT 2021 JIPMAT 2022 JIPMAT 2023 Total

Number of 00 01 03 04
Questions

Important Note:
Before solving past year questions, complete your class
sheets and Super 300 Series (Part 14, 15 and 16).
Download pdf from Percentile Telegram Channel
@percentileclasses
Name of file: OLD is GOLD 15 IPM 2024
All Percentile Classes eBooks are updated, now you can find
last exercise of all chapters as Past Year Questions

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 63 of 69

Past Year Questions (IPM Indore)

(Permutation Combination & Probability)
1. From a pack of 52 cards, we draw one by one, without replacement. If
f(n) is the probability that an Ace will appear at the nth turn, then
(IPM Indore 2019)
1 1
(a) f(2) = > f(3) (b) > f(2) > f(3)
13 13
1 1
(c) f(3) > f(2) = (d) f(2) = f(3) =
13 13

2. A die is thrown three times and the sum of the three numbers is found to
be 15. The probability that the first throw was a four is (IPM Indore 2019)
1 1 1 1
(a) (b) (c) (d)
6 4 5 10

3. How many different numbers can be formed by using only the digits 1
and 3 which are smaller than 3000000? (IPM Indore 2019)
(a) 64 (b) 128 (c) 190 (d) 254

4. A man is known to speak the truth on an average 4 out of 5 times. He

throws a die and reports that it is a five. The probability that it is actually a
five is (IPM Indore 2020)
4 5 4 2
(a) (b) (c) (d)
9 9 15 15

5. Out of 13 objects, 4 are indistinguishable and rest are distinct. The

number of ways we can choose 4 objects out of 13 objects is
_____________. (IPM Indore 2020)

6. The number of 5-digit numbers consisting of distinct digits that can be

formed such that only odd digits occur at odd places is (IPM Indore 2021)
(a)5250 (b) 6240 (c) 2520 (d) 3360

7. Mrs and Mr Sharma, and Mrs and Mr Ahuja along with four other persons
are to be seated at a round table for dinner. If Mrs and Mr Sharma are to
be seated next to each other, and Mrs and Mr Ahuja are not to be seated

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 64 of 69

next to each other, then the total number of seating arrangements is

_________. (IPM Indore 2022)

8. The number of triangles that can be formed by choosing points from 7

points on a line and 5 points on another parallel line is (IPM Indore 2022)

9. In how many ways can the letters of the word MANAGEMENT be arranged
such that no two vowels appear together? (IPM Indore 2022)
(a) 37800 (b) 75600 (c) 25200 (d) 21600

10. Let A = (1, 2, 3} and B = {a, b}. Assuming all relations from set A to set
B are equally likely, what is the probability that a relation from A to B is also
a function? (IPM Indore 2022)
(a) 1
1
(b)
8
1
(c)
2
32
(d)
26

11. If one of the factors of the number 37 28 173 is randomly chosen, then
the probability that the chosen factor will be a perfect square is.
(IPM Indore 2022)
5
(a)
36
5
(b)
32
1
(c)
12
3
(d)
40

12. The total number of positive integer solutions of 21 ≤ a + b + c ≤ 25

is______. (IPM Indore 2023)

13. In a chess tournament, there are four groups, each containing an equal
number of players. Each player plays (IPM Indore 2023)
• against every other player belonging to one's own group exactly
once;
PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN
 Page 65 of 69

• against each player belonging to one of the remaining three groups

exactly twice;
• against each player belonging to one of the remaining two groups
exactly three times; and
• against each player belonging to the remaining group exactly four
times.
• If there are more than 1000 matches being played in the tournament,
the minimum possible number of players in each group is_______.

14. The probability that a randomly chosen positive divisor of 102023 is an

integer multiple of 102001 is (IPM Indore 2023)
22
(a)
2023
23
(b)
2024
222
(c)
20232
232
(d)
2024 2

15. A rabbit is sitting at the base of a staircase which has 10 steps. It

proceeds to the top of the staircase by climbing either one step at a time
or two steps at a time. The number of ways it can reach the top is
(IPM Indore 2023)
(a) 34 (b) 55 (c) 144 (d) 89

16. The minimum number of times a fair coin must be tossed so that the
probability of getting at least one head exceeds 0.8 is (IPM Indore 2023)
(a) 6 (b) 5 (c) 7 (d) 3

17. Consider an 8 × 8 chessboard. The number of ways 8 rooks can be

placed on the board such that no two rooks are in the same row and no
two are in the same column is (IPM Indore 2023)
(a) 7! (b) 8 (c) 8! (d) 7

18. If a three-digit number is chosen at random, what is the probability that

it is divisible neither by 3 nor by 4? (IPM Indore 2023)
(a) 1/3 (b) 2/3 (c) ¼ (d) 1/2

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 66 of 69

Past Year Questions (JIPMAT)

(Permutation Combination & Probability)

1. Given below are two statement based on the following

If A and B are independent events such that P(A) = p, P(B) = 2p and P
5
(exactly one of A,B)=
9
1
Statement I: 𝑝 =
3
5
Statement II: 𝑝 =
12
In the light of the above statements, choose the correct answer form the
question given below (JIPMAT 2022)
(a) Both Statement I and Statement II are true
(b) Both Statement I and Statement II are false
(c) Statement I is true but Statement II is false
(d) Statement I is false but Statement II is true

2. Let A and B be two events such that P(a)=0.25, P(b)=0.50 and P(A∩
B)=0.14. The probability that neither A nor B occurs is (JIPMAT 2023)
(a) 0.09 (b) 0.19 (c) 0.39 (d) 0.29

3. Given below are two statements in the context of throwing two different
dice together: (JIPMAT 2023)
Statement (I): The probability that the two numbers obtained have even
sum, is 0.50.
Statement (II): The probability that the two numbers obtained have even
product is 0.75.
In light of the above statements, choose the most appropriate answer from
the options given below.
(a) Both Statement (I) and Statement (II) are true.
(b) Both Statement (I) and Statement (II) are false.
(c) Statement (I) is true but Statement (II) is false.
(d) Statement (I) is false but Statement (II) is true.

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 67 of 69

4. The probabilities that A, B, and D can solve a problem independently are

1/3, 1/3 and 1/4 respectively. The probability that only two of them are
able to solve the problem is . (JIPMAT 2023)
(a) 5⁄36 (b) 7⁄36 (c) 13⁄36 (d) 1⁄2

Answers
IPMAT Indore
1. b 6. c 11. b 16. d 21.
2. c 7. 960 12. 1160 17. c 22.
3. c 8. 175 13. 8 18. d 23.
4. a 9. a 14. d 19. 24.
5. 256 10. b 15. d 20.

JIPMAT
1. a 6. 11. 16.
2. c 7. 12.
3. a 8. 13.
4. b 9. 14.
5. 10. 15.

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 68 of 69

Super 300 Series

Important Questions for CAT | IPMAT| XAT |CMAT | IIFT | Du-JAT | All
BBA MBA exams

S. No. Topics
1 Logarithms
2 AP GP HP – 01
3 AP GP HP – 02
4 Special Series
5 SET Theory
6 Quadratic Equations
7 Inequalities
8 Maxima Minima
9 Functions
10 Number System 01
11 Number System 02
12 Number System 03
13 Number System 04
14 Combinations
15 Permutations
16 Probability
17 Geometry 01
18 Geometry 02
19 Coordinate Geometry/ Mensuration 03
20 Averages
21 Allegations
22 Profit Loss
23 SI CI
24 Ratio/Variations
25 Time Work
26 Time Distance Speed 01
27 Time Distance Speed 02
28 Binomial Trigonometry
29 Determinants
30 Matrices

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN

 Page 69 of 69

OLD is GOLD Series 2024

Percentile Classes YouTube Channel

S. No. Topics
1 Quadratic Equations + Inequalities
2 AP GP HP + Special Series
3 Logarithms
4 Para Jumbles
5 Function Maxima Minima
6 Number System
7 Geometry
8 Grammar
9 Percentage + Profit Loss + SI CI + Ratio + Partnership
10 Averages + Alligations
11 Time and Work
12 Critical Reasoning
13 Time Distance Speed
14 SET Theory
15 Permutation Combination Probability
16 Vocab
17 Trigonometry
18 Data Interpretation
19 Matrices and Determinants
20 Reading Comprehensions
21 Miscellaneous (Conic + Binomial + Clocks etc)

PERCENTILE CLASSES WWW.PERCENTILECLASSES.IN