Permutation and Combination

Welcome to
Permutations & Combinations

Table of contents
Session 01 𝟎𝟑 Session 02 𝟐𝟑
Session 03 𝟒𝟑
Session 04 𝟔𝟓
Fundamental Principle of Counting 04 PERMUTATION 24
Combination 44 Complementary Principle 72
Multiplication Principle (Rule of AND) 04 FORMULA FOR PERMUTATION 24
Special Case String Method 61 Including/Excluding Specified
Addition Principle (Rule of OR) 07 36 81
Objects
Factorial Notation 20 Permutation when all the
38
objects are not distinct
Session 05 𝟗𝟎 Session 06 𝟏𝟏𝟎 Session 07 𝟏𝟐𝟖 Session 08 𝟏𝟒𝟕
DIVISIBILITY MODEL 91 Circular Permutations 112 All Possible Selections 129 GEOMETRY MODELS 148
Rank 101 Formation of Groups 116 MODEL BASED ON DIVISORS 135
Circular Permutations 102
Exponent of Prime in 𝑛! 143
Session 09 𝟏𝟔𝟕
Session 10 𝟏𝟖𝟕
Derangements 168
Application of Multinomial Theorem 191
Principle of Inclusion and Exclusion 173
Distinct Thing → Distinct Boxes 176
Identical Things → Distinct Boxes 179

Session 01
Fundamental Principles
of Counting
Return To Top
Key Takeaways
Fundamental Principle of Counting:
Number of different ways of arranging
• Counting techniques
Selecting different objects
Multiplication Principle (Rule of AND)
Event 𝐴 Event 𝐵
Different ways Different ways
𝑚 𝑛
Total number of ways for two events simultaneously

𝑚×𝑛
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 𝐵.
𝐴 𝐵 𝐶
3 ways 4 ways
Number of ways to travel from 𝐴 to 𝐵 = 3

Number of ways to travel from 𝐵 to 𝐶 = 4
Number of ways he can travel from 𝐴 to 𝐵 and 𝐵 to 𝐶 = 3 × 4 = 12 Ways
Return To Top
(𝑥, 1) (𝑥, 2) (𝑥, 3) (𝑥, 4)
1
𝑥 2
(𝑦, 1) (𝑦, 2) (𝑦, 3) (𝑦, 4)
𝑦
𝐴 𝐵 𝐶
𝑧 3
(𝑧, 1) (𝑧, 2) (𝑧, 3) (𝑧, 4)
4
• The Multiplication principle can be generalised for any finite number of events.
Return To Top
Key Takeaways
Addition Principle (Rule of OR):
Event 𝐴 Event 𝐵
Different ways Different ways
𝑚 𝑛
Total number of ways for an event 𝐴 or 𝐵 to occur

𝑚+𝑛
Return To Top
Observe a road network in the diagram below.
𝐶
𝐴
𝐷
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
Case II: Via 𝐷 𝐴 𝐷 𝐶

2 ways 3 ways
∴ Number of ways he can travel = 2 × 3 = 6 Ways
Return To Top ∴ Total number of ways = 12 + 6 = 18 Ways
Key Takeaways
Addition Principle (Rule of OR):
Note:
➢ 𝐴 and 𝐵 are disjoint.
➢ Can be extended to finite number of disjoint events.
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
5 Girls
B 3
3 Boys
C 5
Total possible ways = 3 × 5 = 15
D 8
Return To Top
There are 5 doors to enter and exit the auditorium, but the same
door cannot be used to enter and exit the auditorium, Then in how
many ways can a student enter and exit the auditorium.
ENTRY
EXIT
=5×5
= 25
Return To Top
There are 5 doors to enter and exit the auditorium, but the same
door cannot be used to enter and exit the auditorium, Then in how
many ways can a student enter and exit the auditorium.
ENTRY
EXIT
=5×4
= 20
Return To Top
Customer has 4 options,
Burgers Fries Beverages Deserts
4 3 5 2
4 × 3 × 5 × 2 = 120
Return To Top
→
→
=5×4×3×2
→ = 120
Return To Top
Twelve students compete for a race. The number of ways in which
first three places can be taken is ?
1𝑠𝑡
2𝑛𝑑
3𝑟𝑑
= 12 × 11 × 10
= 1320
Return To Top
A customer forgets a 3-digit code for an Automated Teller Machine
(ATM) in a bank. Find the largest possible number of unsuccessful
trials necessary to obtain correct code.
10 × 10 × 10
= 1000
Number of unsuccessful attempts: = 1000 − 1

= 999
Return To Top
How many 3 digit even numbers can be formed from the digits
1, 2, 3, 4, 5, 6 if the digits can be repeated.
Digits : 1, 2, 3, 4, 5, 6
Number of ways to = Number of ways of filling

form 3 digit numbers 3 vacant places in succession
For 3 digit even numbers,
1 2 3 4 5 6
2 4 6
Return To Top
How many 3 digit even numbers can be formed from the digits
1, 2, 3, 4, 5, 6 if the digits can be repeated.
Unit’s place can be filled in 3 ways.
Ten’s place can be filled in 6 ways. (Repetition is allowed)
Hundred’s place also can be filled in 6 ways. (Repetition is allowed)
6 6 3
∴ Required number of 3-digit even number
=6×6×3
= 108
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
7𝑡ℎ
i. at any of the 7 floors.
6𝑡ℎ
ii. at different floors.
5𝑡ℎ
i. Any of the 5 persons can leave the lift cabin in 7 different ways. 4𝑡ℎ
3𝑟𝑑
Thus, by product rule, the total number of ways = 7 × 7 × 7 × 7 × 7
2𝑛𝑑
5
= 7 = 16807.
1𝑠𝑡
𝐺
ii. First person can leave the lift cabin in 7 different ways.
Second person can leave the lift cabin in 6 different ways.

⋯
Thus, by product rule, the total number of ways = 7 × 6 × 5 × 4 × 3
Return To Top
= 2520.
Key Takeaways
Factorial Notation:
• The product of first ‘𝑛’ natural numbers are denoted by 𝑛!

𝑛! = 1 × 2 × 3 × ⋯ × 𝑛 − 1 × 𝑛
When 𝑛 = 1, 1! = 1
When 𝑛 = 2, 2! = 1 × 2 = 2
When 𝑛 = 3, 3! = 1 × 2 × 3 = 6
When 𝑛 = 4, 4! = 1 × 2 × 3 × 4 = 24
Return To Top
Key Takeaways
NOTE:
• We define 0! = 1
• 𝑛! = 𝑛 × 𝑛 − 1 ! = 𝑛 × 𝑛 − 1 × 𝑛 − 2 ! and so on
5! = 5 × 4! = 120
6! = 6 × 5! = 720
7! = 7 × 6! = 5040
• Factorial of a negative integer is not defined.

