CONTENT

Forming Numbers

Arranging Digits
Examples
Example
Example
How many 3-digit numbers can be formed using the digits 1, 2, 3, 4, 5?
(a) Repetition of digits is allowed.

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧

𝟓 𝟓 𝟓

𝟏 𝟏 𝟏
𝟐 𝟐 𝟐
𝟑 − 𝒅𝒊𝒈𝒊𝒕𝒏𝒖𝒎𝒃𝒆𝒓𝒔 𝟑 𝟑 𝟑 𝑹𝒆𝒑𝒆𝒕𝒊𝒕𝒊𝒐𝒏  𝒊𝒔  𝒂𝒍𝒍𝒐𝒘𝒆𝒅
𝟒 𝟒 𝟒
𝟓 𝟓 𝟓
Example
How many 3-digit numbers can be formed using the digits 1, 2, 3, 4, 5?
(b) Repetition of digits is NOT allowed.

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
𝟑 𝟒 𝟓

𝟏
𝟐 𝟐
𝟑 − 𝒅𝒊𝒈𝒊𝒕𝒏𝒖𝒎𝒃𝒆𝒓𝒔 𝟑 𝟑 𝟑 𝑹𝒆𝒑𝒆𝒕𝒊𝒕𝒊𝒐𝒏  𝒊𝒔  𝒂𝒍𝒍𝒐𝒘𝒆𝒅
𝟒 𝟒 𝟒
𝟓 𝟓 𝟓
Example
How many 3-digit odd numbers can be formed using the digits 1, 2, 3, 4, 5, 6?
(a) Repetition of digits allowed

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
𝟔 𝟔 𝟑

𝟏 𝟏 𝟏
𝟐 𝟐 𝟑
𝟑 𝟑 𝟓
𝟑 − 𝒅𝒊𝒈𝒊𝒕𝒏𝒖𝒎𝒃𝒆𝒓𝒔 𝑹𝒆𝒑𝒆𝒕𝒊𝒕𝒊𝒐𝒏  𝒊𝒔  𝒂𝒍𝒍𝒐𝒘𝒆𝒅
𝟒 𝟒
𝟓 𝟓
𝟔 𝟔
Example
How many 3-digit odd numbers can be formed using the digits 1, 2, 3, 4, 5, 6?
(b) Repetition of digits NOT allowed

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
𝟒 𝟓 𝟑

𝟐 𝟐 𝟏
𝟒 𝟑 𝟑
𝟑 − 𝒅𝒊𝒈𝒊𝒕𝒏𝒖𝒎𝒃𝒆𝒓𝒔 𝟓 𝟒 𝟓 𝑹𝒆𝒑𝒆𝒕𝒊𝒕𝒊𝒐𝒏  𝒊𝒔  𝐍𝐎𝐓 𝒂𝒍𝒍𝒐𝒘𝒆𝒅
𝟔 𝟓
𝟔
Example
How many numbers divisible by 5 and lying between 4000 and
5000 can be formed from 4, 5, 6, 7, 8?
Repetition of digits is NOT allowed.

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Example
How many numbers are there between 100 and 1000 which
have exactly one of their digit as ‘7’.
Repetition of digits other than ‘7’ is NOT allowed.

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
 CONTENT

Definition of Permutation and Combination

Examples
Example
Example
In how many ways 5 girls can occupy 3 chairs, such that each
chair is occupied by only one girl?

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑮𝟏 𝑮𝟐 𝑮𝟑 𝑮𝟒 𝑮𝟓

𝐺 𝐺 𝐺
𝐺 𝐺
𝐺 𝑆𝑜,   𝑐𝑜𝑟𝑟𝑒𝑐𝑡  𝐴𝑛𝑠𝑤𝑒𝑟
𝐺 𝐺 = 5  ·  4  ·  3
𝐺 =  60
𝐺 𝐺
𝐺
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑮𝟏 𝑮𝟐 𝑮𝟑 𝑮𝟒 𝑮𝟓

𝐺 𝐺 𝐺
𝐺 𝐺
𝐺 𝑆𝑜,   𝑐𝑜𝑟𝑟𝑒𝑐𝑡  𝐴𝑛𝑠𝑤𝑒𝑟
𝐺 𝐺 = 5  ·  4  ·  3
𝐺 =  60
𝐺 𝐺
𝐺
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑮𝟏 𝑮𝟐 𝑮𝟑 𝑮𝟒 𝑮𝟓

𝐺 𝐺 𝐺
𝐺 𝐺
𝐺 𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
𝐺 𝐺 = 𝟓  ·  𝟒  ·  𝟑
𝐺 =  𝟔𝟎
𝐺 𝐺
𝐺

𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
= 𝟓  ·  𝟒  ·  𝟑
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑮𝟏 𝑮𝟐 𝑮𝟑 𝑮𝟒 𝑮𝟓

𝐺 𝐺 𝐺
𝐺 𝐺
𝐺 𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
𝐺 𝐺 = 𝟓  ·  𝟒  ·  𝟑
𝐺 =  𝟔𝟎
𝐺 𝐺
𝐺

𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
= 𝟓  ·  𝟒  ·  𝟑
𝟓 𝑮𝒊𝒓𝒍𝒔 3 Chairs
(Think 5-3 = 2)
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑮𝟏 𝑮𝟐 𝑮𝟑 𝑮𝟒 𝑮𝟓

