Welcome to

Permutations & Combinations

Table of contents
Session 01 03 Session 04 106
Fundamental Principle of Counting 04 Circular Permutations 107
Multiplication principle (Rule of And) 04 Formation of Groups 117
Addition principle (Rule of Or) 10 All Possible Selections 125
Exponent of Prime in 𝑛! 27
Permutation 31 Session 05 130
Model Based On Divisors 131
Geometry Models 136
Session 02 42
Special Case 43 Principle of Inclusion and Exclusion 142

Permutation when all the objects are not distinct 45 Derangements 146

Combination 52
Session 06 150
Distinct Things → Distinct Boxes 151
Session 03 73
Complementary Principle 74 Identical Things → Distinct Boxes 153
Application of Multinomial Theorem 162
Including/Excluding Specified Objects 81
Divisibility Model 91
Session 1
Fundamental Principle of
Counting and Introduction to
Permutation

Return To Top
Fundamental Principle of Counting:

• The fundamental counting principle is a rule used to count the total number of
possible outcomes in a situation.

• This can be done by two methods depending on the situation:

❖ Multiplication Principle

❖ Addition Principle

Multiplication principle (Rule of And)

• If one event can occur in 𝑚 ways and a second event can occur
in 𝑛 ways after the first event has occurred, then the two events
in succession can occur in 𝑚 × 𝑛 ways.

Return To Top
Multiplication principle (Rule of And)

Event 𝐴 Event 𝐵

Different ways Different ways

𝑚 𝑛

Total number of ways for two events

𝑚×𝑛

Return To Top
There are 3 ways to travel from 𝐴 to 𝐵 and 4 ways to travel from
𝐵 to 𝐶. In how many ways can a person travel from 𝐴 to 𝐶 via 𝐵.

Solution:

𝐴 𝐵 𝐶

3 ways 4 ways

Number of ways to travel from 𝐴 to 𝐵 = 3

Number of ways to travel from 𝐵 to 𝐶 = 4
Number of ways a person can travel from 𝐴 to 𝐵 and 𝐵 to 𝐶 = 3 × 4 = 12 Ways

Return To Top
There are 3 ways to travel from 𝐴 to 𝐵 and 4 ways to travel from
𝐵 to 𝐶. In how many ways can a person travel from 𝐴 to 𝐶 via 𝐵.

Solution:
(𝑥, 1) (𝑥, 2) (𝑥, 3) (𝑥, 4)
1
𝑥 2
(𝑦, 1) (𝑦, 2) (𝑦, 3) (𝑦, 4)
𝑦
𝐴 𝐵 𝐶
𝑧 3
(𝑧, 1) (𝑧, 2) (𝑧, 3) (𝑧, 4)
4

Return To Top
In how many ways can we pair up one boy with one girl from a group
of 3 boys and 5 girls ?

A 15

B 3

C 5

D 8

Return To Top
In how many ways can we pair up one boy with one girl from a group
of 3 boys and 5 girls ?

Solution:
A 15
5 Girls

B 3
3 Boys

C 5
Total possible ways = 3 × 5 = 15

D 8

Return To Top
Addition principle (Rule of Or)

• If there are two operations such that they can be done independently in 𝑚
and 𝑛 ways respectively, then any one of these two operations can be done
by (𝑚 + 𝑛) number of ways.

Event 𝐴 Event 𝐵

Different ways Different ways

𝑚 𝑛

Total number of ways for an Event 𝐴 or 𝐵 to occur

=𝑚+𝑛

Return To Top
In how many ways can a person travel from 𝐴 to 𝐶 via 𝐵 (or) via 𝐷.

𝐶
𝐴

Case I: Via 𝐵 𝐴 𝐵 𝐶
3 ways 4 ways
∴ Number of ways he can travel = 3 × 4 = 12 Ways

Return To Top
In how many ways can a person travel from 𝐴 to 𝐶 via 𝐵 (or) via 𝐷.

𝐶
𝐴

Case II: Via 𝐷 𝐴 𝐷 𝐶

2 ways 3 ways
∴ Number of ways he can travel = 2 × 3 = 6 Ways
∴ Total number of ways = 12 + 6 = 18 Ways

Return To Top
There are 15 two bed room flats in first building and 10 two bed room
flats in second building and 8 two bed room flats in third building.
The number of choices a customer will have for buying a flat is

A 1200

B 33

C 32

D 1199

Return To Top
There are 15 two bed room flats in first building and 10 two bed room
flats in second building and 8 two bed room flats in third building.
The number of choices a customer will have for buying a flat is

Solution:

The number of choices a customer A 1200

will have for buying a flat is

15 + 10 + 8 = 33 B 33

C 32

D 1199

Return To Top
There are 4 books, one each of Physics, Chemistry, Math, and
Biology. These books need to be arranged in 5 different boxes, In
how many ways can we do it ? (Only one book can go in one box).
Solution:

Return To Top
→

→
= 5 ×4 ×3 ×2
→ = 120

Return To Top
The number of natural numbers less than 7000 which can be formed
by using the digits 0, 1, 3, 7, 9 (repetition of digits allowed) is equal to
_____ .
JEE MAIN 2019
Solution:

Given: Digits are 0, 1, 3, 7, 9 A 374

Number of one-digit natural numbers

B 372
Number of two-digit natural numbers
Total number of natural C
numbers less than 7000 375
Number of three-digit natural numbers

D 250
Number of four-digit natural numbers

Return To Top
The number of natural numbers less than 7000 which can be formed
by using the digits 0, 1, 3, 7, 9 (repetition of digits allowed) is equal to
_____ .
JEE MAIN 2019
Solution:
Case I: Case II:
Number of one-digit Number of two-digit
natural numbers natural numbers

9
9 9
7
7 7
4 ways 4 ways 3 5 ways
3 3
1
1 1
0

Number of one-digit Number of two-digit natural

natural numbers= 4 numbers= 4 × 5 = 20
Return To Top
The number of natural numbers less than 7000 which can be formed
by using the digits 0, 1, 3, 7, 9 (repetition of digits allowed) is equal to
_____ .
JEE MAIN 2019
Solution:

Case III:
Number of three-digit natural numbers

9 9
9 7 7
7 3 5 ways 3 5 ways
4 ways
3 1 1
1 0 0

Number of three-digit natural numbers = 4 × 5 × 5 = 100

Return To Top
The number of natural numbers less than 7000 which can be formed
by using the digits 0, 1, 3, 7, 9 (repetition of digits allowed) is equal to
_____ .
JEE MAIN 2019
Solution:

Case IV:
Number of four-digit natural numbers

9 9 9

7 7 7

3 5 ways 3 5 ways 3 5 ways

3 1 1 1
2 ways
1 0 0 0

Number of four-digit natural numbers = 2 × 5 × 5 × 5 = 250

Return To Top
The number of natural numbers less than 7000 which can be formed
by using the digits 0, 1, 3, 7, 9 (repetition of digits allowed) is equal to
_____ .
JEE MAIN 2019
Solution:

Given: Digits are 0, 1, 3, 7, 9

Number of one-digit natural numbers

Number of two-digit natural numbers

Total number of natural
numbers less than 7000
Number of three-digit natural numbers

Number of four-digit natural numbers

= 4 + 20 + 100 + 250
= 374
Return To Top
An 𝑛-digit number is a positive number with exactly 𝑛-digits. Nine
hundred distinct 𝑛-digit numbers are to be formed using only the
three digits 2, 5 and 7. The smallest value of 𝑛 for which this is possible
is _____ .
IIT JEE 1998

A 6

B 7

C 8

D 9

Return To Top
An 𝑛-digit number is a positive number with exactly 𝑛-digits. Nine
hundred distinct 𝑛-digit numbers are to be formed using only the
three digits 2, 5 and 7. The smallest value of 𝑛 for which this is possible
is _____ .
IIT JEE 1998
Solution:

𝑛-digit numbers are to be formed using only 2, 5, and 7. A 6

∴ Each vacant place can be filled in 3 ways

B 7
So, ′𝑛′ vacant places can be filled in 3 ways
𝑛

Now, 3𝑛 ≥ 900
C 8
⇒ 31 , 32 , 33 , 34 , 35 , 36, 37

36 = 729 37 = 2187 D 9
∴ Smallest value of ‘𝑛’ is 7 (3 × 3 × ⋯ 𝑛 times)

Return To Top
Find the number of ways to distribute 4 prizes among 5 students if no
student gets all the prizes.

Solution:
Prizes 4 Students 5
𝑆1
𝑆2
𝑃1 𝑆3 For each prize there are 5 ways
𝑆4
𝑆5

∴ Distribution of 4 Prizes among 5 students= 54 ways

One boy getting all the prizes = 5 ways

Required number of ways = Distribution of 4 Prizes − One boy getting all the prizes
= 54 − 5 = 620

Return To Top
5 persons entered the lift on the ground floor of an 8 −floor building (ground
floor included). Suppose each of them can leave the cabin independently at any
floor beginning with the first. In how many ways can each of the five persons can
leave the lift?
i. at any of the 7 floors.
ii. at different floors.

Solution: i. Any of the 5 persons can leave the lift cabin in 7 different ways. 7𝑡ℎ
6𝑡ℎ
Thus, by product rule, the total number of ways = 7 × 7 × 7 × 7 × 7
5𝑡ℎ
5
= 7 = 16807.
4𝑡ℎ
3𝑟𝑑
ii. First person can leave the lift cabin in 7 different ways.
2𝑛𝑑
Second person can leave the lift cabin in 6 different ways. 1𝑠𝑡
⋯

Thus, by product rule, the total number of ways = 7 × 6 × 5 × 4 × 3

= 2520.
Return To Top
Find the remainder when 1! + 2! + 3! + ⋯ + 100! Is divided by 15.

Solution: Let 𝑆 = 1! + 2! + 3! + ⋯ + 100!

= 1! + 2! + 3! + 4! + 5! + ⋯ + 100!

