PERMUTATIONS AND COMBINATIONS

SESSION – 1

AIM
 Introduction
 Factorial
 Fundamental Principle of Counting.

INTRODUCTION
The present chapter can be given the name as combinatorics (or)
counting techniques. The basis of all the techniques given in this
chapter are based on two fundamental principles of counting
namely addition and multiplication principles. Using these formulas
for number of ways of arrangements (permutations) and selections
(combinations) of different objects are derived.

FACTORIAL

The continued product of first n natural numbers is called the “n

factorial” and is denoted by ! = |

i.e n! = 1 × 2 × 3 × 4 × .... × (n - 1) × n.

Thus, 3! = 1 × 2 × 3 = 6; 4! = 1×2×3×4 = 24, 5!

= 1×2×3×4×5 = 120 etc.

Clearly, n! is defined for positive integers only.

!
n! = n (n - 1)! ⟹ ( − 1)! =
 !
Put n = 1 ⟹ 0! = =1
!
Put n = 0 ⟹ (−1)! = =
⟹ (−1)! = ∞

NOTE: Factorials of proper fractions or negative integers are not

defined. Factorial n is defined only for whole numbers.

!
Ex1:Compute: ! !

! × × × × ! × × ×
Sol: = = = 210
! ! !×( × × × ) × × ×

Ex2: Express the product 6 × 7 × 8 × 9 × 10 as factorials.

Sol: 6. 7. 8. 9. 10
. . . . . . . . . !
= =
. . . . !
Ex3: Find n if (n +1)! = 12 × (n - 1)!
Sol: Find n(n + 1) × n × (n -1)! = 12 × (n - 1)!
⟹ n(n +1) = 12 ⟹ n2 + n -12 = 0
⟹ (n + 4) (n - 3) = 0 ⟹n=3
Ex4: Prove that + + =
! ! ! !
×
Sol: + + = + + =
! ! ! ! ! ! !
FUNDAMENTAL PRINCIPLES OF COUNTING
Addition principle :
If an operation can be performed in ‘m’ different ways and another
operation, which is independent of the first operation, can be
performed in ‘n’ different ways, then either of the two operations,
can be performed in (m + n) ways. This can be extended to any
finite number of mutually exclusive operations.
NOTE: The addition Rule is True only when the operations are
mutually exclusive and multiplication rule is true only when
the operations are independent.

Ex1: Find the number of two digit numbers (having different digits)
which are divisible by 5.
Sol: Any number of required type either ends in 5 or in 0. Number
of two digit numbers (with different digits) ends in 5 is 8 and
that of ending in 0 is 9.
Hence, by addition principle the required number of numbers
is 8 + 9 = 17.
Ex2: In a class there are 10 boys and 8 girls. The teacher wants to
select either a boy or a girl to represent the class in a function.
In how many ways can the teacher make this selection?
Sol: Here the teacher is to perform two jobs.
i) Selection of a boy among 10 boys. Or,
ii) Selection of a girl among 8 girls
The first job can be performed in l0 ways and second job can
be performed in 8 ways, therefore by the fundamental
principle of addition either of two jobs can be performed in 10
+ 8 = 18 ways.
Multiplication principle :
If an operation can be performed in ‘m’ different ways following
which a second operation can be performed in ‘n’ different ways,
then the two operations in succession can be performed in m × n
ways. This can be extended to any finite number of independent
operations.

Ex1: A Hall has 3 gates. In how many ways can a man enter the hall
through one gate and come out through a different gate?
Sol: Suppose the gates are A, B and C. Now there are 3 ways (A, B or
C) of entering into the hall. After entering into the hall, the man
come out through a different gate in 2 ways. Hence, by the
multiplication Principle, total number of ways is 6.
B
A
C
A

B 3 2 = 6 ways.
C
A
C
B

Ex2: In a class there are 10 boys and 8 girls. The teacher wants to
select a boy and a girl to represent the class in a function. In
how many ways can the teacher make this selection?
Sol: Here the teacher is to perform two jobs.
i) Selection of a boy among 10 boys, and
ii) Selection of a girl among 8 girl
The first job can be performed in 10 ways and second job can
be performed in 8 ways. Hence by the fundamental principle of
multiplication, both jobs can be performed simultaneously in
108 = 80 ways.
Worked out examples
1] Given 4 flags of different colours, how many different signals
can be generated, if a signal requires the use of 2 flags one
below the other?
Sol: The total number of signals is equal to the number of

ways of filling in 2 vacant places in succession by four flags of

different colours. The upper vacant place can be filled in 4
different ways by any one of the 4 flags; following which, the
lower vacant place can be filled in 3 different ways by any one
of the remaining the different flags.
Hence, by the fundamental principle of multiplication, the
required number of signals is 4 × 3 = 12
2] How many numbers between 10 and 10,000 can be formed by
using the digits 1, 2, 3, 4, 5 if
i) No digit is repeated in any number. ii) Digits can be repeated.
Sol: i) Number of two digit number = 5 × 4 = 20
Number of three digit numbers = 5 × 4 × 3 = 60
Number of four digit numbers = 5 × 4 × 3 × 2 = 120
Total = 200
ii) Number of two digit numbers = 5 × 5 = 25
Number of three digit numbers = 5 × 5 × 5 = 125
Number of four digit numbers = 5 × 5 × 5 × 5 = 625
Total = 775
3] By using the digits 0, 1, 2, 3, 4 and 5 (repetitions not allowed)
numbers are formed by using any number of digits. Find the
number of non- zero numbers that can be formed
Sol: We have, the digits 0, 1, 2, 3, 4.
Required number of numbers
= Number of 1 digits number + No. of 2 digit numbers +..........+
Number of 6 digit numbers
=5+5×5+5×5×4+5×5×4×3+5×5×4×3×2+5×5×
4×3×2×1
= 5 + 25 + 100 + 300 + 600 + 600 = 1630.
4] A gentleman has 6 friends to invite. In how many ways can he
send invitation cards to them, if he has three servants to carry
the cards?
Sol: Since a card be sent by any one of the three servants, so the
number of ways of sending the invitation card to the first
friend = 3. Similarly, invitation cards can be sent to each of the
six friends in 3 ways.
So, the required number of ways = 3 × 3 × 3 × 3 × 3 ×
3 = 36 = 729
5] Five persons entered the lift cabin on the ground floor of an 8 -
floor house. Suppose each of them can leave the cabin
independently at any floor beginning with the first. Find the
total number of ways in which each of the five persons can
leave the cabin (i) at any one of the 7 floors (ii) at different
floors.
Sol: Suppose A1, A2, A3, A4, A5 are five persons.
i) A1 can leave the cabin at any of the seven floors. So, A1 can
leave the cabin in 7 ways. Similarly, each of A2, A3, A4, A5 can
 leave the cabin in 7 ways. Thus, the total number of ways in
which each of the five persons can leave the cabin at any of the
seven floors in 7 × 7 × 7 × 7 × 7 = 75 .
ii) A1 can leave the cabin at any of the seven floors. So, A1 can
leave the cabin in 7 ways. Now, A2 can leave the cabin at any of
the remaining 6 floors. So, A2 can leave the cabin in 6 ways.
Similarly, A3, A4, and A5 can leave the cabin in 5, 4 and 3 ways
respectively. Thus, the total number of ways in which each of
the five persons can leave the cabin at different floors in
7 × 6 × 5 × 4 × 3 = 2520.
6] For a set of five true / false questions, no student has written
all correct answers, and no two students have given the same
sequence of answers. What is the maximum number of
students in the class, for this to be possible?
Sol: Since a true / false type question can be answered in 2 ways
either by marking it true or false. So, there are 2 ways of
answering each of the 5 questions.
 Total number of different sequences of answers = 2 × 2 × 2 ×
2 × 2 = 25 = 32.
Out of these 32 sequences of different sequences of answers
there is only one sequence of answering all the five questions
correctly. But no student written all the correct answers and
different students have given different sequences of answers.
 Maximum number of students in the class
= Number of sequences except one sequence in which all
answers are correct
= 32 - 1 = 31
7] How many numbers are there between 100 and 1000 such that
at least one of their digits is 7?
Sol: Clearly, a number between 100 and 1000 has 3 - digits
 Total number of 3 - digit numbers having at least one of
their digits as 7
= (Total number of three - digit numbers) - (Total number of 3
- digit numbers in which 7 does not appear at all)
Total number of three- digit numbers: We have to form three -
digit numbers by using the digits 0, 1, 2, 3, ........, 9.
Clearly, hundred’s place can be filled in 9 ways and each of the
ten’s and one’s place can be filled in 10 ways.
So, total number of 3 - digit number = 9 × 10 × 10 = 900.
Total number of three - digit number in which 7 does not
appear at all: Here we have to form three - digit numbers by
using the digits 0 to 9, except 7.
So, hundred’s place can be filled in 8 ways and each of the ten’s
and one’s place can be filled in 9 ways. So, total number of
three - digit numbers in which 7 does not appear at all is 8 × 9
× 9.
Hence, total number of 3 - digit numbers having at least one of
their digits as 7 is
9 × 10 × 10 - 8 × 9 × 9 = 252.
CLASS EXERCISE
1] If s = 1.1! + 2.2! + 3.3! +.......+ n.n!, then
a) ! b) ! ∉
c) cannot be discussed d) none of these
!
( )!
2] Prove that: ! = {1. 3. 5.... (2n -1)}2n.
3] How many numbers are there between 100 and 1000 which
have exactly one of their digits as 5?
4] How many three digit odd numbers can be formed by adding
the digits 1, 2, 3, 4, 5, 6 if:
i) The repetition of digits is not allowed?
ii) The repetition of digits is allowed?
5] In how many ways can 3 prizes be distributed among 4 boys,
when
i) no boy gets more than one prize?
ii) a boy may get any number of prizes?
iii) no boy gets all the prizes?
 SESSION – 2

AIM
 Permutation

DEFINITIONS:
An arrangement that can be formed by taking some or all of a finite
set of things (or objects) is called a permutation.

DEFINITION:
A permutation is said to be a linear permutation if the objects are
arranged in a line.

DEFINITION:
A permutation is said to be a circular permutation if the objects are
arranged in the form of a circle (a closed curve).

E.g. 1: The linear permutations formed by taking two things at a

time from the set {A, B, C} are AB, BA, AC, CA, BC, CB.

E.g. 2: The linear permutations formed by taking two digits at a

time from the set {1, 2, 3, 4} are 12, 21, 13, 31, 14, 41, 23, 32,
24, 42, 34, 43.

THEOREM 1
Let r and n be positive integers such that 1 ≤ r ≤ n. Then the
number of all permutations of n distinct things taken r at a time is
given by
n (n - 1) (n - 2) (n - 3) ..... (n - (r - 1)).
i.e. P (n, r) = nPr = n (n - 1) (n - 2).....(n - (r - 1)).
Proof:
The number of permutations of n distinct things, taken ‘r’ at a time,
is same as the number of ways in which we can fill up r- places
when we have n different things at our disposal.

The first place can be filled in ‘n’ ways, for any one of the ‘n’ things
can be used to fill up the first place. Having filled it, there are (n - 1)
things left and any one of these (n - 1) things can be used to fill up
the second place. So, the second place can be filled in (n - 1) ways.
Hence, by the fundamental principle of counting, the first two
places can be filled in n (n -1) ways. When the first two places are
filled, there are (n - 2) places left, so that the third place can be filled
from the remaining (n - 2) things in (n - 2) ways. Therefore, the first
three places can be filled in n (n - 1) (n - 2) ways. Continuing in this
manner, we find that the first (r - 1) places can be filled in n (n - 1)
(n - 2) .... (n - (r - 2)) ways.

After filling up first (r - 1) places, exactly n - (r -1) = n - r + 1 things

are left. So, the rth place can be filled in (n - (r - 1)) ways. Hence, the
‘r’ places can be filled in n (n - 1) (n - 2) .... (n - (r - 1)) ways.

Hence, the total number of permutations of n distinct things,

taken ‘r’ at a time is
n (n – 1) (n – 2) (n – 3).... (n – (r – 1))
Thus, P (n, r) = n (n – 1) (n – 2) (n – 3).... (n – (r – 1))
THEOREM 2
!
Prove that: ( , ) = =( )!
Proof
We have,
P(n, r) = n (n - 1) (n - 2) (n - 3).... (n -(r - 1))
( )( )( )…. ( ) ( ) ( ) …… . .
⟹ P(n, r) = ( ) ( ) …….. . .
!
⟹ P (n, r) = ( )!

Ex: If 10 = 5040, find the value of r.

Sol: We have,
!
10 = 5040 ⟹ ( )!
= 10 × 504
! ! × × × × !
⟹( )!
= 10 × 9 × 8 × 7 ⟹ ( )!
= !
! !
⟹( )!
= ⟹ (10 − )! = 6! ⟹ 10 − =6⟹ =4
!

