Welcome to

Permutations & Combinations

 Table of contents

Session 01 𝟎𝟑 Session 04 𝟓𝟔 Session 08 𝟏𝟑𝟐

Multiplication principle (Rule of And) 04 Combination 57 Division and distribution 148

Properties of 𝑛𝐶
58
Addition principle (Rule of Or) 06 𝑟

Working rule 60
Session 09 𝟏𝟓𝟐
Special Case 74
Session 02 𝟏𝟗 Division and distribution 157

1 Coin toss 24 Beggar’s Method 168

Session 05 𝟕𝟖
2 Coin toss 25 Beggar’s Method (Generalization) 170
Combinatorial Geometry 90
3 Coin toss 26

Session 06 𝟗𝟒 Session 10 𝟏𝟖𝟎

Session 03 𝟑𝟕
Visualization and analysis 102 All possible selections 181
OMR for True/False Questions 39
Divisibility model 104 Model based on divisors 187
Exponent of prime in 𝑛! 43
Circular permutation 192
Permutation 48
Session 07 𝟏𝟏𝟕 Selection of non-consecutive
Formula for Permutation 199
50 place of circle
Restricted Combination 120
Derangement formula 201
Maximizing 𝑛𝐶𝑟 124

Number of ways of selection 130

 Session 01
Fundamental Principles
of Counting

Return To Top
 Key Takeaways

Multiplication principle (Rule of And)

• Let there are two parts A and B of an operation and if these two parts can be
performed in m and n different number of ways respectively, then that
operation can be completed in m × n ways.

Event 𝐴 Event 𝐵

Different ways Different ways

𝑚 𝑛

Total number of ways for two events

𝑚×𝑛

Return To Top
 There are 3 ways to travel from Kota to Jaipur and 4 ways to travel
from Jaipur to Delhi .
(𝑎) In how many ways can a person travel from Kota to Delhi via Jaipur.
(𝑏) In how many ways a person can take a round trip provided that the
same road has not been taken while coming back to Kota.

𝑎 Number of ways= 3 × 4 = 12 ways

𝑏 3 × 4 × 2 × 3 = 72

Ways for Ways for

going coming back
𝐾 𝐽 𝑫
Event A
Event B

Return To Top
 Key Takeaways

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 𝐴(𝑚 different ways) → Event 𝐵(𝑛 different ways), then total number of
ways for an event to occur = (𝑚 + 𝑛)
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 𝐷.

Solution: Case 1: A to B and B to C

𝐵
3 × 4 = 12 ways
𝐶
Case 2: A to B and B to C
𝐴
2 × 3 = 6 ways

Total number of ways = 12 + 6 = 18

𝐷

Return To Top
 Twelve students compete for a race. The number of ways in which
first three places can be taken.

Solution:
Number of ways = 12 × 11 × 10

= 1320

2𝑛𝑑 1𝑠𝑡
3𝑟𝑑

Return To Top
 Find the number of ways when 𝑛 distinct balls can be put into 3 boxes .

Solution:
A 3𝑛
We know that 1 ball have three choices i.e. box1 or box2 or box3
Similarly other balls also have 3 choices
B 3
So total number of way in which n ball can be put into 3 boxes is

𝐵1 → 3
C 3𝑛
3 × 3 × 3 × 3 × 3 ⋯ 3 = 3𝑛
𝐵2 → 3
𝑛 times D
𝐵3 → 3 1

Return To Top
 I. Four visitors A, B, C and D arrive at a town which has 5 hotels . In
how many ways can they disperse themselves among 5 hotels, if
four hotels are used to accommodate them?
II. In how many ways can clean and clouded days occur in a week
assuming that an entire day is either clean or clouded.

I. Total number of ways= 5 × 4 × 3 × 2 × 1 = 120

II. Total number of days in a week= 7

Number of events= 2 (clean/clouded)

Total number of ways= 2 × 2 × 2 × 2 × 2 × 2 × 2 = 27 = 128

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 trials necessary
to obtain correct code.
Solution:

Total number of digits = 10

Largest number of trials to obtain correct 3 digit code = 10 × 10 × 10 = 1000

Return To Top
 How many number plates for a car be made if each plate contains 2
different English alphabets followed by 3 different digits.

Solution: Required Number of ways = 26 × 25 × 10 × 9 × 8

∴ Total number of ways = 468000

Return To Top
 If repetitions are not permitted. How many 3 digit numbers can be
formed from the 6 digits 2, 3, 5, 6, 7 & 9.

6 × 5 × 4
120 numbers

Return To Top
 Find the number of 3 digit number containing at least one 7.

Solution: Repetition is allowed

At least one 7 ⇒ Total − None (No 7)

= −

9 × 10 × 10 8 × 9 × 9

Excluding 0 Excluding 0 and 7

= 900 − 648 = 252 ways

Return To Top
 Solve the following:
𝑖) How many of the 900 three digit numbers have at least one even
digit?
𝑖𝑖) The number of natural numbers from 1000 to 9999 (both inclusive)
that do not have all 4 different digits is

𝑖)Atleast one even digit = Total 3 digit number − None even Number

0 = 900 − 125 = 775

9 × 10 × 10
𝑖𝑖) Required Natural numbers = total − All different

0 −

9 × 10 × 10 × 10 9 × 9 × 8 × 7
= 9000 − 9 × 9 × 8 × 7 = 4464
Return To Top
 Using 0, 1, 2, 3, 4, 5, 6 how many numbers of five digits can be made
greater than 24,000

Solution: 𝑖 Greater than 24,000

3/4
2 4 0 0 0 + 2 5/6 + 5/6 −1

1 × 1 × 7 × 7 × 7 + 1 × 2 × 7 × 7 × 7 + 4 × 7 × 7 × 7

24,666 ≥Number≥ 24000

Return To Top
 Using 0, 1, 2, 3, 4, 5, 6 how many numbers of five digits can be made
𝑖𝑖 less than 54,000 𝑖𝑖𝑖 Number greater than 24000 but less than 54000

Solution: 𝑖𝑖 Less than 54,000

0/1 1/2
5 /2/3 + /3/4

1 × 4 × 7 ×7 × 7 + 4 × 7 × 7 × 7 × 7
= 73 4 + 28

𝑖𝑖𝑖 Number greater than 24000 but less than 54000

2 0 0 0 + 3/4 + 5 −1

1 × 3 × 7 × 7 × 7 + 2 × 7 × 7 × 7 × 7 + 1 × 4 × 7 × 7 × 7

Return To Top
 𝑖 . In how many ways can 5 letters be mailed if there are 3 different
mailboxes available if each letter can be mailed in any mailbox
𝑖𝑖 . Every telephone number consists of 7 digits. How many
telephone numbers are there which do not include any other digits
but 2, 3, 5 and 7 ?

Solution: 𝑖 𝐿1 → 3 𝑖𝑖 Repetition of No. is allowed in telephone number

𝐿2 → 3

𝐿3 → 3 3×3×3×3×3
= 35 ways 4 × 4 × 4 × 4 × 4 × 4 × 4
𝐿4 → 3
= 47 ways
𝐿5 → 3

Return To Top
 Session 02
coin toss and rank based
problem

Return To Top
 If repetitions are not permitted
𝑖 . How many 3 digit numbers can be formed from the 6 digits
2, 3, 5, 6, 7 & 9.
𝑖𝑖 . How many of these are less than 400? 𝑖𝑖𝑖 . How many are even?
𝑖𝑣 . How many are odd? 𝑣 . How many are multiples of 5?

𝑖 𝑖𝑖 2 or 3 𝑖𝑖𝑖 2 or 6

6 × 5 × 4
2 × 5 × 4 5 × 4 × 2
120 numbers
40 numbers 40 numbers

𝑖𝑣 For odd numbers 𝑣 5

= total – even numbers
= 120 − 40 = 80
5 × 4 × 1
20 ways
Return To Top
 How many 4 digits even numbers can be made by using 0,1,2,3,4,5,6.

Solution: Even numbers have last digit ‘even’.

Case 𝐼 −Last digit fixed for zero
Whenever we have even number case
and digits include zero then we play two
different stories and add them Case 𝐼𝐼 −Last digit to left even digits

Note:

Above rule is specially for the case when repetition is not allowed.

Return To Top
 How many 4 digits even numbers can be made by using 0,1,2,3,4,5,6.

Even numbers have last digit ‘even’.

Solution:
𝑖 If repetition is not allowed: 𝑖𝑖 If repetition is allowed:

0 0 + 0

6 × 5 × 4 × 1 6 × 7 × 7 × 1 + 6 × 7 × 7 × 3
+ 7 × 7 6 + 18 = 420

5 × 5 × 4 × 3 6 × 7 × 7 × 3
20 6 + 15 = 420

Return To Top
 The number of natural numbers from 1000 to 9999 (both inclusive)
that do not have all 4 different digits is

Required Natural numbers = total − All different

0 −

9 × 10 × 10 × 10 9 × 9 × 8 × 7

= 9000 − 9 × 9 × 8 × 7 = 4464

Return To Top
 Key Takeaways

1 Coin toss :

Start

• Number of possible outcomes when 1 coin is tossed= 2 i.e. T, H

Return To Top
 Key Takeaways

2 Coin toss :

Start

Number of possible outcomes when 2 coins are tossed =22

•
i.e, 𝑇 𝑇, 𝑇 𝐻, 𝐻 𝑇, 𝐻 𝐻
Return To Top
 Key Takeaways

3 Coin toss :
𝑇
𝑇
𝐻
𝑇
𝑇
𝐻
Start 𝐻
𝑇
𝑇
𝐻 𝐻
𝑇
𝐻
𝐻

• Number of possible outcomes when 2 coins are tossed = 23

i.e. 𝑇 𝑇 𝑇, 𝑇 𝑇 𝐻, 𝑇 𝐻 𝑇, 𝑇 𝐻 𝐻, 𝐻 𝑇 𝑇, 𝐻 𝑇 𝐻, 𝐻 𝐻 𝑇, 𝐻 𝐻 𝐻
Return To Top
 Four dices are rolled , find
(𝑎) Total number of possible outcomes
(𝑏) Number of ways in which NO dice exhibit ‘5’
(𝑐) Number of ways in which ATLEAST ONE dice exhibit ‘5’

Solution:
(𝑎) Possible outcomes = 64 = 1296 {Relate with coin system}

(𝑏) Number of ways in which no dice exhibit ‘5’

Let’s remove face of ‘5’ from the cube

Now we have edge of ‘5’ faces

∴ Possible outcomes = 54

(𝑐) At least one dice exhibit ‘5’ = Total - none

= 64 − 54 = 1296 − 625 = 671

Return To Top
 How many words can be made by using alphabets of 𝑆𝐻𝐸 without
repetition? Find the rank of the word 𝑆𝐻𝐸.

