7.

Permutations and
Combinations
Important Formulae & Shortcuts
Methods
 Factorial Notation
For any natural number 𝑛, the product of 𝑛 with each natural number less than itself is
called ' 𝑛 factorial' and is denoted as 𝑛 ! or !n.

Note: 0 ! is defined as 1 .

 Properties of factorial notation

For any positive integers 𝑚 and 𝑛,

(i) 𝑛! = 𝑛(𝑛 − 1)!

(ii) When > 1, 𝑛 ! = 𝑛(𝑛 − 1)(𝑛 − 2) !

(iii) When > 2, 𝑛! = 𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) !

(iv) (𝑚 + 𝑛) ! is always divisible by 𝑚 ! as well as 𝑛 !

(v) (𝑚 × 𝑛)! ≠ 𝑚! × 𝑛 !

(vi) (𝑚 + 𝑛)! ≠ 𝑚! + 𝑛 !

(vii) When > 𝑛, 𝑚 ! is always divisible by 𝑛 !

(viii) (𝑚 ÷ 𝑛)! ≠ 𝑚! ÷ 𝑛 !

(ix) (𝑚 − 𝑛)! ≠ 𝑚! − 𝑛 !

 Principle of Addition
Statement : If two mutually exclusive events ' 𝐴 ' and ' 𝐵 ' can occur in m and n ways
respectively, then the number of ways in which either of the two events can occur is 𝑚 +
𝑛.

Suppose there are 3 possible choices with no common outcome. The first, second and
third choices can be made in 𝑚, 𝑛 and r ways respectively. If only one of the choices is to
be made, then it has (𝑚 + 𝑛 + 𝑟) possible ways

 Principle of Multiplication
Statement : If an event ' 𝐴 ' can occur in ' 𝑚 ' different ways and following it if another
event ' 𝐵 ' can occur in ' 𝑛 ' different ways, then the two operations can be performed in
succession in m × n different ways.

Suppose an experiment consists of three possible activities. The first, second and third
activity has m, n and r possible outcomes respectively. Then the total number of different
possible outcomes of the experiment are (𝑚 × 𝑛 × 𝑟).

The result of counting objects in a set does not depend on the order in which these
objects are counted or on the method used for counting these objects.

 Permutation
A permutation is an arrangement in a definite order of a number of objects, taken some
or all a time.

Permutations When all Objects are Distinct

Theorem 1: The number of permutations of ' 𝑛 ' different objects taken ' 𝑟 ' at a time,
when repetition of objects is not allowed, is 𝑛(𝑛 − 1)(𝑛 − 2) … . (𝑛 − 𝑟 + 1) (where 𝑟 ≤ 𝑛)

 Properties of Permutation
(i) 𝑛 𝑃𝑛 = 𝑛 !

(ii) 𝑛 P0 = 1

(iii) 𝑛 𝑃1 = 𝑛

(iv) 𝑛 𝑃𝑟 = 𝑛 × (𝑛−1)
𝑃(𝑟−1)

(𝑛−2)
= (𝑛)(𝑛 − 1) × P(r−2)

(𝑛−3)
= (𝑛)(𝑛 − 1)(𝑛 − 2) × 𝑃(𝑟−3) and so on
𝑛𝑃
(v) 𝑛𝑃
𝑟
= 𝑛 − 𝑟 + 1 - Theorem 2 : The number of arrangements of 𝑛 distinct objects,
(𝑟−1)
taken 𝑟 at a time, when when repetitions are allowed. is the number of ways of filling r
places using 𝑛 distinct objects

 Theorem 3 : The number of permutations of 𝑛 distinct objects taken all at a time,

when 𝑚 specified objects among 𝑛 always come together, is (𝑛 − 𝑚 + 1) !

 Important Results :

(a) The number of permutations of 𝑛 distinct objects, taken 𝑟 at a time, when a specific
object is always included equals 𝑛−1 𝑃𝑟−1

(b) The number of permutations of 𝑛 distinct objects, taken 𝑟 at a time, when a specific
object is not included equals n−1 Pr .
  Theorem : The number of permutations of ' 𝑛 ' objects, of which ' 𝑝 ' objects are of