= 1! + 2! + 3! + 4! + 15𝑘, 𝑘 ∈ ℤ (∵ 5!, 6!, ⋯ are divisible by 15)

= 1 + 2 + 6 + 24 + 15𝑘

= 33 + 15𝑘

= 15 𝑘 + 2 + 3

∴ Remainder is 3.

Return To Top
Key Takeaways

Exponent of Prime in 𝑛!

• Let 𝑛! = 2𝑒 1 ⋅ 3𝑒2 ⋅ 5𝑒3 ⋅ 7𝑒4 ⋯ Prime Factorization of 𝑛!

Example:

3! = 21 ⋅ 31

4! = 23 ⋅ 31

5! = 23 ⋅ 31 ⋅ 51

100! =?

Return To Top
Key Takeaways

Exponent of Prime in 𝑛!

• Let 𝑝 be a prime number and 𝑛 be any positive integer such that :

𝑛! = 𝑝1 𝑒1 ⋅ 𝑝2 𝑒2 ⋅ 𝑝3 𝑒3 ⋯

Exponent of 𝑝1 in 𝑛! is given as
𝑛 𝑛 𝑛
𝑒1 = + 2
+ +⋯
𝑝1 𝑝1 𝑝1 3

Exponent of 𝑝2 in 𝑛! Is given as
𝑛 𝑛 𝑛
𝑒2 = + 2
+ +⋯ . denotes greatest integer
𝑝2 𝑝2 𝑝2 3

Return To Top
Find the number of zeros in 200!

Solution: 200! = 2𝑒1 ⋅ 3𝑒2 ⋅ 5𝑒3 ⋯

200 200 200 200 200 200 200
𝑒1 = + + + + + + +⋯
2 22 23 24 25 26 27

= 100 + 50 + 25 + 12 + 6 + 3 + 1 + 0 = 197
200 200 200 200
𝑒3 = + + + +⋯
5 52 53 54

= 40 + 8 + 1 + 0 = 49

200! = 2197 ⋅ 3𝑒2 ⋅ 549 ⋯

= 2148 ⋅ 249 ⋅ 3𝑒2 ⋅ 549 ⋯

= 2148 ⋅ 3𝑒2 ⋅ 1049 ⋯

Number of zeros in 200! = 49.

Return To Top
Find the number of zeros in 200!

Solution: Alternative solution:

Number of zeros in 200! equals to multiples of 10 in 200!

Among the prime factors 2 and 5 the highest power of 5 in 200! will be less than
the highest power of 2 in 200!

So, the highest power of 10 in 200! will be equal to highest power of 5 in 200!

200 8
= 40 =1
5 5

40 1
=8 =0
5 5

Number of zeros in 200! = 40 + 8 + 1 + 0 = 49

Return To Top
Key Takeaways

PERMUTATION

• A permutation is an arrangement in a definite order of a

number of objects taken some or all at a time.

FORMULA FOR PERMUTATION

• When all the objects are distinct, the number of permutations of

𝑛 distinct objects taken ′ 𝑟′ at a time is denoted by 𝑛𝑃𝑟 or 𝑃 𝑛, 𝑟 .

𝑛𝑃
𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯× 𝑛 − 𝑟 + 1

Return To Top
Key Takeaways

𝑛𝑃
𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯× 𝑛 − 𝑟 + 1

Proof :

By definition, 𝑛𝑃𝑟 = number of permutations of 𝑟 things out of 𝑛 different things

= number of ways of filling up 𝑟 vacant places with 𝑛 different objects

Consider 𝑟 vacant places

1𝑠𝑡 2𝑛𝑑 3𝑟𝑑 ⋯ 𝑟 𝑡ℎ

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

So, we are filling the vacant places in succession without repetition.

∴ 𝑛𝑃𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯ × 𝑛 − 𝑟 + 1
(By Fundamental principle of counting)
Return To Top
FORMULA FOR PERMUTATION

• 𝑛𝑃 𝑛!
𝑟 =
𝑛−𝑟 !

Proof :

𝑛
𝑃𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯ × 𝑛 − 𝑟 + 1
𝑛−𝑟 !
⇒ 𝑛𝑃𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯ × 𝑛 − 𝑟 + 1
𝑛−𝑟 !

𝑛!
⇒ 𝑛𝑃𝑟 =
𝑛−𝑟 !

Return To Top
Note :

• 𝑛𝑃
0 = 1 (Arranging nothing)

• 𝑛
𝑃𝑛 = 𝑛! (Arranging all the things)

• The number of permutations of 𝑛 different objects taken

𝑟 at a time, where repetition is allowed is 𝑛𝑟 .

Return To Top
The number of six letter words (with or without meaning), formed
using all the letters of the word ′ 𝑉𝑂𝑊𝐸𝐿𝑆 ′ , so that all the
consonants never come together, is
JEE Main Aug 2021
Solution:
Total possible words = 6! = 720

Total case when consonants are together 𝑂, 𝐸, 𝑉𝑊𝐿𝑆

Such cases = 3! ⋅ 4! = 144

Required cases = 720 − 144 = 576

Return To Top
All possible numbers are formed using the digits 1, 1, 2, 2, 2, 2, 3, 4, 4,
taken all at a time. The number of such numbers in which the odd
digits occupy even places is :
JEE Main Apr 2019

A 160

B 162

C 175

D 180

Return To Top
All possible numbers are formed using the digits 1, 1, 2, 2, 2, 2, 3, 4, 4,
taken all at a time. The number of such numbers in which the odd
digits occupy even places is :
JEE Main Apr 2019
Solution: There are total 9 digits, out of which only 3 are odd.

Also, in a 9 digit number, there are 4 even places.

A 160
So, these 3 odd digits will occupy 3 places out of
4 and rest all the digits will occupy remaining 6
places. B 162

Hence, required number of such

numbers will be C 175
3! 6!
= 4𝐶3 ⋅ ⋅ = 180
2! 4!2! D 180

Return To Top
Key Takeaways

Properties of 𝑛 𝑃𝑟

𝑛𝑃 II. 𝑛𝑃 =𝑛× 𝑛−1 𝑃 𝑟−1

I. 𝑛𝑃
𝑟
=𝑛−𝑟+1 𝑟
𝑟−1
Also, 𝑛𝑃𝑟 = 𝑛 × 𝑛 − 1 × (𝑛−2)𝑃(𝑟−2) and so on
Proof :
We know, 𝑛𝑃𝑟 =
𝑛! Proof :
𝑛−𝑟 !
𝑛𝑃 𝑛! (𝑛−1)!
𝑛𝑃
𝑟 𝑛! (𝑛−𝑟+1)! (𝑛−𝑟+1)! 𝑟 = =𝑛⋅
= × = =𝑛−𝑟+1 𝑛−𝑟 ! 𝑛−𝑟 !
𝑛𝑃 𝑛−𝑟 ! 𝑛! 𝑛−𝑟 !
𝑟−1
𝑛𝑃 = 𝑛 × (𝑛−1)𝑃(𝑟−1)
𝑟

III. 𝑛𝑃
𝑟 + 𝑟 × 𝑛𝑃 𝑟−1 = 𝑛+1 𝑃𝑟

Return To Top
Properties of 𝑛 𝑃𝑟

III. 𝑛𝑃
𝑟 + 𝑟 × 𝑛𝑃 𝑟−1 = 𝑛+1 𝑃𝑟

Proof :

𝑛 𝑛! 𝑛!
𝑃𝑟 + 𝑟 × 𝑛𝑃 𝑟−1 = + 𝑟×
𝑛−𝑟 ! 𝑛−𝑟+1 !

𝑛−𝑟+ 1 != 𝑛−𝑟 +1 × 𝑛−𝑟 !

𝑛! 𝑟
= 1+
𝑛−𝑟 ! 𝑛−𝑟+1

𝑛! 𝑛+1
= ×
𝑛−𝑟 ! 𝑛−𝑟+1

(𝑛+1)! 𝑛+1
= = 𝑃𝑟
𝑛−𝑟+1 !

Return To Top
The value of (2 ⋅ 1𝑃0 − 3 ⋅ 2𝑃1 + 4 ⋅ 3𝑃2 − ⋯ upto 51st term) +
(1! − 2! + 3! − ⋯ upto 51st term) is equal to :
JEE MAIN SEPT 2020

A 1 − 5! 5!

B 1 + 52!

C 1

D 1 + 51!

Return To Top
The value of (2 ⋅ 1𝑃0 − 3 ⋅ 2𝑃1 + 4 ⋅ 3𝑃2 − ⋯ upto 51st term) +
(1! − 2! + 3! − ⋯ upto 51st term) is equal to :
JEE MAIN SEPT 2020
Solution:
(2 ⋅ 1𝑃0 − 3 ⋅ 2𝑃1 + 4 ⋅ 3𝑃2 − ⋯ upto 51st term) + (1! − 2! + 3! − ⋯ upto 51st term)

2 ⋅ 1𝑃0 = 2! 3 ⋅ 2𝑃1 = 3! 4 ⋅ 3𝑃2 = 4! and so on. A 1 − 5! 5!

= 2! − 3! + 4! − ⋯ − 51! + 52! + 1! − 2! + 3! − ⋯ − 50! + 51!

B 1 + 52!
= 1 + 52!

C 1

D 1 + 51!

Return To Top
Session 2
Properties of Permutation and
Introduction to Combination

Return To Top
Key Takeaways

Special Case:

A C T : All the three letters are different.

ACT ATC

• Different arrangements CAT CTA

TA C TC A

• Number of arrangements = 6 = 3! ( 3𝑃3)

Return To Top
Key Takeaways

Special Case:

E G G : Out of three, two are identical.

EGG EGG

• Different arrangements GEG GEG

GGE GGE

• Number of arrangements =
3!
2!
=3

Return To Top
Key Takeaways

Permutation when all the objects are not distinct:

Note:

The number of permutations of 𝑛 objects of which 𝑝 objects are of same

• kind and rest are distinct =
𝑛!
𝑝!