Solution:

3 × 2 × 1 = 3! = 6 ways

𝐸 __ __ ⇒ 2! = 2 word

𝐻 __ __ ⇒ 2! = 2 word

𝑆 𝐸 𝐻 ⇒ 1 word

𝑆 𝐻 𝐸 ⇒ 1 word

= 6 word

Return To Top
 How many words can be made by using alphabets of 𝐾𝐼𝑁𝐺
without repetition? Find the rank of the word 𝐾𝐼𝑁𝐺.

Solution:
𝐺 = 3! = 6 Words

𝐼 = 3! = 6 Words

𝐾 𝐺 = 2! = 2 Words

𝐾 𝐼 𝐺 𝑁 = 1 Words

𝐾 𝐼 𝑁 𝐺 = 1 Words

= 16 word

Return To Top
 Find the rank of 𝑉𝐼𝑆𝐻𝐴𝐿?

𝐴 𝐻 𝐼 𝐿 𝑆 𝑉
Solution:
𝐴 = 5! = 120 Words 𝑉 𝐼 𝐴 = 3! = 6 Words

𝐻 = 5! = 120 Words 𝑉 𝐼 𝐻 = 3! = 6 Words

𝐼 = 5! = 120 Words 𝑉 𝐼 𝐿 = 3! = 6 Words

𝐿 = 5! = 120 Words 𝑉 𝐼 𝑆 𝐴 = 2! = 2 Words

𝑆 = 5! = 120 Words 𝑉 𝐼 𝑆 𝐻 𝐴 𝐿 = 1 Words

𝑉 𝐴 = 4! = 24 Words

𝑉 𝐻 = 4! = 24 Words

Rank of VISHAL is = 5 × 120 + 2 × 24 + 3 × 6 + 2 + 1 = 669

Return To Top
 How many words can be made by using 𝐾𝑁𝐼𝐹𝐸 without repetition?
Find the rank of the word 𝐾𝑁𝐼𝐹𝐸.

Solution:

5 4 3 2 1 = 5! = 120 types of words are possible

Dictionary order : 𝐸 𝐹 𝐼 𝐾 𝑁

𝐾 𝑁 𝐼 𝐹 𝐸

3 × 4! + 3 × 3! + 2 × 2! + 1 ⋅ 1! + 0!

3 × 24 + 3 × 6 + 2 × 2 + 1 ⋅ 1 + 1

72 + 18 + 4 + 1 + 1

96𝑡ℎ Rank

Return To Top
 How many words can be made by using 𝐾𝑁𝐼𝐹𝐸 without repetition?
Find the rank of the word 𝐾𝑁𝐼𝐹𝐸.

Solution: 𝐾 𝐼 𝑁 𝐺

2 × 3! + 1 × 2! + 1 ⋅ 1! + 0!

2×6 + 1×2+ 1⋅1 +1

12 + 2 + 1 + 1 = 16𝑡ℎ Rank

Return To Top
 Find the rank of GARRANE from letter ARRANGE ?.

Solution: 𝐺 𝐴 𝑅 𝑅 𝐴 𝑁 𝐸

3 ⋅ 6! 0 ⋅ 5! 3 ⋅ 4!
+ + + 3 ⋅ 3! + 0 ⋅ 2! + 1 ⋅ 1! + 0!
2! ⋅ 2! 2! ⋅ 2! 2!

𝐴 𝑅 𝐴 𝑅 𝑅
Here 𝐴 is Here 𝑅 is
killed killed

= 540 + 0 + 36 + 18 + 0 + 1 + 1 = 596

Return To Top
 There are 720 permutations of digits 1, 2, 3, 4, 5, 6. Suppose these
permutations are arranged from smallest to largest beginning with
1, 2, 3, 4, 5, 6 and ending to 654321. (I) Find the number in 124𝑡ℎ position.

Solution: Number at 124𝑡ℎ position

It is a dictionary like permutations: Repetition is not allowed

Starting from 1: 1 5 4 3 2 1 = 5! = 120

Similarly, starting from 2: 5! = 120

⋅
⋅
Similarly, starting from 6: 5! = 120

Return To Top
 There are 720 permutations of digits 1, 2, 3, 4, 5, 6. Suppose these
permutations are arranged from smallest to largest beginning with
1, 2, 3, 4, 5, 6 and ending to 654321. (I) Find the number in 124𝑡ℎ position.

Solution: Starting from 1: = 5! = 120

Similarly, starting from 2: 5! = 120 Total = 120 × 6 = 720 permutations

Similarly, starting from 6: 5! = 120

1
= 120
2 1 3 4 5 6
=1
2 1 3 4 6 5
=1

2 1 3 5 4 6
=1

2 1 3 5 6 4 (124𝑡ℎ number)
=1
Return To Top
 There are 720 permutations of digits 1, 2, 3, 4, 5, 6. Suppose these
permutations are arranged from smallest to largest beginning with
1, 2, 3, 4, 5, 6 and ending to 654321. (II) Find the position of 321456.

Solution: 𝑖𝑖 . Position of 321456

1 = 120

2 = 120

3 1 = 24

3 2 1 4 5 6 =1

∴ Position is 265𝑡ℎ
Return To Top
 Session 03
Intro to permutations,
Exponent of prime p in n!

Return To Top
 Find the number of ways of forming a 3 digit number containing
only one 7

No 0
No 7 No 7 7 8×9×1

+ +

No 0
No 7 7 8×1×9
No 7

+ +

No 0
No 7 7 1×9×9
No 7

= 72 + 72 + 81 = 225

Return To Top
 Key Takeaways

T F T F T F T F
OMR for True/False Questions

OMR for 3 Questions[T/F]:

23 outcomes T F T F
T T
T T
F F
T F
T T
F F T F T F
F F

If the correct option is FTT and none

of the students got it right, then the
number of possibilities are 7.

Return To Top
 For a set of 5 True/False type questions, no student has written all
correct answers and no two students has written all same answers.
What is the strength of the class ?

Solution: Total OMR possible = 25

Perfectly correct OMR = 1

Required OMRs = 25 − 1 = 32 − 1 = 31

⇒ Strength of the class = 31

Return To Top
 A new flag is to be designed with 6 vertical strips using some or all of
the colors yellow, green, blue and red. Then, the number of ways this
can be done such that no two adjacent strips have the same color is

Solution:

4 4 × 3 × 3 × 3 × 3 × 3 = 4 × 35

3 Y G B R

Return To Top
 How many number of ways to get 5 letter palindrome

Solution:

= 263
26 26 26 1 1

As one letter is chosen for first position, the same

letter can be filled at last position in one way only.

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

𝑛 𝑛 𝑛 𝑛
𝐸𝑝 𝑛! = + 2 + 3 + ⋯ + ____ To be stopped just before =0
𝑝 𝑝 𝑝 𝑝𝑡

Exponent of prime in 𝑛! Here, 𝑝: prime

Return To Top
 Find exponent of 2 in 100!
or
If 100! = 2𝑚 ⋅ 𝐼 where (𝐼 = multiple of odd numbers),then 𝑚 =

100 100 100 100 100 100

𝐸2 100! = 2
+
4
+
8
+
16
+ ⋯+
64
+
128

= 50 + 25 + 12 + 6 + 3 + 1 = 97

Find exponent of 3 in 100!

100 100 100 100 100

𝐸3 100! = + + + +
3 32 33 34 35

= 33 + 11 + 3 + 1 = 48

Return To Top
 Find exponent of 18 in 100!.
Solution:
𝐸2 100! = 50 + 25 + 12 + 6 + 3 + 1 = 97

𝐸3 100! = 33 + 11 + 3 + 1 = 48
𝐸5 100! = 20 + 4 = 24

𝑖 . 100! = 297 × 348 × 524 × ⋯

100! = 297 × 32 24
× 524 × ⋯

100! = 273 × 224 × 32 24

× 524 × ⋯

100! = 273 × 2 × 32 24
× 524 × ⋯

100! = 273 × 1824 × 524 × ⋯

Exponent of 18 in 100! = 24

Return To Top
 Find the number of zeroes in 100!

Solution:
100! = 297 × 348 × 524 × ⋯

100! = 273 × 224 × 348 × 524 × ⋯

100! = 273 × 5 × 2 24
× 348 × ⋯

100! = 273 × 1024 × 348 × ⋯

Number of zeros in 100! = 24

Return To Top
 Exponent of 18 in 100
𝐶50 is

A 1
For finding the exponent:

𝐸3 100! = 33 + 11 + 3 + 1 = 48
B 2
𝐸3 50! = 16 + 5 + 1 = 22

C
100! 348 3
= = 34
50! 50! 322 × 322

As 18 = 3 × 22 D 4

the exponent of 18 will be 2.

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.

• 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

Proof

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

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

𝑛!
⇒ 𝑛𝑃𝑟 =
𝑛−𝑟 !

Return To Top
 Key Takeaways

Formula for Permutation

• 𝑛𝑃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
 Three digit numbers are to be formed by using the odd digits
only. The number of such numbers which satisfy the following
conditions :
𝑖) Repetition not allowed
𝑖𝑖) Repetition is allowed
𝑖𝑖𝑖) When at-least one digit is repeated.

𝑖) Odd digits= 1, 3, 5, 7, 9

5!
Number of permutations without repetition = 5𝑃2 = = 60
2!

𝑖𝑖) Number of permutations with repetition = 53 = 125

𝑖𝑖𝑖) Total number of ways when at least one digit is repeated

= Permutations with repetations − Permutations without repetition

= 125 − 60 = 65
Return To Top
 Key Takeaways

Formula for Permutation

𝑛𝑃
• 𝑛𝑃
𝑟
𝑟−1
=𝑛−𝑟+1

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

• 𝑛𝑃𝑟 + 𝑟 × 𝑛𝑃(𝑟−1) = (𝑛+1)

𝑃𝑟

Return To Top
 Find 𝑛 such that 𝑛𝑃5 = 42 ⋅ 𝑛𝑃3 .

Given: 𝑛𝑃5 = 42 ⋅ 𝑛𝑃3

𝑛! 𝑛!
⇒ = 42 ⋅
𝑛−5 ! 𝑛−3 !
⇒𝑛 𝑛−1 𝑛−2 𝑛−3 𝑛−4
= 42 𝑛 𝑛 − 1 (𝑛 − 2)
⇒ 𝑛 − 3 𝑛 − 4 = 42
⇒ 𝑛2 − 7𝑛 − 30 = 0
⇒ 𝑛 − 10 𝑛 + 3 = 0

𝑛 = 10 𝑛 = −3(rejected)

Return To Top
 Find 𝑟 if 5 ⋅ 4𝑃𝑟 = 6 ⋅ 5𝑃𝑟−1

