Notes For Permutation and Combination

Intro To Premutation And Combination:

Permutation and combination are all about counting and arrangements made from a certain group
of data. You have a counting situation which requires formulas. If count is small you do not
require formulas but if count is large you require formulas for counting.
For example:
If you have to count 1 to 10, you can easily do this, but if you have to count upto 10255 it will
require formulas.

Permutation: ​In mathematics, permutation relates to the act of arranging all the things of a set
into some sequence or order.

Combination: ​Combinations can be defined as the number of ways in which ‘r’ things at a time
can be selected from amongst ‘n’ things available for selection.

This chapter gives you counting situations which are mapped to the use of certain formulas and
you have to know which formula is used in which situation.

Every P & C question will always end with asking you to “Find the numbers of ways?’ doing
something. Whenever you identify that the question is a P & C question, you 1st ask yourself if it
is a selection question, distribution question, or it is an arrangement question then you go with an
appropriate formula.

This chapter splitted into 3 parts:

1.​ Selection ​2.​ Distribution ​ 3.​ Arrangement

Selection:
Selection can be defined as the number of ways in which r things at a time can be selected from
amongst n things available for selection.
Let say select two people for 4 people A,B,C,D and count the number of different ways i which
one can make the selection.
Count physically;
1st selection is AB, 2nd selection is AC, 3rd selection is AD, 4th selection is BC, 5th selection is
BD, 6th selection is CD.
Hence the number of possible selections = 6.
But if you have to select 8 people from the 16 people. You can not physically count the number
of selections because there are so many possible cases which are not possible to visualize. Hence
in order to handle this situation you need the ​nCr​ formula.

This formula tells us if you have ‘n’ “distinct” objects from them select ‘r’ objects and you want
to count the number of selections.

Thus, ​nCr = n! /[r! (n–r)!]​ ; where n ≥ r.

Example 1:
Selection of 2 people from 4 people.
Here n = 4 and r = 2
According to formula, 4C2 = 4!/2! × 2! = 6 ways.

Example 2:
Selection of 8 objects from 16 objects.
Here n = 8 and r = 16
According to formula, 16C8 = 16!/8! × 8!ways.

Factorial: ​ ​T​he product of an integer and all the integers below it.ie 5! = 5 × 4 × 3 × 2 × 1 = 120.
n! = 1 × 2 × 3 × ……………. × n ​OR ​n × (n-1) × (n-2) × …………….. × 3 × 2 × 1

NOTE : Factorial only defined for the whole number.

# value of 0! Is always 1.
# 7! Can be written as 7 × 6! Or 7 × 6 × 5!
8×7×6 7×6
# 8C3 = 3×2×1 = 56. And 7C2 = 2×1 = 21.

Here in the denominator we just talk about the factorial of r and in the numerator start with 8 and
take terms equal to ‘r’.

# ​nCr = nC(n-r).​ This formula comes from the following logic,

Number of selection of ‘r’ things from ‘n’ distinct things ≡ ​number of ways of rejecting (n-r)
things for ‘n’ things.
Let say form 7 people you ask to select 5.
Select 5 from 7 ≡ reject 2 from 7

Eg. 16C13 = 16C3 if the value of ‘r’ is large then use the formula ​nCr = nC(n-r).

# ​Value of ​nC0 = 1 ​and ​nC1 = n.

Questions on Selection

Case1:​ A,B,C,D are 4 ‘distinct’ people and you have to select 2 people.
Case2:​ 4 ‘identical’ objects and you have to select 2 objects.

In both cases we are talking about the number of selections. In 1st case the selection process is
differ at each step i.e. AB,AC,AD,BC,BD and CD. In the 2nd case there is only one selection
because objects are identical.

NOTE: Selecting ‘r’ things from ‘n’ identical things, number of selections is always one.

Problem 1:
There is a room with 12 people and everyone shakes hands with each other. What is the number
of handshakes?

Solution:
To understand this lets take a scenario where 3 people A,B,C and count the number of
handshakes.

1st hand shake between A- B.

2nd hand shake between A - C
3rd hand shake between B - C
This is similar to selecting 2 people from 3 i.e. 3C2.
Hence, in the given question the number of handshake will be 12C2 = 12 × 11/2 = 66.
This question may asked in different way,
Problem 2:
In a room there are 8 men, and 6 women and a handshake is held between 1 man and 1
woman.What is the number of handshakes?