General Result:

The number of permutations of 𝑛 objects where 𝑃1 objects are of one

• kind, 𝑃2 objects are of second kind, ⋯,𝑃𝑘 objects are of 𝑘𝑡ℎ kind and rest
𝑛!
(if any) are all distinct = ; 𝑝1 + 𝑝2 + ⋯ + 𝑝𝑘 ≤ 𝑛
𝑃1 !⋅𝑃2 !⋯𝑃𝑘 !

Return To Top
Find the number of words that can be formed by using all the
letters of the word :
𝑖) MESOPOTAMIA 𝑖𝑖) INDEPENDENCE

Solution :

𝑖) MESOPOTAMIA 𝑖𝑖) INDEPENDENCE

MM AA OO ESPTI EEEE NNN DD IPC

Total letters = 11 Total letters = 12

12!
11! Possible words =
Possible words = 2! × 2! ×(2!)
4! × 3! ×(2!)

Return To Top
How many words, with or without meaning, can be made from the
letters of the word EQUATION, using each letter exactly once if :
i. 4 letters are used at a time.
ii. All letters are used but first letter is a vowel.
iii. All letters are used but last letter is a consonant.

Solution :
Given word: E Q U A T I O N

8 different letters

Number of vowels = 5

Number of consonants = 3

i. 4 letters are used at a time.

Number of words = 8𝑃4 = 8 × 7 × 6 × 5 = 1680.

Return To Top
How many words, with or without meaning, can be made from the
letters of the word EQUATION, using each letter exactly once if :
i. 4 letters are used at a time.
ii. All letters are used but first letter is a vowel.
iii. All letters are used but last letter is a consonant.

Solution :
O

A Number of words = 5 × 7! = 25,200

E
_ _ _ _ _ _ _ _
5
7!
Return To Top
How many words, with or without meaning, can be made from the
letters of the word EQUATION, using each letter exactly once if :
i. 4 letters are used at a time.
ii. All letters are used but first letter is a vowel.
iii. All letters are used but last letter is a consonant.

Solution :

Q
_ _ _ _ _ _ _ _
3
7!

Number of words = 3 × 7! = 15,120

Return To Top
Find the number of permutations of the letters of the word
ALLAHABAD. How many of them :
𝑖) start with A. 𝑖𝑖) end with L.
𝑖𝑖𝑖) start with A and end with L.

Solution :
Given word : A L L A H A B A D
AAAA L L BD H
9!
∴ Number of permutations = = 7560
4! × 2!

𝑖) start with A.

A _ _ _ _ _ _ _ _

AAA LL BDH
8!
∴ Number of permutations = 1 × = 3360
3!×2!

Return To Top
Find the number of permutations of the letters of the word
ALLAHABAD. How many of them :
𝑖) start with A. 𝑖𝑖) end with L.
𝑖𝑖𝑖) start with A and end with L.

Solution :

𝑖𝑖) end with L.

_ _ _ _ _ _ _ _ L

AAAA L BDH
8!
∴ Number of permutations = 1 × = 1680
4!

𝑖𝑖𝑖) start with A and end with L.

A _ _ _ _ _ _ _ L

AAA L BDH
7!
∴ Number of permutations = = 840
3!
Return To Top
Key Takeaways

Combination:

• A combination is a selection of some or all of a number of different objects where

the order of selection is immaterial.

Consider four distinct objects A B C D

{A, B, C}

{A, B, D}
4 Different selections
• Selection of 3 objects at a time
{A, C, D}

{B, C, D}

Return To Top
Key Takeaways

Combination:

{A, B, C}
{A, B, D}
3 elements subset of {A, B, C, D}
{A, C, D}

{B, C, D}

• Number of combinations of 4 distinct objects

=4
taken 3 at a time

In each selection, we have 3! permutations.

Number of permutations = 4 × 3! = 4𝑃3

Return To Top
Key Takeaways
Combination:

• Number of selections of 3 objects out of 4 objects = 4

• Number of arrangements of 3 objects taken all at a time = 3!

• Number of arrangements of 4 objects taken 3 at a time = 4 × 3! = 4𝑃3

In general,

Number of selections of 𝑛 objects

taken 𝑟 at a time × 𝑟! = 𝑛𝑃𝑟

Number of selections of 𝑛 objects 𝑛𝑃

taken 𝑟 at a time = 𝑟!
𝑟
= 𝑛𝐶𝑟

Return To Top
Combination:

• The number of combinations (selections) of 𝑛 distinct objects taken 𝑟 at a time,

𝑛
is denoted by 𝑛𝐶𝑟 or 𝐶(𝑛, 𝑟) or .
𝑟

•
𝑛𝑃 𝑛!
𝑛 𝑟
𝐶𝑟 = = (𝑛 ∈ 𝑁, 𝑟 ∈ 𝑊, 0 ≤ 𝑟 ≤ 𝑛)
𝑟! 𝑟!(𝑛−𝑟)!

Note
𝑛!
𝑖) 𝑛𝐶0 = = 1 (Selecting nothing)
0!𝑛!

𝑛!
𝑖𝑖) 𝑛𝐶𝑛 = = 1 (Selecting all the things)
𝑛!0!

Return To Top
Properties of 𝑛𝐶𝑟 :

• 𝑛𝐶
𝑟 is greatest for
𝑛
𝑖) 𝑟 = , if 𝑛 is even
2
𝑛−1 𝑛+1
𝑖𝑖) 𝑟 = or , if 𝑛 is odd
2 2

• 𝑛
𝐶0 + 𝑛𝐶1 + 𝑛𝐶2 + ⋯ + 𝑛𝐶𝑛 = 2𝑛

• 𝑛𝐶
0 + 𝑛𝐶2 + ⋯ = 2𝑛−1
𝑛𝐶 + 𝑛𝐶 + ⋯ = 2𝑛−1
1 3

• 𝑛𝐶
𝑟 =
𝑛
𝑟
× (𝑛−1)𝐶(𝑟−1)

Return To Top
The number of ordered pairs 𝑟, 𝑘 for which
6 ⋅ 35𝐶𝑟 = 𝑘 2 − 3 ⋅ 36𝐶𝑟+1 , where 𝑘 is an integer, is:
JEE MAIN JAN 2020

A 4

B 6

C 2

D 3

Return To Top
The number of ordered pairs 𝑟, 𝑘 for which
6 ⋅ 35𝐶𝑟 = 𝑘 2 − 3 ⋅ 36𝐶𝑟+1 , where 𝑘 is an integer, is:
JEE MAIN JAN 2020
Solution:
36
Using 36𝐶𝑟+1 = 𝑟+1 × 35𝐶𝑟 , we get A 4
36
× 35𝐶𝑟 × 𝑘2 − 3 = 35
𝐶𝑟 × 6
𝑟+1

𝑟+1 B 6
⇒ 𝑘2 − 3 =
6

𝑟+1
⇒ 𝑘2 = +3
6
C 2
𝑘∈𝕀

𝑟 → Non-negative integer 0 ≤ 𝑟 ≤ 35
D 3
𝑟 = 5 ⇒ 𝑘 = ±2

𝑟 = 35 ⇒ 𝑘 = ±3

∴ No. of ordered pairs 𝑟, 𝑘 = 4

Return To Top
Find the number of ways of selecting 3 boys and 4 girls from
5 boys and 6 girls.

Solution:

5 boys 5𝐶
3

6
6 girls 𝐶4

Number of ways of selecting 3 boys = 5𝐶3 = 10

Number of ways of selecting 4 girls = 6𝐶4 = 15
∴ Total number of selections = 10 × 15 = 150

Return To Top
How many words, with or without meaning, each of 3 vowels and 2
consonants can be formed from the letters of the word INVOLUTE ?

Solution:

Given word : INVOLUTE

Vowels : I O U E Consonants : N V L T

∴ Number of selections of 3 vowels and 2 consonants

= 4𝐶3 × 4𝐶2
For each selection, we have

5! ways

Hence, number of required ways = 4𝐶3 × 4𝐶2 × 5!

Return To Top = 2880

A scientific committee is to formed from 6 Indians and 8
foreigners, which includes at least 2 Indians and double the
number of foreigners as Indians. Then the number of ways, the
committee can be formed is:
JEE MAIN FEB 2021

A 560

B 1050

C 1625

D 575

Return To Top
A scientific committee is to formed from 6 Indians and 8
foreigners, which includes at least 2 Indians and double the
number of foreigners as Indians. Then the number of ways, the
committee can be formed is:
JEE MAIN FEB 2021
Solution:
A 560
The possible ways are,

2𝐼, 4𝐹 + 3𝐼, 6𝐹 + 4𝐼, 8𝐹

B 1050
= 6𝐶2 ⋅ 8𝐶 + 6𝐶
4 3 ⋅ 8𝐶 + 6𝐶 ⋅ 8𝐶
6 4 8

= 15 × 70 + 20 × 28 + 15 × 1 C 1625

= 1050 + 560 + 15 = 1625

D 575

Return To Top
There are 15 players in a cricket team, out of which 6 are bowlers, 7
are batsmen and 2 are wicketkeepers. The number of ways, a
team of 11 players be selected from them so as to include at least
4 bowlers, 5 batsmen and 1 wicketkeeper, is
JEE MAIN JULY 2021
Solution:
There are total three cases
𝑖 : 4 Bowlers + 5 Batsmen + 2 WK

No. of ways = 6𝐶4 ⋅ 7𝐶5 ⋅ 2𝐶2 = 315

𝑖𝑖 : 4 Bowlers + 6 Batsmen +1 WK
No. of ways = 6𝐶4 ⋅ 7𝐶6 ⋅ 2𝐶1 = 210

𝑖𝑖𝑖 : 5 Bowlers +5 Batsmen +1 WK

No. of ways = 6𝐶5 ⋅ 7𝐶5 ⋅ 2𝐶1 = 252

Total number of ways = 315 + 210 + 252 = 777