5 ⋅ 4𝑃𝑟 = 6 ⋅ 5𝑃𝑟−1
4! 5!
5⋅ 4−𝑟 !
=6⋅ 6−𝑟 !
5! 5!
=6.
4−𝑟 ! 6−𝑟 ×(5−𝑟)× 4−𝑟 !

⇒ (6 − 𝑟)(5 − 𝑟) =
6
⇒ 𝑟−3 𝑟−8 =
0
𝑟=3 𝑟 = 8 Not acceptable as
𝑟≤4

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

1! 2! 3! 4! 5!
2 ⋅ 1𝑃0 − 3 ⋅ 2𝑃1 + 4 ⋅ 3𝑃2 − ⋯ upto 51𝑠𝑡 term = 2 × −3× +4× −5× +6× +⋯
1 1! 1! 1! 1!

= 2! − 3! + 4! ⋯ − 51! + 52!
A 1 − 5! (5!)
⇒ (2 . 𝑃0 − 3 . 𝑃1 + 4 . 𝑃2 − ⋯ upto 51
1 2 3 𝑠𝑡
term) +(1! − 2! + 3! − ⋯ upto 51 𝑠𝑡
term)

= 2! − 3! + 4! ⋯ − 51! + 52! + (1! − 2! + 3! − ⋯ + 51!) B 1 + 51!

= 1 + 52!
C 1

D 1 + 52!

Return To Top
 Session 04
Combinations and its
properties

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.

Notation

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

𝑛
time, is denoted by 𝐶𝑟 or 𝐶(𝑛, 𝑟) or
𝑛
.
𝑟
𝑛𝑃 𝑛!
𝑛 𝑟
𝐶𝑟 = = (𝑛 ∈ 𝑁, 𝑟 ∈ 𝑊, 0 ≤ 𝑟 ≤ 𝑛)
𝑟! 𝑟!(𝑛−𝑟)!

Return To Top
 Key Takeaways

Properties of 𝑛
𝐶𝑟

• 𝑛𝐶0 = 0!𝑛! = 1(Selecting nothing)

𝑛!

𝑛!
• 𝑛𝐶𝑛 = 0!𝑛! = 1(Selecting everything)

• 𝑛𝐶𝑟 = 𝑛𝐶𝑛−𝑟

• 𝑛𝐶𝑟 = 𝑛𝐶𝑠 ⇒ 𝑟 = 𝑠 or 𝑛 = 𝑟 + 𝑠

𝑛𝐶 𝑛−𝑟+1
• 𝑛𝐶
𝑟
𝑟−1
=
𝑟

• 𝑛𝐶𝑟 + 𝑛𝐶𝑟−1 = 𝑛+1𝐶𝑟

Return To Top
 Key Takeaways

Properties of 𝑛
𝐶𝑟

• 𝑛𝐶𝑟 is greatest for 𝑖) 𝑟 = 2 , if 𝑛 is even

𝑛 𝑛−1 𝑛+1
𝑖𝑖) 𝑟 = or , if 𝑛 is odd
2 2

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

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

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

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

Return To Top
 Key Takeaways

Working rule

𝑛𝑃
• 𝑛𝐶𝑟 = 𝑟!
𝑟
=
𝑛 𝑛−1 𝑛−2 ⋯(𝑛−𝑟+1)
𝑟!

Return To Top
 𝑖) 10𝐶3 =?
𝑖𝑖) Maximum value of 8𝐶𝑟 is ____.
𝑖𝑖𝑖) If 𝑛𝐶4 = 𝑛𝐶5 then 𝑛𝐶2 = _____ ?
𝑖𝑣) 6𝐶5 + 6𝐶4 = _____ ?

10 10⋅9⋅8
𝑖) 𝐶3 = = 120
3!

𝑖𝑖) The value of 8𝐶𝑟 is maximum, if 𝑟 = 4

8⋅7⋅6⋅5
∴ 8𝐶4 = = 70
4!

𝑖𝑖𝑖) 𝑛𝐶4 = 𝑛𝐶5 ⇒ 𝑛 = 4 + 5 = 9

𝑛 9×8
𝐶2 = 9𝐶2 = = 36
2

7×6
𝑖𝑣) 6𝐶5 + 6𝐶4 = 7𝐶5 = 7𝐶2 = = 21
2

Return To Top
 Find total number of ways for symbol that can be made with 5
flags of different colors when any number of them can be used.

Solution: First we select any number of flags and then arrange them in any order.

Total ways: 5𝐶1 ⋅ 1! + 5𝐶2 ⋅ 2! + 5𝐶3 ⋅ 3! + 5𝐶4 ⋅ 4! + 5𝐶5 ⋅ 5! = 5𝑃1 + 5𝑃2 + 5𝑃3 + 5𝑃4 + 5𝑃5

Selection of 2 flags and then

arranging them in 2! ways

Return To Top
 There are 10 persons in a room. Each person shakes hand with
every person. Find the total number of handshakes.

Solution: Total : 10 persons

Required number of hand shakes = Number of ways in which two

persons can be selected
10 10×9
= 𝐶2 = = 45
2

Eight teams participate in a cricket tournament. If each team

plays once against each of the others, find the total number of
matches ?

Total : 8 teams

Each team plays once against each of the others

The total number of matches = 8𝐶2 = 28

Return To Top
 Total number of ways of selecting 3 boys and 4 girls from 5 boys
and 6 girls is ?

5 boys

6 girls

We need to select 3 boys and 4 girls.

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
 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 _____ .
JEE Mains (2019)

A 12 B 11 C 9 D 7

𝑚 𝑚−1
Men → 𝑚 , Women = 2 − 2𝑚 = 42
2

Men to Men − ( Men to Women ) = 84 𝑚2 − 5𝑚 = 84

𝑚
𝐶2 × 2 − 𝑚
𝐶1 × 2𝐶1 × 2 = 84 𝑚 − 12 𝑚 + 7 = 0

𝑚 = 12 , −7 (Rejected)

Return To Top
 There are 15 players in a cricket team, out of which 6 are bowlers, 7 are
batsman 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
batsman and 1 wicketkeeper is:
JEE Mains (2021)
There are total three cases

Case 1: 4 bowlers+5 batsman+2 WK

Number of ways= 6𝐶4 . 7𝐶5 . 2𝐶2 = 315

Case 2: 4 bowlers+6 batsman+1 WK

Number of ways= 6𝐶4 . 7𝐶6 . 2𝐶1 = 210

Case 3: 5 bowlers+5 batsman+1 WK

Number of ways= 6𝐶5 . 7𝐶5 . 2𝐶1 = 252

Return To Top
 There are 15 players in a cricket team, out of which 6 are bowlers, 7 are
batsman 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
batsman and 1 wicketkeeper is:
JEE Mains (2021)

Now, total number of ways= Case 1 + Case 2 + Case 3

= 315 + 210 + 252 = 777

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
JEE Mains (2021)
The possible ways are = 2𝐼, 4𝐹 + 3𝐼, 6𝐹 + 4𝐼, 8𝐹
A 560
Number of ways= 6𝐶2 . 8𝐶4 + 6𝐶3 . 8𝐶6 + 6𝐶4 . 8𝐶8

= 15 × 70 + 20 × 28 + 15 × 1 = 1625
B 1050

C 1625

D 575

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

• Total number of black cards = 26 Total number of cards = 52 (13 cards of each suit)

• Total number of black cards = 26

• Total number of face cards = 12

Return To Top
• Honour cards = face cards + Aces = 16
 The number of ways of choosing 4 cards from a pack of 52
playing cards, such that : 𝑖) All are of the same suit
𝑖𝑖) Two are red and two are black cards
𝑖𝑖𝑖) All are face cards

𝑖) selection of suit= 4𝐶1

selection of 4 cards from same suit= 13

𝐶4

All are of the same suit= 13

𝐶4 . 4𝐶1 = 2860

𝑖𝑖) 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 = 12

𝐶4 = 495
Return To Top
 Key Takeaways

Example:

• A C T : All the three letters are different. EGG : Out of three, two are identical
ACT ATC EGG EGG
• Different
CAT CTA
Different
GEG GEG
arrangements arrangements

TAC TCA GGE GGE

∴ Number of arrangements ∴ Number of arrangements

3!
= 6 = 3! ( 3𝑃3 ) =
2!
=3

Note:

• The number of permutations of 𝑛 objects of which 𝑛!

=
𝑝 objects are of same kind and rest are distinct 𝑝!

Return To Top
 Key Takeaways

Example:

• APPLE : All the number of arrangements DADDY : All the number of arrangements

5!
Different arrangements=
5!
Different arrangements =
2! 3!

Note:

• The number of permutations of 𝑛 objects of which 𝑛!

=
𝑝 objects are of same kind and rest are distinct 𝑝!

Return To Top
 Key Takeaways

Example:

• MUNNI : All the number of arrangements MAHABHARAT : All the number of

arrangements

10!
Different arrangements=
5!
Different arrangements =
2! 4! 2!

Note:

• The number of permutations of 𝑛 objects of which 𝑛!

=
𝑝 objects are of same kind and rest are distinct 𝑝!

Return To Top
 Key Takeaways

Special Case:

• 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 =
𝑝1 ! 𝑝2 ! ⋯ 𝑝𝑘 !
are of 𝑘 𝑡ℎ kind and rest (if any) are all distinct.

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

MESOPOTAMIA INDEPENDENCE

Total letters = 11 Total letters = 12

Possible number 11! Possible number 12!

= =
of words 2! × 2! × (2!) of words 4! × 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: 𝑖) start with A.

Given word : A L L A H A B A D

AAAA LL BDH
9!
∴ Number of permutations = = 7560
4!⋅2!

A _ _ _ _ _ _ _ _

8!
∴ Number of permutations = 1 × = 3360
3!⋅2!
_ _ _ _ _ _ _ _L

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
8!
∴ Number of permutations = × 1 = 1680
4!
A _ _ _ _ _ _ _L

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

A _ _ _ _ _ _ _ L

L
7!
∴ Number of permutations = 1 × × 1 = 840
3!
Return To Top
 Session 05
String & Gap method,
Combinatorial geometry

Return To Top
 Number of ways if different colors of rainbow are arranged so
that Blue and Green are never together.

Solution:

M-1 (String Method) VIBGYOR

12 3 4 5 6
Total arrangement by colors of
6! × 2! → Cases where B, G are always together
Rainbow = 7!

B, G are never together = total cases of VIBGYOR − Case B, G are always together

= 7! − {6! × 2!}

= 5040 − 720 × 2

= 5040 − 1440 = 3600

Return To Top
 Number of ways if different colors of rainbow are arranged so that
Blue and Green are never together.

Solution: M-2 (Gap Method)

Lets get rid of B and G first and take rest colors in a line (in 5! ways)

V I Y O R

They are gaps where we can put B & G

so that B & G can never be together.

5! × 6𝐶2 × 2! = 120 × 30