Solution:
To visualize this take a small case, 3 men A,B,C and 2 women D, E in a room and they start
handshake with each other.

Then, 1. A handshake with D.

2. A handshake with E.
3. B handshake with D.
4. B handshake with E.
5. C handshake with D.
6. C handshake with E.
Hence the total number of handshakes is 6.

This is similar to selecting a man and a woman. Number of handshake = 3C1 × 2C1 = 3 × 2 = 6.
Hence, in the given questions selecting a man out of 8 men and a woman out of 6 women, then
the number of handshake will be 8C1 × 6C1 = 8 × 6 = 48.

Problem 3:
In a room there are a certain number of people and everybody handshake with each other. It was
found that the number of handshakes was 153. Find the number of people in the room?

Solution:
Let's say in the room there are n people and everybody handshake with each other.
Total number of handshake = nC2 = 153
n × (n-1)/2 = 153
n2 - n - 306 = 0
Therefore n = 18,-17 but the number of people can not be -ve. So, n = 18 people.

Problem 4:
In a room with men and women everybody handshake with each other. The number of
handshakes between 2 men is 153 and the number of handshakes between 1 man and 1 woman is
180. Find the total number of handshakes in the room?
Solution:
Let ‘n’ be the number of men in the room and ‘w’ be the number of women in the room.
Number of handshakes between 2 men = 153 i.e. nC2 = 153
n × (n-1)/2 = 153
n2 - n - 306 = 0, hence n = 18 men in the room.

Handshakes between a man and a woman = 180. i.e. nC1 × wC1 = 180
n × w = 180 and hence, w = 180/18 = 10 women.
Therefore the total number of people in the room = 18+10 = 28.
Total number of handshakes = 28C2 = 28 × 27/2 = 378.

Questions on selection-2

Problem 1:
In how many ways can a team of the 3 players be selected from 11 players?

Solution:
Here the value of n = 11. And value of r = 3.
Thus, 11C3 = 11×10×9
3×2×1
= 165.
Similarly form a cricket team from 16 players = 16C11

Problem 2:
A train going from station A to B with 5 stations in between A to B and 6 people get into the
train during the journey (not at A) with different tickets. How many different sets of tickets?

Solution:
We have 5 stations in between A and B.

If somebody gets in at station 1. He will have tickets available to station 2,3,4,5 and B.

So, people who get in at station 1 will have a choice of 5 tickets.

Likewise a person who gets in at station 2 will have a choice of 4 tickets.
A person who gets in at station 3 will have a choice of 3 tickets.
A person who gets in at station 4 will have a choice of 2 tickets.
A person who gets in at station 5 will have a choice of 1 ticket.
Total choice = 5+4+3+2+1 = 15 tickets.

From 15 tickets you are selecting 6 because 6 people have got on the journey with 6 different
tickets.
Hence selecting 6 from 15 = 15C6.

Problem 3:
8 collinear points on a plane, with these points how many 1. Triangle 2. Quadrilateral 3. Straight
lines can be formed?

Solution:
1. To form a triangle you need to select any 3 points out of 8.
8×7×6
So, number of triangle = 8C3 =​ 3×2×1 = 56.

2. To form a quadrilateral you need to select any 4 points out of 8.

8×7×6×5
So, number of quadrilateral = 8C4 = 4×3×2×1 = 70.

3. To form a straight line you need to select any 2 points out of 8.

8×7
So, number of straight line = 8C2 =​ 2×1 = 28.

Formulae For Selection

Already we have discussed two formulae for selection,

n!
1. nCr =
r!(n−r)!
2. nCr = nC(n-r)
3. Total number of selections of zero or more things out of n different things
nCo + nC1 + nC2 + … + nCn
nCo + nC1 + nC2 + … + nCn = 2n

For example:
Let's say A,B,C are 3 different objects and you want to select any number of objects(including
0), then the total number of selections are?
Solution:
You have the following choice to select the objects are,
Select 0 object or select 1 object or select 2 object or select 3 object

( here ‘or’ refers to +)

i.e. 3C0 + 3C1 + 3C2 + 3C3
According to formula; nCo + nC1 + nC2 + … + nCn = 2n
Here n = 2.
Therefore number of selection are = 23 = 8.