Return To Top
The number of ways of choosing 4 cards from a pack of 52 playing
cards, such that :
𝑖) All are of the same suit is ____ .
𝑖𝑖) Two are red and two are black cards is ____ .
𝑖𝑖𝑖) All are face cards is ____ .

Solution:

Return To Top
Solution:
A 2 3 4 5 6 7 8 9 10 K Q J

A 2 3 4 5 6 7 8 9 10 K Q J

A 2 3 4 5 6 7 8 9 10 K Q J

A 2 3 4 5 6 7 8 9 10 K Q J
Selection
A 2 3 4 5 6 7 8 9 10 K Q J of suit = 4𝐶1

A 2 3 4 5 6 7 8 9 10 K Q J

A 2 3 4 5 6 7 8 9 10 K Q J

A 2 3 4 5 6 7 8 9 10 K Q J

Selection of 4 cards from same suit = 13𝐶4

𝑖) All are of the same suit = 4𝐶1 × 13𝐶4 = 2860
Return To Top
The number of ways of choosing 4 cards from a pack of 52 playing
cards, such that :
𝑖) All are of the same suit is ____ .
𝑖𝑖) Two are red and two are black cards is ____ .
𝑖𝑖𝑖) All are face cards is ____ .

Solution:

Selection of two black cards = 26

𝐶2

Selection of two red cards = 26𝐶

2

𝑖𝑖) Two are red and two are black cards = 26𝐶
2 × 26𝐶2 = 105625

𝑖𝑖𝑖) All are face cards = 13

𝐶4 = 495

Return To Top
If the digits are not allowed to repeat in any number formed by
using the digits 0, 2, 4, 6, 8, then the number of all numbers
greater than 10, 000 is equal to
JEE MAIN JULY 2021
Solution:

4 4 3 2 1

No restriction

2, 4, 6, 8

Total number of numbers = 4 × 4 × 3 × 2 × 1 = 96

Return To Top
The number of ways in which 5 boys and 3 girls can be arranged in a
row such that :
i) All the boys are together.
ii) All the girls are not together.

Solution:

5 boys 3 girls

i) All the boys are together

Consider as a single unit.

5 boys sitting together,
taken as a single unit.

Return To Top
Solution:
i) All the boys are together

4! ways

5! ways
∴ Total number of arrangements = 4! × 5! = 2880

ii) All the girls are not together

∴ Total number of arrangements in which all the girls are not together
= (Number of ways of arranging 5 boys and 3 girls)
− (Number of ways of arranging in which all the girls are together)

Return To Top
Solution:
ii) All the girls are not together

(Number of ways of arranging 5 boys and 3 girls)

= 5+ 3 !
And (Number of ways of arranging in which all the girls are together)

1 + 5 = 6 units

3 girls sitting together,

taken as a single unit

Return To Top
Solution:

ii) All the girls are not together

6! ways

3! ways
∴ Total number of arrangements = 3! × 6!

∴ Total number of arrangements in which all the girls are not together
= 5 + 3 ! − 6! × 3!
= 8! − 6! × 3! = 6! 8 × 7 − 6 = 36000

Return To Top
The number of words (with or without meaning) that can be
formed from all the letters of the word ′′𝐿𝐸𝑇𝑇𝐸𝑅′′ in which
vowels never come together is _____ .

Solution: JEE MAIN 2020

Consonants → 𝐿𝑇𝑇𝑅

Vowels → 𝐸𝐸

6!
Total number of words = = 180 (∵ 𝑇 and 𝐸 are repeated)
2!⋅2!

5!
Total number of words if vowels are together = = 60 (∵ 𝐸 is repeated)
2!

Required number of words = 180 − 60 = 120

Return To Top
Session 3
Permutation and Combination
under restriction

Return To Top
Complementary Principle:

Number of favorable ways = Total number of ways − Number of unfavourable ways

Return To Top
The number of ways in which 4 boys and 4 girls can be arranged in a
row such that:
i) No two girls are together.
ii) Boys and girls sit alternatively.

Solution:

4 boys

4 girls

i) No two girls are together

So, 4 boys can be arranged in 4! ways

and 4 girls can be arranged in five places in 5𝐶4 × 4! ways
∴ Total number of ways = 4! × 5𝐶4 × 4! = 2880

Return To Top
The number of ways in which 4 boys and 4 girls can be arranged in a
row such that:
i) No two girls are together.
ii) Boys and girls sit alternatively.

Solution: ii) Boys and girls sit alternatively

Case 1:

4 boys can be arranged in 4! ways.

4 girls can be arranged in 4! ways
∴ Total number of ways = 4! × 4!

Case 2:

4 girls can be arranged in 4! ways.

4 boys can be arranged in 4! ways.
∴ Total number of ways = 4! × 4!

Return To Top
Hence, the total number of ways = 4! × 4! + 4! × 4! = 1152
The number of permutations of the letters of the word HEXAGON
such that
i) relative positions of the vowels and consonants are not changed.
ii) Order of the vowels is not changed.
Solution:
Given word : HEXAGON

i) relative positions of the vowels and consonants are not changed.

Vowels : E A O Consonants : H X G N

1𝑠𝑡 2𝑛𝑑 3𝑟𝑑 4𝑡ℎ 5𝑡ℎ 6𝑡ℎ 7𝑡ℎ

3! ways
4! ways

∴ Total number of ways = 3! × 4!

= 144
Return To Top
The number of permutations of the letters of the word HEXAGON
such that
i) relative positions of the vowels and consonants are not changed.
ii) Order of the vowels is not changed.
Solution:
Given word : HEXAGON
Vowels : E A O Consonants : H X G N 4

ii) Order of the vowels is not changed

Let us arrange the consonants in 4 out of 7 places.

This can be done in 7𝐶4 × 4!

Now remaining three places can be filled with vowels in

only one way. (∵ order of the vowels not to be
changed)

∴ Total number of ways = 7𝐶4 × 4! × 1 = 840

Return To Top
Key Takeaways

Note :

The number of permutations of 𝑛 distinct things, in which the order of 𝑟 things

𝑛!
is not to be considered is = 𝑛𝑃𝑛−𝑟
𝑟!

Return To Top
The total number of ways in which six ′ + ′ and four ′ − ′ signs can be
arranged in a line such that no two ′ − ′ signs occur together is ____.

Solution: Given: Six ′ + ′ signs and four ′ − ′ signs

No two ′ − ′ occur together:

+ + + + + +
6!
Number of ways of arranging six ′ + ′ signs = =1
6!

+ + + + + +

There are 7 blank places in which four ′ − ′ signs are to be arranged.

4!
This can be done in 7𝐶4 ×
4!

∴ Total number of arrangement = 1 × 7𝐶4

= 35

Return To Top
Key Takeaways

Including/Excluding Specified Objects

The number of combination of 𝑛 distinct things taken 𝑟 at a time, such that

𝑖) 𝑝 particular things are always included is 𝑛−𝑝 𝐶 𝑟−𝑝
𝑖𝑖) 𝑝 particular things are always excluded is 𝑛−𝑝
𝐶𝑟
𝑖𝑖𝑖) 𝑝 particular things are included and 𝑞 particular things are excluded is 𝑛−𝑝−𝑞 𝐶 𝑟−𝑝 ;
𝑟 ≤ 𝑛; 𝑝, 𝑞 ≤ 𝑟 & 𝑝 + 𝑞 ≤ 𝑛

Return To Top
The number of ways in which a team of 11 players can be selected
from 22 players such that
i) 2 particular players are always included is ______
ii) 4 particular players are always excluded is _______
iii) 2 particular players are included and 4 particular players are
excluded is _______

Solution: i) 2 particular players are always included is ______

Given : 𝑛 = 22, 𝑟 = 11

∴ 𝑛−𝑝 𝐶 𝑟−𝑝 = 20𝐶

9

ii) 4 particular players are always excluded is ______

𝑛−𝑝 18
∴ 𝐶𝑟 = 𝐶11
iii) 2 particular players are always included and 4
particular players are excluded is ______

𝑛−𝑝−𝑞 16𝐶
∴ 𝐶 𝑟−𝑝 = 9
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

A 350

B 500

C 200

D 300

Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

5 girls

7 boys

Team consists of 2 girls and 3 boys

Condition: Two specific boys A and B refuse to be in the same team.

7 boys

A B
Case 𝑖 : Including A but not B:
Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

5 girls

Number of ways of
7 boys selecting 2 boys = 5𝐶2
A B

Number of ways of
5 girls
selecting 2 girls = 5𝐶2

7 boys

A B
Number of ways = 5𝐶2 × 5𝐶2 = 100.
Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

5 girls

7 boys

A B
Case 𝑖𝑖 : Including 𝐵 but not 𝐴:

5 girls

7 boys

A B
Number of ways of selecting 2 boys = 5𝐶2
Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

Number of ways of
5 girls
selecting 2 girls = 5𝐶2

7 boys Number of ways of

selecting 2 boys = 5𝐶2
A B

Number of ways = 5𝐶2 × 5𝐶2 = 100.

Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019
5 girls

7 boys
A B
Case 𝑖𝑖𝑖 : Both 𝐴 and 𝐵 are excluded.

5 girls

7 boys

A B
Number of ways of selecting 3 boys = 5𝐶3 .
Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

Number of ways of
5 girls
selecting 2 girls = 5𝐶2

7 boys Number of ways of

selecting 3 boys = 5𝐶3 .
A B

Number of ways = 5𝐶3 × 5𝐶2 = 100.

Return To Top
Consider a class of 5 girls and 7 boys. The number of different teams
consisting of 2 girls and 3 boys that can be formed from this class, if
there are two specific boys 𝐴 and 𝐵 who refuse to be the member of
the same team, is
JEE MAIN 2019

Case 𝑖 : Including A but not B: Number of ways = 100

A 350
Case 𝑖𝑖 : Including 𝐵 but not 𝐴: Number of ways = 100