Return To Top = 3600

 The number of ways in which 5 boys and 3 girls can be arranged
in a row such that :
𝑖) all the boys are together. 𝑖𝑖) all the girls are not together.

Solution:
5 boys
𝑖) all the boys are together

4! ways 3 girls

5! ways

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

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

Solution:
5 boys
𝑖𝑖) all the girls are not together
3 girls

∴ Total number of arrangements in which all the girls are not

together = 5 + 3 ! − (6! × 3!)

= 8! − (6! × 3!)

= 36000

Return To Top
 The number of six letter words (with of without meaning)
formed using all the letters of the word ‘VOWELS’ so that all the
consonants never come together is:
JEE Mains (2021)
Total possible words= 6! = 720

When 4 consonants are together (V, W, L, S)

Total case when consonants are together O, E, (VWLS)

Such cases: 3! × 4! = 144

Now, required cases= 720 − 144 = 576

Return To Top
 How many words can be formed using all the letters of the word
GANESHPURI, in which:
1. All vowels are together ?
2. All consonants are together ?
3. Vowels comes together & consonants comes together ?

1. All vowels are together ?

G N A E I U S H P R = 7! × 4!

2. All consonants are together ?

U I G N S H P R A E = 5! × 6!

3. Vowels comes together & consonants comes together ?

A E I U G N S H P R = 2! × 4! × 6!
Return To Top
 How many words can be formed using all the letters of the word
GANESHPURI, in which:
4. No 2 vowels are together ?
5. Letters G, A and N are always separated ?

4. No 2 vowels are together ?

Arrange consonants → find gap and put vowels between them → arrange vowels

6! × 7𝐶4 × 4!

G N S H P R

5. Letters G, A and N are always separated ?

Leave 𝐺, 𝐴 & 𝑁 and Arrange rest → find gap and put 𝐺, 𝐴 & 𝑁 between them → arrange 𝐺, 𝐴 & 𝑁

Return To Top
7! × 8𝐶3 × 3!
 How many words can be formed using all the letters of the word
GANESHPURI, in which:
6. All vowels occur in alphabetical order ?

7. All consonants occur in alphabetical order ?

6. All vowels occur in alphabetical order ?

A E I U G N S H P R

10𝐶 × 1 × 6!
4

7. All consonants occur in alphabetical order ?

GHNPRS A E I U

10𝐶 × 1 × 4!
6

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

Solution:
4 boys

4 girls
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 :
𝑖) no two girls are together. 𝑖𝑖) boys and girls sit alternatively.
𝑖𝑖) boys and girls sit alternatively.

Solution:
Case 1: Total number of ways = 4! × 4! 4 boys

= 2 4! × 4!
4 girls
Case 2: Total number of ways = 4! × 4!
= 1152

Return To Top
 A men has 7 relatives in which 4 ladies & 3 gents. His wife also has 7
relatives having 3 ladies & 4 gents. In how many ways they can call 3
ladies & 3 gents for dinner where 3 relatives are from men’s side & 3
form his wife’s side.

Men Women
(7 Relatives) (7 Relatives)

4 ladies 3 Gents 3 ladies 4 Gents

3 0 0 3

0 3 3 0

2 1 1 2

1 2 2 1

Total number of ways = 4 𝐶3 ⋅ 3 𝐶0 ⋅ 3 𝐶0 ⋅ 4 𝐶3 + 4 𝐶0 ⋅ 3 𝐶3 ⋅ 3 𝐶3 ⋅ 4 𝐶0

+ 4 𝐶2 ⋅ 3 𝐶1 ⋅ 3 𝐶1 ⋅ 4 𝐶2 + 4 𝐶1 ⋅ 3 𝐶2 ⋅ 3 𝐶2 ⋅ 4 𝐶1 = 485
Return To Top
 Key Takeaways

Combinatorial Geometry

If 𝑛 Points are there and no three of them are collinear then

• Total number of lines = 𝑛 𝐶2 .(Selection of any two points will give a straight line)
• Total number of triangles = 𝑛 𝐶3 .(Selection of any three points will give a triangle)

If some points out of 𝑛 Points are collinear then

• Total number of lines = 𝑛 𝐶2 − number of colliner points

𝐶2 + 1

• Total number of triangles =𝑛 𝐶3 − number of colliner points

𝐶3

Return To Top
 From 5 circles and 4 lines find maximum number of intersections.

Maximum intersection will happen when :

Intersection of circle and circle, Intersection of line and line &
Intersection of line and circle will occur simultaneously

2 P.O.I when 1 P.O.I when 2 P.O.I when

circle-circle intersect line-line intersect line-circle intersect

Maximum number of point intersection

5
= 𝐶2 × 2 + 1 × 4 𝐶2 + 2 × 5 𝐶1 × 4 𝐶1 = 20 + 6 + 40 = 66

Return To Top
 Find number of parallelograms in the following

𝑚 Parallel lines

𝑛 Parallel lines

Solution: One parallelogram forms from two parallel lines from

one set and two parallel lines from another set

Hence total number of parallelograms = 𝑚

𝐶2 × 𝑛 𝐶2

Return To Top
 Note:

• In a plane if 𝑚 lines are parallel and another 𝑛 lines are parallel, then number
of parallelograms formed by these line will be = 𝑚
𝐶2 × 𝑛 𝐶2

Return To Top
 Session 06
Divisibility model

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

Total number of triangles = (3+5+6)

𝐶3 − 3 𝐶3 − 5 𝐶3 − 6 𝐶3 A 360
= 364 − 1 − 10 − 20 = 333
B 240
Hence, option (C) is the correct answer

C 333

D 364

Return To Top
 Find the number of
𝑖 Squares on a chessboard. 𝑖𝑖 Rectangles on a chessboard.
𝑖𝑖𝑖 Pairs of unit squares having a common vertex.
(𝑖𝑣) Ways one can travel from one corner to other covering the
shortest possible distance.
𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑔 ℎ
Solution: 1
(𝑖) Number of square on a chessboard 2
3
= (sq of 1 × 1) + (sq of 2 × 2) + (sq of 3 × +)+ (sq of 4 × 4) 4
5
+ (sq of 5 × 5) + (sq of 6 × 6) + (sq of 7 × 7) + (sq of 7 × 7) 6
7
8
=8×8+7×7+6×6+5×5+4×4+3×3+2×2+1×1

= 82 + 72 + 6 2 + 52 + 42 + 32 + 22 + 12

8(8+1)(2×8+1)
= = 204
6

Return To Top
 Find the number of
𝑖 Squares on a chessboard. 𝑖𝑖 Rectangles on a chessboard.
𝑖𝑖𝑖 Pairs of unit squares having a common vertex.
(𝑖𝑣) Ways one can travel from one corner to other covering the
shortest possible distance.
𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑔 ℎ
Solution:
(𝑖𝑖) Number of rectangles on a chessboard: 1
Total number of rectangles = number of ways of 2
3
4
selecting 2 vertical & 2 horizontal lines 5
6
⇒ 9𝐶2 × 9𝐶2 = 1296 7
8
(𝑖𝑖𝑖) Pairs of unit squares having a common vertex.
⇒ Twice the number of squares of size 2 × 2
⇒ 2 × 7 × 7 = 98

Return To Top
 Find the number of
𝑖 Squares on a chessboard. 𝑖𝑖 Rectangles on a chessboard.
𝑖𝑖𝑖 Pairs of unit squares having a common vertex.
(𝑖𝑣) Ways one can travel from one corner to other covering the
shortest possible distance.
𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑔 ℎ
Solution:
(𝑖𝑣) Number of ways one can travel from one 1
corner to other covering the shortest possible 2
3
distance if he moves only along the edges of 4
squares. 5
6
Let R denotes rightward movement & U be the upward 7
movement of one unit each. 8

RRRRRRRR UUUUUUUU
Number of possible paths = Total arrangements of 8 R’s & 8 U’s
16!
in a row =
8!×8!

Return To Top
 Find the number of point of intersection :

𝑚 Points 𝑛 Points

Solution: Number of point of intersection= 𝑚

𝐶2 × 𝑛 𝐶2 × 1

Return To Top
 Given 9 points on a circle each point is joined to another point.
Find number of point of intersections.

Solution: Selection of 4 points will give 1 point of intersection

Number of point of intersection= 9 𝐶4

Return To Top
 There are 𝑛 straight lines in a plane, no 2 of which are parallel, and no
3 pass through the same point. Their points of intersection are joined.
Then find the number of fresh lines.

Solution:

If four lines are there, then 3 fresh lines can be drawn

Hence, for 𝑛 lines number of fresh lines will be

𝑛
= 𝐶4 × 3

Return To Top
 Key Takeaways

Visualization and analysis

• •

Number of Number of
straight lines = 6𝐶2 straight lines = 4𝐶2

= 15 =6

6 sides 9 diagonals 4 sides 2 diagonals

Return To Top
 Key Takeaways

Visualization and analysis

• • For 𝑛 sided polygon the number of diagonals

𝑛2 −3𝑛
=
2

Number of
straight lines = 5𝐶2

= 10

5 sides 5 diagonals
Return To Top
 Key Takeaways

Divisibility model

• A number is divisible by 2: If it’s LAST digit is even (0, 2 , 4, 6, 8)

• 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 5: If it’s last digit is 0 or 5

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

• A number is divisible by 7: If
[( (Number formed by other digits) − (2 × digits at units-
place)] is 0 or multiple of 7
Return To Top
 Key Takeaways

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 digits at odd-places) − (Sum of digits at even-places) is 0 or divisible by 11

Return To Top
 Using 0, 1, 2, 3, 4, 5, How many 5 − digit numbers can be made
divisible by 2
a. With Repetition allowed b. With Repetition not allowed

Solution:
a. With Repetition allowed
All digits 0/2/4
except 0 can
come here
All digits can
come here
Total number of ways = 5 × 6 × 6 × 6 × 3

b. With Repetition not allowed

Case 1 Case 2

0 2/4
Return To Top
 Using 0, 1, 2, 3, 4, 5, How many 5 − digit numbers can be made
divisible by 2
a. With Repetition allowed b. With Repetition not allowed

Solution:
b. With Repetition not allowed

Case 1 Case 2

0 2/4

5 × 4 × 3× 2× 1 4 × 4 × 3× 2× 2

Total number of ways = 5 × 4 × 3 × 2 × 1 + 4 × 4 × 3 × 2 × 2

= 120 + 192
= 312

Return To Top
 Using 0, 1, 2, 3, 4, 5, How many 5-digit numbers can be made
a. Divisible by 3 with repetition not allowed?
b. Divisible by 6 with repetition not allowed?

Solution:

a. For making numbers divisible by 3 following sets of numbers can be used :

(𝐼) 0, 1, 2, 4, 5
(𝐼𝐼) 1, 2, 3, 4, 5

