Welcome to

Permutations & Combinations

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

𝑚×𝑛
 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 he can travel from 𝐴 to 𝐵 and 𝐵 to 𝐶 = 3 × 4 = 12 Ways
Solution:

(𝑥, 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.
Addition Principle (Rule of OR):

Event 𝐴 Event 𝐵
Different ways Different ways
𝑚 𝑛

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

𝑚+𝑛
 Observe a road network in the diagram below.

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

Solution: 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
∴ Total number of ways = 12 + 6 = 18 Ways
 There are 5 doors to enter and exit the auditorium. In how many ways
can a student enter and exit the auditorium if:
𝑖 The same door can be used to enter and exit the auditorium
𝑖𝑖 The same door cannot be used to enter and exit the auditorium

Solution:
ENTRY

EXIT

=5×5
= 25
 There are 5 doors to enter and exit the auditorium. In how many ways
can a student enter and exit the auditorium if:
𝑖 The same door can be used to enter and exit the auditorium
𝑖𝑖 The same door cannot be used to enter and exit the auditorium

Solution:
ENTRY

EXIT

=5×4
= 20
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
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)

FORMULA FOR PERMUTATION

• 𝑛 𝑛!
𝑃𝑟 =
𝑛−𝑟 !

Proof :

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

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

𝑛!
⇒ 𝑛𝑃𝑟 =
𝑛−𝑟 !

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 𝑛𝑟 .
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

i. 4 letters are used at a time.

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

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.

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

E
_ _ _ _ _ _ _ _
5
7!
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.

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

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

 Special Case:

A C T : All the three letters are different. E G G : Out of three, two are identical.

EGG EGG
ACT ATC
• Different arrangements GEG GEG
• Different arrangements CAT CTA
GGE GGE
TAC TCA

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

3!
2!
=3
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 !⋯𝑃𝑘 !
How many words can be formed using the letters of the word
BANANA ?

Given word : BANANA

6 letters
6!
∴ Number of arrangements = 2! ×3! = 60

∴ Total number of words = 60

How many words can be formed using the letters of the word
BANANA ?

A 20

B 60

C 30

D 40
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}
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
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

Key Takeaways

Combination:

In general,

Number of selections of 𝑛 objects

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

Number of selections of 𝑛 objects 𝑛𝑃

taken 𝑟 at a time = 𝑟
= 𝑛𝐶𝑟
𝑟!
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!
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
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!

= 2880
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
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
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
String Method

The number of permutations of 𝑛 distinct things, taken all at 𝑚! 𝑛 − 𝑚 + 1 !

A time when 𝑚 specified things always come together.
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.

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.
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)
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
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
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.

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

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!
Hence, the total number of ways = 4! × 4! + 4! × 4! = 1152
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 𝑛−𝑝−𝑞
𝐶 𝑟−𝑝
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 _______

i) 2 particular players are always included is ______

Given : 𝑛 = 22, 𝑟 = 11

𝑛−𝑝 20
∴ 𝐶 𝑟−𝑝 = 𝐶9

ii) 4 particular players are always excluded is ______

𝑛−𝑝 18
∴ 𝐶𝑟 = 𝐶11
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 _______

iii) 2 particular players are always included and 4 particular players are
excluded is ______

𝑛−𝑝−𝑞 16
∴ 𝐶 𝑟−𝑝 = 𝐶9
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.

Last two digits can be : 00 04 12 20 24 32 40 44

8 ways

4 × 5 × 5 × 8

∴ Total number of ways = 4 × 5 × 5 × 8 = 800.

Number of 5 digited numbers using the digits 0, 1, 2, 3, 4 with
repetition, which are divisible by 4, is:

A 800

B 1000

C 400

D 600
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

 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!
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
 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

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

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!

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

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

8−1 !
Necklaces be made from 10 different beads = × 3!
2

7! × 3!
=
2
How many different necklaces be made from 10 different beads such
that three particular beads always come together.

A 9!
2

B 7!
2

C 9!×3!
2

D 7!×3!
2
Key Takeaways

Formation of Groups:

Let us consider 4 people

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!
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 ! … 𝑛𝑘 !
𝐼𝐼) Let us divide them into two equal groups

4𝐶 × 2𝐶 4!
Number of ways = 2 2
= =3
2! 2!(2!∙2!)
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 𝑘! 𝑛!

𝑘𝑛 !
𝑘
Find the number of ways to divide 10 distinct things into groups, for
each of the following 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!
Number of ways = Number of ways =
2! 5! 2 3! 3! 3 1!
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
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
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
Example:

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

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

MODEL BASED ON DIVISORS:

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

• Number of divisors = 6 Sum of divisors = 28

Let us explain these two with ‘combinations’

12 = 22 ∙ 31 (prime factorization)
Key Takeaways

MODEL BASED ON DIVISORS:

12 = 22 ∙ 31 (prime factorization)

1 = 20 ∙ 30
2 = 21 ∙ 30 The number of divisors
0
3=2 ∙3 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

MODEL BASED ON DIVISORS:

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.
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
⋯
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 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
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

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
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 .
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! =?
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
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.

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

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
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
GEOMETRY MODELS

The number of diagonals of a polygon of 𝑛 sides (𝑛 vertices) is

• 𝑛
𝐶2 − 𝑛 =
𝑛 𝑛−3
2
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
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

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
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 :
i) 20 lines in a plane is_______.
ii) 10 circles in a plane is_______.
iii) 20 lines and 10 circles in a plane is________.

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
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________.

iii) 20 lines and 10 circles in a plane

⇒ Number of points of intersection of 20 lines and 10 circles in a plane

20 10
=2× 𝐶1 × 𝐶1 = 400

∴ Maximum number of points of intersection of 20 lines and 10 circles in a plane

= 190 + 90 + 400

20 lines 10 circles

= 680
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! 𝑛!
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
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
𝑖) 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
𝑖𝑖𝑖) 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
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 𝑛
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
Identical 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) = 𝑛+𝑟−1

𝐶𝑟−1

Proof:

Let 𝑛 identical objects put on floor

1 2 3 4 ⋯⋯ 𝑛−1 𝑛
Identical Things → Distinct Boxes:

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

1 2 3 4 ⋯⋯ 𝑛−1 𝑛

𝑛 identical objects 𝑟 − 1 identical partitions

𝑛+𝑟−1 ! 𝑛+𝑟−1
= 𝐶𝑟−1
𝑛! 𝑟−1 !
Identical Things → Distinct Boxes:

The number of ways of distributing 𝑛 distinct 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

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
Identical Things → Distinct Boxes:

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

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
Thank You!