4. The number of selections of 1 or more things out of n different things

nC1 + nC2 + … + nCn = 2n - 1

For example:
Number of different values of exact change that you can pay if you have one coin each of 1 Rs,
5Rs, 10Rs and 50Rs.

Solution:
You can pay money by selecting;
Selecting 1 coin or Selecting 2 coins or Selecting 3 coins or Selecting 4 coins or selecting 5
coins.

eg. If you have to pay 3 Rs, you can pay by 2 coins (1Rs and 2Rs coins). Likewise 6Rs, 7Rs,
12Rs, only pay by using 2 coins.
Values like 65 Rs you can pay only by using 2 coins ( 5Rs, 10 Rs and 50 Rs coins)
i.e. 5C1 + 5C2 + 5C3 +5C4 + 5C5

According to formula; nC1 + nC2 + … + nCn = 2n - 1

Here n = 5.
Therefore number of different values = 25 - 1 = 31.

5. Total number of selections of zero or more things out of n identical things = n + 1 (

include zero thing)

6. Total number of selections of 1 or more things out of n identical things = ​n

Question On Selection-3

Type 1: Question involving pre selection

Problem 1:
In a cricket team there are 16 players and select 11 players such that the captain is always
selected. Find the total number of selections?

Solution:
Here given that the captain always be selected ( i.e. preselected) now you have to select only 10
players from 15 players.
Therefore, selection of 10 from 15 = 15C10.

Problem 2:
A hostel warden who has a hostel with 12 students living inside it. He selects 3 students for a
committee every week and he always wants to select his favourite student in the committee. How
many weeks can he continue with selecting the same group again?

Solution:
Let's say his favourite student is A and has to be in the committee. Now he has to select only 2
students from 11 students.
Therefore, selection of 2 from 11 = 11C2.

Type 2: Constraint based selection

Problem 1:
Out of 6 men and 4 women and you have to select a committee of 3 with at least one woman. In
how many different ways can it be done?

Solution:
You have committee with at least 1 woman are,
1 women and 2 men or 2 women and 1 man or 3 women and no man
4C1 × 6C2 + 4C2 × 6C1 + 4C3 × 6C0

2nd method:
Committee of all men subtracted from total number of committee i.e. 10C3 - 6C3

# From 10 people if you want to draw a committee of 3, will be 10C3.

If divide 10 people into 6 men and 4 women and you have to make committee of 3 and do not
given any constraint in case you decide to do this problem using how many men and how many
women then you have to write all possible committee i.e.

3 men & no woman or 2 men & 1 woman or 1 man & 2 women or no man & 3 women i.e.
6C3 × 4C0 + 6C2 × 4C1 + 6C1 × 4C2 + 6C0 × 4C3

Problem 2:
A plane with 12 points all are non-collinear except 5 points that lie on the same line. How many
triangles, quadrilaterals and straight lines can be formed?

Solution:
Let's say ABCDE are the collinear points and FGHIJKL are non collinear points.
1.​ To form a triangle take
2 points from collinear & 1 point from non collinear or 1 point from collinear & 2 points from
non collinear or no points from collinear & 3 points from non collinear

Number of triangle = 5C2 × 7C1 + 5C1 × 7C2 + 5C0 × 7C3

2.​ To form a quadrilateral take

2 points from collinear & 2 points from non collinear or 1 point from collinear & 3 points from
non collinear or no points from collinear & 4 points from non collinear

Number of quadrilateral = 5C2 × 7C2 + 5C1 × 7C3 + 5C0 × 7C4

3.​ To form straight lines

1 point from collinear & 1 point from non collinear or no point from collinear & 2 points from
non collinear

Number of straight line = 5C1 × 7C1 + 5C0 × 7C2 + 1

Add 1 because in collinear points when you select any two points from these, you form the same
line whether you select AB or DE. Hence ABCDE lines do not get counted when you select one
point from collinear and one point from non collinear.
Distribution of identical objects

Distribution can happen of identical objects or distinct objects.

Number of ways of distributing n identical things among r persons when each person may
get any number of things = (n + r – 1) C(r–1)

Problem 1:
If you have 4 identical objects to give between two friends X & Y. What are the number of
distributions?