4 × 4 × 3× 2× 1 5 × 4 × 3× 2× 1

Total number of ways = 4 × 4 × 3 × 2 × 1 + 5 × 4 × 3 × 2 × 1 = 96 + 120

= 216

Return To Top
 Using 0, 1, 2, 3, 4, 5, How many 5-digit numbers can be made
a. Divisible by 3 with repetition not allowed?
b. Divisible by 6 with repetition not allowed?

Solution: b. For making numbers divisible by 6 following sets of

numbers can be used (Sum of digits should be divisible by 3):
(𝐼) 0, 1, 2, 4, 5
(𝐼𝐼) 1, 2, 3, 4, 5
𝐼.
0 2/4
4 ×3× 2 ×1 ×1 3 × 3× 2 ×1 ×2

𝐼𝐼.
2/4

4 × 3× 2 ×1 ×2

Number of ways = 4 × 3 × 2 × 1 × 1 + (3 × 3 × 2 × 1 × 2)
+ (4 × 3 × 2 × 1 × 2)
Return To Top = 108
 The number of 6-digit 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 __

Solution: 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-digit 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 __

Solution: Given digits: 0, 1, 2, 5, 7 and 9

𝐾1 − 𝐾2 = 22
⇒ (𝐾1 − 𝐾2 ) is divisible by 11

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

𝐾1 − 𝐾2 = 0
𝐾1 + 𝐾2 = 24
+
𝐾1 − 𝐾2 = 0

2𝐾1 = 24 ⇒ 𝐾1 = 12

𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12

Return To Top
 The number of 6-digit 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 __

Solution: Given digits: 0, 1, 2, 5, 7 and 9

𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12

0, 5, 7 1, 2, 9

Case 1

{𝑑1 , 𝑑3 , 𝑑5 } = 0, 5, 7 and {𝑑2 , 𝑑4 , 𝑑6 } = { 1, 2, 9 }

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

Return To Top
 The number of 6-digit 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 __

Solution: Given digits: 0, 1, 2, 5, 7 and 9

𝑑1 + 𝑑3 + 𝑑5 = 𝑑2 + 𝑑4 + 𝑑6 = 12

0, 5, 7 1, 2, 9

Case 2

{𝑑1 , 𝑑3 , 𝑑5 } = 1, 2, 9 and {𝑑2 , 𝑑4 , 𝑑6 } = { 0, 5, 7 }

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

∴ Total number of 6-digit numbers divisible by 11 = 24 + 36 = 60

Return To Top
 How many words can be formed by alphabet of 𝑃𝐸𝑁𝐶𝐼𝐿.
A. Without condition: B. When 𝑁 always comes before 𝐸:
C. When 𝑁 & 𝐸 comes together: D. When word starts with 𝑁 & ends with
E. When relative place of vowels is unchanged.

A. Total ways = 6! = 720

B. When 𝑁 always comes before 𝐸

Total ways = 6 𝐶2 × 1 × 4!
= 360

Selection of 2 places
C. When 𝑁 & 𝐸 comes together:
Total ways = 5! × 2! NE PCIL
= 240 1 2 34 5
Return To Top
 How many words can be formed by alphabet of 𝑃𝐸𝑁𝐶𝐼𝐿.
A. Without condition: B. When 𝑁 always comes before 𝐸:
C. When 𝑁 & 𝐸 comes together: D. When word starts with 𝑁 & ends with
E. When relative place of vowels is unchanged.

D. Total ways = 4! = 24
N E

E. Total ways = 4! × 2! = 48

Vowel will come

at these places

Return To Top
 16 men are to be seated on a long table having 8 chairs on either
side. 2 particular men wants to sit on one particular side and 4
particular men want to sit on the other side. Find the number of
ways this condition is met?

Total number of ways= 8 𝐶2 × 2! × 8 𝐶4 × 4! × 10!

Return To Top
 Session 07
Restricted Combinations

Return To Top
 The total number of numbers lying between 100 and 1000 that
can be formed with the digits 1, 2, 3, 4, 5. if the repetition of digits is
not allowed and numbers are divisible by either 3 or 5 is JEE MAIN 2021
_ _ _
Divisible by 3
12 → 3, 4, 5 → 3! = 6
15 → 2, 3, 4 → 3! = 6
24 → 1, 3, 5 → 3! = 6
45 → 1, 2, 3 → 3! = 6
Total= 24

_ _ 5 ⇒ 4 × 3 = 12
Divisible by 15
135, 315, 345, 435 total 4 numbers divisible by 15
∴ total number= 24 + 12 − 4 = 32

Return To Top
 Find number of 3 − digit number 𝑥𝑦𝑧 such that
𝑎) 𝑥 < 𝑦 < 𝑧 𝑏) 𝑥 ≤ 𝑦 < 𝑧 𝑐) 𝑥 ≤ 𝑦 ≤ 𝑧

Solution:
1) Number is 𝑥 𝑦 𝑧 𝑥 is at 1𝑠𝑡 position, so 𝑥 ≠ 0

𝑎) 𝑥 < 𝑦 < 𝑧 for this we need number from 1 − 9

Select only 3 numbers out of 9 = 9𝐶3 × 1

𝑥 = 𝑦 < 𝑧 → 9𝐶2 × 1
𝑏) 𝑥 ≤ 𝑦 < 𝑧 ൝ Total way = 9𝐶2 + 9𝐶3 = 10
𝐶3
𝑥 < 𝑦 < 𝑧 → 9𝐶3 × 1

𝑥 = 𝑦 = 𝑧 → 9𝐶1 × 1
𝑥 = 𝑦 < 𝑧 → 9𝐶2 × 1 = 9𝐶1 + 9𝐶2 + ( 9𝐶2 + 9𝐶3 )
𝑐) 𝑥 ≤ 𝑦 ≤ 𝑧
𝑥 < 𝑦 = 𝑧 → 9𝐶2 × 1 = 10
𝐶2 + 10𝐶3 = 11
𝐶3
𝑥 < 𝑦 < 𝑧 → 9𝐶3 × 1

Return To Top
 Key Takeaways

Restricted Combination

• Number of ways of making a team of 𝑟 people out of 𝑛 people = 𝑛𝐶𝑟

• Number of ways of making
𝑛−𝑝
a team of 𝑟 people where 𝑝 people
are always selected = 𝐶𝑟−𝑝

• Number of ways of𝑛−𝑝

making a team of 𝑟 people where 𝑝 people are
always rejected = 𝐶𝑟

• Number of ways of making a team of 𝑟 people where 𝑘 people are always

selected and 𝑝 people are always rejected = 𝑛−𝑘−𝑝
𝐶𝑟−𝑘

Return To Top
 A grandfather with 7 grand children takes them to zoological garden
without taking the same three children together. How frequently
each child goes and how frequently the grandfather goes ?

Solution: Ways to select 3 children out of 7 = 7𝐶3

𝑖) Grandfather will go as many times as group of 3 will be formed = 7𝐶3

𝑖𝑖) A child (let’s say Ram) will be selected with other any two children in 7−1
𝐶3−1
= 6𝐶2 ways
∴ A child will go to zoological garden 6𝐶2 times i.e 15 times

Return To Top
 A guard team of 12 men is formed from a group of 𝑛 soldiers. It is
found that two particular soldiers 𝐴, 𝐵 are 3 times as often together
on guard team as three particular soldiers 𝐶, 𝐷, 𝐸. Then the value of
𝑛 is ____ .
JEE Mains 2019
Number of soldiers = 𝑛, 𝑟 = 12
A D

E
B C

Number of ways in which 𝐴, 𝐵 are included is 3 times that of

𝐶, 𝐷, 𝐸 included on guard.
𝑛−2
Number of ways in which A and B are included = 𝐶12−2
𝑛−3
Return To Top Number of ways in which C, D and E are included = 𝐶12−3
 A guard team of 12 men is formed from a group of 𝑛 soldiers. It is
found that two particular soldiers 𝐴, 𝐵 are 3 times as often together
on guard team as three particular soldiers 𝐶, 𝐷, 𝐸. Then the value of
𝑛 is ____ .
JEE Mains 2019
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

(𝑛−2)
⇒ 𝐶(12−2) = 3 × (𝑛−3)𝐶(12−3)

⇒ (𝑛−2)
𝐶10 = 3 × (𝑛−3)𝐶9
𝑛−2 ! 𝑛−3 !
⇒ =3×
10! 𝑛−12 ! 9! 𝑛−12 !

𝑛−2
⇒ =3
10

⇒ 𝑛 = 32

Return To Top
 Key Takeaways

Maximizing 𝑛𝐶𝑟
𝑛
𝐶𝑟

𝑛 𝑛−1 𝑛+1
If 𝑛 is even 𝑟 = If 𝑛 is odd r = ,
2 2 2

Max 𝑛
𝐶𝑟 = 𝑛𝐶𝑛 Max 𝑛
𝐶𝑟 = 𝑛𝐶𝑛−1 or 𝑛𝐶𝑛+1
2 2 2

Return To Top
 A man wants to give as many number of parties as he can, out of his
20 friend by calling the same number of people but not the same
group. How should he call so that the:
(𝑖) Number of parties will be maximum ?
(𝑖𝑖) How many times each friend can be called ?
Solution:

Calling 𝑟 friends: Same number but different group

Calls 𝑟 friends: Number of ways = 20
𝐶𝑟
For maximum, 𝑟 = 20 (∵ 20 is even)
2
⇒ 𝑟 = 10

(𝑖) So he must call 10 friends for maximum parties

(𝑖𝑖) Number of ways in which each friend can be called = 20−1
𝐶10−1 = 19
𝐶9
∴ Fixing the one friend for party out of 20 friends, other 9 friends
can be called in 19𝐶9 ways

Return To Top
 A committee of 5 is to be chosen from a group of 9 people. Number
of ways it can be formed if two particular persons either serve
together or not at all and two other particular persons refuse to serve
with each other?
Solution:
Case (𝑖) AB Including
Number of ways = 7𝐶3 − 5𝐶1

Case (𝑖) AB not Including

Number of ways = 7𝐶5 − 5𝐶3
∴ Total number of ways = 7𝐶3 − 5𝐶1 + 7𝐶5 − 5𝐶3
= 35 − 5 + 21 − 10 = 41

Return To Top
 A cricket team consist of 11 players (𝐴 to 𝐾) is to be sent for batting. If
𝐴 wants to bat before 𝐽 and 𝐽 wants to bat after 𝐺, then find number of
batting orders if rest of players can go in any order

𝐴 𝐺 𝐽
Only 2 Method
𝐺 𝐴 𝐽

11
= 𝐶3 × 2! × 8!

Return To Top
 In a morse telegraphy, there are 4 arms & each arm is capable of
taking 5 distinct positions including the position on rest. Find the
number of different signals.