• The value of 𝑛! ends with zero, if 𝑛 ≥ 5.
Return To Top
Find the remainder when 1! + 2! + 3! + ⋯ + 100! Is divided by 15.
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
Session 02
Permutations of distinct
and alike objects
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 and the objects do not repeat 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
Key Takeaways
FORMULA FOR PERMUTATION
• 𝑛 𝑛!
𝑃𝑟 =
𝑛−𝑟 !
Proof :
𝑛
𝑃𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯ × 𝑛 − 𝑟 + 1
𝑛−𝑟 !
⇒ 𝑛𝑃𝑟 = 𝑛 × 𝑛 − 1 × 𝑛 − 2 × ⋯ × 𝑛 − 𝑟 + 1
𝑛−𝑟 !
𝑛!
⇒ 𝑛𝑃𝑟 =
𝑛−𝑟 !
Return To Top
Key Takeaways
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
Find 𝑛 such that 𝑛𝑃5 = 42 ⋅ 𝑛𝑃3 .
Given: 𝑛𝑃5 = 42 ⋅ 𝑛𝑃3 .

𝑛! 𝑛!
⇒ = 42 ⋅
𝑛−5 ! 𝑛−3 !
⇒ 𝑛 𝑛 − 1 𝑛 − 2 𝑛 − 3 𝑛 − 4 = 42𝑛 𝑛 − 1 (𝑛 − 2)
⇒𝑛 𝑛−1 𝑛−2 𝑛 − 3 𝑛 − 4 − 42 = 0
⇒ 𝑛 − 3 𝑛 − 4 = 42 (∵ 𝑛 ≥ 5)
⇒ 𝑛2 − 7𝑛 − 30 = 0
⇒ 𝑛 − 10 𝑛 + 3 = 0
⇒ 𝑛 = −3 (rejected)
⇒ 𝑛 = 10
Return To Top
Prove that:
𝑛
𝑃𝑟
𝑖 𝑛𝑃
=𝑛−𝑟+1
𝑟−1
𝑖𝑖 𝑛
𝑃𝑟 = 𝑛 × 𝑛−1
𝑃 𝑟−1 Also, 𝑛𝑃𝑟 = 𝑛 × 𝑛 − 1 × (𝑛−2)𝑃(𝑟−2) and so on
𝑛!
𝑖 We know, 𝑛𝑃𝑟 =
𝑛−𝑟 !
𝑛𝑃 𝑛! (𝑛−𝑟+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 MAINS 2020
(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
Three-digit numbers are to be formed by using the odd
digits only. The number of such numbers which satisfy the
following conditions :
I. Without repetition.
II. When repetition is allowed.
III. When at-least one digit is repeated.
Odd digits: 1, 3, 5, 7, 9
5!
Number of permutations without repetition = 5𝑃3 = = 60
2!
The number of permutations of 𝑛 different objects

taken 𝑟 at a time, where repetition is allowed is 𝑛𝑟 .
Number of permutations with repetition = 53 = 125.

Return To Top
Three-digit numbers are to be formed by using the odd
digits only. The number of such numbers which satisfy the
following conditions :
Odd digits: 1, 3, 5, 7, 9
Number of permutations with repetition

− 125 − 60 = 65.
Number of permutations without repetition
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.
Given word: E Q U A T I O N
8 different letters
Number of vowels = 5
Number of consonants = 3
Number of words = 8𝑃4 = 8 × 7 × 6 × 5 = 1680.

Return To Top
A Number of words = 5 × 7! = 25,200
E
_ _ _ _ _ _ _ _
5
7!
Return To Top
Q
_ _ _ _ _ _ _ _
3
7!
Number of words = 3 × 7! = 15,120
Return To Top
Key Takeaways
Special Case:
A C T : All the three letters are different.
ACT ATC
• Different arrangements CAT CTA
TAC TCA
• 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:
The number of permutations of 𝑛 objects of which 𝑝 objects are of same

• kind and rest are distinct =
𝑛!
𝑝!
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 !⋯𝑃𝑘 !
Return To Top
Find the number of words that can be formed by using all the
letters of the word :
𝑖) MESOPOTAMIA 𝑖𝑖) INDEPENDENCE
𝑖) 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 can be formed using the letters of the word
BANANA ?
A 20
Given word : BANANA
6 letters B 60
6!
∴ Number of arrangements = 2! ×3! = 60
∴ Total number of words = 60 C 30
D 40
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.
Given word : A L L A H A B A D
AAAA LL BDH
9!
∴ Number of permutations = = 7560
4! × 2!
𝑖) start with A.
A _ _ _ _ _ _ _ _
AAA LL BDH
8!
∴ Number of permutations = 1 × = 3360
Return To Top 3!×2!
Find the number of permutations of the letters of the word
ALLAHABAD. How many of them :
𝑖) start with A. 𝑖𝑖) end with L.
𝑖𝑖) end with L.

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

A _ _ _ _ _ _ _ L
AAA L BDH
7!
Return To Top ∴ Number of permutations = = 840
3!
Session 03
Combination of objects
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
Return To Top
Key Takeaways
Combination:
In general,
Number of selections of 𝑛 objects

taken 𝑟 at a time × 𝑟! = 𝑛𝑃𝑟
Number of selections of 𝑛 objects 𝑛𝑃

taken 𝑟 at a time = 𝑟
= 𝑛𝐶𝑟
𝑟!
Return To Top
Key Takeaways
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
Eight teams participate in a cricket tournament. If each team plays
once against each of the others, find the total number of matches ?
DS
DKR VCB
Total : 8 teams
Each team plays once against

MSK DRH each of the others
RMI SR
KLXI
The total number of matches = 8𝐶2 = 28
Return To Top
Find the number of ways of selecting 3 boys and 4 girls from
5 boys and 6 girls.
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 ?
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
Find the number of 6 - digit numbers in which all the odd digits
and only odd digits will appear.
odd digits = 1, 3, 5, 7, 9
_ _ _ _ _ _
6 digit number formed

by using 5 odd digits
⇒ 5 odd digits are to be arranged with one digit repeating in 6 places.

1 ,3 ,5 ,7 ,9 ,1
1 ,3 ,5 ,7 ,9 ,3
Possible selections 1 ,3 ,5 ,7 ,9 ,5
of digits
1 ,3 ,5 ,7 ,9 ,7
1 ,3 ,5 ,7 ,9 ,9
6!
∴ The number of 6-digit numbers = 5𝐶1 × =
Return To Top 2!
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
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
Total number of cards = 52

13 cards of each type
Total number of black cards = 26 Total number of red cards
Return To Top
K Q J
K Q J
K Q J
K Q J
Total number of face cards = 12

K Q J
K Q J
K Q J
K Q J
Return To Top
A 2 3 4 5 6 7 8 9 10 K Q J
SPADE
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
CLUB
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
DIAMOND
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
HEART
A 2 3 4 5 6 7 8 9 10 K Q J
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 ____ .
Return To Top
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 ____ .
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
Find the number of ways of choosing 2 cards from a pack of 52 playing
cards, such that one is heart and other one is spade.
A 52
𝐶2
Selection of one heart = 13
𝐶1
Selection of one spade = 13