Case 𝑖𝑖𝑖 : Both 𝐴 and 𝐵 are excluded. Number of ways = 100 B 500
Including A but not B
+ C 200
∴ Total number of selections = Including 𝐵 but not 𝐴
+ D 300
Both 𝐴 and 𝐵 are excluded

Return To Top ∴ Total number of selections = 100 + 100 + 100 = 300.

DIVISIBILITY MODEL:

• A number is divisible by 3: If the sum of its digits is divisible by 3.

• A number is divisible by 4: If it’s last 2 digits are divisible by 4.

• A number is divisible by 6: If it is divisible by 2 and 3.

• A number is divisible by 7 if the difference between twice the unit digit of the given
number and the remaining part of the given number is a multiple of 7 or it is equal to
0.

Example: 504, 3367, 5719

Return To Top
DIVISIBILITY MODEL:

• A number is divisible by 8: If it’s last 3 digits are divisible by 8.

• A number is divisible by 9: If the sum of its digits is divisible by 9.

• A number is divisible by 11:

if (sum of the digits in the odd places) − (sum of digits in even places) is divisible by 11.

Example: 209, 3564

Return To Top
A five-digit number divisible by 3 is to be formed using the numbers
0, 1, 2, 3, 4 and 5 without repetitions. The total number of ways this
can be done is:

A 216 B 600 C 240 D 3125

Given digits: 0, 1, 2, 3, 4 and 5

A number is divisible by 3 if the sum of its digit is a multiple of 3.

3 3 + 9 = 12 9

The sum of given six digits = 0 + 1 + 2 + 3 + 4 + 5 = 15

15

⇒ Possible sum of five digits such that

= 12 or 15
the number formed is divisible by 3
Return To Top
A five-digit number divisible by 3 is to be formed using the numbers
0, 1, 2, 3, 4 and 5 without repetitions. The total number of ways this
can be done is:

Case 𝑖 : Digits are 0, 1, 2, 4, 5 (Sum of digits = 12)

Number of ways = 5𝑃5 − (Number of ways in which 0 comes in first place)

= 5! − 4!

= 120 − 24 = 96

Case 𝑖𝑖 : Digits are 1, 2, 3, 4, 5 (Sum of digits = 15)

Number of ways = 5𝑃5 = 5! = 120

∴ Total number of ways = 96 + 120 = 216

Return To Top
The number of 5 digits numbers which are divisible by 4, with
digits from the set 1, 2, 3, 4, 5 and the repetition is allowed is
JEE Advanced 2018

Last 2 digits should be divisible by 4 i.e. , 44, 12, 32,24, 52

So, the number of ways to fill the spaces are:

5 5 5 5

∴Total number of 5 − digit numbers = 54 = 625

The number of 6 digits numbers that can be formed using the digits
0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated, is:
JEE MAIN 2019
A 60

B 72

C 48

D 36

Return To Top
The number of 6 digits numbers that can be formed using the digits
0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated, is:
JEE MAIN 2019
Given digits: 0, 1, 2, 5, 7 and 9

Let the six-digit number be: 𝑑1 𝑑2 𝑑3 𝑑4 𝑑5 𝑑6

A number is divisible by 11, if the difference of the

alternating sum of digits of it is divisible by 11.

𝑑1 𝑑2 𝑑3 𝑑4 𝑑5 𝑑6 is divisible by 11

⇒ 𝑑1 + 𝑑3 + 𝑑5 − 𝑑2 + 𝑑4 + 𝑑6 is divisible by 11

𝐾1 𝐾2

⇒ (𝐾1 − 𝐾2 ) is divisible by 11
Return To Top
The number of 6 digits numbers that can be formed using the digits
0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated, is:
JEE MAIN 2019
𝑑1 + 𝑑3 + 𝑑5 + 𝑑2 + 𝑑4 + 𝑑6 = 24
𝐾1 − 𝐾2 = 22

∵ Sum of given digits is 24 ⇒ 𝐾1 + 𝐾2 = 24 𝐾1 − 𝐾2 = 11

𝐾1 − 𝐾2 = 0

𝐾1 + 𝐾2 = 24 𝐾1 + 𝐾2 = 24 𝐾1 + 𝐾2 = 24

− 𝐾1 − 𝐾2 = 22 + 𝐾1 − 𝐾2 = 11 + 𝐾1 − 𝐾2 = 0

𝐾2 = 1 2𝐾1 = 35 2𝐾1 = 24

Sum of digits = 1 Not possible ⇒ 𝐾1 = 𝐾2 = 12

is not possible
𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12
Return To Top
The number of 6 digits numbers that can be formed using the digits
0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated, is:
JEE MAIN 2019
𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12

0, 5, 7 1, 2, 9

Case 𝑖 : 𝑑1 , 𝑑3 , 𝑑5 = 0, 5, 7 and 𝑑2 , 𝑑4 , 𝑑6 = 1, 2, 9

2 2 1

𝑑1 𝑑3 𝑑5

∴ Number of ways = 2 2 × 3! = 24 ∵ (𝑑1 can not be 0)

Return To Top
The number of 6 digits numbers that can be formed using the digits
0, 1, 2, 5, 7 and 9 which are divisible by 11 and no digit is repeated, is:
JEE MAIN 2019
𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12
A 60
1, 2, 9 0, 5, 7
B 72
Case 𝑖𝑖 : 𝑑1 , 𝑑3 , 𝑑5 = 1, 2, 9 and 𝑑2 , 𝑑4 , 𝑑6 = 0, 5, 7

C 48
𝑑1 𝑑3 𝑑5

∴ Number of ways = 3! × 3! = 36 D 36
∴ Total number of 6-digit numbers divisible by 11 = 24 + 36 = 60

Return To Top
If the letters of the word MOTHER are permutated and all the words
so formed (with or without meaning) be listed as in a dictionary, then
the position of the word ‘MOTHER’ is _______. JEE MAIN 2020

Given word : MOTHER Alphabetic order of letters : E, H, M, O, R, T

From the given letters, the word MOTHER comes after the words :

1) Starting with E
𝑖) Starting with MOTE
2) Starting with H 𝐴) Starting with ME
𝑎) Starting with MOE Next Word : MOTHER
3) Starting with M 𝐵) Starting with MH
𝑏) Starting with MOH
𝐶) Starting with MO
𝑐) Starting with MOR

𝑑) Starting with MOT

Return To Top
E
Starting with E = 120

H 5!
Starting with H = 120

5!
M E
Starting with ME = 24

M H 4!
Starting with MH
= 24
4!
Starting with MOE M O E
=6
3!
Starting with MOH M O H
=6
3!
Starting with MOR M O R
=6
3!
Starting with MOTE M O T E =2

2!
Return To Top
Starting with E E = 120

H
Starting with H = 120

M E
Starting with ME = 24

M H
Starting with MH = 24

M O E
Starting with MOE =6

Starting with MOH M O H

=6

Starting with MOR M O R =6

Starting with MOTE M O T E

=2

Next word M O T H E R
Return To Top
Words Number of words Sum

Starting with E 120 −

Starting with H 120 240

Starting with ME 24 264

∴ Position of the word
Starting with MH 24 288
MOTHER = 309𝑡ℎ
Starting with MOE 6 294

Starting with MOH 6 300

Starting with MOR 6 306

Starting with MOTE 2 308

Return To Top
If all the permutations of the letters of the word AGAIN are arranged
in the order as in a dictionary, then find the 49𝑡ℎ word.

Given word : AGAIN

Words Number of Sum
words
Alphabetic order of letters : A, A, G, I, N
Starting with 𝐴 24

A Starting with 𝐺 12 36
Starting with A
Starting with 𝐼 12 48
49
4! = 24
Starting with G
G

4!
I = 12
Starting with I 2!

4!
= 12
2!

N A A G I
The next word is
Return To Top
Session 4
Circular Permutations and
Formation of Groups

Return To Top
Key Takeaways

Circular Permutations

The number of circular permutations of 𝑛 distinct objects is

𝑛−1 !

𝑎𝑛−1 𝑎3
𝑎𝑛 𝑎2
𝑎1

Return To Top
Key Takeaways

Proof :

Let 𝑥 be the number of circular permutations of

𝑛 distinct objects.

For each circular arrangement, the number

of linear arrangements = 𝑛

∴ The number of linear Number of circular

=𝑛×
arrangements of 𝑛 distinct objects arrangements of 𝑛 distinct things

𝑛! = 𝑛 × 𝑥

𝑛!
∴𝑥= = 𝑛−1 !
𝑛
∴ The number of circular permutations of 𝑛 distinct objects is 𝑛 − 1 !
Return To Top
Circular Permutations

The number of circular permutations of 𝑛 distinct objects

is 𝑛 − 1 !

Difference between linear and circular arrangement :

𝑎𝑛−1 𝑎3
Linear → Recognized starting place 𝑎𝑛 𝑎2
𝑎1
Circular → No starting and ending place

Note:
If positional places are marked, then circular
arrangements can be treated as linear arrangements.

Return To Top
The number of ways in which 5 boys and 4 girls can be seated at a
round table, if
i) there is no restriction.
ii) all the girls are together.
iii) all the girls are not together.
iv) no two girls are together.

i) There is no restriction.

9 children can be arranged in 9 − 1 ! = 8! ways

Return To Top
ii) All the girls are together.
Consider 4 girls as one unit.
∴ Total 6 units
6 units can be arranged in 6 − 1 ! = 5! ways.

4 girls can be arranged themselves in 4! ways.

Required number of ways = 5! × 4!

iii) All the girls are not together.

Required number of ways
= Total number of ways
− Number of ways in which all girls are
together

= 8! − 5! × 4!

Return To Top
iv) No two girls are not together.

We can arrange 5 boys in 4! ways.

There will be 5 gaps to arrange 4 girls = 4! × 5C4

Total number of ways = 4! × 5C4 × 4!

Return To Top
Circular Permutations :

• Number of circular permutations of 𝑛 distinct things, if clockwise and

1
anticlockwise directions are taken as not different is 𝑛−1 !.
2