THEOREM 3
The number of all permutations of n distinct things, taken all
at a time is n!,
Proof
The number of all permutations of n distinct things, taken all at a
time is same as the number of ways of filling ‘n’ places when we
have n distinct things at our disposal.
Proceeding as in theorem 1, we have
P (n, n) = n (n - 1) (n - 2) (n - 3).... (n - (n - 1))
P (n, n) = n (n - 1) (n - 2) (n - 3).... 3.2.1 = n!
Ex: Find the number of words that can be formed using all letters
of the word “KUMARI”
Sol: Here 6 different letters are present in the word KUMARI so
they can be arranged among themselves in 6! ways.
Therefore number of words = 6!
NOTE:
i) nP0 = 1, nP1 = n and nP n-1 = n Pn = n!

ii) nPr = n-1Pr + or n-1 Pr = (n - r).n -1Pr-1

iii) = . = n (n - 1).n-2P r-2 = n (n - 1)(n - 2) n - 3 P

r -3
iv) = =2 =3 =−−−−
v) If Pn stands for
1.P1 + 2.P2 + 3.P3 +.....+ n. Pn = (n + 1)! - 1

Worked out examples:

1] If 56 . 54 = 30 800: 1, find r.
Sol: We have, 56 . 54 = 30 800: 1
! ! ! !
⟹( :
)! ( )!
= ⟹( :
)! ( )!
= 30800: 1
! ( )!
⟹( )!
× = ⟹ 56 × 55 × (51 − ) = 30800
!
⟹ (51 − ) = 10 = 41.
2] If P(n, 4) = 20 × P (n, 2), find n.
Sol: We have,
P(n, 4) = 20 × P (n, 2)
! !
⟹ ( )! = 20 × ( )! ⟹ (n – 2)! = 20 × (n – 4)!
⟹ (n – 2) (n –3) (n – 4)! = 20 × (n – 4)!
⟹ (n – 2) (n – 3) = 20 ⟹ (n – 2) (n – 3) = 5 × 4 [by comparing
two sides]
⟹n–3=4
⟹n=7
3] Seven athletes are participating in a race. In how many ways
can the first three prizes be won?
Sol: The total number of ways in which first three prizes can be
won is the number of arrangements of seven different things
taken 3 at a time.
! × × × !
So, required number of ways = 7 = ! = = 210
!
ALITER: First prize can be won in seven ways. Second prize can
be won by any one of the remaining six athletes in 6 ways.
Now, five athletes are left. So, third prize can be won by any
one of the remaining 5 athletes in 5 ways.
Hence, by the fundamental principle of counting, the required
number of ways = 7 × 6 × 5 = 210.
4] How many 4-letter of word with or without meaning, can be
formed out of the letters of the word, ‘LOGARITHMS’, if
repetition of letters is not allowed?
Sol: There are 10 letters in the word ‘LOGARITHMS’.
So, the number of 4 – letter word
= Number of arrangements of 10 letters, taken 4 at a time =
10P4= 5040.
5] The number of negative term of the sequence { xn}, where
= ( )! − ! is
a) 1 b) 2 c) 3 d) 4
( )( )( )( ) ( )( )
Sol: Clearly = ( )!
− = −
! ! !

= =
! !
Since xn is -ve
 4n2 + 28n - 95 < 0 which is true for n = 1, 2
Hence number of -ve terms = 2.
6] If = = , then prove that b2 = a (b + c).
Sol: = =
! ! !
∴ ( )!
= ( )!
= ( )!

⟺ ( )( )!
= ( )!
= ( )!

from first two relations, = − +1 .......... (1)

and from last two relations, = − ...........(2)

form (1) and (2), we get = + 1

 b2 = a (b + c).
CLASS EXERCISE
1] How many different signals can be given using any number of
flags from 5 flags of different colours?
2] In a class there are 30 students. On the New Year day, every
student posts a greeting card to all his / her classmates. Find
the total number of greeting cards posted by them.
3] If there are 25 railway stations on a railway line, how many
single second class tickets must be printed so as to enable a
passenger to travel from one station to another?
4] If a denotes the number of permutations of (x + 2) things taken
all at a time, ‘b’ the number of permutations of x things taken
11 at a time and c the number of permutations of x -11 things
taken all at a time such that a = 182 bc, find the value of x.
5] The number of six digit numbers that can be formed from the
digits 1, 2, 3, 4, 5, 6 and 7 so that digits do not repeat and the
terminal digits are even, is
a) 144 b) 72 c) 288 d) 720
 SESSION – 3 & 4

AIM
 Permutations under certain conditions.
 Permutations with repetition of things

THEOREM 1
Prove that the number of all permutations of n different objects
taken r at a time, when a particular object is to be always included
in each arrangement, is r. − 1 .
Proof: Here we have to find the number of ways in which r places
can be filled with n given objects such that a particular object
occurs in each arrangement. Suppose the particular object is
placed at the first place. Then, the remaining (n -1) places can
be filled with remaining (r - 1) objects in − 1 ways.
Similarly, by fixing the particular object at the second, third,
fourth,..., rth places, we find that the number of permutations
in each case is − 1 . Hence, by the fundamental principle
of addition, the required number of permutations
= −1 + −1 +. . . . . + − 1 = . −1

THEOREM 2
Prove that the number of permutations of n distinct objects taken ‘r’
at a time, when a particular object is never taken in each
arrangement, is − 1 .

Proof: Since one particular object out of n given objects is never

taken. So, we have to determine the number of ways in which r
places can be filled with (n - 1) distinct objects. Clearly, the
number of such arrangement is − 1 .
Corollary
i) Number of permutations of ‘n’ different things, taken ‘s’ at a
time, when ‘p’ particular things is to be always included in each
arrangement, is rPs. n-sPr-s.
ii) Number of permutations of n different things, taken all at a
time, when m specified things always come together is m! × (n -
m + 1)!

* Special cases:
1] Arrangement when certain things occur together
Ex: Five Indians and Five Americans sit in a row. Find the number
of ways in which they can be seated when all five Americans sit
together.
Sol: Considering all five Americans as one unit, five Indians and one
unit can be seated in 6! ways. Now five Americans can be
arranged among themselves in 5! ways.
 required number of arrangements = 6! × 5!.

2] Arrangement when certain things do not occur together

Method
Required number of ways = Total ways (without restriction) -
Number of ways in which they sit together.

Ex: In how many ways five Indians and Five Americans sit in a row
so that all five Americans do not sit together.
Sol: Require number of ways = 10! - 6! × 5!
3] Arrangement when no two of a certain things occur
together
Ex: In how many ways five Indians Five Americans can sit in a row
so that no two Americans sit together.
Sol: Five Indians can be arranged in a row in 5! ways. Then there
are 6 gaps between them. In these 6 gaps, the 5 Americans can
be arranged in 6P5 ways.
 Total number of ways = 5! × 6P5.

4] Arrangement when order should not change

If we want to arrange ABC in such a way so that order of A and
C should not change it means we want those arrangement in
which A comes before C i. e.,
ABC
BAC
ACB

5] Divisibility:
i) A number is divisible by 6 if it is divisible by 2 and 3
ii) The number is divisible by 7 if the difference between twice
the digit in the units place and the number formed by the other
digits is either 0 or a multiple of 7. Example: 504, 5719.
iii) A number is divisible by 8 if it's last 3 digits are divisible by 8.
iv) A number is divisible by 9 if the sum of it's digits is divisible by
9.
v) A number is divisible by 11, if the difference between the sum
of the digits in the odd places and sum of digits in even places
is divisible by 11.
Example: 209, 3564
PERMUTATIONS WITH REPETITION OF THINGS

THEOREM 1
The number of permutations of n dissimilar things taken r at a time
when repetition of things is allowed any number of times is nr.
Proof:
The required number of permutations is equal to the number of
ways of filling ‘r’ blank place by ‘n’ things, when repetition of things
is allowed.
The first blank place can be filled by any one of the n different
things and hence it can be done in n ways. Since repetition of things
is allowed, the second blank place can also be filled by any one of
the n different things and hence the second blank place can be filled
in n ways. Similarly every blank place can be filled in n ways. By
counting principle of multiplication the r blank places can be filled
in nr ways. The required number of permutations = nr.

Corollary 1
The number of permutations of n dissimilar things taken not more
than r at a time, when each thing may occur any number of times is
( )
.
Ex: Find the number of different telephone numbers formed by
taking 3 digits from 1, 2, 3, 4, 5.
Sol: To form a telephone number, each digit may be repeated any
number of times. Thus the required number of possible
telephone numbers is 53 = 125.
Worked out examples
1] Find the number of 5 letter words that can be formed using the
letter of the word CONSIDER. How many of them begin with C,
how many end with R and how many of them begin with C and
end with R?
Sol: The word CONSIDER has 8 letters, all distinct and we have to
fill up 5 blanks.

This can be done in 8P5 = 8.7.6.5.4 = 6720 ways.

Begin with ‘C’: Fill the first place with C as shown below
C

Then the remaining 4 places can be filled with the remaining 7

letters in
7P4 = 7.6.5.4. = 840 ways. Thus the number of 5 letter words
that begin with C is 840.
End with ‘R’: Fill the last place with R as shown below.
R

Then we are left with 7 letters and 4 places. They can be filled
in 7P4 = 840 ways.
Thus the number of 5 letter words that end with R is 840.
Begin with ‘C’ and End with ‘R’: First we fill the first place with
‘C’ and the last place with ‘R’ as shown below.
C R

Then we are left with 3 places to be filled with the remaining 6

letters. This can be done is 6 = 6.5.4 = 120 ways. Thus, the
number of words that begin with C and end with R is 120.
2] Find the number of ways of arranging 6 boys and 5 girls in a
row so that i) all the girls sit together ii) no two girls sit
together iii) boys and girls sit alternately and iv) no two boys
sit together
Sol: 6 boy and 5 girls are altogether 11 persons.
 The number of ways of arranging 6 boys and 5 girls in a row
is 11! ways.
i) Treat the 5 girls as one unit. Then we have 6 boys and 1
unit of girls. They can be arranged in 7! ways. The 5 girls can be
arranged among themselves in 5! ways.
 The number of ways in which all girls are sit together =
7! 5!.
ii) First arrange the 6 boys in a row in 6! ways. Then there are
7 gaps between them as shown below by the letter X.
XBXBXBXBXBXBX
Thus we have 7 gaps and 5 girls. They can be arranged in 7P5
ways.
 The number of arrangements in which no two girls sit
together = 6! × 7 .
iii) To arrange the 6 boys and 5 girls alternatively, the odd
places will be occupied by 6 boys and even places by 5 girls.
BGBGBGBGBGBG
The 6 boys can be arranged in 6 odd places in 6! ways and 5
girls in the even places in 5! ways.
 The number of arrangements in which boys and girls sit
alternatively = 6! × 5!.
iv) First arrange the 5 girls in a row in 5! ways. Then there are
6 gaps between them as shown below by the letter X.
XGXGXGXGXGX
Thus we have 6 gaps and 6 boys. They can be arranged in 6!
ways .
  The number of arrangements in which no two boys sit
together = 5! × 6!

3] Find the number of 4 digited numbers that can be formed using

the digits 1, 2, 5, 6, 7. How many of them are divisible by i) 2 ii)
3 iii) 4 iv) 5 v) 25
Sol: The number of 4 digited numbers that can be formed using the
digits 1, 2, 5, 6, 7 is 5 P4 = 120.
i) A number is divisible by 2 when its unit place must be filled
with an even digit from among the given integers. This can be
done in 2 ways.
2 or 6
Now, the remaining 3 places can be filled with remaining 4
digits in 4P3 = 4 × 3 × 2 = 24 ways.
 The number of 4 digited numbers divisible by 2=2 × 24 = 48.
ii) A number is divisible by 3 only when the sum of the digits
in that number is a multiple of 3.
Sum of the given 5 digits = 1 + 2 + 5 + 6 + 7 = 21.
The 4 digits such that their sum is a multiple of 3 form the
given digits are 1, 2, 5, 7, (sum is 15).
They can be arranged in 4! ways and all these 4 digited
numbers are divisible by 3.
 The number of 4 digited numbers divisible by 3 = 4! = 24.
iii) A number is divisible by 4 only when the last two places
(tens and units places) of it is a multiple of 4.
X

Hence the last two places should be filled with one of the
following 12, 16, 52, 56, 72, 76. Thus the last two places can be
filled in 6 ways.
 The remaining two places can be filled by remaining 3 digits in
3 P2 = 3 × 2 = 6 ways.
 The number of 4 digited numbers divisible by 4 = 6 × 6 = 36.
iv) A number is divisible by 5 when its units place must be
filled by 5 from the given integers 1, 2, 5, 6, 7. This can be done
in one way.
5

The remaining 3 places can be filled with remaining 4 digits in

4P3 = 4×3×2 = 24 ways.
 The number of 4 digited numbers divisible by 5 = 1×24 = 24.
v) A number is divisible by 25 when its last two places are
filled with either 25 or 75.
X

Thus the last two places can be filled in 2 ways.

The remaining 2 places form the remaining 3 digits can be
filled in 3P2 = 6 ways.
 The number of 4 digited numbers divisible by
25 = 2 × 6 = 12.

4] A child has four pockets and three marbles. In how many ways
can the child put the marbles in his pockets?
Sol: The first marble can be put into the pocket in 4 ways, so the
second can also be put in the pocket in 4 ways and the third
and fourth also. Thus, the number of ways in which the child
can put the marbles = 4 × 4 × 4 = 64 ways.
5] Find the number of 4 letter words using the letters of the word
MISTER in which at least one letter is repeated.
Sol: Total number of 4 letter words formed using the word MISTER
= 6 4.
The number of 4 letter words formed using the word MISTER
in which no letter is repeated = 6P4.
 The number of 4 letter words formed using the word