𝐶1 B 26
𝐶1 × 26𝐶1
One is heart and other is spade = 13

𝐶1 × 13𝐶1 = 169
C 13
𝐶2
D 13
𝐶1 × 13𝐶1
Return To Top
Find the number of permutations of the letters of the words RANDOM
such that vowels come together.
Given word : RANDOM
Vowels : A O Consonants : R N D M AO R N D M
Consider as 5
a single unit ∴ Number of arrangements
of 5 units = 5!
AO OA In each arrangement, two vowels can

be arranged in 2! Ways.
∴ Total number of arrangements = 5! × 2! = 240
Return To Top
String Method
The number of permutations of 𝑛 distinct things, taken all at 𝑚! 𝑛 − 𝑚 + 1 !

A time when 𝑚 specified things always come together.
Return To Top
The number of ways in which we can choose a committee from 4
men and 6 women so that the committee includes at least two men
and exactly twice as many women as men is ____ .
6 women
4 men
Committee: At least 2 men and twice as many women as men.

Case 𝑖 : Two men and Four women
Number of selections = 4𝐶2 × 6𝐶4
Case 𝑖𝑖 : Three men and six women
Number of selections = 4𝐶3 × 6𝐶6
∴ Total number of ways = 4𝐶2 × 6𝐶4 + 4𝐶3 × 6𝐶6 = 94.

Return To Top
There are 𝑚 men and two women participating in a chess
tournament. Each participant plays two games with every other
participant. If the number of games played by the men between
themselves exceeds the number of games played between the
men and women by 84, then the value of 𝑚 is _____ .
Given: Number of men = 𝑚,

Number of women = 2,
vs Number of games = 𝑚
𝐶2 × 2
Number of games = 𝑚
𝐶1 × 2𝐶1 × 2
vs
Return To Top
There are 𝑚 men and two women participating in a chess
tournament. Each participant plays two games with every other
participant. If the number of games played by the men between
themselves exceeds the number of games played between the
men and women by 84, then the value of 𝑚 is _____ .
2 × 𝑚𝐶2 = 2 × 𝑚𝐶1 × 2𝐶1 + 84 ⇒ 𝑚 − 12 𝑚 + 7 = 0

𝑚 𝑚−1
⇒2× = 4 𝑚 + 84
2!
⇒ 𝑚2 − 𝑚 = 4 𝑚 + 84 𝑚 = −7 𝑚 = 12
⇒ 𝑚2 − 5 𝑚 − 84 = 0 neglected
Return To Top
Session 04
Permutations Including
/Excluding specified Objects
Return To Top
In an examination, a question paper consists of 12 questions divided into
two parts , part (𝑖) and part (𝑖𝑖), containing 5 and 7 questions, respectively.
A student is required to attempt 8 questions in all, selecting at least 3
from each part. In how many ways can a student select the questions?
Given: Total number of questions = 12
Number of questions to be attempted = 8
PART (I) PART (II)

Number of
CASE
ways
Total : 5 Total : 7
5
𝑖 3 5 𝐶3 × 7 𝐶5
5
𝑖𝑖 4 4 𝐶4 × 7 𝐶4
5
𝑖𝑖𝑖 5 3 𝐶5 × 7 𝐶3
Return To Top
In an examination, a question paper consists of 12 questions divided into
two parts , part (𝑖) and part (𝑖𝑖), containing 5 and 7 questions, respectively.
A student is required to attempt 8 questions in all, selecting at least 3
from each part. In how many ways can a student select the questions?
∴ Total number of ways in which the student can select
5
= 𝐶3 × 7𝐶5 + 5
𝐶4 × 7𝐶4 + 5
𝐶5 × 7𝐶3
= 210 + 175 + 35 = 420
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.
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
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
(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
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
Complementary Principle
Note:
In the previous problem, we used complementary principle.
Number of favorable ways = Total number of ways
− Number of unfavourable ways
Return To Top
row such that:
i) No two girls are together.
ii) Boys and girls sit alternatively.
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
row such that:
i) No two girls are together.
ii) Boys and girls sit alternatively.
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.
Return To Top Hence, the total number of ways = 4! × 4! + 4! × 4! = 1152
Find the number of arrangements of the letters of the word
PERMUTATIONS such that :
i) All the vowels as one unit and all the consonants as one unit.
ii) There are always 4 letters between 𝑃 and 𝑆.
Vowels : E U A I O Consonants: P R M T T N S
There are two units, which can be arranged in = 2! ways

In each arrangement in vowels can be arranged in = 5! ways
7!
And consonants can be arranged in
2!
7!
∴ Total number of required arrangements = 2 × 5! ×
2!
= 604800
Return To Top
Find the number of arrangements of the letters of the word
PERMUTATIONS such that :
𝑃 ___ ___ ___ ___ 𝑆

1+1+1+1+1+1+1 = 7 2 cases
𝑆 ___ ___ ___ ___ 𝑃
10!
Remaining 10 places can be filled with the letters
2!
ERMUTATION
10!
∴ Total number of ways = 7 × 2 × = 25401600
2!
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.
Given word : HEXAGON
Vowels : E A O Consonants : H X G N
1𝑠𝑡 2𝑛𝑑 3𝑟𝑑 4𝑡ℎ 5𝑡ℎ 6𝑡ℎ 7𝑡ℎ
3! ways
4! ways

= 144
Return To Top
The number of permutations of the letters of the word HEXAGON
such that
ii) Order of the vowels is not changed.
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
Note :
The number of permutations of 𝑛 distinct things, in which the order of 𝑟 things

𝑛!
is not to be considered is = 𝑛𝑃𝑛−𝑟
𝑟!
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 _______

Given : 𝑛 = 22, 𝑟 = 11
𝑛−𝑝 20
∴ 𝐶 𝑟−𝑝 = 𝐶9
ii) 4 particular players are always excluded is ______
𝑛−𝑝 18
∴ 𝐶𝑟 = 𝐶11
Return To Top
The number of ways in which a team of 11 players can be selected
from 22 players such that
ii) 4 particular players are always excluded is _______
iii) 2 particular players are included and 4 particular players are
excluded is _______
iii) 2 particular players are always included and 4 particular players are
excluded is ______
𝑛−𝑝−𝑞 16
∴ 𝐶 𝑟−𝑝 = 𝐶9
Return To Top
If set 𝐴 = 𝐸, 𝑄, 𝑈, 𝐴, 𝑇, 𝐼, 𝑂, 𝑁 then the number of 5 elements.
Subsets of 𝐴 which always include 𝐴, 𝑇 is
Given, 𝐴 = 𝐸, 𝑄, 𝑈, 𝐴, 𝑇, 𝐼, 𝑂, 𝑁
∴ 𝑛 = 8, 𝑟 = 5
Condition 𝐴, 𝑇 are always included