• Example : Circular arrangement of flowers in a Garland, Beads in a

Necklace.

• Number of circular permutations of 𝑛 distinct things, taken 𝑟 at a time

is 𝑛𝐶𝑟 . 𝑟 − 1 !.

• In the above case, if clockwise and anticlockwise directions are taken as

1
not different, then the number of circular permutations is . 𝑛𝐶𝑟 . 𝑟 − 1 !.
2

Return To Top
How many necklaces of 12 beads each can be made from 18 beads of
various colors? ____________.

Solution: Number of circular permutations of 𝑛 distinct things, taken 𝑟 at a time

1
when clockwise and anticlockwise directions are same is . 𝑛𝐶𝑟 . 𝑟 − 1 !
2

1
Required number of ways = . 𝑛𝐶𝑟 . 𝑟 − 1 !
2

1 18
= × 𝐶12 × 12 − 1 !
2
1
= × 18𝐶12 × 11!
2

Return To Top
The number of ways in which a garland can be made by using 8
different flowers is ____________.

Solution:

8−1 ! 1
Number of ways = = × 7!
2 2

= 2520

Return To Top
Five persons 𝐴, 𝐵, 𝐶, 𝐷 and 𝐸 are seated in a circular arrangement. If
each of them is given a hat of one of the three colours red, blue and
green, then number of ways of distributing the hats such that the
persons seated in adjacent seats get different coloured is
Solution: 𝐴
5 persons having 5 hats of colour red, green, blue i.e. 3 colours.
𝐸 𝐵
Maximum number of same colour hats used = 2,

Because if we give 3 same colour hats then atleast 2 person

having same colour of hat will seat in adjacent seats.

Now, suppose hats used are 𝐵, 𝐺, 𝐺, 𝑅, 𝑅. 𝐷 𝐶

So far selecting single colour hat = 3𝐶1 ways

Then distribute that single colour hat in = 5𝐶1 ways

Also to distribute alternative coloured hat to adjacent person = 2𝐶1 ways

∴ required number of ways = 3𝐶1 × 5𝐶1 × 2𝐶1 = 3 × 5 × 2 = 30

Return To Top
Key Takeaways

Formation of Groups:

Let us consider 4 people

Return To Top
Key Takeaways

Formation of Groups:

𝐼) Let us divide them into two unequal groups of sizes 1 and 3

4!
Number of ways = 4𝐶1 × 3𝐶3 = =4
1!3!
Return To Top
Key Takeaways

Results:

• Number 𝑚+𝑛
of ways of dividing 𝑚 + 𝑛 (𝑚 ≠ 𝑛) things into two unequal groups of size 𝑚
!
and 𝑛 is
𝑚! 𝑛!

• Number of ways of dividing 𝑚 + 𝑛 + 𝑝 (𝑚 ≠ 𝑛 ≠ 𝑝) things into three unequal groups

𝑚+𝑛+𝑝 !
of size 𝑚, 𝑛, 𝑝 is
𝑚! 𝑛! 𝑝!

General Results:

• Number of ways of dividing 𝑛1 + 𝑛2 + ⋯ + 𝑛𝑘 into 𝑘 unequal groups of size 𝑛1 , 𝑛2 , … ,

(𝑛1 + 𝑛2 +⋯+ 𝑛𝑘 )!
𝑛𝑘 is
𝑛1 ! 𝑛2 ! … 𝑛𝑘 !

Return To Top
Key Takeaways

𝐼𝐼) Let us divide them into two equal groups

4 𝐶 × 2𝐶 4!
Number of ways = 2 2
= =3
2! 2!(2!∙2!)
Return To Top
Key Takeaways

Results:

• Number of ways of dividing 2𝑛 things into two equal groups of size 𝑛 each is
2𝑛 !
2!(𝑛!∙𝑛!)

• Number of ways of dividing 3𝑛 things into three equal groups of size 𝑛 each is
3𝑛 !
3! 𝑛!∙𝑛!∙𝑛!

General Results:

• Number of ways of dividing 𝑘𝑛 things into 𝑘 equal groups of size 𝑛 each is 𝑘! 𝑛!

𝑘𝑛 !
𝑘

Return To Top
Find the number of ways in which 5 different books can be
𝑖) tied up in 3 bundles.
𝑖𝑖) distributed among 3 students
such that each student get at-least one book.

Solution:
𝑖) 5 books → 3 bundles

Case 1 Case 2

5 5

1 2 2 1 1 3

5! 5!
Number of ways = = 15 Number of ways = = 10
1!2! 2! 2 2! 1! 2 3!

Total number of ways = 15 + 10 = 25

Return To Top
𝑖𝑖) 5 books → 3 students
Case 1

5 5!⋅3!
Number of ways = 2
= 15 ⋅ 3! = 90
1!2! 2!
(Distribution)

1 2 2

Case 2

5 5!⋅3!
Number of ways = = 10 ⋅ 3! = 60
2! 1! 2 3!

(Distribution)

1 1 3 Total number of ways = 90 + 60 = 150

Return To Top
Let 𝑛 be the number of ways in which 5 boys and 5 girls can stand in
a queue in such a way that all the girls stand consecutively in the
queue. Let 𝑚 be the number of ways in which 5 boys and 5 girls can
stand in a queue in such a way that exactly four girls stand
𝑚
consecutively in the queue. Then the value of is
𝑛
JEE Advanced 2015
Solution:
Case 1: 𝑛 = 5! × 6! Case 2: ___𝐵___𝐵___𝐵___𝐵___𝐵___
Where 5! = arranging of five girls 𝑚 = 5! × 5𝐶4 × 4! × 6𝐶2 × 2!
6! = arranging of five boys and five Where 5! = arranging of five boys
consecutive girls 5𝐶 =
4 selecting of four girls,
4! = arranging of five girls
6𝐶 =
2 selecting two gaps in between five boys,
2! = arranging of four consecutive girls and
one single girl
𝑚 5!× 5𝐶4 ×4!× 6𝐶2 ×2!
∴ = =5
𝑛 5!×6!
Return To Top
Key Takeaways

All Possible Selections:

Case 1:

• The total number of selections𝑛out of 𝑛 distinct things taken any number of

things (including nothing) is 2

• Total number of selections = 𝑛𝐶

0 + 𝑛𝐶1 + ⋯ + 𝑛𝐶𝑛 = 2𝑛

• The𝑛total number of ways of selecting at least one thing from 𝑛 distinct things
=2 −1

• Total number of selections = 𝑛𝐶

1 + 𝑛𝐶2 + ⋯ + 𝑛𝐶𝑛 = 2𝑛 − 𝑛𝐶0 = 2𝑛 − 1

Return To Top
Case 2:

• The total number of selections out of 𝑛 similar things taken any number of
things (including nothing) is 𝑛 + 1.

• The total number of ways of selecting at-least one thing from 𝑛 similar things = 𝑛.
If there are three similar letters, say A, A and A, then
Total number of selections = {no A, one A, two A’s, three A’s} = 4 ways

Case 3:

• If there are 𝑝 similar things of one type, 𝑞 similar things of second type and 𝑟
similar things of third type, then the number of ways of selecting atleast one
thing is 𝑝 + 1 𝑞 + 1 𝑟 + 1 − 1

Case 4:

• If there are 𝑝, 𝑞, 𝑟 similar things of different kinds and 𝑛 distinct things,𝑛 then the
number of ways of selecting atleast one thing is 𝑝 + 1 𝑞 + 1 𝑟 + 1 2 − 1
Find the number of ways of selecting at least one fruit from 5 mangoes,
4 apples and 3 bananas.

Solution:
Number of ways of selecting at least one fruit

= 5 + 1 4 + 1 3 + 1 −1

= 119

Return To Top
In a book-store, there are 4 copies of one book, 5 copies of another
book and a single copy of 5 different books each. The number of ways
a person can purchase at least one book is

A 29

B 179

C 959

D 1919

Return To Top
In a book-store, there are 4 copies of one book, 5 copies of another
book and a single copy of 5 different books each. The number of ways
a person can purchase at least one book is

Required number of ways = 4 + 1 5 + 1 ∙ 25 −1 A 29

= 959

B 179

C 959

D 1919

Return To Top
Session 5
Application of Permutation and
Combination

Return To Top
Key Takeaways
MODEL BASED ON DIVISORS:

• Divisors of 12 are: 1 2 3 4 6 12

• Number of divisors = 12 Sum of divisors = 28

Let us explain these two with ‘combinations’

12 = 22 ∙ 31 (prime factorization)
1 = 20 ∙ 30
2 = 21 ∙ 30 The number of divisors
3 = 20 ∙ 31 = (Number of ways of selecting two 2’s)×
(Number of ways of selecting one 3)
4 = 22 ∙ 30
= 2+ 1 1+1 = 6
6 = 21 ∙ 31
12 = 22 ∙ 31

Return To Top • So, if 12 = 2𝑥 ∙ 3𝑦 then number of divisors = 𝑥+1 𝑦+1

MODEL BASED ON DIVISORS:
𝑥 𝑥 𝑥
Let 𝑁 be a positive integer and 𝑁 = 𝑝1 1 ⋅ 𝑝2 2 ⋅ 𝑝3 3 ⋯

Where 𝑝1 , 𝑝2 , 𝑝3 ⋯ are distinct primes and 𝑥1 , 𝑥2 , 𝑥3 ⋯ ∈ 𝑁

• → Number of divisors of 𝑁 = 𝑥1 + 1 𝑥2 + 1 𝑥3 + 1

𝑥 𝑥
• → Sum of all the divisors = 𝑝10 + 𝑝11 + 𝑝12 + ⋯ + 𝑝1 1 𝑝20 + 𝑝21 + 𝑝22 + ⋯ 𝑝2 2 ⋯

𝑥 +1 𝑥 +1
𝑝1 1 −1 𝑝2 2 −1
• → Sum of all the divisors =
𝑝1 −1 𝑝2 −1
⋯