Solution:
​X Y
1st distribution 4 0
2nd distribution 3 1
3rd distribution 2 2
4th distribution 1 3
5th distribution 0 4

Therefore total number of distributions = 5

According to formula;
Here n = 4 and r = 2
So, the total number of distributions = (4+2-1)C(2-1) = 5C1 = 5.

Problem 2:
If x+y+z = 20 and x,y,z are whole numbers. How many solutions does x+y+z = 20 have?

Solution:
x+y+z = 20 is the same as distributing 20 objects between x,y and z.
Here n = 20 and r = 3.
So, the total number of solutions = (20+3-1)C(3-1) = 22C2 = 231 .
If x,y,z are natural numbers, in this case this formula does not work directly because in this case
zero is not allowed.

Problem 2:
20 identical chocolates are distributed amongst A,B,C such that each person gets at least 1
chocolate. What are the number of distributions?

Solution:
In this case we do not use the formula (n + r – 1) C(r–1) ​because it includes the 20, 0, 0 and 19,
1 , 0 amongst A,B,C respectively.
From 20 chocolates first you have to give 1 to each of A,B,C, then you left with 17 chocolates,
now you are allowed to give those 17 chocolates freely to these 3 people as you want including
zero distribution.
A B C
1st distribution 1 1 1
Now n = 17 and r = 3.
So total number of distributions = (17+3-1)C(3-1) + 1= 19C2 + 1

Problem 3:
A+B+C = 20, A,B,C ≥ 2 and all are integers. How many solutions does it have?

Solution:
A+B+C = 20, this is the same as 20 identical chocolate distributed amongst 3 people A,B,C with
minimum 2 chocolate each.
A B C
1st distribution 2 2 2

Now you left with 14 and these 14 distribute among 3.

Here n = 14 and r = 3
So total number of distributions = (14+3-1)C(3-1) + 1 = 16C2 + 1
This approach is called a modified ‘n’ approach.

Problem 4:
20 identical chocolates are distributed amongst A,B,C such that A gets minimum 3, B gets
minimum 5 chocolates. What are the number of distributions?

Solution:
20 identical chocolate distributed amongst 3 people A,B,C A with minimum 3 and B with
minimum 5 chocolates.
 A B C
1st distribution 3 5 0
Now you left with 12 and these 12 are distributed among 3.
Here n = 12 and r = 3
So total number of distributions = (12+3-1)C(3-1) + 1 = 14C2 + 1

Formulae For Arrangement

1. MNP Rule
It tells us if you have 3 tasks to do and there are M ways of doing the first thing, N ways of doing
the second thing and P ways of doing the third thing then there will be M × N × P ways of doing
all the three things together.

This formula is used to do problems on arrangements and also used for distribution of
distinct objects.

Problem 1:
Shubham wants to go from Mumbai to Pune and Pune to Delhi and Delhi to Kolkata. There are 6
trains from Mumbai to Pune, 5 trains from Pune to Delhi and 8 trains from Delhi to kolkata. Find
the total number of ways of travelling?

Solution:

So, total number of ways of travelling = 6 × 5 × 8 = 240.

2. r! Formula
If you have ‘r’ distinct things and you want to place them in ‘r’ places, then the total number of
ways ​= r!

Problem 1:
6 people ABCDEF and you want to sit them on 6 chairs. Find the total number of ways of
sitting?

Solution:
The 1st chair can be filled by 6 people.
The 2nd chair can be filled by 5 people.
The 3rd chair can be filled by 4 people.
The 4th chair can be filled by 3 people.
The 5th chair can be filled by 2 people.
The 6th chair can be filled by 1 person.
So the total number of ways = 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720.
r! Nothing but the MNP rule used for ‘r’ distinct objects in ‘r’ places.

3. r! modified for arrangement of identical objects

Number of arrangements of ‘n’ things out of which P1 are alike and are of one type, P2 are alike
and are of a second type and P3 are alike and are of a third type and the rest are all different
= ​n!/ P1! P2! P3!

For example:
AAA BB CCC and you want to be placed in 8 places.
AAA are 3 alike things, BB are two alike things and CCC are three alike things.

So, total number of ways = 8!/3! × 2! × 3!

4. nPr formula
nPr = number of arrangements of ‘n’ distinct things taken r at a time.
nPr = n!/ (n – r)!; n ≥ r