MISTER in which atleast one letter is repeated = 64 – 6P4.

6] A family consists of a grandfather, 5 sons and daughters and 8

grandchildren. They are to be seated in a row for dinner. The
grandchildren wish to occupy the 4 seats at each end and the
grandfather refuses to have a grandchild on either side of him.
In how many ways can the family be made to sit?
Sol: The total number of seats = 1 grandfather + 5 sons and
daughters + 8 grand children
= 14
The grand children wish to occupy the 4 seats on either side of
the table
= 4! ways = 24 ways
and grandfather can occupy a seat in (5 - 1) ways = 4 ways
(Since 4 gaps between 5 sons and daughters)
And the remaining seat can be occupied in 5! ways = 120 ways
(5 seats for sons and daughters)
Hence required number of ways, By the principle of
multiplication law
= 24 × 4 120 = 11520
7] A tea party is arranged for 16 people along two sides of a large
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?
Sol: There are 8 chairs on each side of the table. Let sides be
represented by A and B. Let four persons sit on side A, then
number of ways arranging 4 persons on 8 chairs on side A =
8P4 and then two persons sit on side B, then number of ways
arranging 2 persons on 8 chairs on side B 8P2 and arranging
the remaining 10 persons in remaining 10 chairs in 10! ways.
Hence the total number of ways in which the persons can be
arranged
! ! !
= 8P4 × 8P2 × 10! = ! !
8] Nine boys and 3 girls are to be seated in 2 vans, each having
numbered seats, 3 in the front and 4 at the back. The number
of ways of seating arrangements, if the girls should sit together
in a back row on adjacent seats, is
a) 12! b) 3. 11! c) 4. 11! d) 3! 9!
Sol: The 3 girls have to sit together in back seats a, b, c, d or p, q, r, s.
The number of ways they can be seated is 4 (3)! = 4!
The 9 boys can sit in the remaining 11 seats in the two vans in
11P9 ways.
!
The desired number is 4!. = 12!
!
CLASS EXERCISE

1] A code word is to consist of two distinct English alphabets

followed by two distinct numbers from 1to 9. For example, CA
23 is a code word. How many such code words are there? How
many of them end with an even integer?
2] Find the number of ways of seating 10 students A1, A2 ......, A10
in a row such that
a) A1, A2, A3 sit together
b) A1, A2, A3 sit in a specified order
c) A1, A2, A3 sit together in a specified order.
3] A number lock has 3 rings and each ring has 10 digits 0, 1, 2,
....., 9. Find the maximum number of unsuccessful attempts that
can be made by a thief who tries to open the lock without
knowing the key code.
4] Let n1 = x1 x2 x3 and n2 = y1 y2 y3 be two 3- digit numbers,
then the pairs of n1 and n2 can be formed so that n1 be
subtracted form n2 without borrowing is
a) 55. 54 b) 45.55 c) 45. (55)2 d) 55. (45)2
5] Twelve boys and 2 girls are to be seated in a row such that
there are at least 3 boys between the 2 girls. The number of
ways this can be done is  12! Then =
a) 2.12C6 b) 20 c) 11P2 d) 11C2
6] A seven digit number divisible by 9 is to be formed by using 7
out of numbers {1, 2, 3, 4, 5, 6, 7, 8, 9}. The number of ways in
which this can be done is
a) 7! b) 2.(7)! c) 3.(7)! d) 4.7!
 SESSION - 5

AIM:
 Application using permutations (Sum of the numbers formed &
Ranking)

SUM OF NUMBER FORMED WITH THE GIVEN DIGITS

METHOD
Suppose we have to find sum of numbers of four digits that can be
formed with the given digit, first find the sum at unit place, ten
place, hundred place & thousand place. Sum of numbers = (sum at
unit place) × 1 + (sum at ten place) × 10 + (sum at hundred place) ×
100 + (sum at thousand place) × 1000.

NOTE
i) The sum of the digits in the unit place of all numbers formed
with the help of a1, a2,........, an taken all at a time is (n - 1)! (a1
+ a2 +..... + an) (repetition of digits not allowed)
ii) The sum of all digit numbers that can be formed using the
digits a1, a2,.. an (repetition of digits not allowed) is (n - 1)! (a1
( )
+ a2 +..... + an) .
iii) The sum of the numbers formed by taking all the given ‘n’
distinct non zero digits = (n -1)!
(sum of all the n digits) (111 ..... n times)
iv) The sum of all r - digit numbers that can be formed using the
given ‘n’ distinct nonzero digits = (sum of all n digits)
[ −1 × 111 ..... 1 (r times)]
v) The sum of the numbers formed by taking all the given n digits
(including 0) = (sum of all the n digits) [(n - 1)! 111....1 (n
times) - (n - 2)! 111....1 (n -1 times)].
vi) The sum of the r - digit numbers formed by using the given n
distinct digits (including 0) =
(sum of all the n digits) [ − 1 × 111 . . . . . 1 (r times) -
−1 × 111 ....1 (r - 1 times)].

1] Find the sum of all 4 digited numbers that can be formed using
the digits 1, 2, 4, 5, 6 without repetition.
Sol: The number of 4 digited number formed by using the digits 1,
2, 4, 5, 6 without repetition
= 5P4 = 120.
Out of these 120 numbers,
4P numbers contain 2 in units place
3
4P numbers contain 2 in ten place
3
4P numbers contain 2 in hundreds place
3
4P numbers contain 2 in thousands place
3

2
2
2
2
 The value obtained by adding 2 in all the number
= 4 × 2 + 4 × 20 + 4 × 200 + 4 × 2000
= 4 (2 + 20 + 200 + 2000) = 4 (2222) = 4 × 2 × 1111
Similarly, the value obtained by adding 1 is 4 × 1 × 1111
the value obtained by adding 4 is 4 × 4 × 1111
the value obtained by adding 5 is 4 × 5 × 1111
the value obtained by adding 6 is 4 × 6 × 1111
 The sum of all the numbers
= 4 × 1× 1111 + 4 × 2 × 1111 + 4 × 4 × 1111 + 4 × 5 ×
1111 + 4 × 6 × 1111
= 4 1111 (1 + 2 + 3 + 4 + 5 + 6) = 24 (1111) (18) = 479952.
2] If the letter of the word MASTSER are permuted in all possible
ways and the words thus formed are arranged in the dictionary
order, then find the ranks of the words
i) REMAST ii) MASTER
Sol: i) The alphabetical order of the letters of the given word is A,
E, M, R, S, T.
The number of words begin with A is 5! = 120
The number of words begin with E is 5! = 120
The number of words begin with M is 5! = 120
The number of words begin with RA is 4! = 24
The number of words begin with REA is 3! = 6
The next word is REMAST.
 R and of the word REMAST = 3 (120) + 24 + 6 + 1 = 360 +
31 = 391.
ii) The alphabetical order of the letters of the given word is A,
E, M, R, S, T.
The number of words begin with A is 5! = 120
The number of words begin with E is 5! = 120
The number of words begin with MAE is 3! = 6
The number of words begin with MAR is 3! = 6
The number of words begin with MASE is 2! = 2
The number of words begin with MASR is 2! = 2
The next word is MASTER.
Rank of the word MASTER = 2 (120) + 2(6) + 2(2) + 1 = 240
+ 12 + 4 + 1 = 257.
CLASS EXERCISE
1] The letters of the word COCHIN are permuted and all the
permutations are arranged in alphabetical order as in English
dictionary. The number of words that appear before the word
COCHIN is
a) 360 b) 192 c) 96 d) 48

2] Find the sum of all 4 digited numbers that can be formed using
the digits 0, 2, 4, 7, 8 without repetition.

3] If all the letters of the word ‘AGAIN’ be arranged as in a

dictionary, what is the fiftieth word?
 SESSION - 6

AIM
 Circular Permutations
 Permutations of objects not all distinct

THEOREM 1
The number of circular permutations of n different things
taken r at a time is .=
Proof:
Let k be the number of required circular permutations. Consider
one of these ‘k’ circular permutations. This permutation contains r
different things arranged in the form of a circle. We can break the
circle in r ways by disconnecting the circle between any two things.
Thus a circular permutation gives rise to r linear permutations.
Hence ‘k’ circular permutations give rise to ‘kr’ linear permutations.
But the number of linear permutations of n things taken r at a time
is nPr.

Ex: In how many ways can 13 persons out of 24 persons be seated

around a table.
Sol: In case of circular table the clockwise and anticlockwise orders
are different, thus the required number of circular
!
permutations = = × !.

Corollary 1:
The number of circular permutations of n different things taken all
at a time is (n -1)!
Consider the two circular permutations ABC, ACB as shown in
figure. In either of these permutations each thing has the same
neighbours. In the first permutation A, B, C are arranged in
anticlockwise and in the second permutation A, B, C are arranged in
clockwise direction. If we ignore the direction, then these two
permutations become a single permutation. If we wish to count the
number of permutations of which in any two permutations all the
things shall not have the same neighbours, then we consider the
permutations in one direction only. For example in the preparation
of garland or necklace we consider the circular permutations in one
direction only.
A A

B C B
C

Note:
i) The number of gaps in a circular permutation of n different
things, is n.
ii) If the seat number is given in the circular permutation, then it
becomes a linear permutation

Ex: There are n seats numbered 1, 2, 3..... n. The number of ways in

which m (≤ n) persons can take seats is.......
Sol: In this case, circular becomes linear, so no. of required ways =
nPm.

Corollary 2:
The number of circular permutations of n things taken ‘r’ at a
time in one direction is
Ex: How many necklace of 12 beads each can be made from 18
beads of various colours?

Sol: In the case of necklace there is no distinction between the

clockwise and anticlockwise arrangements, thus the required
number of circular permutations
18 18!
= =
2 × 12 6! × 24

18 × 17 × 16 × 15 × 14 × 13! 119 × 13!

= =
6 × 5 × 4 × 3 × 2 × 1 × 24 2

Corollary 3:
The number of circular permutations of n things taken all at
a time in one direction is ( − 1)!

Ex: Find the number of ways in which 12 different beads can be

arranged to form a necklace.
Sol: 12 different beads can be arranged among themselves in a
circular order in (12 – 1)! = 11! ways. Now in the case of
necklace there is no distinction between clockwise and
anticlockwise arrangements. So the required number of
arrangements = (11!).
Note: Number of circular permutations of n things when p are
alike and the rest are different, taken all at a time,
distinguishing clockwise and anticlockwise arrangement is
( )!
!
Ex: Find the no. of circular permutations of the letters of the word
CIRCLE
( )!
Sol: = 60.
!

Worked out examples:

1] A family consists of a father, a mother, 2 daughters and 2 sons.
In how many different ways can they sit at a round table if the
2 daughters wish to sit on either side of the father?
Sol: Total number of persons in a family = 6
Treat the 2 daughters along with a father as one unit. Then we
have a mother, 2 sons and one unit of daughters along with
father in a family. They can be seated around a table in (4 -1)! =
3! ways. The 2 daughters can be arranged on either side of the
father in 2! ways.
 Number of required arrangements = 3! × 2! = 6 × 2 = 12.

2] A round table conference is attended by 3 Indians, 3 Chinese, 3

Canadians and 2 Americans. Find the number of ways of
arranging them at the round table so that the delegates
belonging to same country sit together.
Sol: Since the delegates belonging to the same country sit together,
first arrange the 4 countries in a round table in 3! ways. Now, 3
Indians can be arranged among themselves in 3! ways.
3 Chinese can be arranged among themselves in 3! ways.
3 Canadians can be arranged among themselves in 3! ways and
2 Americans can be arranged among themselves in 2! ways.
The number of required arrangements = 3! × 3! × 3! × 3! × 2! =
6 × 6 × 6 × 6 × 2 = 2592.
3] In how many ways can we arrange 6 different flowers in a
circle. In how many ways we can form a garland using these
flowers.
Sol: The number of circular arrangements of 6 different flowers =
(6 -1)! = 120
When we form a garland, clockwise and anticlockwise
arrangements are similar. Therefore, the number of ways of
forming garland = (6 -1)! = 60.

4] There are 2n guests at a dinner party. Supposing that the

master and mistress of the house have fixed seats opposite one
another, and that there are two specified guests who must not
be placed next to one another, find the number of ways in
which the company can be placed.
Sol: Let the M and represent seats of the master and mistress
respectively, and let a1, a2, a3, ......, a2n represent the 2n seats.
. ..
an + 1 an

. .
an + 3
.. M'

.
. ..
..
.. a2
a4
a3

a2n M
Let the guests who must not be placed next to one another be
called P and Q.
Now put P at a1, and Q at any position, other than a2, say at a3;
then remaining 2n - 2 guests can be arranged in the remaining
(2n - 2) positions in (2n - 2)! ways. Hence there will be
altogether (2n - n) (2n - n)! arrangements of the guests when P
is at a1.
The same number of arrangements when P is at an or an + 1 or
a2n.
 Hence for these positions (a1, an, an + 1, a2n) of P there are