∴ Number of required subsets = 8−2
𝐶 5−2
6
= 𝐶3
= 20
Return To Top
A guard of 12 men is formed from a group of 𝑛 soldiers. It is found
that two particular soldiers 𝐴, 𝐵 is 3 times as often together on guard
as three particular soldiers 𝐶, 𝐷, 𝐸. Then the value of 𝑛 is ____ .
Number of soldiers = 𝑛, 𝑟 = 12
Number of ways in which 𝐴, 𝐵 are included is 3 times

that of 𝐶, 𝐷, 𝐸 included on guard.
Return To Top
A D
B C E
Number of ways in which 𝐴, 𝐵 are included is 3 times

that of 𝐶, 𝐷, 𝐸 included on guard.
Number of ways in which A and B are included = 𝑛−2

𝐶12−2
Number of ways in which C, D and E are included = 𝑛−3

𝐶12−3
Return To Top
𝑛−2 𝑛−3
⇒ 𝐶 12−2 =3× 𝐶 12−3
𝑛−2 𝑛−3
⇒ 𝐶10 = 3 × 𝐶9
𝑛−2 ! 𝑛−3 !
⇒ =3×
10! 𝑛−12 ! 9! 𝑛−12 !
𝑛−2
⇒ =3
10
⇒ 𝑛 = 32
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
Number of ways of
5 girls selecting 2 girls = 5𝐶2
Number of ways of
7 boys
selecting 3 boys = 7𝐶3
Team consists of 2 girls and 3 boys
Total number of ways to select 2 girls and 3 boys for the team
= 5𝐶2 × 7𝐶3 = 10 × 35 = 350
Return To Top
the same team, is
Number of ways of
5 girls selecting 2 girls = 5𝐶2
Number of ways of
7 boys selecting 1 boy = 5𝐶1
A B
If the two boys are included, only one boy has to be chosen from 5 boys
∴ Number of ways the team can be formed if both the boys are included
= 5𝐶2 × 5𝐶1 = 10 × 5 = 50
∴ Required number of selections = (Total no. of ways) − (No. of ways the team can be
formed if both the boys are included)
Return To Top = 350 − 50 = 300
the same team, is
JEE MAINS 2019

A 350
B 500
C 200
D 300
Return To Top
Session 05
Rank of a word and Circular
Permutations
Return To Top
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 [2 × units-place digits − (Number formed by other digits)]
Example:
504, 3367, 5719 0 Multiple of 7
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
Number of 5 digited numbers using the digits 0, 1, 2, 3, 4 with
repetition, which are divisible by 4, is:
Given digits: 0, 1, 2, 3, 4
A number is divisible by 4 if its last two digits are divisible by 4. A 800
Last two digits can be : 00 04 12 20 24 32 40 44

B 1000
8 ways
C 400
4 × 5 × 5 × 8
∴ Total number of ways = 4 × 5 × 5 × 8 = 800. D 600
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
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
Return To Top 2!
Starting with E E = 120
H
Starting with H = 120
Starting with ME M E = 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
Alphabetic order of letters : A, A, G, I, N words
Starting with 𝐴 24
Starting with A A Starting with 𝐺 12 36
Starting with 𝐼 12 48
4! = 24 49
Starting with G
G
4!
Starting with I I = 12
2!
4!
= 12
2!
N A A G I
The next word is
Return To Top
Rank:
The position of a word when all permutations of that word are written in alphabetical
order is called rank.
Example:
Let the word be CAT.
All possible permutation of the word CAT: CAT, CTA, ATC, TCA, ACT, TAC.
Arranging them in alphabetical order CAT: ACT, ATC, CAT, CTA, TAC, TCA
CAT is the 3𝑟𝑑 in the above list, so the rank of the word CAT is 3.
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
Key Takeaways
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 not 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
Out of 10 people, 5 are to be selected around a round table and the
remaining to be seated in a row. The number of arrangements is
______.
Total : 10 people
5! ways
Number of linear arrangements = 5!
Number of circular permutations of 𝑛 distinct

things, taken 𝑟 at a time is 𝑛𝐶𝑟 . 𝑟 − 1 !
Return To Top
Out of 10 people, 5 are to be selected around a round table and the
remaining to be seated in a row. The number of arrangements is
______.
Required number of circular permutations = 10

𝐶5 . 5 − 1 ! = 10
𝐶5 . 4!
Required number of linear arrangements = 5!
Total number of arrangements = 10

𝐶5 . 4! ⋅ 5!
1
= ⋅ 10!
5
= 2 × 9!
Return To Top
Session 06
Division and
Distribution of objects
Return To Top
The number of ways in which a garland can be made by using 8
different flowers is ____________.
8−1 ! 1
Number of ways = = × 7!
2 2
= 2520
Return To Top
Key Takeaways
Circular Permutations :
Note :
Number of circular permutations of 𝑛 distinct things, if clockwise and anticlockwise

1
directions are taken as not different is 𝑛−1 !.
2
Example : Circular arrangement of flowers in a Garland, Beads in a Necklace.
Return To Top
How many necklaces of 12 beads each can be made from 18
beads of various colors? ____________.
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
Note :
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 not different,
1
then the number of circular permutations is . 𝑛𝐶𝑟 . 𝑟 − 1 !.
2
Return To Top
How many different necklaces be made from 10 different beads such
that three particular beads always come together.
8 different beads including 3 beads together as 1 bead A 9!

2
B 7!
2
C 9!×3!
2
D 7!×3!
2
8−1 !
Necklaces be made from 10 different beads = × 3!
2
7! × 3!
=
2
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
Consider division of 10 distinct things into groups, in different cases.
𝑖) 𝑖𝑖𝑖)
10 10
2 5 2 4
3 4
10! 10!
Number of ways = Number of ways =
2!3!5! 2!2! 4! 2
𝑖𝑖) 𝑖𝑣)
10 10
3 1
5 5
3 3
10! 10!
2! 5! 2 3! 3! 3 1!
Return To Top
𝑣) 𝑣𝑖𝑖)
10 10
2 2
1 4
2 2
2 2 3
10! 10!
5! 2! 5 1!2!3!4!
𝑣𝑖) 𝑣𝑖𝑖𝑖)
10 10
2 3
4 6
2 3
10! 10!
4!6! 2! 2! 2 . 2! 3! 2
Return To Top
The number of ways in which a pack of 52 cards:
𝑖) can be divided into four equal sets is_______.
𝑖𝑖) can be distributed among four people equally is_______.
𝑖) Four equal sets

52! 52
Number of ways =
4! 13! 4
13 13
13 13
𝑖𝑖) Distributing equally among four people