Number of signals that can be made = 54 − 1

Return To Top
 An 8-oared to be manned from a crew of 11, of whom 3 can only steer
but can not row. 8 can row but can not steer. In how many ways staff
can be arranged if two of the men can only row on left side?

3
𝐶1 × 1 × 4𝐶2 × 2! × 6!

Steering Left

Return To Top
 Key Takeaways

Number of ways of selection

• Number of ways to select 𝑟 things out of 𝑛 things 𝑛𝐶𝑟 .

• If 𝑛 things arranged in a line, then total number of ways to select 𝑟 things
out of 𝑛 things so that no two of are consecutive is 𝑛−𝑟+1
𝐶𝑟 ways.

• If 𝑛 things arranged in a line, then total number of ways to select

𝑟 consecutive things out of 𝑛 things is 𝑛 − 𝑟 + 1 ways.

Return To Top
 A train having 12 stations enroute has to be stopped at 4 stations,
Number of ways it can be stopped if no two of the stopping stations
are consecutive.

12−4+1
𝐶4 = 9𝐶4 ways 8 Station → 8 + 1 ways

9
𝐶4 ways

Return To Top
 Session 08
Arrangement of Alike
Objects

Return To Top
 The number of arrangements beginning with letter
‘𝐶’ that can be made by using letters of the word“MATHEMATICS” is:

Solution:
A 5016000
Alphabets in the given word: A, A, C, E, H, I, M, M, S, T, T

Total number of arrangements =

11! B 453600
2!×2!×2!

C C 226800

Total number of words beginning D

10! 56700
From ‘C’ = = 453600
2!×2!×2!

Return To Top
 Number of 7 digit number if sum of the digit is
𝑖 63 𝑖𝑖 62 𝑖𝑖𝑖 61 𝑖𝑣 60

Solution:

𝑖 When sum is 63 9 9 9 9 9 9 9 1 Way

7!
𝑖𝑖 When sum is 62 9 9 9 8 9 9 8 = 7 Ways
6!⋅1!

9 9 9 9 9 9 7
7! 7!
𝑖𝑖𝑖 When sum is 61 + Ways
9 9 9 9 9 8 8 6! ⋅ 1! 5! ⋅ 2!

Return To Top
 Number of 7 digit number if sum of the digit is
𝑖 63 𝑖𝑖 62 𝑖𝑖𝑖 61 𝑖𝑣 60

Solution:
9 9 9 9 9 9 6

𝑖𝑣 When sum is 60 9 9 9 9 9 8 7 7! 7! 7!
+ + = 84
6!⋅1! 5! 4!⋅3!

9 9 9 9 8 8 8

Return To Top
 Number of numbers greater than a million using 2,3,0,3,4,2,5 and
how many of them are divisible by 5 ?

Solution:
1 million = 1,000,000 (English System)
1 million has 7 digits
7! 6!
Total ways of formation of number greater than a million = − = 1080
2!×2! 2!×2!

Number divisible by 5

Case 1 Case 2 (Excluding the case where 0 is at first place)

0 + 5

− 0

Total ways of formation of number divisible by 5

6! 6! 5!
= + − = 330
Return To Top 2!×2! 2!×2! 2!×2!
 Find total number of ways selecting 5 letters of “ INTERNATIONAL”

Solution: II NNN AA TT O , R, E, L

D→ I, N, T, E, R, A, O, L 2A→ I I, T T, A A 3A→N N N

5D 8
𝐶5

3 D, 2 A 4
𝐶1 × 7𝐶3

2 A, 2 A, 1 D 4
𝐶2 × 6𝐶1

3 A, 2 D 1
𝐶1 × 7𝐶2

3 A, 2 A 1
𝐶1 × 3𝐶1

Total no. ways = 8𝐶5 + 4𝐶1 × 7𝐶3 + 1𝐶1 × 7𝐶2 + 4𝐶2 × 6𝐶1 + 1𝐶1 × 3𝐶1 = 256

Return To Top
 Find number of 5 letter words that can be formed using alphabets
present in the word ‘INDEPENDENCE’ ?

EEEE NNN DD I P C

D→I, N, D, E, P, C 2A→D D 3A→NNN 4A→EEEE

Selection of 5 letters:
5!
5 D → 6 𝐶5 × 5! 2 D +3 A → 5 𝐶2 × 2 𝐶1 ×
3!
3 D + 2 A → 5 𝐶3 × 3 𝐶1 ×
5! 5!
2! 2 A +3 A → 2 𝐶1 × 2 𝐶1 ×
2! 3!
1 D + 2 A+ 2 A 1 D +4 A → 5 𝐶1 × 1 𝐶1 ×
5!
5! 4!
4 3
→ 𝐶1 × 𝐶2 ×
2! 2!

Return To Top
 In how many ways interview of 10 people can be made
(𝑖) If Ram comes before Shyam.
(𝑖𝑖) if Ram comes before Shyam and Shyam comes before Mohan.
(𝑖𝑖𝑖) if Ram comes before Shyam and Mohan.

Solution: (𝑖) Ram comes before Shyam, hence two places

need to be selected

Total number of ways

10
= 𝐶2 × 1 × 8!

(𝑖𝑖) Ram comes before Shyam and Shyam comes before

Mohan, hence 3 places need to be selected

Total number of ways

10
= 𝐶3 × 1 × 7!

Return To Top
 In how many ways interview of 10 people can be made
(𝑖) If Ram comes before Shyam.
(𝑖𝑖) if Ram comes before Shyam and Shyam comes before Mohan.
(𝑖𝑖𝑖) if Ram comes before Shyam and Mohan.

Solution: (𝑖𝑖𝑖) Ram comes before Shyam and Mohan,

hence three places need to be selected

Total number of ways

10
= 𝐶3 × 2! × 7!

Return To Top
 How many ways interview schedules among 6 persons (3 child and 3
mother) can be arranged such that no child will be interviewed before
his mother.

Solution:
Mother Child

𝑀1 𝐶1

𝑀2 𝐶2

𝑀3 𝐶3

6!
Number of ways = 6 𝐶2 × 1 × 4 𝐶2 × 1 × 2 𝐶2 × 1 =
2!×2!×2!

Return To Top
 Number of arrangements in which 8 people can be arranged in
a row , if A & B comes together and ‘C’ comes always after ‘D’.

Solution:
7!×2!
Number of ways = = 7! AB C D
2!

7 6 5 4 3 2 1

Return To Top
How many different words can be formed using all letters of word
HONOLULU . If no alike letters are together.

Letters in the given word: H, O, O, U, U, L, L, N

H O N O L U L U
𝐴 𝐵
𝐴 = {Set of words having "𝑂𝑂" together}
𝐵 = {Set of words having "𝑈𝑈" together}
𝐶 = {Set of words having "𝐿𝐿" together}
8!
Total Arrangements= = 5040
2!⋅2!⋅2!
𝐶 8
7!
𝐴= = 1260
2!×2!

Similarly,
6!
𝐵= = 1260
2!×2!
6!
𝐶= = 1260
2!×2!
 How many different words can be formed using all letters of word
HONOLULU . If no alike letters are together.

H O O N L U U L
1 2 3 4 5 6 𝐴 𝐵
6!
Now, 𝐴 ∩ 𝐵 = = 360
2!
6!
Similarly, 𝐵 ∩ 𝐶 = = 360
2!
6!
&𝐶∩𝐴 = = 360
2!

Now, 𝐴 ∩ 𝐵 ∩ 𝐶 = 5! = 120 𝐶 8

H O O L L U U N
1 2 3 4 5

Return To Top
 How many different words can be formed using all letters of word
HONOLULU . If no alike letters are together.

H O N O L U L U
𝐴 𝐵
8!
Total Arrangements = = 5040 1 2
2!⋅2!⋅2!
4
Area (7) = {Set of words having "𝑂𝑂", "𝐿𝐿“, 7
"𝑈𝑈" together} 5 6

OO UU LL H N = 5! = 120 3

𝐶 8
Area (4 + 7) = {Set of words having "𝑂𝑂" and "𝑈𝑈“
together}

6!
OO UU LLHN = = 360
2!

Area 4 = 360 − 120 = 240

Return To Top
 How many different words can be formed using all letters of word
HONOLULU . If no alike letters are together.

Area (7) = 5! = 120

Area 4 = 240 𝐴 𝐵
1 2
Similarly, Area 5 = Area 6 = 240
4
Area 1 = words having only {𝑂𝑂} together
7
5 6
= OO UULLHN − Area (4,5,7)

7! 3
= − 240 − 240 − 120
2! ⋅ 2!
𝐶 8
= 1260 − 600 = 660 = Area 2 , Area (3)
Area 8 = Total − Area {1,2,3 ⋯ , 7}
= 5040 − 3 × 680 − 3 × 240 − 120
= 5040 − 2820 = 2220
Return To Top
 How many different words can be formed using all letters of word
HONOLULU . If no alike letters are together.

Short trick to solve this type of questions

Total ways, If no alike letters are together:

Total words − ෍ 𝑛 𝐴 − ෍ 𝑛 𝐴 ∩ 𝐵 + ෍ 𝑛 𝐴 ∩ 𝐵 ∩ 𝐶

8! 7! 7! 7! 6! 6! 6!
− + + − − − + 5!
2!×2!×2! 2!×2! 2!×2! 2!×2! 2! 2! 2!

= 5040 − (2700 + 120)

= 5040 − (1260 − 360 + 120)

= 2220

Return To Top
 Key Takeaways

Division and distribution

Things to be distributed Method

If 5 different books are to be Division into group method,

distributed in 3 different boxes then distribute

If 5 different books are to be Division into group method,

distributed in 3 alike boxes then distribute by one way

If 10 alike coins are to

Beggar’s method
3 different beggars

If 12 alike coins in 3 alike

Just Group formation
boxes

Return To Top
 Key Takeaways

Division and distribution

In how many ways 5 things can 5! 5!

5
be divided in 2 groups of 3 & 2? 3!×2! 𝐶3 ⋅ 2 𝐶2 =
3! × 2!

In how many ways 10 things can 10! 10 10!

be divided in 3 groups of4, 5 & 1? 4!×5!×1!
𝐶4 ⋅ 6 𝐶4 ⋅ 1 𝐶1 =
4!×5!×1!

In how many ways 12 things can 12! 12

𝐶6 ⋅ 6 𝐶3 ⋅ 3 𝐶2 ⋅ 1 𝐶1
be divided in 4 groups of 6, 3, 2 & 1? 6!×3!×2!×1!

𝑇𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑇ℎ𝑖𝑛𝑔𝑠

Total number of ways of division=
𝐹𝑎𝑐𝑡𝑜𝑟𝑖𝑎𝑙 𝑜𝑓 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑡ℎ𝑖𝑛𝑔𝑠 𝑖𝑛 𝑒𝑎𝑐ℎ 𝑔𝑟𝑜𝑢𝑝