altogether 4 (2n-2) (2n - 2)!. ways .....(1)
If P is at a2 there are altogether (2n - 3) positions for Q, hence
there will be altogether (2n - 3)(2n - 2)! arrangements of the
guests when P is at a2.
The same number of arrangements of the guests when P is at
any other position excepting the four positions a1,an,an+1,
a2n.
Hence for these (2n - 4) positions of P there will be altogether
(2n - 4) (2n - 3) (2n - 2)! arrangements of the guests ...............(2)
Hence from (1) and (2), the total no. of ways of arranging the
guests
= 4(2n - 2)(2n - 2)! + (2n - 4) (2n - 3) (2n - 2)!
= (4n2 - 6n + 4) (2n - 2)!

5] There are 20 persons among whom are two brothers. The

number of ways in which we can arrange them around a circle
so that there is exactly one person between the brothers is
(a) 19! (b) (c) 2! 17! (d) None of these
Sol: We can arrange 18 persons around a circle in (18 - 1) ! = 17!
ways. Now, there are exactly 18 places where we can arrange
the two brothers. Also, the two brothers can be arranged in 2!
ways. Thus, the number of ways of arranging the persons
subject to the given condition is (17!) (18) (2!) = 2(18!). Hence
(b) is the correct answer.
PERMUTATIONS OF OBJECTS NOT ALL DISTINCT:

THEOREM 1
The number of permutations of n things taken all at a time when p
!
of them are all alike and the rest all different is !
Proof:
Let k be the number of required permutations. Consider one of
these permutations. This permutation contains p like things and n-
p unlike things. If we replace the ‘p’ like things by ‘p’ unlike things
which are different from the rest of n-p unlike things then we get p!
permutations by permuting these new p unlike things without
altering the position of the old n - p unlike things. Thus a single
permutation gives rise to p! permutations. Hence k permutations
give rise to k (p!) permutations. Since the ‘n’ things are dissimilar,
the number of permutations obtained by taking all the things is n!.
!
 k (p!) = n! ⟹ k = !

THEOREM 2
The number of mutually distinguishable permutations of ‘n’ things,
taken all at a time, of which ‘p’ are alike of one kind, q alike of
!
second such that p + q = n, is ! !
Proof:
Let the required number of permutations be k. Consider one of
these k permutations.
Now, replace ‘p’ alike things in this permutation by ‘p’ distinct
things which are also different from others. These p different things
may be permuted among themselves in p! ways without changing
the positions of other things. Similarly, if we replace q alike things
by q distinct things, which are also different from others, then they
can be permuted among themselves in q! ways.
Thus, if both the replacements are done simultaneously, then we
find that each one of the k permutations give rise to p! × q!
permutations. Now, each of these k × p! × q! permutations, is a
permutation of n different things, taken all at a time.
 k × p! × q! = No. of permutations of n different things
taken all at a time = n!
!
Hence, k = ! !

NOTE 1:
The 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 p1 + p2 + ....+ pr = n, is ! ! ! ...... !
NOTE 2:
The number of permutations of n things, of which, of which ‘p’ are
alike of one kind, ‘q’ are alike of second kind and remaining all are
!
distinct, is ! !

NOTE 3:
Suppose there are ‘r’ things to be arranged, allowing repetitions. Let
further p1, p2, ... pr be the integers such that the first object occurs
exactly p1 times, the second occurs exactly p2 times, etc. Then the
total number of permutations of these ‘r’ objects to the above
( .... )!
condition is ! ! !...... !

RESULT:1
The number of functions that can be defined from a set containing
‘m’ elements into a set containing ‘n’ elements is nm.
Ex: Find the number of functions that can be defined from {1, 2, 3}
into {a, b, c, d}
Sol: The number of function = 43 = 64

RESULT:2
The number of surjections (onto functions) that can be defined
from a set A containing ‘n’ elements to a set B containing 2 elements
is 2n - 2.

NOTE
If n (A) = r, n(B) = n, r ≥ n, then the number of surjections defined
from set A to set B is − ( − 1) + ( − 2) −
( − 3) +. . . . +(−1) . .1

Ex: Find the number of surjections from {a, b, c, d} onto set {1, 2}.
Sol: The number of surjections = 24 - 2 = 16 - 2 = 14

RESULT:3
The number of injections (one one functions) that can be defined
from a set containing m elements into a set containing ‘n’ elements
(m ≤ n) is .

Ex: Find the number of injections from {1, 2, 3} into {a, b, c, d}.
Sol: The number of injections = 4 = 24
RESULT:4
The number of bijections (one one, onto functions) that can
be defined from a set containing ‘n’ elements onto a se
containing ‘n’ elements is n!.

Ex: Find the number of bijections that can be defined from {1, 2, 3}
onto {a, b, c}
Sol: The number of bijections = 3! = 6

Worked out examples:

1] Find the number of ways of arranging the letters of the word
i) INDEPENDENCE
ii) SINGING
iii) COMBINATION
Sol: i) The word INDEPENDENCE contains 12 letters in which
there are 3N’s are alike, 2D’s are alike, 4E’s are alike and rest
are different.
( )!
 The number of required arrangements = ! ! !

ii) The word SINGING contains 7 letters in which there are 2I’s
are alike, 2N’s are alike, 2G’s are alike and rest is different.
!
 The number of required arrangements = ! ! !.

iii) The word COMBINATION contains 11 letters in which there

are 2 O’s are alike, 2I’s are alike, 2 N’s are alike and rest are
different.
!
 The number of required arrangements = ! ! !.
2] In how many ways can the letters of the word PERMUTATIONS
be arranged if
i) the words start with P end with S
ii) vowels are all together.
Sol: i) There are 12 letters in the given word of which 2 are T’s
and the remaining are distinct. Remaining 10 letters between P
!
and S can be arranged in ! = 1814400

ii) There are 5 vowels in the given word. These vowels can be
put together in 5! ways. Considering these 5 vowels as one
letter, we have 8 letters (7 remaining letters and one letter
formed by 5 vowels) of which 2 are T’s. These 8 letters can be
arranged in ways. Hence, by the fundamental principle of
!
multiplication, required number of words is 5! × ! = 2419200

3] How many different words can be formed with the letters of

the word ‘MISSISSIPPI’? In how many of these permutations
four I’s do not come together?
Sol: There are 11 letters in the given word, of which 4 are S’s, 4 are
I’s and 2 are P’s. So, total number of words is the number of
arrangements of 11 things, of which 4 are similar of one kind, 4
are similar of second kind and 2 are similar of third kind i.e.
!
! ! !
!
Hence, the total number of words = ! ! ! = 34650.
Considering 4 I’s as one letter, we have 8 letters of which 4 are
!
S’s and 2 are P’s. These 8 letters can be arranged in ! ! ways.
 Number of words in which 4-I’s come together = 840.
Hence, number of words in which 4 - I’s so not come together =
34650 - 840 = 33810.
4] How many numbers greater than a million can be formed with
the digits 2, 3, 0, 3, 4, 2, 3?
Sol: Any number of greater than a million will contain all the seven
digits.
Now, we have to arrange these seven digits, out of which 2
occur twice, 3 occurs twice and the rest are distinct. The
!
number of such arrangements = !× ! = 420.
These arrangements also include those numbers which contain
0 at the million’s place. Keeping 0 fixed at the millionth place,
we have 6 digits out of which 2 occurs twice, 3 occurs thrice
!
and the rest are distinct. These 6 digits can be arranged in !× !
= 60 ways.
Hence, the number of required numbers = 420 - 60 = 360.

5] How many ways can the letters of the word ENGINEERING be

arranged so that the 3 N’s come together but the 3 E’s do not
come together?
Sol: Given word contains 11 letters of which 3 E’s, 3 N’s, 2G’s, 2 I’s,
and one R.
Treat all the 3 N’s as one unit. Then the number of
arrangements in which all the 3 N’s are come together =
! ! !
× =
! ! ! ! ! ! !
Treat all the 3 N’s as one unit and 3 E’s as one unit. The number
of arrangements in which 3N’s come together and 3 E’s come
!
together = ! !
 The number of arrangements in which 3N’s come together
! !
and 3E’s do not come together = ! ! ! − ! ! = 15120 - 1260 =
13860.
6] The number of ways to give 16 different things to three
persons A, B, C so that B gets 1 more than A and C gets 2 more
than B, is
! ( )!
a) ! ! ! b) 4! 5! 7! c) ! ! d) none of these
!
Sol: Number of things given to A is 4
Number of things given to B is 5
Number of things given to C is 7
!
Hence, required number of ways = ! ! !

7] The number of onto functions from A = {1, 2, 3, 4, 5} to B = {1,

2, 3} which are non-decreasing
(i < j ⟹ f (i) ≤ f (j)) is
a) 6 b) 18 c) 64 d) 75
Sol: The images of the members of A are 11123, 12223, 12333,
11223, 11233, 12233. These are six.

CLASS EXERCISE
1] How many ways can the letters of the word BANANA be
arranged so that
i) all the A’s come together? ii) no two A’s come together?
2] How many numbers can be formed with the digits 1, 2, 3, 4, 2, 1
so that the odd digits always occupy the odd places?
3] Find the total number of ways in which six ‘+’ and four ‘-’ signs
can be arranged in a line such that no two ‘-’ sign occur
together.
4] How many numbers greater than 1000000 can be formed by
using the digits 1, 2, 0, 2, 4, 2, 4?
5] A library has ‘a’ copies of one book, ‘b’ copies of two books, ‘c’
copies of each of three books and single copy of ‘d’ books. The
total number of ways in which these books can be distributed,
is
( )! ( )!
a) b)
! ! ! ! ! !
( )!
c) d) None of these
!( !) ( !)
6] In how many ways the letters of the word ‘ MONDAY’ can be
written around a circle if the vowels are to be separated in any
arrangement.
7] Find the number of ways of arranging the chief minister and 10
cabinet ministers at a circular table so that the chief minister
always sits in a particular seat.
8] A chain of beads is to be prepared using 6 different red
coloured beads and 3 different blue coloured beads. In how
many ways can this be done if no two blue coloured beads
come together?
9] Find the number of ways of arranging 6 boys and 6 girls
around a cicular table so that
i) all the girls come together ii) no two girls come together
iii) boys and girls come alternately.
 SESSION - 8

AIM
 Combinations

COMBINATIONS

Definition: A selection that can be formed by taking some or all of a

finite set of things (or objects) is called a combination.

Eg.1: The combinations formed by taking two things at a