Four equal sets can be distributed among 4 people in 4! ways
52! 52!
Number of ways = 4 × 4! =
4! 13! 13! 4
Return To Top
Find the number of ways in which 5 books can be
𝑖) tied up in 3 bundles.
𝑖𝑖) distributed among 3 students
such that each student get at-least one book.
𝑖) 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!
Number of ways = = 15 ⋅ 3! = 90
1!2! 2! 2
(Distribution)
1 2 2
Case 2
5 5!
Number of ways = = 10 ⋅ 3! = 60
2! 1! 2 3!
(Distribution)
1 1 3 Total number of ways = 90 + 60 = 150
Return To Top
A boat is manned by 8 men, 4 on each side. In how many ways can 8
men be arranged if two particular men can only row on left side and
another one particular man can only row on right side?
8 men → 4 on each side

𝑃1 𝑃2 𝑃3 𝑃4
𝑃5 𝑃6 𝑃7 𝑃8
Return To Top
𝑃1 𝑃2 𝑃3 𝑃4 𝑃5 𝑃6 𝑃7 𝑃8
5!
Remaining 5 people will be divided into two groups of size 2 and 3 in ways
2!3!
Here we have to arrange the crew on both the sides, which can be done in 4! ways
5!
Total number of arrangements = × 4! × 4! = 5760
2!3!
Return To Top
Session 07
Selections from distinct and
Identical objects
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
There are 10 lamps in a room, each can be switched on independently.
The number of ways in which the room can be illuminated is_______.
10
= 𝐶1 + 10𝐶2 + ⋯ + 10𝐶10
= 210 − 10𝐶0
Number of ways = 210 − 1 = 1023
Return To Top
Key Takeaways
All Possible Selections:

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
Return To Top
Find the number of ways of selecting at least one fruit from 5 mangoes,
4 apples and 3 bananas.
Number of ways of selecting at least one fruit

= 5 + 1 4 + 1 3 + 1 −1
= 119
Return To Top
Key Takeaways
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
Return To Top
Number of 4 letter words with or without meaning that can be
formed using letters of the word INEFFECTIVE is:
Four letters words:

We can get 4 four letter words, if we permutates
Case I: 3 alike and 1 distinct. the letters in each of the above cases.
4!
Number of ways = 1 × 6𝐶1 × = 24
3!
Case II: 2 alike of 1 kind and 2 alike of other kind:

4!
Number of ways = 3𝐶2 × = 18
2!2!
Case III: 2 alike and 2 distinct

4!
Number of ways = 3𝐶1 × 6𝐶2 × = 540
2!
Case IV: 4 distinct

Number of ways = 7𝐶4 × 4! = 840
∴ Number of 4 letter words = 24 + 18 + 540 + 840 = 1422
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)
Return To Top
Key Takeaways
12 = 22 ∙ 31 (prime factorization)
1 = 20 ∙ 30
2 = 21 ∙ 30 The number of divisors
3=2 ∙30 1 = (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
• So, if 12 = 2𝑥 ∙ 3𝑦 then number of divisors = 𝑥+1 𝑦+1
Return To Top
Key Takeaways
Sum of divisors = 20 ∙ 30 + 21 ∙ 30 + 20 ∙ 31 +22 ∙ 30 +21 ∙ 31 + 22 ∙ 31
= (20 + 21 + 22 )(30 + 31 )
= (7)(4)
= 28
So, if 12 = 2𝑥 ∙ 3𝑦 , then
Sum of the divisors = (20 + 21 + 22 + ⋯ 2𝑥 )(30 + 31 + 32 + ⋯ 3𝑦 )
G.P. G.P.
Return To Top
Key Takeaways

𝑥 𝑥 𝑥
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
⋯
Return To Top
𝑥 𝑥 𝑥
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 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
Consider the number 1350. Find
i. Number of divisors
ii. Number of proper divisors
iii. Sum of divisors
iv. Sum of proper divisors
Given: 1350 = 21 ∙ 33 ∙ 52
i. Number of divisors = 1 + 1 3 + 1 2 + 1 = 24
ii. Number of proper divisor = 24 − 2 = 22 ( Except 1 and 1350 )

22 −1 34 −1 53 −1
iii. Sum of divisors = = 3720
2−1 3−1 5−1
iv. Sum of proper divisor = 3720 − 1 + 1350 = 2369
Return To Top
In how many ways the number 8100 can be written
as product of two coprime factors?
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
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
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!
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!
Alternative solution:
Number of zeros in 200! directly 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
= 40
5
40
=8
5
8
=1
5
1
=0
5
Number of zeros in 200! = 40 + 8 + 1 + 0 = 49
Return To Top
Session 08
Applications of selections in
geometry
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
ii. 𝑛
𝐶3 triangles
HAND SHAKE
PROBLEM
𝑃1 𝑃2
𝑃3 𝑃4
Return To Top
Key Takeaways
GEOMETRY MODELS
• 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
Key Takeaways
GEOMETRY MODELS
The number of diagonals of a polygon of 𝑛 sides (𝑛 vertices) is
• 𝑛
𝐶2 − 𝑛 =
𝑛 𝑛−3
2
Return To Top
Key Takeaways
GEOMETRY MODELS
If a set of 𝑚 parallel lines are intersected by another set of 𝑛 parallel

lines, then the number of parallelograms, we can obtain is
• 𝑚
𝐶2 × 𝑛𝐶2
Return To Top
Key Takeaways
GEOMETRY MODELS
The maximum number of points of intersection of
i. 𝑛 straight lines in a plane is 𝑛

𝐶2
ii. 𝑛 circles in a plane is 2 × 𝑛𝐶2
Return To Top
There are 12 points in a place of which 7 are collinear.
By joining them, we can have :
i. Number of straight lines
ii. Number of triangles
iii. Number of circles
iv. Number of pentagons
i. Number of straight lines = 12

𝐶2 − 7𝐶2 + 1 = 46
ii. Number of triangles = 12

𝐶3 − 7𝐶3 = 185
iii. Number of circles = 12

𝐶3 − 7𝐶3 = 185
iv. Number of pentagons = 12

𝐶5 − 7𝐶5 = 771
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_______.
iii) 20 lines and 10 circles in a plane is________.
i) 20 line in a plane
The maximum number of points of intersection of 𝑛 straight lines in a plane is 𝑛𝐶2
⇒ Maximum number of points of intersection of 20 straight lines
= 𝐶2 = 190
20
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
Case 𝑖 Case 𝑖𝑖 Case 𝑖𝑖𝑖
20 20 10 10
=2× 𝐶1 × 𝐶1 = 400 =2× 𝐶2 = 90 =2× 𝐶2 = 90
Total = 400 + 90 + 190