n!
one kind, 𝑞 are of the other kind and the rest, if any, are of different kind is 𝐩!𝐪!

Note that 𝑝, 𝑞 < 𝑛 and 𝑝 + 𝑞 ≤ 𝑛

 Circular Permutations
Thus, the circular arrangements or permutations are considered different only when
relative order of the objects is distinct.

Thus, the number of distinct circular arrangements = (𝑛 − 1) !

 Remarks :
If clockwise and anticlockwise permutations cannot be distinguished, then the number of
(𝑛−1)!
ways of the distinct arrangements =
2

 Theorem : The number of ways in which n objects, out of which p are alike can be
(𝐧−1)!
arranged in circular order is
𝐩!

 Remarks : The number of circular permutations of 𝑛 different objects taken 𝑟 at a

time where clockwise and anticlockwise arrangements are
𝑛𝑃 𝑛𝑃
(a) taken as different is 𝑟
𝑟
(b) not taken as different is 2𝑟
𝑟
.

 Combination

 Definition : A selection of number of objects taking some or all of them at a time

is called a combination. The total number of combinations of 𝑛 objects taking 𝑟
𝑛
objects (𝑟 ≤ 𝑛) at a time is denoted by 𝑛 𝐶𝑟 or 𝑛 𝐶𝑟 or 𝐶(𝑛, 𝑟) or ( ).
𝑟

 Theorem : Total number of selections of 𝐧 distinct objects taken 𝐫 at a time is

𝑛!
given by 𝑛 𝐶𝑟 = 𝑟!(𝑛−𝑟)!

𝑛! 𝑛!
 Remark : 𝑛 𝐶(𝑛−𝑟) = =