time from the set {A, B, C} are {A, B}, {A,C}, {B, C}.
Eg.2: The combinations formed by taking two things at a ` time
from the set {1, 2, 3, 4} are {1, 2}, {1, 3}, {1, 4}, {2,
3}, {2, 4}, {3, 4}.

Note1: Formation of a combination by taking r elements from a

finite set A means picking up an ‘r’ element subset of A.

Note 2: The number of combinations of ‘n’ dissimilar things taken

‘r’ at a time is equal to the number of r element subsets of a set
containing n elements.

Note 3: The number of combinations of ‘n’ dissimilar things taken

‘r’ at a time is denoted by or
C(n, r) or
THEOREM 1
!
= !( ) !
Proof: Consider one of the combinations. This combination consists
of ‘r’ dissimilar things. If we permute the ‘r’ things we get r!
Permutations. Thus each combination gives rise to r!
Permutations and hence combinations give rise to r!
Permutations. But the number of permutations of ‘n’ dissimilar
things taken ‘r’ at a time is .
!
∴ != ⟹ = =
! !( )!

( )( )….( )
Note 1: =
! . . …..
× ×
e.g.: 10 = = 120
× ×

Note 2: exists only when r ≥ n.

Note 3: is a positive integer and divides .

Corollary 1:
= 1.

THEOREM 2
! !
Proof: = =( =
!( )! ) ![ ( )]
×
e.g.: 20 = 20 = 20 = = 190
×
THEOREM 3
+ = ( + 1)
! !
Proof: + = +(
!( )! ) !( )!
!( ) !( ) !( ) ( )!
= = =
!( )! !( )! !( )!
= ( + 1)
Second Proof = ( + 1) = The number of combinations of
(n + 1) things taken ‘r’ things at a time = The number of
combinations that a particular thing must be excluded + The
number of combinations that the particular thing must be
included = + .

THEOREM 4
If = then r = s or r+ s = n.
Proof: Suppose r  s. Let r > s. Then n - r < n - s
! !
= ⟹ !( )! = !( )! ⟹ ! ( − )! = ! ( − )!
⟹ s!(s +1) (s + 2) .... r(n - r)! = s! (n - r)! (n - r + 1) (n - r + 2)
....(n - s)
⟹ (s +1) (s + 2) .... r = (n - r + 1) (n - r + 2) ....(n - s)
Since each side of this equation is a product of r - s consecutive
positive integers, we get r = n - s ⟹ r + s = n. Similarly if r < s,
then also we can prove that r + s = n.
 If − then r = s or r + s = n.
e. g. 1: If = = then n = 4 + 5 = 9.
e.g. 2: If 15 = 15 then 15 = r + 2r ⟹ r = 5
THEOREM 5
Let n and r be non- negative integers such that 1 ≤ r ≤ n.
Then, = . −1
!
Proof: We have, =( )! !
.( )!
⟹ = {( ) ( )}!( )!
( )!
⟹ = {( ) ( )}!( )!
= . −1

THEOREM 6
If 1 ≤ r ≤ n, then n.n-1 Cr-1 = (n - r +1)nCr-1
!
Proof: . {( ) ( )}!( )!
!
=( ) !( )!
( ). !
=( )( ) !( )!

!
= ( − + 1) ( ) !( )!
!
= ( − + 1) { ( )}!( )!
= ( − + 1)

Important points
i) nCr is a natural number.
ii) nC0 = nCn = 1, nC1 = n
iii) nCr = nCn - r
iv) nCr + nC r - 1 = n+1Cr
v) n Cx = nCy ⟺ x = y or x + y = n
vi) n. n-1Cr-1 = (n - r + 1) nCr-1
vii) If n is even then the greatest value of n Cr is nCn /2.
viii) If n is odd then the greatest value of nCr is
( )
ix) = . −1 = ( )
.n-2Cr-2 = ………..
x) =
xi) =
xii) + + +. … … . . =2
xiii) + + +. . . . = + + +. . . . . . = 2
xiv) C + C + C + … … . . + C =2
xv) C + C + C + … … . . + C = C

Worked out examples

1] If 17C2t+1 = 17C3t-5, find t.

Sol: 17C2t+1 = 17C3t-5 ⟹ 2t + 1 = 3t - 5 or (2t + 1) + (3t - 5) = 17 ⟹ 1 +
5 = t or 5t = 21 t= 6 or t = 21/5 which is not and integer.  t =
6.

2] If nPr = npr+1 and nCr = nCr-1, find the values of n and r.

Sol: nPr = nPr+1
! !
⟹ ( )! = ( )!
⟹ ( ) !( )!
=( )!
⟹ n - r = 1 ----- (i)
and, nCr = nCr-1
! !
⟹ ( ) !( ) ! = ( )( ) !( )!
⟹ =
⟹ n - r + 1 = r ⟹ n - 2r = -1 --------(ii)
Solving (i) and (ii), we obtain n = 3 and r = 2.
3] If n+1Cr+1:nCr:n-1Cr-1 = 11: 6: 3, then find the values of n and r.
Sol: Here =
⟹ . = ⟹ =
⟹ 6n + 6 = 11r + 11 ⟹ 6n - 11r = 5
and = ⟹ . =
⟹ =2 ⟹ n = 2r
Solving (1) and (2) we get n = 10, r = 5.

4] If there are 12 persons in a party, and if each two of them

shake hands with each other, how many handshakes happen in
the party?
Sol: It is to note here that, when two persons shake hands, it is
counted as one handshake, not two. So, this is a problem on
combinations.
The total number of handshakes is same as the number of ways
!
of selection 2 persons among 12 persons = 12 = ! × ! = 66

5] In how many ways can a cricket eleven be chosen out of a

batch of 15 players if
i) There is no restriction on the selection ;
ii) A particular player is always chosen;
iii) A particular player is never chosen?
Sol: i) The total number of ways of selecting 11 players out of 15
is
× × ×
15 = 15 = 15 = = 1365
× × ×
ii) If a particular player is always chosen. This means that 10
players are selected out of the remaining 14 players.
  Required number of ways = 14 = 14 = 14 =
1001
iii) If a particular player is never chosen. This means that 11
players are selected out of the remaining 14 players.
 Required number of ways =14 = 14 = 14 = 364
6] Find the number of ways of forming a committee of 5 members
from 6 men and 3 ladies. How many committee contain at least
two ladies.
Sol: The number of ways of forming a committee of 5 members
from 6 men and 3 ladies
× × × ×
= 9 = × × × × = 126.
Since the committee contains at least 2 ladies, the members of
the committee may be of the following two types i) Committee
contains 3 men, 2ladies ii) Committee contains 2 men, 3 ladies.
The number of selections in first type = 6 × 3 = 20 × 3 =
60
The number of selections in first type = 6 × 3 = 15 × 1 =
15
The number of ways of forming committee containing at least 2
ladies = 60 + 15 = 75.

7] Let A be the set of 4 - digit numbers , where

> > > then n(A) is equal to
a)126 b) 84
c) 210 d) none of these
Sol: Any selection of four digits from the ten digits 0, 1, 2, 3, ..., 9
gives one such number.
So, the required number of numbers = 10 = 210. Hence (c) is
the correct answer.
8] Six X’s have to be placed in the squares of the figure below,
such that each row contains at least one X. In how many
different ways can this be done?
X X

X X X X

or

X X X X

X X

In the given figure there are 8 squares and we have to place 6

X’s this can be done in
.
i.e., 8 = 8 = . = 28 ways
But these include the possibility that either headed row or
lowest row may not have any X. These two possibilities are to
be excluded.
 Required number of ways = 28 – 2 = 26
Alternative Method: If there are n rows, I row has squares.
II row has squares, III row has squares, and so on. If we
placed Xs in the squares such that each row contain at least
one X. The number of ways
= Coefficient of in + +. . . . . . + ×
+ ….....+ ×
+ +. . . . . . + . . . . . . ..
Sol: The required no. of ways
= coefficient of x6 in 2 +2 2 +4 +4 +
4 2 +2
= coefficient of x3 in (4 + 4x + x2) (4 + 6x + 4x2 + x3)
= 4 + 16 + 6 = 26

9] A man has 7 relatives, 4 of them are ladies and 3 gentlemen ;

his wife also has 7 relatives, 3 of them are ladies and 4
gentlemen. In how many ways can they invite a dinner party of
3 ladies and 3 gentlemen so that there are 3 of them man’s
relatives and 3 of the wife relatives?
Sol: The four possible ways of inviting 3 ladies and 3 gentlemen for
the party with the help of the following table
Man’s relatives Wife’s relatives Number of ways
Ladies Gentleman Ladies Gentleman
(4) (3) (3) (4)
0 3 3 0 4C × 3C × 3C × 4C
0 3 3 0
=1
1 2 2 1 4C × 3C × 3C × 4C
0 2 2 1
= 144
2 1 1 2 4C × 3C × 3C × 4C
0 1 1 2
=324
3 0 0 3 4C × 3C × 3C × 4C
3 0 0 3
= 16
 Required number ways to invite = 1 + 144 + 324 + 16 = 485.
10] i) There are p intermediate stations on a railway line from
one terminus to another. In how many ways a train can
stop at 3 of these intermediate stations if no of two of these
stopping stations are to be consecutive?
ii) There are 8 railway stations along a railway line. In how
many ways can a train be stopped at 3 of these stations
such that no two of them are consecutive?
Sol: i) Let there be p intermediate stations between two terminus
stations A and B as shown above.
No. of ways the train can stop in three intermediate stations
= pC3.
These are comprised of two exclusive cases viz.
i) At least two stations are consecutive.
ii) No two of which is consecutive.
Now there are (p-1) pairs of consecutive intermediate
stations.
In order to get a station trio in which at least two stations
are consecutive, each pair can be associated with a third
station in (p - 2) ways. Hence total no. ways in which 3
stations consisting of at least two consecutive stations can
be chosen in (p-1) (p - 2) ways. Among these, each triplet of
consecutive stations occur twice. For example, the pair
( , ) when combined with and the pair ( , )
when combined wit Sn - 1 gives the same triplet and is
counted twice. So, the number of three consecutive stations
trio should be subtracted.
Now, no. of these three consecutive stations trio is (p –
2) Hence the no. of ways the triplet of stations consisting of at
least two consecutive stations can be chosen in
{( − 1)( − 2)( − 2)} ways = ( − 2) ways
Hence the no. of ways the train can stop in three consecutive
stations is
( )( )
= − ( − 2) = − ( − 2)
. .
( ) ( )( )( )
= = = ( − 2)
. .
ii) Number of required ways = =

11] n different things are arranged around a circle. In how many

ways can 3 objects be selected when no two of the selected
objects are consecutive?
Sol: Let the objects be denoted by a , a , a , . . . . . . a . arranged in a
circle. We have to select 3 objects so that no two of them are
consecutive. For this we first find the number of ways in which
2 or 3 objects are consecutive. Now, number of ways in which 2
or 3 object are consecutive is obtained as follows with the
number of such triples is , ,......, .
[Note that we have excluded since it will be repeated
again for if we start with , then we shall get triples:
, ]
So number of such triples when we start with is (n - 3).
Similarly with , , . . . . .. we shall get the numbers of
triples that is (n - 3).
But total number of triples is .
Hence required number of ways
= − ( − 3)
( )( )
= − ( − 3)
. .
= [ 2 − 3 + 2 − 6 + 18]
 = ( 2 − 9 + 20)
= ( − 4) ( − 5)

CLASS EXERCISE

1] Evaluate 20 +∑ 25 − .
10 20
2] The sum∑ , where = 0, if p < q is maximum
−
when m is:
a) 5 b) 10 c) 15 d) 20
3] If a set A has 7 elements. Find the number of subsets of A
having.
i) 4 elements ii) at least 5 elements.
iii) at most 3 elements
4] A person wants to take 9 children to an exhibition by taking 3
at a time in all possible ways. How many times does a
particular child go to the exhibition and how many times does
the person go to the exhibition?
5] Find the number of ways of forming a committee of 5 members
out of 6 Indians and 5 Americans so that always the Indians
will be in majority in the committee.
 SESSION – 9 & 10

AIM
 Total Combination
 Selection of Objects from a group of alike and different objects
 Division and Distribution of objects into groups of unequal
size.
 Division of objects into groups of equal size.

TOTAL COMBINATION

THEOREM 1
The total number of combinations of (p + q) things taken any
number at a time when p things are alike of one kind and q
things are alike of second kind is (p + 1)(q + 1).

Proof: Since any number of things can be selected from (p +

q) things, the combinations may contain any number of things
from 0 to (p + q) things. Of the first kind of p like things, 0
(none), 1, 2, 3, .... or p things may be selected. Thus the first
kind of things may be selected in (p + 1) ways. Of the second
kind of q like things, 0 (none), 1, 2, 3, .... or q things may be
selected. Thus the second kind of things may be selected in (q +
1) ways.
Hence the total number of ways is (p + 1) (q + 1).
 The number of required combinations
= (p + 1) (q + 1).

Note: The total number of combinations (p + 1) (q + 1) of p +

q things taken any number at a time, includes the case in which
nothing will be selected.
Corollary 1:
The total number of combinations of (p + q) things taken one or
more at a time when p things are alike of one kind and q things are
alike of second kind is (p + 1)(q + 1) -1.

Corollary 2:
The total number of combinations of (p1 + p2 +...pk) things taken
any number at a time when p1 things are alike of one kind, p2
things are alike of second kind, ... pk things are alike of kth kind, is
(p1 + 1) (p2 + 1)....(pk + 1).
Ex.: The total number of combinations of 10 things when 6 things
are alike of one kind and 4 things are alike of second kind is (6
+1) (4 + 1) = 35.

Corollary 3:
The total number of combinations of (p1 + p2 + ...pk) things taken
one or more at a time when p1 things are alike of one kind, p2
things are alike of second kind, ... pk things are alike of kth kind, is
(p1 + 1) (p2 + 1)....(pk + 1)-1.

Corollary 4:
The total number of combinations of n different things taken any
number at a time is 2n.

Corollary 5:
The total number of combinations of n different things taken one or
more at a time is 2n-1.
Ex: There are 12 different books on a shelf. In how many ways we
can select atleast one of them.
Sol: We may select 1 book, 2 books, ........., 12 books.
 The number of ways = 12 + 12 +. . . . . . +12 = 2 −
1 = 4095
Note: + + +. . . . =2 .
Ex.: The total number of combinations of 8 different things is
28 = 256.

Corollary 6:
Number of ways in which at least one object may be selected out of
p alike objects of one kind, q alike objects of second kind and r alike
objects of third kind and rest all are different is( + 1)( +
1)( + 1). 2 ( )

Ex: Find the number of ways in which one ore more letters can be
selected from the letters
AAAAABBBB CCCDDEFG.
Sol: Here 5 A’s are alike 4 B’s are alike, 3C’s are alike, 2D’s are alike
and E, F, G are different.
Then total number of combinations
= (5 + 1) (4 + 1) (3 + 1) (2 + 1) 23 - 1
= 6. 5. 4. 3. 8 – 1 = 2879

Corollary 7:
The number of ways of selecting r items out of
n identical items is 1.

Ex.: The number of ways of selecting 5 balls out of 8 identical balls

is 1.
Corollary 8:
The total number of ways of selecting zero or
more from a group of n identical items is (n + 1).

Corollary 9:
The total number of ways of selecting atleast
one from n identical items is n

Ex.: How many combinations of 7 shirts?

Sol: The shirts are alike in combinations 1 shirt or 2 shirts or 3
shirts or ... or 7 shirts (shirts are identical) in each cases 1
combination.
Hence number of combinations = 1 + 1+ 1 + 1 + 1 + 1 + 1 = 7

SELECTION OF OBJECTS FROM A GROUP OF

ALIKE AND DIFFERENT OBJECTS
The number of combinations (Selections) of n objects, of
which p are identical, taken r at a time is = − + −
+ − + . . . . + − =∑ − , if ≤ and
it is = − + − +. . . . + − =∑ − ,
if r > p

Ex.: A bag has contains 23 balls in which 7 are identical. Then find
the number of ways of selecting 12 balls from bag.
Sol: Here n = 23, p = 7, r = 12 (r > p)
 Required number of selections = ∑ 16
= 16 + 16 + 16 + 16 + 16 + 16 + 16 + 16
= 16 + 16 + 16 + 16 + 16 + 16 +
16 + 16
=17 + 17 + 17 + 17
 ∵ + = +1
= 17 + 17 + 17 + 17 ∵ =
= (17C11+17C12) + (17C9 + 17C10)
= 18C12 + 18C10
= 18C6 + 18C8

Worked out examples

1] A question paper consists of two sections having respectively 3

and 5 questions. The following note is given on the paper “It is
not necessary to attempt all the questions. One question from
each section is compulsory”. In how many ways can a
candidate select the questions?
Sol: Here we have two sections A and B (say), the section A has 3
questions and section B has 5 questions and one question from
each section is compulsory according to the given direction.
 Number of ways selecting one or more than one question
from section A is 23 - 1 = 7 and number of ways selection one
or more than question form section B is 25 - 1 = 31
Hence by the principle of multiplication, the required number
of ways in which a candidate can select the questions = 7 × 31
= 217.

2] 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 books is 63, find the value of n.
Sol: Given student select at most n book from a collection of (2n +
1) books. It means that he select one book or two book or three
book or ......or n books. Hence by the given hypothesis.
2n+1C + 2n+1C + 2n+1C + …….. + 2n+1C = 63
1 2 3 n
 But we know that 2n+1C0 + 2n+1C1 + 2n+1C2 + 2n+1C3 + …… + 2n+1C2n+1
=2
Now 2n+1C0 = 2n+1C2n+1 = 1
then 1 + 2n +1 C1 + 2n +1 C2+ ...........+ 2n +1 Cn = 63 + 1
⟹ 2n +1C0 + 2n +1C1 + 2n +1 C2+ ...........+ 2n +1 Cn = 64
⟹ ( 2n +1 C0 + 2n +1 C1 + 2n +1 C2+ ...........+ 2n +1 C2n + 1) =
64
⟹ . 2 2n + 1 = 64
⟹ 22n = 26 ⟹ 2n = 6 ⟹ n = 3

3] There are 12 fruits in a basket of which 5 are apples, 4

mangoes and 3 bananas (fruits of same species are
identical).How many ways are there to select atleast one fruit.
Sol: Let x be the number of apples being selected
y be the number of mangoes being selected and
z be the number of bananas being selected.
Then x = 0, 1, 2, 3, 4, 5,
y = 0, 1, 2, 3, 4
z = 0, 1, 2, 3
Total number of triplets (x, y, z) is 6 × 5 × 4 = 120
Exclude (0, 0, 0)
 Number of combinations = 120 -1 = 119.
4] How many words can be formed by taking 4 letters at a time
out of the letters of the word’ MATHEMATICS’.
Sol: There are 11 letters viz. MM, AA,TT, H, E, I, C, S. All these letters
are not distinct, so we cannot use nPr. We can choose 4 letters
from the following ways:
i) All the four distinct letters: There are 8 distinct letters viz.
M, A, T, H, E, I, C, S out of which 4 can be chosen in 8C4 ways.
So, the total number of groups of 4 letters = 8C4. Each such
group has 4 letters which can be arranged in 4! ways. Hence
the total number of words = 8C4 × 4! = 8P4 = 1680.

ii) Two distinct and two alike letters: There are 3 pairs of alike
letters viz MM, AA, TT, out of which one pair can be chosen in
3C1 ways. Now we have to choose two letters out of the
remaining 7 different types of letter which can be done in 7C2
ways. So, the total number of groups of 4 letters in which two
are different and 2 are alike is 3C1 × 7C2. Each such group has
4 letters of which 2 are alike and remaining two distinct and
!
they can be arranged in ! ways. Hence, the total number of
!
words in which two letters are alike = 3C1 × 7C2 = ! = 756.
iii) Two alike of one kind and two alike of other kind: There are
3 pairs of 2 alike letters out of which 2 pairs can be chosen in
3C2 ways. So, there are 3C2 groups of 4 letters each. In each
group there are 4 letters of which 2 are alike of one kind and
!
two alike of other kind. These 4 letters can be arranged in ! !
ways. Hence, the total number of words in which two letters
 !
are alike of one kind and two alike of other kind = × ! !=
18.
From i), ii) and iii) the total number of 4 letter words = 1680 +
756 + 18 = 2454.

5] The number of words of four letters containing equal number

of vowels and consonants, repetition being allowed, is
a) 1052 b) 210 × 243
c) 105 × 243 d) none of these
Sol: The number of selections of 1 pair of vowels and 1 pair of
consonants = ×
The number of selections of 2 different vowels and 2 different
consonants = ×
The number of selections of 2 different vowels and 1 pair of
consonants = ×
The number of selections of 1 pair of vowels and 2 different
consonants = ×
So that the required number of words
! ! !
= × × ! !+ × × 4!+ × !+ × × !
Hence (d) is the correct answer.
DIVISION AND DISTRIBUTION OF OBJECTS INTO GROUPS
OF UNEQUAL SIZE.

THEOREM -1
The number of ways in which (m + n) things can be divided
into two different groups of m and n things respectively is
( )!
! !
Proof: If we select m things from (m + n) things then
( + ) things can be divided into two different groups of m
and n things respectively.
( )!
∴ The required number of ways =( )
= ! ! .
NOTE
The number of ways in which ( + + ) items can be
divides into unequal groups containing m, n, p items is
( )!
× = =
! ! !

DIVISION OF OBJECTS INTO GROUPS OF EQUAL SIZE.

i) If m = n, then the groups are equal size. Division of these

groups can be given by two types.
Type I: If order of group is not important
The number of ways in which 2n different things can be
( )!
divided equally into two groups is !( !)
Proof: Let k be the number of ways of dividing 2n things
into two groups of n things each. In any division, the groups
can be interchanged without getting a new distribution of
things. The two groups in any division can be interchanged in
2! ways. Therefore the two groups in k divisions can be
interchanged in 2! k ways.But the number of ways of selecting
 n things from 2n things is 2n Cn. Then 2! k = 2n Cn
( )!
⇒ = =
! !( !)

Type II: If order of group is important:

The number of ways in which 2n different things can be divided
equally into two distinct groups is
( )! !
× 2! = (
!( !) !)

ii) If m = n = p, then the groups are equal size. Division of

these groups can be given by two types.

Type I: If order of group is not important

The number of ways in which 3p different things can be
!
divided equally into three groups is !( !)
Type II: If order of group is important:
The number of ways in which 3p different things can be
( )! !
divided equally into three distinct groups is !( !) × 3! = ( !)

NOTE:
i) The number s of ways to distribute ( + + ) items among
three persons in groups containing m, n and p items is
( )!
× 3! = (number of ways to divide) × (number of
! ! !
groups)
ii) If order of group is not important: The number of ways in
which mn different objects can be divided equally into m
groups each containing n objects and the order of the group is
( )!
not. important is ( !) . !
iii) If order of group is important: The number of ways in which
mn different objects can be divided equally into m groups
containing n objects and the order of group is important is
( )! ( )!
( !)
× = ( !)
!

Corollary 1:
The number of ways in which 2n things can be
( )!
divided among two persons equally is (
!)
Corollary 2:
The number of ways in which (n1 + n2 + ....nk)
things can be divided into k different groups of n1 things, n2
( .... )
things, .....nk things respectively is .
! !.... !
Corollary 3:
The number of ways in which kn things can be
( )!
divided into k equal groups of n things each is !( !)
.
Corollary 4:
The number of ways in which kn things can be
( )!
divided among k persons equally is ( .
!)
Worked out examples:
1] In how many ways can a pack of 52 cards be divided equally
among four players in order?
Sol: Here 52 cards are to be divided into four equal groups and the
order of the groups in important.
! !
So. required number of ways = (
4! = (
!) ! !)
Aliter: For the first player we have 52C13 choices, for the
second player 39C13 choices, for the third player 26C13
choices and for the last player we have 13C13 choices.
Hence, the total number of way
!
= 52C13 × 39C13 × 26C13 × 13C13 = ( !)

2] In how many ways can a pack of 52 cards be formed into 4

groups of 13 cards each?
Sol: Here order of group is not important, then the number of ways
in which 52 different cards can be divided equally into 4
!
groups is !( !)

Alternative Method: Each group will get 13 cards. Now first

group can be given 13 cards out of 52 cards in 52C13 ways.
Second group can be given 13 cards out of remaining 39 cards
(i.e. 52 - 13 = 39) in 39C13 ways Third group can be given 13
cards out of remaining 26 cards (i.e., 39 - 13 = 26) in 26C13
ways and fourth group can be given 13 cards out of remaining
13 cards (i.e., 26 - 13 = 13) in 13C13 ways. But the all (four)
groups can be interchanged in 4! ways. Hence the required
number of ways
 = 52C13 × 39C13 × 26C13 × 13C13 × !
! ! ! !
= × × ×1× =(
! ! ! ! ! ! ! !) !

3] In how many ways can 12 different balls be divided between 2

boys, one receiving 5 and the other 7 balls? Also in how many
ways can these 12 balls be divided into groups of 5, 4 and 3
balls respectively?
Sol: I Part: Here order is important, then the number of ways in
which 12 different balls can be divided between two boys
which contains 5 and 7 balls respectively, is
!
= ! ! × 2!
. . . . . !
= ( . . . . ) !
.2 = 1584
Alternative Method: First boy can be given 5 balls out of 12
balls in 12 C5. Second boy can be given 7 balls out of 7 balls
(i.e. 12 − 5 = 7) but there order is important ( boys
interchanged by 2 types) then required no. of ways
= × × 2!
! !×
= ! ! × 1 × 2! = !× !
. . . . . !.
= = 1584.
. . . . . !

II Part: Here order is not important then the number of ways

in which 12 different balls can be divided into three groups of
5, 4, and 3 balls respectively, is
! . . . . . . . !
= ! ! ! = !. . . . . . . = 27720
 Alternative Method: First group can be given 5 balls out of 12
balls in 12 C5 ways. Second group can be given 4 balls out of
remaining 7 balls (12 − 5 = 7) in 7 C 4 and 3 balls can be given
out of remaining 3 balls in 3C3.
Hence the required number of ways (Here order of groups are
not important)
! ! !
= × × = ! !× ! !×1= ! ! !

4] Find the number of solutions of the equation + + =

6, where , , ∈ .
Sol: x + y + z = 6, , , ∈
 The number of non-negative integer solutions
= = = 28

Aliter: Number of solutions

= coefficient of x 6 in (1 + x + x 2 + ....x 6 ) 3
= coefficient of x 6 in (1 - x 7 ) 3 (1- x) -3
= coefficient of x 6 in (1- x) -3
3+6−1
= = = 28 .
6

5] Find the number of integral solutions for the equation x + y + z

+ t = 20, where x, y, z, t are all ≥ – 1.
Sol: x + y + z + t = 20, where , , , ≥ − 1
Let x + 1 = a, y + 1 = b, z + 1 = c, t + 1 = d where , , , ≥
∴ + + + = 20
⇒ a-1 + b - 1 + c-1 + d - 1= 20 ⇒ a + b + c + d = 24
∴ The number of non negative integer.
Solutions = 24 + 4 _ 1C4-1 = 27C3
6] In how many ways can a pack of 52 cards be divided in 4sets,
three of them having 17 cards each and fourth just 1card?
Sol: First we divide 52 cards into two sets which contains 1 and 51
!
cards respectively is ! !
Now 51 cards can be divided equally in three sets each
contains 17 cards (Here order of sets is not important) in
!
ways.
!( !)
! !
Hence the required number of ways = ×
! ! !( !)
! !
= =(
! !( ) !) !

Alternative Method: First set can be given 17 cards out of 52

cards in 52C17. Second set can be given 17 cards out of
remaining 35 cards (i.e. 52 - 17 = 35) in 35C17 . Third set can
be given 17 cards out of remaining 18 cards (i.e., 35 - 17 = 18)
in 18 C17 and fourth set can be given 1 card out of 1 card in
1C1. But the first three sets can be interchanged in 3! ways.
Hence the total number of ways for the required distribution
= × !× × × !
! ! ( )!
= × × ×1× =( ) ! !
! ! ! ! ! ! !

7] 10 different toys are to be distributed among 10 children. Total

number of ways of distributing these toys so that exactly 2
children do not get any toy, is equal to
a) (10!) +( ) b) (10!) +( )
! ! ! ! ! ! ! ! ! !
c) (10!) +( d) (10!) +(
! ! !) ! ! ! !) ( !)
Sol: It is possible in tow mutually exclusive cases
Case 1: 2 children get none, one child gets three and all
remaining children get one each.
Case 2: 2 children get none, 2 children get 2 each and all
remaining children get one each.
!
In case one, number of ways = ! ! ! . 10!
!
In second case, number of ways = ( . 10!
!) !
Thus total ways = (10!) +(
! ! ! !) !
8] Between two junction stations A and B there are 12
intermediate stations. The number of ways in which a train can
be made to stop at 4 of these stations so that no two of these
halting stations are consecutive is
a) 8C4 b) 9C4
c) −4 d) none of these
Sol: Let x1, be the number of stations before the first halting
station. x2 between 1st and 2nd, x3, x4, x5 on the right of 4th
station.
∴ ≥ 0, ≥ 0, , , ≥ 1. such that
x1 + x2 + x3 + x4+ x5 = 8 ..........(1)
Let y2 = x2 - 1, y3 = x3 -1, y4 = x4 -1
∴ (1) ⇒ x1 + y2 + y3 + y4+ x5 = 5, where y1, y2, y3 ≥ 0
∴ no. of solutions = =
CLASS EXERCISE
1] The number combinations that can be formed with 5 oranges,
4 mangoes and 3 bananas when it is essential to take
i) at least one fruit . ii) one fruit of each kind.
2] There are p copies of n different books. The number of
different ways in which a nonempty selection can be made
from them is
a) ( + 1) − 1 b) −1
c) ( + 1) −1 d) ( + 1)
3] The total number ways of selecting five letters from the letters
of the word INDEPENDENT, is
a) 72 b) 64 c) 56 d) None of these
4] In how many ways can we decide batting order of Indian
cricket team such that Tendulkar will always bat before
Sehwag and Sehwag before Dravid and Dravid will never be
the last person to bat?
a) 4 × 9! b) (10)! c) 5 × 9! d) none of these
5] Find the number of ways of distributing 50 identical things
among 8 persons in such a way that three of them get 8 things
each, two of them get 7 things each and remaining 3 get 4
things each,
6] In how many ways can we put 12 different balls in three
different boxes such that first box contains exactly 5 balls?
7] In a bakery four types of biscuits are available. In how
many ways a person can buy 10 biscuits if he decide to
take atleast one biscuit of each variety.
8] The number of points (x,y,z) in space, whose each coordinate is
a negative integer such that x + y + z + 12 = 0 is ------
9] The number of ways in which 30 marks can be allotted to 8
questions if each question carries at least 2f marks, is
a) 115280 b) 117280 c) 116280 d) None of these
10] Five balls are to be placed in three boxes. Each can hold all the
five balls. In how many different ways can we place the balls so
that no box remains empty, if
i) balls and boxes are all different
ii) balls are identical but boxes are different
iii) balls are different but boxes are identical
iv) balls as well as boxes are identical
 SESSION - 11

AIM
 Geometrical application of nCr

THEORY
Geometric Applications of:
1] If out of n points m are collinear, then
Number of straight lines = − + 1
2] In a polygon the total number of diagonals out of n points (no
( )
three are collinear) = nC2 – n =
3] Number of triangles out of n points in which m are collinear
= −
4] Number of triangles that can be formed out of a points (when
none of the side is common to the sides of polygon)
= − ( − 3) = ( − 4)( − 5).
5] Number of parallelograms in two systems of parallel lines
(when 1st set contains m parallel lines and 2nd set contains n
parallel lines) = ×
6] Number of square in two systems of perpendicular parallel
lines (when 1st set contains m parallel lines and 2nd set
contains n parallel lines). = ∑ ( − )( − ); ( < )
7] Number of rectangles of any size in a square of n × n is ∑
and the number of squares of any size is ∑ ( + 1 − )( +
1− ).
8] In a rectangle of n p (n<p), the number of rectangles of any size
is ( + 1)( + 1) and number of squares of any size is
∑ ( + 1 − )( + 1 − ).
9] 'n' straight lines are drawn in the plane such that no two lines
are parallel and no three lines are concurrent. Then the
number of parts into which these lines divide the plane is equal
( )
to 1 + =1+∑
10] There are 'n' straight lines in a plane no two of which are
parallel and no three passes through the same point. Their
points of intersection are joined. Then the number of fresh
lines thus introduced is ( − 1)( − 2)( − 3)
11] Number of rectangles on a chess board (including squares) =
1296
12] Number of squares on a chess board (exclusively squares) =
204
13] Number of rectangles on a chess board which are not squares =
1092.

Proofs of some of the above results

1] There are n points in a plane out of these points no three are in
the same straight line except m points which are collinear. Hoe
many (i) straight lines (ii) and triangles can be formed by
joining them?
Sol: i) Number of lines formed by joining any two points out of
given n points = nC2 and number of lines formed by joining any
two points out of m collinear points = mC2, but these collinear
points giving exactly one straight line passing through all of
them.
Hence required number of straight lines = nC2–mC2 + 1.
ii) Number of triangles formed by joining any three points out
of m collinear points
 = nC3 and number of triangles formed by joining any three
points out of m collinear points
= mC3, but not triangle would be formed by joining any
three points out of these m collinear points.
Hence the number of triangles formed = nC3 - mC3

2] There are n straight lines in a plane such that n1 of them are

parallel in one direction, n2 are parallel in different direction
and so on, nk are parallel in another direction such that n1 + n2
+ ......+ nk = n. Also no three of the given lines meet at a point.
Prove that the total number of points of intersection is
−∑
Sol: Total number of points of intersection when no two of n given
lines are parallel and no three of them are concurrent is nC2.
But it is given that there are k sets of n1, n2, n3, … nk parallel
lines such that no line in one set is parallel to a line in another
set.
Hence total number of points of intersection
= − ( + +. . . . + )
( ) ( ) ( ) ( )
= − + + ⋯+
( )
= − + +. . . . + −( + +. . . . + )
( )
= − ∑ −
= − ∑ = −∑
3] Find the number of triangles whose angular points are at the
angular points of a given polygon of n sides, but none of whose
sides are the sides of the polygon.
Sol: A polygon of n sides has n angular points. Number of triangles
formed from these n angular points = nC3. These are
comprised of two exclusive cases viz.
i) At least one side of the triangle is a side of the polygon.
ii) No side of the triangle is a side of the polygon.
.
D

. .
C

A .. B

Let AB be one side of the polygon. If each angular point of the

remaining (n - 2) points is joined with A and B, we get a
triangle with one side AB.
∴ No. of triangles of which AB is one side = (n- 2). like wise
number of triangles of which BC is one side = (n - 2) and of
which at leas tone side of the polygon = n ( n- 2).
Out of these triangle, some are counted twice. For example, the
triangle when C is joined with AB is ΔABC is taken when AB is
taken as one side. Again triangle formed when A is joined with
BC are counted when BC is taken as one side.
Number of such triangles = n.
Hence, the number of triangles of which one side is the side of
the triangle
= ( − 2) − = ( − 3)
Hence, the total no. of required triangles = − ( − 3) =
( − 4)( − 5)
4] There are n straight lines in a plane, no two of which are
parallel and no three passes through the same point. Their
point of intersection are joined. Show that the number of fresh
lines thus introduced is ( − 1)( − 2)( − 3).
Sol: Let AB be any one of the n straight lines and suppose it is

A .
intersected by some other straight line CD at P.
P
B
Then it is clear that AB contains ( − 1) of the points of
intersection because it is intersected by the remaining ( − 1)
straight lines in ( − 1) different points. Hence the aggregate
number of points contained in the n straight lines = ( − 1).
But in making up this aggregate each point has evidently been
counted twice. For instance, the point P has been counted once
among the points situated on AB and again among those on CD.
( )
Hence, the actual number of points = .
Now we have to find the number of new lines formed by
joining these points. The no. of new lines passing through P is
evidently equal to the no. of points lying outside the lines AB
and CD for we get a new line joining P with each of these points
only.
Now since each of the lines AB and CD contained ( − 2) points
besides the point P, the number of points situated on AB and
CD
= 2( − 2) − 1 = (2 − 3)
The number of points outside AB and CD
( )
= − (2 − 3) .
= the number of new lines passing through P and similarly
through each other points.
∴ The aggregate number of new lines passing through the
points
 ( ) ( )
= − (2 − 3)
But in making up this aggregate, every new line is counted
twice ; for instance if Q be one of the points outside AB and CD,
the line PQ is counted once among the lines passing through P
and again among these passing through Q.
Hence, actual number of fresh lines introduced
( ) ( )
= − (2 − 3)
= ( − 1)( − 2)( − 3).

5] How many diagonals are there in a polygon with n sides?

Sol: A polygon of n sides has n vertices. By joining any two vertices
of a polygon, we obtain either a side or a diagonal of the
polygon. Number of line segments obtained by joining the
vertices of a n sided polygon taken two at a time
= Number of ways of selecting 2 out of n
( )
= =
Out of these lines, n lines are the sides of the polygon.
( ) ( )
∴ Number of diagonals of the polygon = − =

6] If m parallel lines in plane are intersected by a family of n

parallel lines. Find the number of parallelograms formed.
Sol: A parallelogram is formed by choosing two straight lines from
the set of m parallel lines and two straight lines from the set of
n parallel lines.
Two straight lines from the set of m parallel lines can be
chosen in mC2 ways and two straight lines from the set of n
parallel lines can be chosen in nC2 ways. Hence, the number of
 ( ) ( )
parallelograms formed = × = × =
( )( )

Worked out examples:

1] 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
Sol: Required number of parallelograms
! ! ×
= × = ! ! × ! ! = × × = 18

2] The maximum number of points into which 4 circles and 4

straight lines intersect, is
a) 26 b) 50 c) 56 d) 72
Sol: 4 lines intersect each other in 4C2 = 6 points and 4 circles
intersect in 4P2 = 12 points.
Each line cuts 4 circles into 8 points.
∴ 4 lines cut 4 circles into 32 points.
∴ Required number = 6 + 12 + 32 = 50.

3] A polygon has 44 diagonals. The number of its sides are

a) 13 b) 12 c) 11 d) 10
Sol: Let n be the number of sides .
∴ Number of diagonals = n C2 - n = 44 (given)
( )
⇒ −
= 44 ⇒ − − 2 = 88
⇒ − 3 = 88 ⇒ ( − 11)( + 8) = 0
⇒ = 11
4] The number of rectangles excluding squares from a rectangle
of size 9 × 6, is
a) 391 b) 791
c) 842 d) None of these
Sol: Here n = 6 and p = 9.
∴ Number of rectangles excluding square
×
= (6 + 1)(9 + 1) − ∑ (7 − )(10 − )
= 945 − ∑ (70 − 17 + ) = 945 − 154 = 791.

5] Let Tn denote the number of triangles 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
Sol: − = 21
( )( ) ( )( )
⇒ − = 21 ⇒ − − 42 = 0 ⇒ =
−6,7
∴ =7

6] There are 5 points A, B, C, D, E, no. three are collinear and no

four are concyclic. If the line AB intersects all the circles drawn
through the five points then the number of points of
intersection on the line apart from A and B is
a) 6 b) 8 c) 10 d) 12
.
D

. .
E
B

Sol: A. . C

The circles through ACD, ACE, ADE intersect the line AB at 3

points
The circles through BCD, BCE, BDE intersect the line AB at 3
points
 The circles through CDE intersect the line AB at 2 points
The desired number is 3 + 3 + 2 = 8.

7] The straight lines I1, I2, I3 are parallel and lie in the same
plane. A total number of m points are taken on I1, n points on
I2, k points on I3, . The maximum number of triangles formed
with vertices at these points, are
a)
b)= − − −
c) + +
d) None of these
Sol: Total no. of points are m + n + k . The Δ’ s formed by these
points = .
Joining 3 points on the same line gives no triangle, such ’s are .
∴ Required number of triangles
= − ( + + ).

8] Two straight lines intersect at a point O. Points A1, A2 .....An are

taken on one line and points B1, B2, ........Bn on the other. If the
point O is not to be used, the number of triangles that can be
drawn using these points as vertices, is
a) n (n - 1) b) n (n - 1) 2
c) n2 (n - 1) d) n2 (n - 1) 2
Sol: No. of triangles = − − .
( )( ) ( )( )
= −
= ( − 1)(3 ) = ( − 1)
CLASS EXERCISE
1] Six straight lines are drawn in the plane such that no two lines
are parallel and no three lines are concurrent. Then find the
number of parts into which these lines divide the plane.
2] 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
intersection of the straight lines.
3] The number of triangles that can be formed by joining vertices
of a decagon so that the triangle has no common side with the
polygon, is
a) 120 b) 50 c) 110 d) 60
4] ABCD is a quadrilateral. 3, 4, 5 and 6 points are marked on the
sides AB, BC, CD and DA respectively. The number of triangles
with vertices on different sides, is
a) 270 b) 342 c) 282 d) None of these
5] There are 10 points in a plane of which no three points are
collinear and 4 points are concyclic. The number of different
circles that can be drawn through atleast 3 of these points is
a) 116 b) 120 c) 117 d) None of these
6] There are three coplanar parallel lines. If any p points are
taken on each of the lines, the maximum number of triangles
with vertices at these points is:
a) 3p2 (p - 1) + 1 b) 3p2 (p - 1) c) p2 (4p - 3) d)
None of these
7] The number of points in the cartesian plane with integral co-
ordinates satisfying the inequalities | | ≤ , | | ≤ , | − | ≤ ;
is
a) (k + 1)3 - k3 b) (k + 2)3 - (k + 1)3
c) (k2 + 1) d) None of these
 SESSION - 12

AIM:
 Uses of series
 Multinomial Theorem

THEORY: USES OF SERIES

i) If there are n1 objects of one kind, n2 objects of second kind,
and so on ….. nk objects of kth kind, then the number of ways of
choosing r objects out of these objects = coefficient of xr in
(1+ x + x2 +….+ ) (1+ x + x2 +….+ ….. ) (1 + x + x2
+….+ )
ii) If atleast one object of each kind is to be included in selection
of (i), then the number of ways of choosing r objects =
coefficient of xr in (x + x2 +….+ )(x + x2 +….+ ….. )(x + x2
+….+ )
iii) The number of possible arrangements (permutations) of r
objects out of n1 identical objects of one kind, n2 identical
objects of second kind and so on is r! coefficient of xr in
1+ + +. . . . + 1+ + +. . . . + .... 1 + +
! ! ! !

+. . . . +
! !

Ex1: Find the number of Combinations and permutations of

4 letters taken from the word EXAMINATION.
Sol: There are 11 letters A, A; I, I; N, N; E, X, M, T, O
Then No. Of combinations = coefficient of x4 in (1 + x + x2) 3 (1
+ x)5
(∵ 2A’s, 2I’s, 2N’s, 1E, 1X, 1M, 1T and 1O)
 = coefficient of x4 in {(1 + x)3 + x6 + 3 ( 1 + x)2 x2 + 3 ( 1 + x)
x4 } ( 1 + x)5
= coefficient of x4 in {(1 + x)8 + x6 ( 1 + x)5 + 3x2 ( 1+ x)7 +
3x4 ( 1 + x) 6}
= 8C4 + 0 + 3. 7C2 + 3
= 70 + 63 + 3 = 136 and No. of Permutations
= coefficient of x4 in 4! 1 + + 1+
! ! !

= coefficient of x4 in 4! 1 + + (1 + )
!
= coefficient of x4 in 4! (1 + ) + + (1 + ) +
(1 + ) (1 + ) =coefficient of x4 in 4! (1 + ) +
(1 + ) + (1 + ) + (1 + )
= 4! +0+ . + = 2454

Alternative Method: There are 11 letters: A, A; I, I; N, N ; E,

X, M, T, O
The following cases arise:
Case I: All letters different: The required number of
choosing 4 different letters from 8 different (A, I, N, E, X, M,
. . .
T, O) types of the letters = 8 C4 = . . . = 70 and No. of
Permutations = 8 P4 = 8.7.6.5 = 1680
Case II: Two alike of one type & Two alike of another type:
This must be 2A’s, 2I’s or 2I’s, 2N’s, 2A’ s.
∴ No. of selections = 3C2 = 3
!
and No. of Permutations = 3.
! !
 e.g. (For arrangements)

A A I I

Case III: Two alike and Two different: This must be 2A’s or
2I’s or 2N’s and for each case 7 different letters.
E.g. for 2A, 7 different’ are I, N,E, X, M, T, O.
×
∴ No. of selections = 3C1 x 7C2 = 3 x × =63
e.g. (For arrangements)

A X A O

and No. of Permutations = 63. = 756

From Case I, II and III,
The required No. of Combinations = 70 + 3 + 63 = 136
and No. of Permutations = 1680 + 18 + 756 = 2454

THEORY
Let x1, x2, x3, …… xr be integers. Then the number of
solutions to the equation x1+ x2 + …..+ xr = n ….(1) where a1
x1 b1, a2 x2 b2, ……,ar xr br, is equal to the coefficient of xn
in ( + +. . . . + )( + +. . . . + )
----- ( + +. … . . . + )-----(2). This is because the
number of ways, in which sum of 'r' integers in (1) equals n,
is the same as the number of times xn comes in (2).

Ex: In how many ways can three persons A,B,C having 6 one rupee
coins, 7 one rupee coins, 8 one rupee coins respectively donate
10 one rupee coins collectively?
Sol: + + = 10, where 0 ≤ ≤ 6, 0 ≤ ≤ 7, 0 ≤ ≤8
∴ Required number of ways = coefficient of x10 in (1 + x + x2
+.....+ x6) (1 + x + x2 + .....+ x7) (1 + x + x2 +.....+ x8)
 = Coefficient of x10 in
= Coefficient of x 10 in (1 - x7) (1- x8)(1 - x9) (1 - x)-3
= Coefficient of x10 in
(1 − − − )(1+ + + +. . . . + )
= − − − .
= 66 - 10 - 6 – 3 = 47.

Different cases of multinomial theorem:

Case 1: If the upper limit of a variable is more than (or)

equal to the sum required and lower limit of all the variables
are nonnegative, then the upper limit of that variable can be
taken as infinite.
Ex: In how many ways the sum of upper faces of four
distinct dies can be six.
Sol: + + + = 6, where 1 ≤ , , , ≤ 6
∴ Number of solutions = Coefficient of x6 in (x + x2 + .....)4
= Coefficient of x2 in (1 + x + x2 +......)4
= Coefficient of x2 in (1 - x)-4
= = = 10

Case 2: When coefficients of variables are not unity.

The number of solutions of
ax1 + bx2 + cx3 = n (where ≤ ≤ , ≤ ≤
, ≤ ≤ ) is the coefficient of tn in
(( ) + ( ) +. . . . +( ) ) ×
(( ) + ( ) +. . . . +( ) )
(( ) + ( ) +. . . . +( ) )
Ex: In how many ways can 15 identical blankets be distributed
among six beggars such that everyone gets at least one blanket
and two particular beggars get equal blankets and another
three particular beggars get equal blankets.
Sol: 2x1 + 3x2 + x3 = 15, where , , ≥ 1
∴ Required number of ways = Coefficient of x15 in
[( ) + ( ) +. . . . +( ) ][( ) + ( ) +. . . . +( ) ][ +
+. . . . + ]
= Coefficient of x9 in (1 + x2 + x4 +.....+ x8) (1+ x3 + x6 + x9)
(1+ x + x2 +....+ x9)
= Coefficient of x9 in (1 + x2 + x3 + x4 + x5 + 2x6 + 2x8 + 2x9)
(1+ x + x2 +....+ x9)
= 1 + 1+ 1 + 1 + 1 + 2 + 1 + 2 + 2 = 12

Case 3: When variable are distinct.

In such a case, we introduce some new variables to remove the
condition of distinctness.

Ex: In how many ways can 14 identical toys can be distributed

among three boys so that each one gets at least one toy and no
two boys get equal number of toys.
Sol: Let the boys get a, b, c toys respectively.
given a + b + c = 14, , , ≥ 1 and a, b, c, are distinct
Let a < b < c and x1 = a, x2 = b - a, x3 = c - b
∴ a + b + c = 14
⇒ + + + + = 14 ⇒ + + + + = 14
⇒ + + + + + = 14
⇒ 3 + 2 + = 14, where , , ≥ 1
∴ Required number of ways = Coefficient of x14 in
 [ + ( ) + ( ) + ( ) ][( ) + ( ) +. . . . +( ) ][ +
+. . . . + ]
= Coefficient of x8 in ( 1+ x3 + x6 + x9) (1 + x2 + .....+ x8) (1+ x
+...+ x8)
= Coefficient of x8 in (1+ x3 + x3 + x4 + x5 + x2 + x6 + x7 + 2x8)
(1 + x + x2 +...+ x8)
= 10.
Since three distinct numbers can be assigned to three boys in
3! ways .
So corresponding to each solution, we have Six ways of
distribution.
So total number of ways = 10 × 6 = 60.

Case 4: When the required sum is not fixed.

To find the number of solutions of the equation x1 + x2 +
…..+ xr ≤ n -(1), we introduce a dummy variable xr+1, so that
x1 + x2 + …..xr+1 = n-----(2), xr+1 ≥ 0 .
The number of solutions of (1) and (2) will be same.

Ex: In how many ways can we get a sum of at most 17 by throwing

six distinct dice.
Sol: Let + . . . . be the numbers that appears on the six dies.
∴ + + +. . . . + ≤ 17.
⇒ + +. . . . + + = 17 , where 1 ≤ ≤ 6 for i = 1, 2, -,
6 and x7 ≥ 0.
∴ Required number of solutions = Coefficient of x17 in (x + x2 +
....+ x6)6 (1 + x + x2 .....)
= Coefficient of x11 in (1 + x + ....+ x5)6 (1- x)-7
= Coefficient of x11 in (1 + x +...+ x5)6 (1- x)-7
 = Coefficient of x11 in (1 − ) (1 − )
=Coefficient of in
. . ( ) . . . . + ( ) [1 − ]
= − 6 × ( )= − 6. = −
6.
Remark: To find the number of solutions of x1 + x2 + ….. + xn >
n (when the values of x1, x2, ….xn are restricted), first find the
number of solutions of x1 + x2 + …..+ xn ≤ n and then subtract
it from total number of solutions.
Ex: In how many ways can we get a sum greater than 17 by
throwing six distinct dies.
Sol: From the above example, number of ways = 6 − ( −
6. )
Note:1. Coefficient of xr in the expansion of (1 − ) is
2.
(1 − ) =
( )
1+ + +
!
( )( ) ( )( )....( )
+. . . . + +. . ..
! !

Worked out examples:

1] In a shooting competition a man can score 5, 4, 3, 2, or 0 points
for each shot. Then the number of different ways in which he
can score 30 in seven shots is
a) 419 b) 418 c) 420 d) 421

Sol: Number of ways of making 30 in 7 shots is,

Coefficient of x30 in ( + + + + ) .
⇒ Coefficient of x 30 in {( + + ) + ( + 1)}
 ⇒ Coefficient of x30 in { ( + 1) + . ( + 1) . (1 +
+ )+ . ( + 1) . ( + + 1) +. . . . }
⇒ + ( + + )+ ( + 2) ⇒ 21 + 252 +
147 = 420

2] In number of ways in which the sum of upper faces of four

distinct dices can be six.
a) 10 b) 4 c) 6 d) 7
Sol: The number of required ways will be equal to the number of
solutions of ;
+ + + + =6 .....(1)
where + + + + ≥ 1
where; − 1 = , − 1 = , − 1 = , − 1 = ≥0
⇒ ( + 1) + ( + 1) + ( + 1) + ( + 1) = 6,
where , , , ≥ 0 ⇒ + + + =2
∴ Number of solutions = = 10.

3] Between two junction stations A and B, there are 12

intermediate stations. The number of ways in which a train can
be made to stop at 4 of these stations so that no two of these
halting stations are consecutive, is
a) 8C4 b) 9C4 c) 12C4 – 4 d) none of these
Sol: Let x1 be the number of stations before the first halting station,
x2 between first and second, x3 between second and third, x4
between third and fourth and x5 on the right of 4th stations.
Then ≥ 0, ≥ 0, , , ≥ 1 satisfying x1 + x2 + x3 + x4 +
x5 = 8.
The total number of ways is the number of solution of the
above equation
 Let y2 = x2 –1, y3 = x3 – 1, y4 = x4 – 1.
Then (i) reduces to x1 + y2 + y3 + y4 + x5 = 5, where y2, y3, y4
≥ 0.
The number of solution of this equation is 5 + 5 – 1C5 – 1 =
9C4.

CLASS EXERCISE
1] The number of ways can 14 identical toys be distributed
among three boys so that each one gets at least one toy and no
two boys get equal number of toys is
a) 45 b) 48 c) 60 d) None of these
2] In how many different ways can 3 persons A, B and C having 6
one rupee coins, 7 one rupee coins and 8 one rupee coins
respectively donate 10 one rupee coins collectively.
3] In an examination, the maximum marks for each of the
three papers are 50 each. Maximum marks for the fourth
paper is 100. Find the number of ways in which a
candidate can score 60% marks on the whole.
4] The number of non - negative integral solutions of y 1 +
y 2 + y 3 + y 4 + y 5 ≤ 20 is
a) 25 C 5 b) 24 C 4 c) 26 C 6 d) 25 C 20
 KEY
SESSION – 1
CLASS EXERCISE
1. a 3. 225 4. i) 60 ii) 108 5.i) 24 ii) 64 iii) 60
SESSION – 2
CLASS EXERCISE
1. 325 2. 870 3. 600 4. 12 5. d
SESSION – 3 & 4
CLASS EXERCISE
1. 4 × 8 × 26 P 2= 20800 2. a ) 8! × 3! b) 10P7 c) 8!

3. 103 - 1 = 9993 4. c 5. c 6. d
SESSION – 6
CLASS EXERCISE
1. i)12 ii) 12 2. 9 3. 35 4. 10 5. c 6. 36
! !
7. 9! 8. ; ; (5, 3) 9. 6!.6!; 5!.6!; 5!.5!.

SESSION – 8
CLASS EXERCISE
1. (ii) 24 2. B 3. i) 35 ii) 29 iii) 64
4. Child- 16 times ; Person – 84 times 5. 281
 SESSION – 9 & 10
CLASS EXERCISE
!
1. (i) 119 (ii) 60 2) a 3. a 4. b 5. ( 6. 12 . 2
!) !

7. 84 8. B 9. C 10. (I) 150 (II) 6 (III) 50 (IV) 2

SESSION – 11
CLASS EXERCISE
1. 22 2. 37C2 –13C2 –11C2 + 2 = 535 3. b 4. b
5. c 6. c 7. a
SESSION – 12
CLASS EXERCISE
1. c 2.7C3 3.110551 4.a, d

*****