= 680
Return To Top
A convex polygon has 44 diagonals. Find the number of its sides.
44 diagonals
Let 𝑛 be the number of slides ⇒ 𝑛 points (vertices)
The number of diagonals of a polygon of 𝑛 sides (𝑛
vertices) is 𝑛𝐶2 − 𝑛.
⋮ ⋮
𝑛
𝐶2 − 𝑛 =
𝑛 (𝑛−1)
− 𝑛 = 44 ⋮ ⋮
2 𝑉𝑛 𝑉3
𝑛 (𝑛−3)
⇒ = 44
2
⇒ 𝑛 𝑛 − 3 = 88
⇒ 𝑛2 − 3𝑛 − 88 = 0 𝑉1 𝑉2
⇒ 𝑛 − 11 𝑛 + 8 = 0
⇒ 𝑛 = 11 (∵ 𝑛 = −8 is not possible)
Return To Top
In a triangle 𝐴𝐵𝐶, the sides 𝐴𝐵, 𝐵𝐶 and 𝐴𝐶 have 3, 4 and 5 points
respectively on them. The number of triangles that can be
constructed using these points as vertices is _____ .
𝐴𝐵 → 3 points 𝐵𝐶 → 4 points 𝐴𝐶 → 5 points
Selecting one point each on one side
OR
Triangle can be formed by
𝐴 Selecting two points on one side and
third point on any other side
𝐵 𝐶
Return To Top
Case (i)
Selecting one point each on = 3𝐶1 × 4𝐶1 × 5𝐶1 = 60
one side
Case (ii)
Selecting two points on one side
and third point on any other side
3
= 𝐶2 × 9𝐶1 + 4
𝐶2 × 8𝐶1 + 5
𝐶2 × 7𝐶1
= 27 + 48 + 70 = 145
∴ Number of triangles = 60 + 145 = 205
𝐵 𝐶
Return To Top
Let 𝑇𝑛 denotes the number of triangles which can be formed
by joining the 𝑛 points which lie on a circle. If 𝑇𝑛+1 − 𝑇𝑛 = 21,
then the value of 𝑛 is _____.
Given : 𝑇𝑛+1 − 𝑇𝑛 = 21
Number of triangles = 𝑇𝑛 = 𝑛𝐶3 , 𝑇𝑛+1 = 𝑛+1

𝐶3
𝑇𝑛+1 − 𝑇𝑛 = 21
𝑛
⇒ 𝑛+1
𝐶3 − 𝑛𝐶3 = 21 𝐶2 + 𝑛𝐶3 = 𝑛+1
𝐶3
𝑛 points
𝑛
⇒ 𝐶2 = 21
⇒ 𝑛 𝑛 − 1 = 42
⇒𝑛=7
Return To Top
A regular polygon of 10 sides is constructed. In how many ways can 3
vertices be selected so that no two vertices are consecutive ?
Given : A regular polygon of 10 sides
Number of ways of selecting any 3 vertices.

−
Number of ways in which no Number of ways of selecting 3 consecutive vertices.
=
two vertices are consecutive −
Number of ways of selecting 3 vertices such
that two are consecutive.
Return To Top
Let the vertices be : 𝑉1 , 𝑉2 , 𝑉3 , ⋯ , 𝑉10 𝑉1 𝑉2
Number of ways of selecting any 3 vertices = 10
𝐶3 𝑉10 𝑉3
Number of ways of selecting 3 consecutive vertices = 10
Number of ways of selecting 3 consecutive vertices 𝑉9 𝑉4
such that two are consecutive = 10 × 6 = 60
𝑉8 𝑉5
𝑉1 𝑉2 𝑉3 , 𝑉2 𝑉3 𝑉4 , ⋯ , 𝑉10 𝑉1 𝑉2 𝑉9
𝑉7 𝑉6
𝑖) Starting with 𝑉1 𝑉2 = 6
𝑉8
Similarly, we have starting with
𝑉2 𝑉3 , 𝑉3 𝑉4 , 𝑉4 𝑉5 , ⋯ , 𝑉10 𝑉1
𝑉7
6 ways
𝑉6
𝑉5
𝑉1 𝑉2 𝑉4
Return To Top
Number of ways of selecting any 3 vertices = 10
𝐶3
Number of ways of selecting 3 consecutive vertices = 10
Number of ways of selecting 3 vertices
such that two are consecutive = 60
Number of ways in which no two vertices are consecutive
10
= 𝐶3 − 10 − 60 𝑉1 𝑉2
= 120 − 70 𝑉10 𝑉3
= 50
𝑉9 𝑉4
𝑉8 𝑉5
𝑉7 𝑉6
Return To Top
How many squares are there in a chess board?
A chessboard has 64 small squares.
There are many more different sized

squares on the chessboard.
1. No. of 8 × 8 𝑠𝑞. = 1 5. No. of 4 × 4 𝑠𝑞. = 25
2. No. of 7 × 7 𝑠𝑞. = 4 6. No. of 3 × 3 𝑠𝑞. = 36
3. No. of 6 × 6 𝑠𝑞. = 9 7. No. of 2 × 2 𝑠𝑞. = 49
4. No. of 5 × 5 𝑠𝑞. = 16 8. No. of 1 × 1 𝑠𝑞. = 64
∴ Total number of squares on chessboard
⇒ 64 + 49 + 36 + 25 + 16 + 9 + 4 + 1 = 204
Return To Top
Find the number of words that can be made by permutating all
the letters of the word ROORKEE, which neither begins with R nor
end with E.
Given word : ROORKEE

Let A ≡ { words begin with R }
B ≡ { words end with E }
A’ ∩ B’ ≡ { words neither begin with R nor end with E }
7!
ROORKEE 𝑛 𝑈 = 2! . 2! . 2!
𝑛 𝐴 = R
6!
2! . 2!
Return To Top
Let A ≡ { words begin with R } B ≡ { words end with E }
A’ ∩ B’ ≡ { words neither begin with R nor end with E }
7!
ROORKEE 𝑛 𝑈 =
2! . 2! . 2!
𝑛 𝐴 = R
6!
2! . 2!
6!
E
𝑛 𝐵 = 2! . 2!
R E
𝑛 𝐴∩𝐵 =
5!
2!
Return To Top
7!
ROORKEE 𝑛 𝑈 =
2! . 2! . 2!
6! 6! 5!
𝑛 𝐴 = 2! . 2!
𝑛 𝐵 = 2! . 2!
𝑛 𝐴∩𝐵 = 2!
𝑛 𝐴′ ∩ 𝐵′ = 𝑛 𝑈 − 𝑛 𝐴 ∪ 𝐵
=𝑛 𝑈 −𝑛 𝐴 − 𝑛 𝐵 +𝑛 𝐴∩𝐵
7! 6! 6! 5!
= − − +
2! .2! .2! 2! . 2! 2! . 2! 2!
= 630 − 180 − 180 + 60 = 330
Return To Top
Session 09
Distribution of objects to
distinct boxes
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 Dearangements.
The number of Derangements of 𝑛 distinct things can be denoted by 𝐷𝑛 .
1 1 1 𝑛 1
𝐷𝑛 = 𝑛! 1 − + − + ⋯ + −1 where 𝑛 ≥ 2
1! 2! 3! 𝑛!
Return To Top
Find the number of derangements of the letters of the word BAG.
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 − + − =2
Return To Top 1! 2! 3!
Six letters with numbers 1,2,3,4,5,6 written on them are put in six
envelopes with numbers 1,2,3,4,5,6 written on them too.
𝑖) No letter is in its correct envelope is______
𝑖𝑖) At least one letter is in its correct envelope is______
𝑖𝑖𝑖) At most two letters are not in their correct envelopes is______
𝑖𝑣) Exactly three letters are not in their correct envelopes is______
Given:
Letter 1 Letter 2 Letter 3 Letter 4 Letter 5 Letter 6