(𝑛−𝑟)![𝑛−(𝑛−𝑟)!! (𝑛−𝑟)!𝑟!

Thus, 𝑛 𝐶(𝑛−𝑟) = 𝑛
𝐶𝑟 , where (1 ≤ 𝑟 ≤ 𝑛)

 Properties of Combinations
𝑛 𝑛 10 10
1 Cr = Cn−r ( e.g. C3 = C7 )

2 If 𝑛 𝐶𝑥 = 𝑛 𝐶𝑦 , then either 𝑥 = 𝑦 or 𝑥 = 𝑛 − 𝑦 i.e. 𝑛 = 𝑥 + 𝑦 3. 𝑛 𝐶𝑟 + 𝑛 𝐶𝑟−1 =

𝑛+1
𝐶𝑟 , where 1 ≤ 𝑟 ≤ 𝑛

3 Number of ways of selecting one or more objects from a collection of 𝑛 distinct

objects is given by 2𝑛 − 1.
 𝑛
4 Cr has maximum value if
𝑛 𝑛−1 𝑛+1
(a) 𝑟 = 2 when 𝑛 is even (b) 𝑟 = 2 or 2 when 𝑛 is odd

𝑛
5 𝐶0 + 𝑛 𝐶2 + 𝑛 𝐶4 + ⋯ = 𝑛
𝐶1 + 𝑛 𝐶3 + 𝑛 𝐶5 + ⋯ = 2(𝑛−1)

𝑛 𝑛 (𝑛−1) 𝑛 𝑛−1 (𝑛−2)

6 𝐶𝑟 = ( 𝑟 ) 𝐶(𝑟−1) = ( 𝑟 ) ( 𝑟−1 ) 𝐶(𝑟−2) and so on

 Important Results
 n
C0 = n Cn = 1, n C1 = n

 n
Cr + n Cr−1 = n+1
Cr

 n
Cx = n Cy ⇔ x = y or x + y = n

 n. n−1
Cr−1 = (n − r + 1) ⋅ n Cr−1

 If n is even, then the greatest value of n Cr is n Cn/2 .

 If n is odd, then the greatest value of n Cr is n Cn+1 or n Cn−1 .

2 2

n
 n
Cr = r ⋅ n−1
Cr−1

 Number of selections of zero or more things out of n different things is, n C0 +

n
C1 + n C2 + ⋯ … + n Cn = 2n .

 n
Cn + n+1
Cn + n+2
Cn + n+3
Cn + ⋯ . + 2n−1 Cn = 2n
Cn+1 .

 Number of combinations of n dissimilar things taken all at a time is n Cn =

n! 1
n!(n−n)!
= 0! = 1
Multiple Choice Questions
MHT-CET 2021
1 All the letters of the word 'ABRACADABRA' are arranged in different possible
ways. Then the number of such arrangements in which the vowels are together is
(A) 1200
(B) 1240
(C) 1220
(D) 1260
n! n!
2 If 2!(n−2)! and 4!(n−4)! are in the ratio 2: 1, then n =
(A) 6
(B) 4
(C) 5
(D) 3

3 The number of ways in which 8 different pearls can be arranged to form a

neacklace is
(A) 40320
(B) 5040
(C) 2520
(D) 1260

4 For a set of five true or false questions, no student has written the all correct
answers and no two students have given the same sequence of answers. The
maximum number of students in the class for this to be possible is
(A) 30
(B) 31
(C) 32
(D) 16

5 A polygon has 44 diagonals. Then the number of sides of the polygon are
(A) 11
(B) 12
(C) 10
(D) 13

6 . The numbers can be formed using the digits 1,2,3,4,3,2,1 so that odd digits
always occupy
odd places in ways.
(A) 9
(B) 18
(C) 6
(D) 3

7 . Out of 7 consonants and 4 vowels, the number of words consisting of 3

consonants and 2
vowels are
(A) 3300
 (B) 210
(C) 120
(D) 25200

8 If 11 C4 + 11
C5 + 12
C6 + 13
C7 = 14
Cr , then value of 𝑟 is
(A) 11
(B) 14
(C) 7
(D) 3

9 The difference between the maximum values of 6 𝐶𝑟 and 𝑛 𝐶𝑟 is 16 , then 𝑛 =

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

10 A committee of 5 is to be formed out of 6 men and 4 ladies. The number of ways

this can be done, when at most 2 ladies are included, is
(A) 240
(B) 186
(C) 60
(D) 120

MHT-CET 2022
11 A bag contains 5 red marbles, 4 black marbles and 3 white marbles. Then the
number of ways in which 4 marbles can be drawn so that at most 2 of them are
red is
(A) 420
(B) 210
(C) 385
(D) 406

12 In a certain examination, a candidate has to pass in each of the 5 subjects. Hence,

the number of ways he can fail is
(A) 25
(B) 25 − 1
(C) 5
(D) 5!

13 It is required to seat 5 men and 4 women in a row so that the men occupy odd
places. Then the number of arrangements that are possible is
(A) 2880
(B) 1440
(C) 144
(D) 362880

14 The number of ways in which the letters of the word MACHINE can be arranged
such that the vowels may occupy only odd position, is
(A) 576
(B) 625
 (C) 288
(D) 1152

15 A man 𝑃 has 7 friends, 4 of them are ladies and 3 are men. His wife 𝑄 also has 7
friends, 3 of them are ladies and 4 are men. Assume 𝑃 and 𝑄 have no common
friends. Then the total number of ways in which 𝑃 and 𝑄 together can throw a
party inviting 3 ladies and 3 men so that 3 friends of each of 𝑃 and 𝑄 are in this
party, is
(A) 468
(B) 469
(C) 484
(D) 485

16 Number of ways, in which 6 men and 5 women can sit at a round table, if no two
women sit together, are
(A) 7! × 5 !
(B) 6! × 5!
(C) 30
(D) 5! × 4!

17 The total number of ways, of dividing 52 cards amongst 4 players, so that 3

players get 17 cards each and fourth player has just one card, are
52!
(A) 17!
52!
(B) (17!)3
52!
(C)
17
52!
(D) (17!)2

18 . The number of different 9 digit numbers that can be formed, from the digits of
the numbet 445577888 by rearranging its digits, so that the odd digits occupy
even positions, are
(A) 60
(B) 120
(C) 180
(D) 36

19 There are 6 periods in each working day of a school. The number of ways one can
arrange 5 subjects such that each is allowed at least one period, is
(A) 5
(B) 725
(C) 720
(D) 1800

20 If a question paper consists of 11 questions divided into two sections I and II.
Section I consists of 6 questions and section II consists of 5 questions, then the
number of different ways can student select 6 questions, taking at least 2
questions from each section, is
(A) 275
(B) 350
 (C) 425
(D) 225

SOLUTIONS
1 (D)
The word ABRACADABRA has

A : 5 times, B : 2 times, 𝑅: 2 times, C, D: 1 time each

When all vowels are together, we have to arrange 7 elements.

7!
∴ No. of arrangements = 2!2! = 1260

2 (C)
𝑛! 4!(𝑛−4)! 2
We have × =
2!(𝑛−2)! 𝑛! 1

(4 × 3)
∴ = 2 ⇒ 𝑛2 − 5𝑛 + 6 = 6
(𝑛 − 2)(𝑛 − 3)

∴ 𝑛(𝑛 − 5) = 0 ⇒ 𝑛 = 5

3 (C)
(8−1)!
Number of necklaces formed from 8 different pearls = = 7 × 6 × 5 × 4 × 3 = 2520
2

4. (B)
Each of the five questions can be solved in two ways.

∴ Maximum number of wrong answers.

= (2 × 2 × 2 × 2 × 2) − 1 = 31

5 (A)
𝑛
Number of diagonals of ' 𝑛 ' sided polygons = 𝐶2 − 𝑛
𝑛
∴ 𝐶2 − 𝑛 = 44

𝑛!
− n = 44 ⇒ n(n − 1) − 2n = 88
2! (𝑛 − 2)!

∴ 𝑛2 − 3𝑛 − 88 = 0 ⇒ (𝑛 − 11)(𝑛 + 8) = 0 ⇒ 𝑛 = 11 … [𝑛 ∈ 𝑁]

6 (B)
We have 4 odd digits i.e. 1, 1, 3, 3 and 3 even digits i.e. 2, 2, 4
In a 7 digit number, there are 4 odd and 3 even places.
4! 3!
So number of possible ways = 2!2! × 2! = 18

7. (A)

We have to choose 3 consonants and 2 vowels from 7 consonants and 4 vowels.

∴ Number of words = ( 7 C3 ) × ( 4 C2 ) × 5 !

7! 4!
= × × 5! = 25200
3! 4! 2! 2!

8 (C)
11 11 12 13 14
C4 + C5 + C6 + C7 = Cr

We know that n Cr + 𝑛 Cr−1 = n+1

Cr
14
∴ Cr = ( 11 C4 + 11
C5 ) + 12
C6 + 13
C7

= ( 12 C5 + 12
C6 ) + 13
C7
13 13 14
= C6 + C7 = C7

∴r=7

9 (D)
6
The maximum value of 6 Cr occurs at 𝑟 = 2 = 3

6! 6×5×4
∴ 6 C3 = = = 20
3! 3! 6

As per data given, | 6 C3 − 𝑛 𝐶3 | = 16

𝑛
∴ C3 = 20 + 16 or n C3 = 20 − 16
n!
If n C3 = 36 ⇒ 3!(𝑛−3)! = 36 ⇒ n(n − 1)(n − 2) = 216 is not possible for 𝑛 ∈ 𝑁 −

n!
If n C3 = 4 ⇒ (n−3)!3! = 4 ⇒ n(n − 1)(n − 2) = 24

Here 24 = 2 × 3 × 4 ⇒ 𝑛 = 4

10 (B)
The committee can be formed in following ways :

(5 men), ( 4 men, 1 lady), ( 3 men, 2 ladies).

∴ Number of ways.
= ( 6 C5 ) + ( 6 C4 × C1 ) + ( 6 C3 × 4 C2 )

= (6) + (15 × 4) + (20 × 6) = 6 + 60 + 120 = 186

11 (A)
A bag contains 5 red, 4 black and 3 white marbles.

We have to draw 4 marbles such that maximum 2 marbles are red.

This can be done in following ways.

(i) All 4 marbles are non-red.

(ii) 1 marble is red and 3 are non-red.

(iii) 2 marbles are red and 2 are non red.

We have 5 red and 7 non-red marbles.

So total number of ways are

7! 7×6×5 7!
(i) 7 C4 = 4!3! = 6
= 35 (ii) 5 C1 × 7 C3 = 5 × 3!4! = 5 × 35 = 175

5! 7!
(iii) 5 C2 × 7 C2 = × = 10 × 21 = 210
3!2! 2!5!

Hence total ways are = 35 + 175 + 210 = 420

12 (B)
There are 5 subjects and each subjects has 2 options i.e. pass or fail.

So numbers of ways candidate can perform in 5 subjects = 2 × 2 × 2 × 2 × 2 = 25 .

Of these 25 ways, there is only 1 way when he passes in all 5 subjects.

∴ Number of ways in which he can fail examination = 25 − 1

13 (A)
We have to make sitting arrangement of 5 men and 4 women such that men occupy odd
places.

Among 9 seats, there are 5 odd and 4 even number seats.

So 5 men can be seated at 5 places in 5 ! ways and 4 women can be seated at 4 places in 4
! ways.

Total number of ways = 5! 4! = (120)(24) = 2880

14 (A)
The word 'MACHINE' has 7 letters of which 3 are vowels.
There are 4 odd positions in which 3 vowels can be arranged in 4 P3 = 4 ! = 24 ways.

The remaining 4 letters can be arranged in remaining 4 spaces in 4 ! ways.

∴ Total number of ways = 24 × 24 = 576

15 (D)
P has 4 women and 3 men friends. Q has 3 womens and 4 men friends.

Number of ways of inviting 3 men and 3 women for party such that 3 friends of each of 𝑃
and 𝑄 are in party are as follows :

P Q
4w, 3 m 3w, 4 m

(i) 3m 3w

(ii) 3w 3m

(iii) 1 m, 2w 2 m, 1w

(iv) 2 m, 1w 1 m, 2w

Total number of ways

= ( 3 𝐶3 × 3 𝐶3 ) + ( 4 𝑐3 × 4 𝐶3 ) + ( 3 𝐶1 × 4 𝐶2 × 4 𝐶2 × 3 𝐶1 ) + ( 3 𝐶2 × 4 𝐶1 × 4 𝐶1 × 3 𝐶2 ).
= (1 + 1) +× (4 × 4) + (3 × 6 × 6 × 3) + (3 × 4 × 4 × 3)
= 1 + 16 + 324 + 144 = 485

16 (B)
There are 6 men and 5 women who sit at a round table so that no two women sit
together.

The 6 men can sit in 5 ! ways.

That gives 6 gaps in which 5 women can sit in 6 P5 = 6 ! ways.

So total number of ways = 5! 6!

17. (B)

The 52 cards are divided in 4 players such that 3 players get 17 cards each and 4th player
gets
only 1 card. Number of ways of doing this
 52
= C17 × 35 C17 × 18 C17 × 1 C1
52! 35! 18! 1! 52!
= × × × =
17! 35! 17! 18! 17! 1! 1! 0! (17!)3

18 (A)
A '9' digit numbers are to be formed from digits 445577888 so that odd digits occupy
even positions.

We have 4 odd digits viz 5577 and in a ' 9 ' digit number, there are 4 even positions.

Also digit 4,5,7 repeat 2 times each and digit 8 repeats 3 times.
4!5!
∴ Number of ways = = 60
2!2!2!3!

19 (D)
We have to arrange 5 subjects in 6 periods such that each subject gets atleast 1 period.

So 4 subjects will get 1 period each and 5th subject will get 2 periods.
6!
In 6 periods, the 5 subjects can be arranged in 6 P5 = 1! = 6 ! ways.

The 5th subject having 2 periods can be chosen in 5 ways.

Since the subject repeats,

5×6!
Total number of ways = = 5 × 360 = 1800
2!

20 (C)
Sections I, II have 6, 5 questions respectively. Student has to select 6 questions such that
minimum 2 questions must be chosen from each section.

This can be done in following ways

Section I Section II

2 4

3 3

4 2

Total ways

= ( 6 C2 × 5 C4 ) + ( 6 C3 × 5 C3 ) + ( 6 C4 × 5 C2 )

= (15 × 5) + (20 × 10) + (15 × 10) = 425