For example:
Six people ABCDEF arrange in 3 places = 6P3 = 6!/3! = 120.
Similar situation is getting handled using the MNP rule. So, according to MNP rule, 6 people
arranging in 3 places = 6 × 5 × 4 = 120

The Relationship Between Permutation & Combination:

When we look at the formulae for Permutations and Combinations and compare the two we see
that,
nPr = r! × nCr
i.e. The arrangement of r things out of n is nothing but the selection of r things out of n followed
by the arrangement of the r selected things amongst themselves.

Generic Questions On Arrangements

Problem 1:
In how many ways can you send 5 letters, if you have 4 servants. Any servant be used any
number of times.

Solution:
You have to send L1&L2&L3&L4&L5. Each of these 5 distributions you have 4 ways of it
because you have 4 servants.
So, total number of ways = 45

Problem 2:
In how many ways in which to wear 6 distinct rings in 4 fingers, if any finger has any number of
rings.

Solution:
Each of these 6 rings can have 4 fingers.
So, total number of ways = 4 × 4 × 4 × 4 × 4 × 4 = 46

# these type of question always confusing about weather it 46 or 64 .

Let's say 8 servants and 5 letters. Answer will be either 85 or 58 Which one will you choose?
Between servants and letters one of them is repeatable and the other is non repeatable. If you
think about servants and letters you can send the servant again and again but you can not send
letters again and again. So the repeatable aspect is servants and the non repeatable aspect is
letters.

NOTE : In this type of question answer will be RN R . Here R = repetible and NR = Non
repetible.

Problem 3:
A team of 16 players, making a batting order of 11 players, such that the captain always selected.
Find the total number of ways?

Solution:
This question can be done by selection and arrangement.
1 player is preselected and out of 15 players we have to select 10 players.
No of selection = 15C10 and no of arrangement = 11!.
So total number of ways = 15C11 × 11!.
Problem 4:
In how many ways 7 people A,B,C,D,E,F,G are placed in 7 places such that A & B are together?

Solution:
A&B are together. So, A&B counted as one person and 5 people separately, effectively there are
6 people.
Arrangement of 6 people is 6! And arrangement of AB = 2!.
Therefore total number of ways = 6! × 2!.

Problem 5:
In how many ways 7 people A,B,C,D,E,F,G are arranged in a straight line in 7 places such that A
is always in the middle?

Solution:
Middle place is fixed by A and the remaining 6 places are filled by 6 people.
So, total number of ways = 6!.

Problem 6:
In how many ways 7 people A,B,C,D,E,F,G are arranged in 7 places such that no two of A,B,C
are together?

Solution:
A,B,C in 3 places is 3! And D,E,F,G in 4 places is 4!
Total number of ways = 3! × 4!.

Questions On Word Formation

Type 1: Word formation question

Problem 1:
How many words can be formed with the word PATNA, LUCKNOW and JAIPUR which have
1. No restrictions.
2. Total number of new words
3. Start with the first letter.
4. Start and end with vowels.

Solution:
PATNA
1. ​Total number of letters - P,T,N occurs once while A occurs twice.
So, the total number of words that can be formed = 5!/2! = 60

2.​ Total number of new words = 60 - 1 = 59.

3.​ We can arrange only 4 letters (as place of P is restricted) in which A occurs twice.
So, the total number of words that can be formed = 4!/2!

4. ​In the word PATNA in which we have 2 vowels(A,A).

So, the total number of words that start with A and end with A = 3!

LUCKNOW
1. ​Total number of distinct letters = 7.
So, the total number of words that can be formed = 7!

2. ​Total number of new words = 7! - 1.

3.​ We can arrange only 6 letters (as place of L is restricted)

So, the total number of words that can be formed = 6!

4. ​In the word LUCKNOW in which we have 2 vowels(U,O). Arrangement of two vowel = 2!
So, the total number of words that can be formed = 2! × 5!

JAIPUR
1. ​Total number of distinct letters = 6.
So, the total number of words that can be formed = 6!

2. ​Total number of new words = 6! - 1.

3.​ We can arrange only 5 letters (as place of J is restricted)

So, the total number of words that can be formed = 5!