. . . . . .
. . . . . .
. . . . . .
1 2 3 4 5 6
Return To Top
𝑖) No letter is in its correct envelope is______
Letter 1 Letter 2 Letter 3 Letter 4 Letter 5 Letter 6

. . . . . .
. . . . . .
. . . . . .
1 2 3 4 5 6
Number of ways = 𝐷6 = 265
𝑖𝑖) At least one letter is in its correct envelope is______
Number of ways =Total number of permutations

− No letter is in its correct envelope
= 6! − 265
= 455
Return To Top
𝑖𝑖𝑖) At most two letters are not in their correct envelopes is______
All letters are One letter isn’t Two letters are

in its correct + in its correct + not in their
envelope envelope correct envelope
= 1 + 0 + 6𝐶2 × 𝐷2
= 16
𝑖𝑣) Exactly three letters are not in their correct envelopes is______
= 6𝐶3 × 𝐷3
= 40
Return To Top
Principle of Inclusion and Exclusion
= + -
𝑛 𝐴 𝑛 𝐵 𝑛 𝐴∩𝐵
𝑛 𝐴∪𝐵
include exclude
𝑛 𝐴∪𝐵 =𝑛 𝐴 +𝑛 𝐵 −𝑛 𝐴∩𝐵
Return To Top
𝑛 𝐴∪𝐵∪𝐶 𝐴 𝐵
= 𝑛 (𝐴) + 𝑛 (𝐵) + 𝑛 (𝐶) − 𝑛 (𝐴 ∩ 𝐵) − 𝑛 (𝐴 ∩ 𝐶) − 𝑛 (𝐵 ∩ 𝐶)
include exclude
+ 𝑛 (𝐴 ∩ 𝐵 ∩ 𝐶)
𝐶
include
Return To Top
In general, 𝑛 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ ⋯ ∪ 𝐴𝑛
= ෍ 𝑛 𝐴𝑖 − ෍ 𝑛 𝐴𝑖 ∩ 𝐴𝑗 + ෍ 𝑛 𝐴𝑖 ∩ 𝐴𝑗 ∩ 𝐴𝑘 − ⋯ + −1 𝑛
𝑛 𝐴1 ∩ 𝐴2 ∩ 𝐴3 ∩ ⋯ ∩ 𝐴𝑛
⇒ 𝑛 𝐴1 ′ ∪ 𝐴2 ′ ∪ 𝐴3 ′ ∪ ⋯ ∪ 𝐴𝑛 ′ = 𝑛 𝑈 − 𝑛 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ ⋯ ∪ 𝐴𝑛
Return To Top
Key Takeaways
Distinct Thing → 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
Atleast 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.
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
If 𝐴 = 𝑎1 , 𝑎2 , 𝑎3 , 𝑎4 , 𝑎5 and 𝐵 = 𝑏1 , 𝑏2 , 𝑏3 then find
𝑖) Number of functions from 𝐴 to 𝐵______
𝑖𝑖) Number of functions from 𝐴 to 𝐵 such that every element in
𝐵 has atleast one pre-image______
If 𝐴 = 𝑎1 , 𝑎2 , 𝑎3 , 𝑎4 , 𝑎5 and 𝐵 = 𝑏1 , 𝑏2 , 𝑏3 then find

𝑨 𝑩
𝑖) Number of functions from 𝐴 to 𝐵______
𝒂𝟏
= 𝑟 𝑛 = 35 = 243
𝒂𝟐 𝒃𝟏
𝑖𝑖) Number of functions from 𝐴 to 𝐵 such that 𝒂𝟑 𝒃𝟐
every element in 𝐵 has atleast one pre-image____ 𝒂𝟒 𝒃𝟑
𝒂𝟓
= 𝑟 𝑛 − 𝑟𝐶1 𝑟 − 1 𝑛
+ 𝑟𝐶2 𝑟 − 2 𝑛
− ⋯ + −1 𝑟−1
∙ 𝑟𝐶𝑟−1 1 𝑛
= 35 − 3𝐶1 3 − 1 5
+ 3𝐶2 3 − 2 5
= 150
Return To Top
Key Takeaways
Identical Things → Distinct Boxes:

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
Key Takeaways

Case 2
Atleast one thing (i.e. empty boxes are not allowed) = 𝑛−1
𝐶𝑟−1
Proof:
Let us give each box 1 object to satisfy atleast one condition.

0 or more things (i.e. empty boxes are allowed) = 𝑛+𝑟−1
𝐶𝑟−1
Now where 𝑛 − 𝑟 objects to be distributed in 𝑟 boxes.
𝑛−𝑟+𝑟−1 𝑛−1
= 𝐶𝑟−1 = 𝐶𝑟−1
Return To Top
Key Takeaways
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
In how many ways 5 identical balls can be distributed into 3 distinct
boxes so that no box remains empty.
Given:
𝑛 = 5, 𝑟=3

𝑛−1
= 𝐶𝑟−1
= 4𝐶2
=6
Return To Top
For the equation 𝑎 + 𝑏 + 𝑐 + 𝑑 = 12.
𝑖) Number of non-negative integral solutions are______
𝑖𝑖) Number of positive integral solutions are______
𝑖) Number of non-negative integral solutions are______

Given:
𝑛 = 12, 𝑟 = 4
𝑛+𝑟−1 12+4−1
𝐶𝑟−1 = 𝐶4−1
15
= 𝐶3 = 455
𝑖𝑖) Number of positive integral solutions are______

𝑛−1
𝐶𝑟−1
12−1
= 𝐶4−1
11
= 𝐶3 = 165
Return To Top
In how many ways 10 apples, 5 mangoes, 4 oranges can be distributed
among 4 persons, when each person may receive any number of
fruits. (Fruits of each type are identical)
Given:
Number of persons = 4
Let 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 be number of apples receive by 𝑃1 , 𝑃2 , 𝑃3 , 𝑃4 respectively
∴ 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 10
10+4−1
𝐶4−1
13
= 𝐶3
Let 𝑦1 , 𝑦2 , 𝑦3 , 𝑦4 be number of mangoes receive by 𝑃1 , 𝑃2 , 𝑃3 , 𝑃4 respectively
∴ 𝑦1 + 𝑦2 + 𝑦3 + 𝑦4 = 5
5+4−1
𝐶4−1
= 8𝐶3
Return To Top
In how many ways 10 apples, 5 mangoes, 4 oranges can be distributed
among 4 persons, when each person may receive any number of
fruits. (Fruits of each type are identical)
Let 𝑧1 , 𝑧2 , 𝑧3 , 𝑧4 be number of oranges receive by 𝑃1 , 𝑃2 , 𝑃3 , 𝑃4 respectively