Number of ways in which 𝑁 can be resolved as a product of two factors is equal to

1
•2 𝑥1 + 1 𝑥2 + 1 ⋯ , if 𝑁 is not a perfect square

1
•2 𝑥1 + 1 𝑥2 + 1 ⋯ + 1 , if 𝑁 is a perfect square

Return To Top
In how many ways the number 8100 can be written as product of
two coprime factors?

Solution :

Given: 8100 = 22 ∙ 34 ⋅ 52

Possible ways to express 8100 as product of two coprime factors are,

→ 1 × 22 ∙ 34 ∙ 52

→ 22 × 34 ∙ 52

→ 34 × (22 ∙ 52 )

→ 52 × 22 ∙ 34

∴ Number of ways = 4

Return To Top
Key Takeaways

MODEL BASED ON DIVISORS:

• If ′𝑛′ is the number of different prime factors of 𝑁, then the number of ways in
which 𝑁 can be resolved as product of two coprime factors is equal to 2𝑛−1.

Return To Top
Let 𝑛 be a non-negative integer. Then the number of divisors of the form
4𝑛 + 1 of the number 10 10 ⋅ 11 11 ⋅ 13 13 is equal to ________.
JEE Main Jul 2021
Solution :
𝑁 = 210 ⋅ 510 ⋅ 1111 ⋅ 1313

20 + 21 + ⋯ + 210 50 + 51 + ⋯ + 510

Only 20 is allowed to All types are of

be selected (20 is of the type 4𝜆 + 1
the type 4𝜆 + 1)

110 + 111 + ⋯ + 1111 130 + 131 + ⋯ + 1313

11even are of the All types are of

type 4𝜆 + 1 the type 4𝜆 + 1

Number of required divisors

= 1 × 11 × 6 × 14 = 924
Return To Top
Key Takeaways
GEOMETRY MODELS

• If there are 𝑛 points in a plane (no three are collinear)

then by joining them we can obtain:

i. 𝑛𝐶
2 straight lines 𝑃1 𝑃2
ii. 𝐶3 triangles
𝑛
HAND SHAKE
PROBLEM

𝑃3 𝑃4

• If there are 𝑛 points in a plane of which 𝑚 points are

collinear, then by joining them, we can obtain

i. 𝐶2 − 𝑚𝐶2 + 1 straight lines

𝑛

ii. 𝑛𝐶 − 𝑚𝐶
3 3 triangles
Return To Top
The number of diagonals of a polygon of
i) 5 sides is ____ .
ii) 10 sides is ____ .

i) Polygon of 5 sides:

The number of diagonals of a polygon of 5

sides is 5𝐶2 − 5 = 5

So, in general, the number of diagonals of a polygon of 𝑛 sides

(𝑛 vertices) is 𝑛𝐶2 − 𝑛.

ii) Polygon of 10 sides:

The number of diagonals of a polygon of 10

sides is 10𝐶2 − 10 = 35

Return To Top
The maximum number of points of intersection of :
i) 20 lines in a plane is_______.
ii) 10 circles in a plane is_______.

i) 20 lines in a plane
The maximum number of points of intersection of 𝑛 straight lines in a plane is 𝑛𝐶2
20
⇒ Maximum number of points of intersection of 20 straight lines = 𝐶2 = 190

ii) 10 circles in a plane

The maximum number of points of intersection of 𝑛 circles in a plane is 2 × 𝑛𝐶2 .

⇒ Maximum number of points of intersection of 10 circles = 2 × 10𝐶2 = 2 × 45 = 90

Return To Top
The number of parallelograms that can be formed from a set of 4
parallel lines intersecting another set of 3 parallel lines is_______.

Given : 4 parallel lines intersecting another set of 3 parallel lines.

If a set of 𝑚 parallel lines are intersected by another set of 𝑛 parallel lines,

then the number of parallelograms obtained will be 𝑚𝐶2 × 𝑛𝐶2.

∴ Required number of parallelograms = 4𝐶2 × 3𝐶2 = 18

Return To Top
If the sides 𝐴𝐵, 𝐵𝐶 and 𝐶𝐴 of a triangle 𝐴𝐵𝐶 have 3, 5 and 6 interior points
respectively, then the total number of triangles that can be constructed
using these points as vertices is equal to :
JEE Main Mar 2021

A 360

B 240

C 333

D 364

Return To Top
If the sides 𝐴𝐵, 𝐵𝐶 and 𝐶𝐴 of a triangle 𝐴𝐵𝐶 have 3, 5 and 6 interior points
respectively, then the total number of triangles that can be constructed
using these points as vertices is equal to :
JEE Main Mar 2021

Solution :
A 360
Total number of triangles 𝐴

= 3+5+6 𝐶3 − 3𝐶3 − 5𝐶3 − 6𝐶3 B 240

= 364 − 1 − 10 − 20
𝐵 𝐶
C 333
= 333

D 364

Return To Top
Principle of Inclusion and Exclusion

= + −

𝑛 𝐴 𝑛 𝐵 𝑛 𝐴∩𝐵
𝑛 𝐴∪𝐵

include exclude

𝑛 𝐴∪𝐵 = 𝑛 𝐴 +𝑛 𝐵 −𝑛 𝐴∩𝐵
𝑛 𝐴′ ∩ 𝐵′ = 𝑛 𝐴 ∪ 𝐵 ′ = 𝑛 𝑈 − 𝑛 𝐴 ∪ 𝐵

Return To Top
Find the number of words that can be made by permutating all
the letters of the word 𝑅𝑂𝑂𝑅𝐾𝐸𝐸, which neither begin with 𝑅 nor
end with 𝐸.
Solution :

Given word : 𝑅𝑂𝑂𝑅𝐾𝐸𝐸

Let 𝐴 ≡ { words begin with 𝑅 }

𝐵 ≡ { words end with 𝐸 }

𝐴′ ∩ 𝐵′ ≡ { words neither begin with 𝑅 nor end with 𝐸 }

7!
𝑅𝑂𝑂𝑅𝐾𝐸𝐸 𝑛 𝑈 = 2!⋅ 2!⋅ 2!

𝑛 𝐴 = R

6!
2!⋅ 2!

Return To Top
Let 𝐴 ≡ { words begin with 𝑅 } 𝐵 ≡ { words end with 𝐸 }

𝐴′ ∩ 𝐵′ ≡ { words neither begin with 𝑅 nor end with 𝐸 }

7!
𝑅𝑂𝑂𝑅𝐾𝐸𝐸 𝑛 𝑈 =
2!⋅ 2!⋅ 2!

𝑛 𝐴 = R

6!
2!⋅ 2!

6!
E
𝑛 𝐵 = 2! . 2!

6!
2! . 2!

R E
𝑛 𝐴∩𝐵 =

5!
2!
Return To Top
Find the number of words that can be made by permutating all
the letters of the word 𝑅𝑂𝑂𝑅𝐾𝐸𝐸, which neither begin with 𝑅 nor
end with 𝐸.
Solution :
7!
𝑅𝑂𝑂𝑅𝐾𝐸𝐸 𝑛 𝑈 =
2!⋅ 2!⋅ 2!

6!
6! 5!
𝑛 𝐴 = 2!⋅ 2! 𝑛 𝐵 = 𝑛 𝐴∩𝐵 =
2!⋅ 2! 2!

𝑛 𝐴′ ∩ 𝐵′ = 𝑛 𝑈 − 𝑛 𝐴 ∪ 𝐵

= 𝑛 𝑈 −𝑛 𝐴 −𝑛 𝐵 + 𝑛 𝐴∩ 𝐵

7! 6! 6! 5!
= − − +
2!⋅ 2!⋅ 2! 2!⋅ 2! 2!⋅ 2! 2!

= 330

Return To Top
Key Takeaways

Derangements

If 𝑛 things are arranged in a row, then the number of rearrangements such that none of
them occupy their original positions are called Derangements.
The number of Derangements of 𝑛 distinct things can be denoted by 𝐷𝑛 .

1 1 1 𝑛1
𝐷𝑛 = 𝑛! 1 −
1!
+ − + ⋯+
2! 3!
−1
𝑛!
where 𝑛 ≥ 2

Return To Top
Find the number of derangements of the letters of the word BAG.

Solution :

Given word : BAG

ABG

AGB

BAG
All permutations = 3! = 6 ways = Number of derangements = 𝐷3 = 2
BGA

GAB

GBA
Using formula:
1 1 1 𝑛1
𝐷𝑛 = 𝑛! 1 −
1!
+
2!
−
3!
+ ⋯ + −1
𝑛!
where 𝑛 ≥ 2

1 1 1
𝐷3 = 3! 1 − 1! + 2! − 3! = 2
Return To Top
Six cards and six envelopes are numbered 1,2,3,4,5,6 and cards are to
be placed in envelopes so that each envelope contains exactly one
card, and no card is placed in the envelope bearing the same number
and moreover the card numbered 1 is always placed in envelope
numbered 2. Then the number of ways it can be done is
JEE Advanced 2014
A 44

B 53

C 67

D 265

Return To Top
Six cards and six envelopes are numbered 1,2,3,4,5,6 and cards are to
be placed in envelopes so that each envelope contains exactly one
card, and no card is placed in the envelope bearing the same number
and moreover the card numbered 1 is always placed in envelope
numbered 2. Then the number of ways it can be done is
JEE Advanced 2014
Solution:
There are 2 possibilities A 44
(1) If the card number 2 goes in the envelope 1, then it is derangement
1 1 1 1
case of 4 things which can be done in, 4! 1 −
1!
+ − +
2! 3! 4!
= 9 ways B 53

(2) If the card number 2 doesn’t go in the envelope 1, then it is derangement

1 1 1 1 1
C 67
case of 5 things which can be done in, 5! 1 − + − + − = 44 ways
1! 2! 3! 4! 5!

Hence, Total ways = 9 + 44 = 53. D 265

Return To Top
Session 6
Distribution concept and
Multinomial theorem