4. ​In the word JAIPUR in which we have 3 vowels(A,I,U). We have to select 2 vowels and
arrange them amongst 1st and last place = 3C2 × 2!and also arrange 3 consonants and 1 vowel =
4!
So, the total number of words that can be formed = 3C2 × 2! × 4!.

Type 2: Dictionary position question

Problem 1:
What is the dictionary position of the word RUPAJI that can be formed by letters of the word
JAIPUR?

Solution:
1st arrange all the letters of the word JAIPUR in alphabetically order for reference.
A-I-J-P-R-U
Number of words starting with A = 5!
Number of words starting with I = 5!
Number of words starting with J = 5!
Number of words starting with P = 5!
Number of words starting with R = 5!
Number of words starting with U = 5!

You are looking for the word RUPAJI. In this word letter ‘U’ will come only after the letter ‘R’.
so, the words starting with letter ‘U’ are not considered. RUPAJI one of the word inside words
start with letter ‘R’

Before the words start with the letter ‘R’ we have words = 5! + 5! +5! + 5! = 480 words.

Words start with the letter ‘R’

Number of words starting with RA = 4!

Number of words starting with RI = 4!
Number of words starting with RJ = 4 !
Number of words starting with RP = 4!
Number of words starting with RU = 4!

RUPAJI one of the word inside the words start with letters ‘RU’
Before the words start with the letters ‘RU’ we have words = 480 + 4! + 4! + 4! + 4! = 480 + 96
= 576 words.

Words start with the letter ‘RU’

Number of words starting with RUA = 3!
Number of words starting with RUI = 3!
Number of words starting with RUJ = 3!
Number of words starting with RUP = 3!

RUPAJI one of the word inside the words start with letters ‘RUP’
Before the words start with the letters ‘RUP’ we have words = 480 + 96 + 18 = 594 words.
Remaining lettres A,I,J six words can be form from A,I,J

AIJ,AJI,IAJ,IJA,JAI,JIA. So out of six the 2nd word AJI will complete the word RUP​AJI
Therefore the position of the word RUPAJI = 594 + 2 = 596.

Questions On Number Formation

Forming numbers with and without replacement:

Problem 1:
How many 4 digit numbers can be formed by using digit 1,2,3,4,5,6 and 7 with replacement of
digit allowed?

Solution:
To forming a 4 digit number with replacement;
1st place can be filled with any of the 7 digits.
2nd place can be filled with any of the 7 digits.
3rd place can be filled with any of the 7 digits.
4th place can be filled with any of the 7 digits.
Therefore total number of ways = 7 × 7 × 7 × 7 = 74

Problem 2:
How many 4 digit numbers can be formed by using digit 0,1,2,3,4,5 and 6 with replacement of
digit allowed?

Solution:
1st place cannot be filled with zero because it makes 4 digit numbers in 3 digit numbers.
So, To forming a 4 digit number with replacement;
1st place can be filled with any of the 6 digits.
2nd place can be filled with any of the 7 digits.
3rd place can be filled with any of the 7 digits.
4th place can be filled with any of the 7 digits.
Therefore total number of ways = 6 × 7 × 7 × 7 = 6 × 73
Problem 3:
How many 4 digit numbers can be formed by using digit 1,2,3,4,5,6 and 7 without replacement
of digits?

solution:
To forming a 4 digit number without replacement;
1st place can be filled with any of the 7 digits.
2nd place can be filled with any of the 6 digits.
3rd place can be filled with any of the 5 digits.
4th place can be filled with any of the 4 digits.
Therefore total number of ways = 7 × 6 × 5 × 4

Problem 4:
How many 4 digit numbers can be formed by using digit 0,1,2,3,4,5 and 6 without replacement
of digits?

Solution:
1st place cannot be filled with zero because it makes 4 digit numbers in 3 digit numbers.
So, To forming a 4 digit number without replacement;
1st place can be filled with any of the 6 digits.
2nd place can be filled with any of the 6 digits.
3rd place can be filled with any of the 5 digits.
4th place can be filled with any of the 4 digits.
Therefore total number of ways = 6 × 6 × 5 × 4

Limit based question:

Problem 1:
How many 4 digit numbers can be formed by using digit 0,1,2,3,4 such that the numbers are not
greater than 4000?

Solution:
In this question we can think that numbers are not greater than 4000. So, numbers are starting
with digit 1,2 and 3. First place cannot be filled with zero because it makes 4 digit numbers in 3
digit numbers.