∴ 𝑧1 + 𝑧2 + 𝑧3 + 𝑧4 = 4
4+4−1
𝐶4−1
= 7𝐶3
13
= 𝐶3 × 8𝐶3 × 7𝐶3
= 560560
Return To Top
Session 10
Multinomial theorem and
its applications
Return To Top
In how many ways can Rs. 16 be divided among 4 persons such that
none of them gets less than Rs. 3.
Given: 16 4
Remaining 4 to be distributed among

4 Persons so that any one receive any
3 3 3 3
amount, which is equal to the number of
non-negative integral solutions of
𝑎+𝑏+𝑐+𝑑 =4
4+4−1
𝐶4−1 𝑎 𝑏 𝑐 𝑑
= 7𝐶3
= 35
Return To Top
Find the number of non-negative integral solutions of
𝑎 + 𝑏 + 𝑐 + 𝑑 ≤ 20.
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
Return To Top
Find the number of integral solutions of
𝑥 + 𝑦 + 𝑧 = 20 where 𝑥 ≥ −4, 𝑦 ≥ 1, ≥ 𝑧 ≥ 0.
Given: 𝑥 + 𝑦 + 𝑧 = 20 ⋯ (𝑖) 𝑥 + 𝑦 + 𝑧 = 20
𝑥 ≥ −4 ⇒ 𝑥 + 4 ≥ 0 𝑢 − 4 + 𝑣 + 1 + 𝑧 = 20
𝑦 ≥1 ⇒𝑦−1≥0 𝑢 + 𝑣 + 𝑧 = 23 ⋯ (𝑖𝑖)
Let, 𝑥 + 4 = 𝑢 and 𝑦 − 1 = 𝑣 where 𝑢 ≥ 0, 𝑣 ≥ 0 and 𝑧 ≥ 0
Number of required solutions of (𝑖)
= Number of non- negative integral solutions of (𝑖𝑖)
23+3−1 25
= 𝐶3−1 = 𝐶2 = 300
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
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
1 1 1
Coefficient of 𝑥 10 in
1−𝑥 1−𝑥 1−𝑥
𝑎
= Coefficient of 𝑥 10 in 1 − 𝑥 −3 𝑆∞ =
1−𝑟
Coefficient of 𝑥 𝑟 in 1 − 𝑥 −𝑚
is 𝑚+𝑟−1
𝐶𝑟
10+3−1
= 𝐶10 𝑚 = 3, 𝑟 = 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𝐶16 + 22𝐶20
= 536
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
Result :
If 𝑑1 , 𝑑2 , ⋯ , 𝑑𝑛 are the given non-zero digits, then the sum of all 𝑛 digit numbers
(without repetition) is equal to
𝑛 − 1 ! (𝑑1 + 𝑑2 + ⋯ + 𝑑𝑛 ) (100 + 101 + ⋯ + 10𝑛−1 )
Return To Top
Find the sum of all four-digit numbers formed by using the
digits 2, 3, 4, 5 without repetition.
Given digits: 2, 3, 4, 5
Number of 4-digit numbers = 4! = 24 _ _ _ _
Click to add text4!

Numbers having 2 in unit’s place = 3! _ _ _ _ 2 3 4 5
3!
Similarly, Numbers having 3, 4, 5 in _ _ _ _ 2 3 4 5

units place = 3!
3!
Sum of all digits in unit’s place = 3! 2 + 3 + 4 + 5
Return To Top
Sum of all digits in unit’s place = 3! 2 + 3 + 4 + 5
Number having 2 in ten’s place= 3! 2
_ _ _ _
3
4
Similarly, Numbers having 3, 4, 5 in
5
ten’s place = 3! _ _ _ _
Sum of digits in ten’s place = 3! 2 + 3 + 4 + 5 × 10
Sum of all digits = Sum of all digits of unit’s , ten’s, hundred’s and
thousand’s places.
Hence, the sum of all 4 digited number

= 3! 2 + 3 + 4 + 5 100 + 101 + 102 + 103 = 3! 2 + 3 + 4 + 5 1111
= 6 × 14 × 1111 = 93324
Return To Top
THANK
YOU
Return To Top
Return To Top

Permutation and Combination

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Permutation and Combination

Uploaded by

Copyright:

Available Formats

Welcome to

Permutations & Combinations

Session 05 𝟗𝟎 Session 06 𝟏𝟏𝟎 Session 07 𝟏𝟐𝟖 Session 08 𝟏𝟒𝟕

Distinct Thing → Distinct Boxes 176

Identical Things → Distinct Boxes 179

Fundamental Principle of Counting:

Number of different ways of arranging

Multiplication Principle (Rule of AND)

Total number of ways for two events simultaneously

Number of ways to travel from 𝐴 to 𝐵 = 3

Addition Principle (Rule of OR):

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

Case II: Via 𝐷 𝐴 𝐷 𝐶

Addition Principle (Rule of OR):

➢ 𝐴 and 𝐵 are disjoint.

➢ Can be extended to finite number of disjoint events.

Burgers Fries Beverages Deserts

Number of unsuccessful attempts: = 1000 − 1

Number of ways to = Number of ways of filling

For 3 digit even numbers,

Unit’s place can be filled in 3 ways.

Ten’s place can be filled in 6 ways. (Repetition is allowed)

Hundred’s place also can be filled in 6 ways. (Repetition is allowed)

∴ Required number of 3-digit even number

Second person can leave the lift cabin in 6 different ways.

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

• The product of first ‘𝑛’ natural numbers are denoted by 𝑛!

• Factorial of a negative integer is not defined.

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

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

FORMULA FOR PERMUTATION

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

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𝑟𝑑 ⋯ 𝑟 𝑡ℎ

FORMULA FOR PERMUTATION

• The number of permutations of 𝑛 different objects taken

Given: 𝑛𝑃5 = 42 ⋅ 𝑛𝑃3 .

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!

II. When repetition is allowed.

The number of permutations of 𝑛 different objects

Number of permutations with repetition = 53 = 125.

III. When at-least one digit is repeated.

Number of permutations with repetition

i. 4 letters are used at a time.

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

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

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

A C T : All the three letters are different.

• Different arrangements CAT CTA

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

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

• Different arrangements GEG GEG

Permutation when all the objects are not distinct:

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

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

𝑖) MESOPOTAMIA 𝑖𝑖) INDEPENDENCE

MM AA OO ESPTI EEEE NNN DD IPC

Total letters = 11 Total letters = 12

∴ Total number of words = 60 C 30

𝑖𝑖) end with L.

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

𝑃 _ _ _ _ 𝑆