Return To Top
 Key Takeaways

Division and distribution

• If there is repetition in Denominator, then multiply the Denominator by

factorial of number of times of repetition

In how many ways 5 things can 5! 1

×
be divided in 3 groups of 2,2,1? 2!×2!×1! 2!

In how many ways 10 things can 10! 1

×
be divided in 3 groups of 4,4,2? 4!×4!×2! 2!

In how many ways 12 things can 12! 1 1

× ×
be divided in 4 groups of 4, 4, 2 & 2? 4!×4!×2!×2! 2! 2!

Return To Top
 Key Takeaways

Division and distribution

• If there is repetition in Denominator, then multiply the Denominator by

factorial of number of times of repetition

In how many ways 12 things can 12!

be divided in 6 groups of 2,2,2. .? 2! 6 ×6!

In how many ways 100 things can be 100!

divided in 50 groups of 2,2,2,2,2 … .? 2! 50 × 50!

Return To Top
 Session 09
Beggar's Method

Return To Top
 Number of ways in which 4 people can be divided into 2 groups of
size 3 and 1

1 3

4!
Number of ways = =4
3!⋅1!

Return To Top
 Number of ways in which 4 people can be divided into 2 groups of
size 3 and 1

Return To Top
 Number of ways in which 4 people can be divided into 2 groups of
equal size

2 2

4! 1
Number of ways = ⋅ =3
2!⋅2! 2!

Return To Top
 Number of ways in which 4 people can be divided into 2 groups of
equal size

Return To Top
 Key Takeaways

Division and distribution

𝑚+𝑛
• Division of 𝑚 + 𝑛 distinct objects into
two groups of the size 𝑚 and 𝑛.

𝑚 𝑛

𝑚+𝑛 !
Number of ways: 𝑚+𝑛𝐶𝑚 × 𝑛𝐶𝑛 = 𝑚+𝑛
𝐶𝑚 =
𝑚!×𝑛!

• Distribution of 𝑚 + 𝑛 objects between two persons:

𝑚+𝑛 !
Number of ways: × 2!
𝑚!×𝑛!

Return To Top
 Key Takeaways

Division and distribution

• Division of 𝑚 + 𝑛 + 𝑝 distinct objects into three 𝑚+𝑛

groups of the size 𝑚, 𝑛, and 𝑝 𝑚 ≠ 𝑛 ≠ 𝑝 :

𝑚 𝑛 𝑛

𝑚+𝑛+𝑝 !
Number of ways: 𝑚+𝑛+𝑝
𝐶𝑚 × 𝑛+𝑝
𝐶𝑛 =
𝑚!×𝑛!×𝑝!

• Distribution of 𝑚 + 𝑛 + 𝑝 distinct objects among𝑚+𝑛+𝑝

three persons
!
if they get 𝑚, 𝑛, and 𝑝 objects Number of ways: × 3!
𝑚!×𝑛!×𝑝!

Return To Top
 Key Takeaways

Division and distribution

• Division of 𝑥1 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑛 into 𝑛 groups of size 𝑥1, 𝑥2, 𝑥3 , ⋯ , 𝑥𝑛

𝑥1 ≠ 𝑥2 ≠ 𝑥3 ≠ ⋯ ≠ 𝑥𝑛

𝑥1 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑛

𝑥1 𝑥2 ⋯⋯ 𝑥𝑛

𝑥1 +𝑥2 +𝑥3 +⋯+𝑥𝑛 !

Number of ways=
𝑥1 ! × 𝑥2 ! × 𝑥3 ! × ⋯ × 𝑥𝑛 !

Return To Top
 Key Takeaways

Division and distribution

• 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
3𝑛 !
is
3! 𝑛!∙𝑛!∙𝑛!

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

𝑘𝑛 !
𝑘! 𝑛! 𝑘

Return To Top
 6 different books are to be distributed between 𝑅, 𝑆 and 𝐺 if each
child gets at least 1 book.
Solution:

Distribution of books into groups

Group-1 Group-2 Group-3

1 2 1

1 2 2

4 2 3

6! 6! 6!
Total number of ways = + + × 3!
4!×1!×1!×2! 2! 3 ×3! 1!×2!×3!

Return To Top
 In how many ways can a pack of 52 cards be
𝑖) Divided in 4 groups of 13 cards each
𝑖𝑖) Distributed equally among 4 players
𝑖𝑖𝑖) Divided in 4 sets of 17 cards for 3 groups & 1 card for 1 group.

Solution:

𝑖)
52!
=
52! 52
13!×13!×13!×13!×4! 13! 4 ×4!

13 13 13 13
52! 52!
𝑖𝑖) × 4! =
13!×13!×13!×13!×4! 13! 4
52
52! 52!
𝑖𝑖𝑖) =
17!×17!×17!×3!×1! 17! 3 ×3! 17 17 17 1

Return To Top
 Number of ways in which 30 soldiers can be deputed equally to 3
equal places

Solution:
A 30!
30! 10!
Total number of ways = × 3!
10!×10!×10!×3!

=
30!
B 30!
10!×10!×10! 10! 3
30

C 30!
10 10 10 10! 2

D 30!
3!⋅ 10! 3

Return To Top
 A rack has 5 pair of shoes. Number of ways in which 4 shoes can be
chosen from it so that there is no complete pair.

Solution: Method (𝑖)

L R
Number of ways
L R
= (Selection of 4 L from 5 pairs + Selection of 3 L from 5 L R
pairs × Selection of 1 R from 2 left out pairs + ⋯ +
Selection of 4 R from 5 pairs) L R
L R
5
𝐶4 + 5 𝐶3 × 2 𝐶1 + 5 𝐶2 × 3 𝐶2 + 5 𝐶1 × 4 𝐶3 + 5 𝐶0 × 5 𝐶4

= 5 + 10 × 2 + 10 × 3 + 5 × 4 + 5

= 5 + 20 + 30 + 20 + 5

= 80

Return To Top
 A rack has 5 pair of shoes. Number of ways in which 4 shoes can be
chosen from it so that there is no complete pair.

Solution: Method (𝑖𝑖)

Selecting any on of these L and R in 2𝐶1

L L L L L L L L L L

R R R R R R R R R R

Number of ways = 5𝐶4 × 2𝐶1 × 2𝐶1 × 2𝐶1 × 2𝐶1 = 80

Selection of 4 pairs out of 5 pairs

Return To Top
 In how many ways can seven different toys be arranged in 4
identical boxes so that each box contains atleast one toy.

Solution: Since, boxes are identical, hence only one ways of distribution will occur

4 1 3

1 2 2
7 Toys 7 Toys 7 Toys
1 2 1

1 2 1

7! 7! 7!
Total number of ways = 3 ×3! + 3 ×3! + × 1!
4!× 1! 1!× 2! 3!× 1! 2 ×2!×2!

Return To Top
 Key Takeaways

Note:

• When different objects are to be distributed into alike / identical

boxes then we follow the technique of - first division of objects by
using grouping method and then distribution using one way (as
boxes are identical).

Return To Top
 Key Takeaways

Beggar’s Method

• Objective: Distributing 10 coins among 3 beggars

1st beggar 2nd beggar 3rd beggar

Steps:
➢ Inserting 𝑝 − 1 = 2 fake coins in random
➢ Giving the first beggar all the coins to the left of the first fake coin
➢ Giving the second beggar all the coins to the left of the second
fake coin
➢ Giving the remaining to the 3rd beggar

Analyzation: Distribution of 10 + 2 coins among 2 beggars

Return To Top
 Key Takeaways

Beggar’s Method

• Objective: Distributing 10 coins among 3 beggars

1st beggar 2nd beggar

Analyzation: Distribution of 10 + 2 coins among 2 beggars

Calculation: Number of ways of selecting 2 beggars for distribution of 10 + 2 coins
10+2 10+3−1
= 𝐶2 = 𝐶3−1

Return To Top
 Key Takeaways

Beggar’s Method (Generalization)

• In general, Number of ways of distributing 𝑛 alike objects among 𝑝 groups

1. Insert 𝑝 − 1 coins
2. To be distributed among 𝑝 − 1 people
3. Last beggar will get what’s left
4. Total coin that needs to be distributed = 𝑛 + 𝑝 − 1

Total Number of ways = 𝑛+𝑝−1

𝐶𝑝−1

• In this method of distribution, the beggar can get one, none or

more than one coins

Return To Top
 Number of ways in which 𝑛 identical coins can be distributed
among 𝑝 beggars such that each can receive none, one or more
number of coins

Solution:
Number of fake coins need to introduce = 𝑝 − 1

Number of ways= 𝑛+(𝑝−1)

𝐶𝑝−1

Return To Top
 Number of ways in which 𝑛 identical coins can be distributed
among 𝑝 beggars such that each can receive atleast one coin is

Solution: We have, 𝑛 coins and 𝑝 beggars

Each one must receive at least one coin

Step 1: First give 1 coin to each beggar

Step 2: Get remaining coins, which is 𝑛 − 𝑝 here

Step 3: Now introduce 𝑝 − 1 fake coins, then total coins will be 𝑛 − 𝑝 + 𝑝 − 1 = 𝑛 − 1

Step 4: Now distribute all coins using beggar’s method

So, the total number of ways= 𝑛−1

𝐶𝑝−1

Return To Top
 Number of ways in which 10 identical coins can be distributed
among 4 boys such that each can receive none , one or more is ….. ?

Solution: Number of coins 𝑛 = 10

Number of boys 𝑝 = 4

Number of ways= 10+(4−1)

𝐶4−1 = 13
𝐶3

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

Solution: Given, 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 10

4 Beggars 10 Coins

𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0, 𝑥4 ≥ 0

Number of ways= 10+(4−1)

𝐶4−1 = 13
𝐶3

Return To Top
 Find the number of natural solutions of 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 10

Solution: Given, 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 10

4 Baggers 10 Coins

𝑥1 > 0, 𝑥2 > 0, 𝑥3 > 0, 𝑥4 > 0

Give one coin to each bagger, then remaining coins= 10 − 4 = 6
Number of ways= 6+(4−1)
𝐶4−1 = 9 𝐶3

Return To Top
 Find the number of integral solutions of 𝑥 + 𝑦 + 𝑧 + 𝑡 = 29 ,
If 𝑥 ≥ 1, 𝑦 ≥ 2, 𝑧 ≥ 3, 𝑡 ≥ 0

Solution: Given conditions:

𝑥 ≥1⇒𝑥−1≥0 𝑦 ≥2⇒𝑦−2≥0 𝑧≥1⇒𝑧−1≥0

𝑋1 𝑋2 𝑋3

𝑥 + 𝑦 + 𝑧 + 𝑡 = 29