Numbers starting with 1

1st place can be filled with 1 digit i.e 1.
2nd place can be filled with any of the 5 digits.
3rd place can be filled with any of the 5 digits.
4th place can be filled with any of the 5 digits
So, the number of ways = 1 × 5 × 5 × 5 = 125.

Numbers starting with 2

1st place can be filled with 1 digit i.e. 2.
2nd place can be filled with any of the 5 digits.
3rd place can be filled with any of the 5 digits.
4th place can be filled with any of the 5 digits
So, the number of ways = 1 × 5 × 5 × 5 = 125.

Numbers starting with 3

1st place can be filled with 1 digit i.e. 3.
2nd place can be filled with any of the 5 digits.
3rd place can be filled with any of the 5 digits.
4th place can be filled with any of the 5 digits
So, the number of ways = 1 × 5 × 5 × 5 = 125.
And number 4000​ itself will get counted.
Therefore total 4 digit numbers = 125+125+125+1 = 376.

NOTE : When in number formation nothing is mentioned about weather repetition allowed or
not, in that case default is repetition allowed.

Problem 2:
How many 4 digit numbers can be formed by using the digits 0,1,2,3,4,5 and 6 which are
divisible by 5.
1. With repetition allowed.
2. With repetition not allowed.

Solution:
(a) 1. With repetition:
Divisibility rule of 5 is that the last digit can be 0 or 5. So, the last digit can be filled by 0 or 5.
Numbers end with zero = 6 × 7 × 7 = 294.
Numbers end with 5 = 6 × 7 × 7 = 294.
Therefore total numbers = 294+294 = 588.

2. Without repetition
Numbers end with zero = 6 × 5 × 4 = 120.
Numbers end with 5 = 5 × 5 × 4 = 100.
Therefore total numbers = 120+100 = 220.

Problem 3:
How many 4 digit numbers can be formed by using the digits 0,1,2,3,4 and 5 which are divisible
by 4.

Solution:
Divisibility rule of 4 is that the last 2 digits are divisible by 4.
Numbers end with last 2 digits 0,0 = 5 × 6
Numbers end with last 2 digits 0,4 = 5 × 6
Numbers end with last 2 digits 1,2 = 5 × 6
Numbers end with last 2 digits 2,0 = 5 × 6
Numbers end with last 2 digits 2,4 = 5 × 6
Numbers end with last 2 digits 3,2 = 5 × 6
Numbers end with last 2 digits 3,6 = 5 × 6
Numbers end with last 2 digits 4,0 = 5 × 6
Numbers end with last 2 digits 5,2 = 5 × 6
Therefore total numbers = 9 × (5 × 6) = 270.

Circular Arrangements

In this chapter you just need to understand a couple of things. On a circle every position is the
same, unlike straight lines every position is different.
1. Number of ways of placing ‘r’ distinct objects on ‘r’ places is equal to (r-1)!
2. If there is a reference point on a circle no need to do minus 1.

For example:
How many ways of arranging 5 people on seats in a circular table ( seat 1 is a reference point)?

Solution:
Seat 1 is a reference point. So, the number of arrangements = 5!

Problem 1:
In how many ways 4 Indian and 4 European sit in alternate places around a circle?

Solution:

Let say 4 Indian sit in A,B,C,D places around a circle. Now you have a circle with a reference
point.
Number of ways of arranging 4 Indian = (4-1)! = 6 and Number of ways of arranging 4 European
= 4! = 24
Therefore total number of ways = 6 × 24 = 144.
3. ‘N’ objects arrange around a circle where clockwise is equal to anticlockwise, then
the number of arrangements = (n-1)!/2

Some Practice Questions

1. How many numbers of 3-digits can be formed with the digits 1, 2, 3, 4, 5 (repetition of
digits not allowed)?
Ans : 60.

2. In how many ways can a person send invitation cards to 6 of his friends if he has four
servants to distribute the cards?
Ans : 46 .

3. In how many ways can the letters of the word ‘EQUATION’ be arranged so that all the
vowels come together?
Ans : 4! × 5!.

4. How many straight lines can be formed from 8 non-collinear points on the X-Y plane?
Ans : 28.

5. For the arrangements of the letters of the word PATNA, how many words would start
with the letter P?
Ans :12.