𝐺 𝐺 𝐺
𝐺 𝐺
𝐺 𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
𝐺 𝐺 = 𝟓  ·  𝟒  ·  𝟑
𝐺 =  𝟔𝟎
𝐺 𝐺
𝐺

𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
= 𝟓  ·  𝟒  ·  𝟑
𝟓 𝑮𝒊𝒓𝒍𝒔 3 Chairs
(Think 5-3 = 2)

5-3
Example
In how many ways 3 girls can occupy 5 chairs, such that each
chair is occupied by only one girl?
𝑪𝟏 𝑪𝟐 𝑪𝟑 𝑪𝟒 𝑪𝟓

3𝐺𝑖𝑟𝑙𝑠
G1, G2, G3

𝑮𝟏 𝑮𝟐 𝑮𝟑

𝐶 𝐶 𝐶 𝑺𝒐,   𝒄𝒐𝒓𝒓𝒆𝒄𝒕  𝑨𝒏𝒔𝒘𝒆𝒓
𝐶 𝐶 𝐶 = 𝟓  ·  𝟒  ·  𝟑
=  𝟔𝟎
𝐶 𝐶 𝐶
𝐶 𝐶
𝐶
Permutation Arrangement

Recall the previous problems No. of ways

1. Arranging 5 girls on 3 chairs 5•4•3
2. Arranging 3 girls on 5 chairs 5•4•3
5•4•3            
   
(Think 5-3 = 2)
5-3

No. of No. of
Arrangements Arrangements
5 girls on 3 chairs 3 girls on 5 chairs
 𝒏 − 𝒈𝒊𝒓𝒍𝒔 r-chairs 𝒓 − 𝒈𝒊𝒓𝒍𝒔 n-chairs

Number of arrangements =
Combination Selection

Recall the previous problems No. of ways

Arranging 5 girls on 3 chairs 5•4•3
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc a b c
a c b
b a c
b c a
c a b
c b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc 𝟑! a b c
a c b
b a c
b c a
c a b
c b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc 𝟑! a b d
2 abd a d b
b a d
b d a
d a b
d b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc 𝟑! a b d
2 abd 𝟑! a d b
b a d
b d a
d a b
d b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc 𝟑! a b e
2 abd 𝟑! a e b
3 ab e b a e
b e a
e a b
e b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements C1 C2 C3

1 a bc 𝟑! a b e
2 abd 𝟑! a e b
3 ab e 𝟑! b a e
b e a
e a b
e b a
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements

1 a bc 𝟑!
2 abd 𝟑!
3 ab e 𝟑!
- - -
- - -
- - -
𝒙 - 3!

Total Arrangements =
 5 girls on 3 chairs

a b c d e
Only 3 girls sit at a time

Count Case Arrangements

1 a bc 𝟑!
2 abd 𝟑!
3 ab e 𝟑!
- - -
- - -
- - -
𝒙 - 3!

Total Arrangements = × 3! 𝟓
𝟑
Total Arrangements = × 3! 𝟓
𝟑

𝟓!
3! 𝟓 𝟑 !
Number of combinations of ‘r’ things out of ‘n’ different things

𝒏
𝒓
CONTENT

Rank Problem/Dictionary

Problem of words and numbers

Examples
Example
Example

If the letters of the word “TOUGH” are arranged to form words meaning
or without meaning and all the words thus listed according to the
alphabetical order as followed in a dictionary then what will be the rank
(position) of the word “TOUGH” in the newly formed dictionary?

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
ABCDEFGHIJKLMNOPQRSTUVWXYZ

TOUGH:-
T, O, U, G, H
Example

If the letters of the word “TOUGH” are arranged to form words meaning
or without meaning and all the words thus listed according to the
alphabetical order as followed in a dictionary then what will be the rank
(position) of the word “TOUGH” in the newly formed dictionary?

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
ABCDEFGHIJKLMNOPQRSTUVWXYZ

TOUGH:-
T, O, U, G, H
H, G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅.

𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
2. G H O U T
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
2. G H O U T
3. G H T U O
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
2. G H O U T
3. G H T U O
4. G H T O U
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
2. G H O U T
3. G H T U O
4. G H T O U
5. G H U O T
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U

𝑻𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝟓! = 𝟏𝟐𝟎 𝒘𝒐𝒓𝒍𝒅𝒔 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒆𝒅. 𝒊. 𝒆. , 𝟏𝟐𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔.

𝒍𝒆𝒕 𝒖𝒔 𝒄𝒓𝒆𝒂𝒕𝒆 𝒕𝒉𝒆 𝒅𝒊𝒄𝒕𝒊𝒐𝒏𝒂𝒓𝒚

𝑹𝒂𝒏𝒌 Word
1. G H O T U
2. G H O U T
3. G H T U O
4. G H T O U
5. G H U O T
6. G H U T O
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
Rank of TOUGH

ABCDEFGHIJKLMNOPQRSTUVWXYZ
TOUGH:- T, O, U, G, H G, H, O, T, U
Rank of MEHUL

ABCDEFGHIJKLMNOPQRSTUVWXYZ
Rank of PUSAN

ABCDEFGHIJKLMNOPQRSTUVWXYZ
Example

How many 4-lettered words can be formed using only the letters of the
word “DAUGHTER” if each word has to include ‘G’ ?

𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧
KEY TAKEAWAYS

Practice Rank Problem

KEY TAKEAWAYS

Enjoy application of Fundamental Counting.

Practice Rank Problem

𝒏
𝒓