⇒ 𝑥 − 1 + 𝑦 − 2 + 𝑧 − 3 + 𝑡 = 29 − 1 − 2 − 3

⇒ 𝑋1 + 𝑋2 + 𝑋3 + 𝑡 = 23

Total number of ways= 23+(4−1)

𝐶4−1 = 26
𝐶3

Return To Top
 Find all non-negative integral solutions 𝑥 + 𝑦 + 𝑧 ≤ 10

Solution: A variable 𝑡(𝑡 ≥ 0) is introduced here, now equality will hold

𝑥 + 𝑦 + 𝑧 + 𝑡 = 10

𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0, 𝑡 ≥ 0

Number of ways = 10+(4−1)

𝐶4−1 = 13
𝐶3

Return To Top
 Find all non-negative integral solutions 𝑥 + 𝑦 + 𝑧 ≤ 6

Solution:
A variable 𝑡(𝑡 ≥ 0) is introduced here, now equality will hold

𝑥+𝑦+𝑧+𝑡 =6
𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0, 𝑡 ≥ 0

Number of ways = 6+(4−1)

𝐶4−1 = 9 𝐶3

Return To Top
 Find all non-negative integral solutions 𝑥 + 𝑦 + 𝑧 < 6

Solution: A variable 𝑡(𝑡 ≥ 1) is introduced

here, now equality will hold
𝑥+𝑦+𝑥+𝑡−1=5
𝑥+𝑦+𝑧+𝑤 =5 [Where 𝑡 − 1 = 𝑤]
𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0, 𝑤 ≥ 0
Number of ways = 5+(4−1)
𝐶4−1 = 8 𝐶3

Return To Top
 Session 10
Circular Permutations

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 =
𝑛 𝑛 𝑛 𝑛
𝐶0 + 𝐶1 + ⋯ 𝐶𝑛

• The total number of𝑛 ways 𝑛of selecting at least one thing out of 𝑛
distinct things is 2 − 1 = 𝑛 𝑛
𝐶0 + 𝐶1 + ⋯ 𝐶𝑛 − 𝐶0 𝑛

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 out of 𝑛 similar
things is 𝑛.

Return To Top
 If 5 objects of 𝑝 type, 4 objects of 𝑞 type & 3 objects of 𝑟 type are
there, then number of selection consisting at least one 𝑝 type
object is

Solution: Total number of ways = 25 − 1 24 (23 )

= 25 − 1 27

Return To Top
 Key Takeaways

All possible selections

Case 3:

• If there are 𝑝 similar things of one type, 𝑞 similar things of second type and 𝑟
similar things of third type then number of ways of selecting at least one thing is
𝑝+1 𝑞+1 𝑟+1 −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

Solution:

Total number of ways = 10

𝐶1 + 10
𝐶2 + ⋯ 10 𝐶10
= 210 − 10
𝐶0
= 210 − 1

Return To Top
 If 𝑎3 𝑏 2 ≡ 3 alike 𝑎, 2 alike 𝑏, then total number of ways to select at
least one thing.

Solution: Total number of ways = 3 + 1 2 + 1 − 1

= 11

Return To Top
 Key Takeaways

Model based on divisors

• If 12 = 2𝑥 ⋅ 3𝑦 then number of divisors= (𝑥 + 1)(𝑦 + 1)

• Sum of divisors= (20 + 21 + ⋯ 2𝑥 )(30 + 31 + ⋯ 3𝑦 )
G.P. G.P.

Return To Top
 Consider a number 75600 then find:
(𝑎) Total number of divisor (𝑏) Proper divisor
(𝑐) Number of even divisor (𝑑) Number of odd divisor
(𝑒) Number of divisor divisible by 35 (𝑓) Number of divisor divisible by 12

Solution: 𝑁 = 75600 = 24 × 33 × 52 × 71

(𝑎) Total divisor = (4 + 1)(3 + 1)(2 + 1)(1 + 1)

= 120

(𝑏) Proper divisor = 120 − 2 = 118

= 96

(𝑐) Number of even divisor

= (4) × (3 + 1)(2 + 1)(1 + 1) (20 needs to be excluded)

(𝑑) Number of odd divisor

= (1) × (3 + 1)(2 + 1)(1 + 1)(21 , 22 , 23 , 24 need to be excluded)

Return To Top = 24
 Consider a number 75600 then find:
(𝑎) Total number of divisor (𝑏) Proper divisor
(𝑐) Number of even divisor (𝑑) Number of odd divisor
(𝑒) Number of divisor divisible by 35 (𝑓) Number of divisor divisible by 12

Solution: 𝑁 = 75600 = 24 × 33 × 52 × 71

(𝑒) we know 35 = 51 × 71

Number of divisor divisible by 35 = (4 + 1)(3 + 1)(2)(1)

= 40
(𝑓) we know 12 = 31 × 22

Number of divisor divisible by 12

= (3)(3)(2 + 1)(1 + 1) (20 , 21 & 30 should be excluded)
= 54

Return To Top
 Key Takeaways

Note:

• Let 𝑁 be a positive integer and 𝑁 = 𝑝1𝑥 1 𝑥 𝑥

⋅ 𝑝2 2 ⋅ 𝑝3 3 ⋯
Where 𝑝1 , 𝑝2 , 𝑝3 , ⋯ are distinct prime numbers and 𝑥1 , 𝑥2 , 𝑥3 , ⋯ ∈ ℕ
➢ Number of divisors of 𝑁 = 𝑥1 + 1 𝑥2 + 1 𝑥3 + 1 ⋯
𝑥 𝑥
➢ Sum of all divisors = 𝑝10 + 𝑝11 + 𝑝12 + ⋯ 𝑝1 1 𝑝20 + 𝑝21 + 𝑝22 + ⋯ 𝑝2 2 ⋯
𝑥 +1 𝑥 +1
𝑝1 1 −1 𝑝2 2 −1
= ⋯
𝑝1 −1 𝑝2 −1

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

equal to
1
❖ [ 𝑥1 + 1 𝑥2 + 1 𝑥3 + 1 ⋯ ] , If 𝑁 is not a perfect square
2
1
❖ [ 𝑥1 + 1 𝑥2 + 1 𝑥3 + 1 ⋯ + 1] , If 𝑁 is a perfect square
2

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 a product of two co-prime factors is equal to 2𝑛−1

Return To Top
 Key Takeaways

Circular permutation

• Number of ways to arrange 𝑛 things in a circle: 𝑛−1 !

Return To Top
 Key Takeaways

Circular permutation

• If positional places are marked, then circular arrangements can be

treated as linear arrangements.

𝑛−1

𝑛
1 2 3

Return To Top
 Key Takeaways

Circular permutation

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

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

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

a time is 𝐶𝑟 ⋅ 𝑟 − 1 !

• In the above case if clockwise and anticlockwise directions

1
are are taken as
not different then number of circular permutation is 𝑛
𝐶𝑟 ⋅ 𝑟 − 1 !
2

Return To Top
 Key Takeaways

Circular permutation

Circular(𝑛 objects)

Take 𝑛 objects at a time Take 𝑟 objects (out of 𝑛) at a time

ACW ≠ CW ACW = CW ACW ≠ CW ACW = CW

𝑛−1 ! 𝑛−1 ! 𝑛 𝑛 𝑟−1 !
𝐶𝑟 × 𝑟 − 1 ! 𝐶𝑟 ×
2 2

Return To Top
 The number of way in which 5 boys and 4 girls can be seated at a round
table, if
𝑖 there is no restriction (𝑖𝑖) all the girls are together
(𝑖𝑖𝑖) all the girls are not together (𝑖𝑣) no two girls are together

Solution:
𝑖 9 Person can be arranged in 9 − 1 ! = 8! ways

𝑖𝑖 Since, all the girls are together, hence consider all girls a unit
Total units= 6
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!

Return To Top
 The number of way in which 5 boys and 4 girls can be seated at a round
table, if
𝑖 there is no restriction (𝑖𝑖) all the girls are together
(𝑖𝑖𝑖) all the girls are not together (𝑖𝑣) no two girls are together

𝑖𝑖𝑖 Required number of ways = Total number of ways−Number of ways in

which girls are together
= 8! − (5! × 4!)
𝑖𝑣 We can arrange 5 boys first in 4! ways
There will be 5 gaps to arrange 4 girls
Now, total number of ways= 4! × 5 𝑃4

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
And clockwise and anticlockwise directions are same is × 𝑛 𝐶𝑟 ⋅ 𝑟 − 1 !
2
1
Required number of ways= × 18
𝐶12 ⋅ 11!
2

Return To Top
 Key Takeaways

Selection of non-consecutive place of circle

• Let 𝑛 element are to be placed in circle. Let 𝑟 no. of elements are to be placed at
non-consecutive position.

Number of ways in which non-consecutive position are to be

Chosen on circle= 𝑛−𝑟+1

𝐶𝑟 − 𝑛−𝑟−1
𝐶𝑟−2

Return To Top
 How many hexagons are constructed by joining vertices of
quindecagon (15 - gon/sides). If none of the sides of any
hexagon coincides with quindecagon.

Number of ways(no. of hexagon) = 𝑛−𝑟+1

𝐶𝑟 − 𝑛−𝑟−1
𝐶𝑟−2
10
= 𝐶6 − 8 𝐶4

Return To Top
 Key Takeaways

Derangement formula:

•𝐷
𝑛! 𝑛! 𝑛! 𝑛! 𝑛!
𝑛 = 𝑛! − + − + − +⋯
1! 2! 3! 4! 5!

Return To Top
 Three letters are to be kept in 3 directed envelops. Find
number of ways they can be placed if none of the letter goes
into its own envelops.

Solution: Number of ways = 2

L1 E1 L1 E1

L2 E2 L2 E2

L3 E3 L3 E3

Return To Top
 Four letters are to be kept in 4 directed envelops. Find number of ways
they can be placed if none of the letter goes into its own envelops

Solution: Total ways = All Right OR 3R+1W OR 2R+2W OR 1R+3W OR 4W=?

4 4
1 0 𝐶2 × 1 × 1 𝐶1 × 2

Total number of arrangements= 4!

Now,
4! = 1 + 0 + 4 𝐶2 × 1 × 1 + 4 𝐶2 × 1 × 2 + 𝐷(4)
𝐷 4 = 4! − (1 + 0 + 4 𝐶2 × 1 × 1 + 4 𝐶1 × 2)
= 24 − 15 = 9
𝑛! 𝑛! 𝑛! 𝑛! 𝑛!
Using Formulae, 𝐷 𝑛 = 𝑛! − + − + − +⋯
1! 2! 3! 4! 5!
4! 4! 4! 4!
⇒ 𝐷 4 = 4! − + − + = 12 − 4 + 1 = 9
1! 2! 3! 4!
Return To Top
 THANK
YOU

Return To Top
Return To Top