Return To Top
Key Takeaways

Distinct Things → Distinct Boxes:

The number of ways of distributing 𝑛 distinct things in 𝑟 distinct boxes such

that each box is filled with

Case 1

0 or more things (i.e. empty boxes are allowed) = 𝑟 𝑛

Case 2

At least one thing (i.e. empty boxes are not allowed)

= 𝑟 𝑛 − 𝑟 𝐶1 𝑟 − 1 𝑛 + 𝑟𝐶
2 𝑟−2 𝑛 − ⋯ + −1 𝑟−1 ∙ 𝑟 𝐶
𝑟−1 1 𝑛

Return To Top
In how many ways 5 different balls can be distributed into 3 boxes so
that no box remains empty.

Solution:
The required number of ways
Atleast one ball (i.e. empty boxes are not allowed)
= 𝑟 𝑛 − 𝑟 𝐶1 𝑟 − 1 𝑛
+ 𝑟 𝐶2 𝑟 − 2 𝑛
− ⋯ + −1 𝑟−1
∙ 𝑟 𝐶𝑟−1 1 𝑛

where 𝑛 = 5, 𝑟 = 3
= 35 − 3𝐶1 3 − 1 5 + 3𝐶
2 3−2 5 − 3𝐶
3 3− 3 5

= 150

Return To Top
Key Takeaways

Identical Things → Distinct Boxes:

The number of ways of distributing 𝑛 identical things in 𝑟

distinct boxes such that each box is filled with

Case 1

0 or more things (i.e. empty boxes are allowed) = 𝑛+𝑟−1

𝐶𝑟−1

Proof:

Let 𝑛 identical objects put on floor

1 2 3 4 ⋯⋯ 𝑛−1 𝑛

Return To Top
Key Takeaways

Proof (Cont.⋯):
To form 𝑟 −groups we need 𝑟 − 1 identical partitions

1 2 3 4 ⋯⋯ 𝑛−1 𝑛

𝑛 identical objects 𝑟 − 1 identical partitions

𝑛+𝑟−1 !
= 𝑛+𝑟−1𝐶𝑟−1
𝑛! 𝑟−1 !

Return To Top
Identical Things → Distinct Boxes:

The number of ways of distributing 𝑛 identical things in 𝑟

distinct boxes such that each box is filled with

Case 2

Atleast one thing (i.e. empty boxes are not allowed) = 𝑛−1
𝐶𝑟−1

For the equation 𝑥1 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑟 = 𝑛

Where 𝑛 is 𝑛 identical units of 1.

𝑖) Number of non-negative integral solution 𝑛+𝑟−1𝐶𝑟−1

𝑖𝑖) Number of positive integral solution 𝑛−1𝐶𝑟−1

Return To Top
The total number of 3 −digit numbers, whose sum of
digits is 10, is
JEE Main Sept 2020

Solution:
Let 𝑥𝑦𝑧 be the 3 digit number
𝑥 + 𝑦 + 𝑧 = 10 where 𝑥 ≥ 1, 𝑦 ≥ 0, 𝑧 ≥ 0
Let 𝑥 − 1 = 𝑡 ⇒ 𝑥 = 1 + 𝑡

⇒ 𝑡 + 𝑦 + 𝑧 = 9 where 𝑡 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0
Total number of non negative integral solution

= 9+3−1𝐶 = 11𝐶 = 55
3−1 2

But for 𝑡 = 9, 𝑥 = 10 not possible

∴ total numbers = 55 − 1 = 54

Return To Top
The total number of positive integral solutions (𝑥, 𝑦, 𝑧) such
that 𝑥𝑦𝑧 = 24 is :
JEE Main 2020

A 36

B 45

C 24

D 30

Return To Top
The total number of positive integral solutions (𝑥, 𝑦, 𝑧) such
that 𝑥𝑦𝑧 = 24 is :
JEE Main 2020
Solution: 𝑥𝑦𝑧 = 24

⇒ 𝑥𝑦𝑧 = 23 ⋅ 31 A 36

⇒ 𝑥 = 2𝑎1 ⋅ 3𝑏1 , 𝑦 = 2𝑎2 ⋅ 3𝑏2 , 𝑧 = 2𝑎3 ⋅ 3𝑏3

B 45
𝑎1 ,𝑎2 , 𝑎3 ∈ {0, 1, 2, 3}

𝑏1 , 𝑏2 , 𝑏3 ∈ {0, 1}
C 24
Case 1: 𝑎1 + 𝑎2 + 𝑎3 = 3

Number of Non-negative solutions = 3+3−1𝐶

3−1 = 5𝐶2 = 10 D 30
Case 2: 𝑏1 + 𝑏2 + 𝑏3 = 1

Number of Non-negative solutions = 1+3−1

𝐶3−1 = 3

∴ Total number of solutions = 10 × 3 = 30

Return To Top
Find the number of non-negative integral solutions of
𝑎 + 𝑏 + 𝑐 + 𝑑 ≤ 20.

Solution: Given: 𝑎 + 𝑏 + 𝑐 + 𝑑 ≤ 20 ⋯ (𝑖)

Let 𝑒 ≥ 0 be a dummy variable such that
𝑎 + 𝑏 + 𝑐 + 𝑑 + 𝑒 = 20 ⋯ (𝑖𝑖)

Now, number of non-negative integral solutions of (𝑖)

= number of non-negative integral solutions of (𝑖𝑖)

= 𝑛+𝑟−1𝐶
𝑟−1
𝑛 = 20, 𝑟 = 5
20+5−1𝐶
= 5−1

24
= 𝐶4

Return To Top
An engineer is required to visit a factory for exactly 4 days during the
first 15 days of every month and it is mandatory that no two visits
take place on consecutive days. Then the number of all possible ways
in which such visits to the factory can be made by the engineer
during 1-15 June 2021 is_________. JEE (ADVANCED) 2020

Given :

15 days → to visit for 4 days,

No two visits are consecutive.

Let 𝑉1 , 𝑉2 , 𝑉3 , 𝑉4 be the 4 visiting days

Return To Top
Let 𝑉1 , 𝑉2 , 𝑉3 , 𝑉4 be the 4 visiting days
Consider,

𝑎 𝑏 𝑐 𝑑 𝑒
𝑉1 𝑉2 𝑉3 𝑉4

where, 𝑎, 𝑏, 𝑐, 𝑑, 𝑒 be the remaining days

So, 𝑎 + 𝑏 + 𝑐 + 𝑑 + 𝑒 = 11 and 𝑎 ≥ 0, 𝑏 ≥ 1, 𝑐 ≥ 1, 𝑑 ≥ 1, 𝑒 ≥ 0
Put 𝑏 = 1 + 𝑥, 𝑐 = 1 + 𝑦, 𝑑 = 1 + 𝑡.
then, 𝑎 + 𝑥 + 𝑦 + 𝑡 + 𝑒 = 8 and 𝑎 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0, 𝑡 ≥ 0, 𝑒 ≥ 0

Number of non-negative integral solution

𝑛+𝑟−1𝐶
= 𝑟−1

= 8+5−1𝐶 12𝐶
5−1 = 4

= 495
Return To Top
Key Takeaways

Application of Multinomial Theorem

In this theorem we try to write all possible outcomes in powers of a random

variable 𝑥 and then calculate coefficient of required outcomes.

Return To Top
Find the number of ways of distributing 10 identical apples among 3
children without any restrictions

Solution: Let 𝑎, 𝑏, 𝑐 be number of apples distributed to three children

𝑎 + 𝑏 + 𝑐 = 10; 𝑎 ≥ 0, 𝑏 ≥ 0. 𝑐 ≥ 0

Possible outcomes = 𝑎 𝑏 𝑐
𝑥0 + 𝑥1 + 𝑥2 + ⋯ 𝑥0 + 𝑥1 + 𝑥2 + ⋯ 𝑥0 + 𝑥1 + 𝑥2 + ⋯

Number of solution will be = Coefficient of 𝑥 10 in

𝑥0 + 𝑥1 + 𝑥2 + ⋯ 𝑥0 + 𝑥1 + 𝑥2 + ⋯ 𝑥0 + 𝑥1 + 𝑥2 + ⋯

Infinite G.P.

Return To Top
Find the number of ways of distributing 10 identical apples among 3
children without any restrictions

1 1 1
Solution: Coefficient of 𝑥 10 in 1−𝑥 1−𝑥 1−𝑥
𝑎
= Coefficient of 𝑥 10 in 1 − 𝑥 −3 𝑆∞ =
1−𝑟

Coefficient of 𝑥 𝑟 in 1 − 𝑥 −𝑚
is 𝑚+𝑟−1
𝐶𝑟

10+3−1 𝑚 = 3, 𝑟 = 10
= 𝐶10
12𝐶
= 10

= 66

Return To Top
Find the number of non-negative integral solutions of
𝑥1 + 𝑥2 + 𝑥3 + 4𝑥4 = 20.

Given: 𝑥1 +𝑥2 + 𝑥3 + 4𝑥4 = 20

Number of non-negative integral solutions

= the coefficient of 𝑥 20 in the product 1 + 𝑥 + 𝑥 2 + ⋯ 3

1 + 𝑥4 + 𝑥8 + ⋯
−𝑚
= coefficient of 𝑥 20 in 1 − 𝑥 −3
1 − 𝑥4 −1 1+𝑥 = 1 − 𝑚𝐶1 𝑥 + 𝑚+1
𝐶2 𝑥 2 − 𝑚+2
𝐶3 𝑥 3 + ⋯

= Coefficient of 𝑥 20 in

(1 + 3𝐶1 𝑥 + 4𝐶2 𝑥 2 + ⋯ + 𝑟+2𝐶𝑟 𝑥 𝑟 ) 1 + 𝑥 4 + 𝑥 8 + ⋯

= 1 + 6𝐶4 + 10𝐶8 + 14𝐶12 + 18𝐶 + 22𝐶

16 20

= 536

Return To Top
Thank You!