0% found this document useful (0 votes)
133 views

Permutations Combinations

1. The document discusses permutations and combinations problems involving arranging objects or selecting objects from a group. 2. It provides examples of calculating permutations of letters in words and numbers that can be formed from given digits. 3. Formulas for permutations and factorials are explained. Permutations are calculated using nPr = n!/(n-r)!.

Uploaded by

Aakash Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
133 views

Permutations Combinations

1. The document discusses permutations and combinations problems involving arranging objects or selecting objects from a group. 2. It provides examples of calculating permutations of letters in words and numbers that can be formed from given digits. 3. Formulas for permutations and factorials are explained. Permutations are calculated using nPr = n!/(n-r)!.

Uploaded by

Aakash Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 80

Mohammed Abdul Jaleel

Soft Skills Training Faculty


GCGC
GITAM Deemed to be University
Intended Learning Outcomes

By the end of this session, you will be able to:


1. Understand the concept of permutations and combinations.
2. Solve various problems on permutations and combinations.
FACTORIAL

If ‘n’ is a non negative integer, then factorial of n is denoted by n! and is


defined as the product of the first n positive integers.

n! = 1.2.3.4…………n; if n > 0
= 1; if n = 0
FUNDAMENTAL PRINCIPLE OF COUNTING:

If an operation can be performed in ‘m’ ways, and a second operation can be


performed in ‘n’ ways corresponding to each performance of the first
operation, then the two operations in succession can be performed in ‘m x n’
ways.
PERMUTATION:
The number of arrangements that can be made by taking some or all of a
number of things is called Permutation

The permutation of n dissimilar things taken ‘r’ at a time is nPr , where

nP 𝑛!
r =
𝑛−𝑟 !
How many 3-digit numbers can be formed using the digits 1, 3, 4, 5 and 8
where repetition of the digits is not allowed?

60
Solution :
We have to form 3-digit numbers using the digits 1,3,4,5 and 8, i.e. we
have to fill three blanks with different digits from 1,3,4,5 and 8.
First blank can be filled from any of the five digits.
Second blank can be filled from any of the remaining four digits.
Third blank can be filled from any of the remaining three digits.
∴ The total number of ways is 5 X 4 X 3 = 60
(or) The number of 3 digit numbers that can be formed from 5 digits
1,3,4,5 and 8 is 5P3 = 60
(i) How many five-digit numbers (all different) can be formed using the digits
1,3,4,5,6,7 and 8?

(ii) How many of them begin with 1?

(iii) How many of them end with 8?

(iv) How many of them begin with 1 and end with 8?

2520,360,360,60
Solution :
(i) The number of five-digit numbers formed by the digits 1,3,4,5,6,7 and 8 is 7P5
(ii) The number of five-digit numbers that begin with 1 is 6P4
1 _ _ _ _ ( First blank is filled with 1 and remaining four blanks are to be
filled with any of the remaining 6 digits)
(iii) The number of five digit numbers that end with 8 is 6P4
____8
(iv) The number of five digit numbers that begin with 1 and end with 8 is 5P3
1___8
Find the number of 4-digit numbers that can be formed using the digits 0, 2,
4, 5, 6 and 8 where repetition is not allowed.

300
Solution:
We have to form 4-digit numbers using the digits 0,2,4,5,6 and 8, i.e. we
have to fill four blanks with different digits from 0,2,4,5,6 and 8.
First blank can be filled from any of the six digits except zero i.e. 5 ways.
From here we can consider zero
Second blank can be filled from any of the remaining five digits.
Third blank can be filled from any of the remaining four digits.
Fourth blank can be filled from any of the remaining three digits.
∴ Number of 4-digit numbers that can be formed is
5 X 5 X 4 X 3 = 300.
Four boys and three girls are to be arranged in a row for a photograph.

1. In how many ways can they be arranged?

2. The number of ways in which all the boys sit together is _____.

3. The number of ways in which no two boys sit together is ______.

4. The number of ways in which boys and girls sit alternately is _____.
7!, 4!.4!,
4!.3!, 4!.3!
Solution :
(i) 7 students (4 boys and 3 girls) can be arranged in 7 places in 7P7 = 7! Ways.
(ii) Consider 4 boys as one unit. Now there are three girls and one unit of boys
(i.e., 4 members). They can be arranged in 4! Ways. 4 boys among themselves
can be arranged in 4! Ways
So, total number of arrangements is 4!.4!.
(iii)First we arrange 3 girls in 3! Ways like _ G _ G _ G _
There are four places for four boys in which they can be arranged in 4! Ways.
So total number of arrangements is 4!.3!
(iv) If we start with boy, then arrangement will be like
BGBGBGB i.e. boys in odd places and girls in even places.
Four boys can be arranged in 4 odd places in 4! ways.
Three girls can be arranged in 3 even places in 3! Ways.
So, number of arrangements is 4!.3!
If we start with girl, then arrangement will be like
GBGBGBB, but two boys sit side by side which is contradiction, so these
arrangement is not possible.
Find the number of 4-digit numbers that can be formed using the digits 1, 2,
3, 5 and 7.
(i) How many of them are divisible by 2?

(ii) How many of them are divisible by 3?

(iii) How many of them are divisible by 5?

(iv) How many of them are divisible by 25?

24, 24, 24,


12
Solution :
The number of four-digit numbers that can be formed using the digits
1,2,3,5 and 7 is 5P4 = 120.
(i) Divisible by 2: Last blank should be filled with only 2, so remaining 3
blanks can be filled with any three of the remaining four digits 1,3,5 and 7
in 4P3 ways = 24 ways.
(ii) Divisible by 3: We have to take only 4 digits such that the sum of the
digits is divisible by 3. Only possible four digits are 1,2,5 and 7.
So, total number of ways is 4! = 24.
(iii) Divisible by 5: Last blank should be filled with only 5, so remaining 3
blanks can be filled with any three of the remaining four digits 1,2,3 and 7
in 4P3 ways = 24 ways.
(iv) Divisible by 25 : Last two blank should be filled with either (2,5) or
(7,5), i.e., in 2 ways.
First two blanks can be filled with remaining 3 digits in 3P2 ways = 6 ways.
So, total number of ways is 2 X 6 = 12 ways
How many numbers greater than 4000 can be formed using the digits 0,2,4,6
and 8 where repetition of the digits is not allowed?

168
Four-digit numbers :
If we want the numbers greater than 4000, then first blank should be filled with
either 4 or 6 or 8 i.e. 3 ways.
Remaining 3 blanks can be filled with remaining 4 digits in 4P3 ways = 24ways,
So total number of 4 digit numbers is 3 X 24 = 72
Five-digit numbers : First blank can be filled with any digit except zero i.e., 2 or
4 or 6 or 8 in 4 ways.
Remaining 3 blanks with any of the remaining 4 digits in 4P3 ways = 24 ways
So, total number of five-digit numbers is 4 X 24 = 96.
Therefore, total number of numbers greater than 4000 are 72 + 96 = 168
Find the sum of all the 4-digit numbers formed by using all the 4 digits 2, 4, 6
and 8.

133320
Solution :
If there are n digits a,b,c,d,e,….., then the sum of all the numbers formed
by using the digits is
(n-1)! (a+b+c+ ….)(111… n times)
Sum of all 4 digit numbers formed by the digits 2,4,6 and 8 is
(4-1)!(2+4+6+8)(1111) = 6 X 20 X 1111 = 1,33,320
Find the number of 4-digit numbers which can be formed using the digits 0, 1,
3, 5 and 6 where repetition of the digits is allowed.

How many of the above numbers are divisible by 5?

500, 200
Solution :
We have to form 4-digit numbers using the digits 0,1,3,5 and 6, i.e. we
have to fill four blanks with digits 0,1,3,5 and 6.
First blank can be filled from any of the five digits except zero i.e. 4 ways.
From here we can consider zero, remaining 3 blanks in five ways each.
So, total number of ways is 4 X 5 X 5 X 5 = 500.
Divisible by 5 :
Last digit should be either zero or five.
If the last digit is zero, then the first blank can be filled with any digit
except zero i.e., 4 ways.
Second and third blank can be filled in 5 ways each.
So, total number of arrangements is 4 X 5 X 5 = 100.
Similarly, if last digit is five, number of arrangements is 100.
So, total number of arrangements is 100 + 100 = 200
A number lock has 4 rings and each ring has five digits. They are 1, 2, 3, 4 and
5. Find the maximum number of unsuccessful attempts that can be made by
a person who tries to open the lock without knowing the key code.

624
Solution :
First ring can be filled in five ways with either1,2,3,4 or 5.
Similarly, remaining three rings can be filled in five ways each.
So, total number of attempts is 5 X 5 X 5 X 5 = 625.
Of which, only one is successful and remaining 625 -1 = 624 are
unsuccessful attempts
How many numbers less than 1000 can be formed using the digits 2, 3, 4 and
6 where repetition of the digits is allowed?

84
Solution :
Numbers less than 1000 means, we have to consider all three digits, two
digits and single digit numbers.
3-digit numbers : Each blank can be filled in four ways
4 X 4 X 4 = 64
2-digit numbers : Each blank can be filled in four ways
4 X 4 = 16
Single digit number : Four possible numbers can be formed.
So, total number of numbers less than 1,000 is 64+16+4 =84.
Find the number of palindromes with 6 digits that can be formed using the
given digits.

(i) 1, 3, 5, 7 and 9

(ii) 0, 2, 4, 6 and 8

125, 100
Solution :
(i) First three blanks can be filled in 5 ways each.
Fourth, fifth and sixth blanks has to be filled the same digits by which the
third, second and first blanks are filled respectively.
So, total number of ways is 5 X 5 X 5 = 125.
(ii) First blank can be filled with any digit except zero i.e., 4 ways.
Second and third blanks in five ways each.
So, total number of ways is 4 X 5 X 5 = 100.
Find the number of ways of arranging the letters of the given words.

(i) BABA

(ii) INDEPENDENCE

6,166320
Solution: (i) BABA
Total letters = 4
Number of A’s = 2
Number of B’s = 2
4!
Total number of arrangements = =6
2!2!
In a library, there are 5 copies of one book, 3 copies each of two different
books, and 4 copies each of three different books. Find the number of ways of
arranging all these books in a shelf in a single row.
Solution :
5 copies of one book each = 5 X 1 = 5
3 copies of two books each = 3 X 2 = 6
4 copies of three books each = 4 X 3 = 12
Total = 5 + 6 + 12 = 23
23!
Total number of arrangements =
4! 3 5!. 3! 2
In how many ways can the letters of the word LIRIL be arranged so that

(i) two L’s come together?

(ii) It begins with L and ends with L?

(iii) the relative position of vowels and consonants is not disturbed?

12, 3, 3
Solution :
(i) Two L’s come together: Consider two L’s as one unit.
Now there are four letters (I, R, I and one unit of L’s)
4! 2! 4!
They can be arranged in X = = 12 ways.
2! 2! 2!
(ii) Begin with L and end with L: First and last place should be filled with
2!
L. This can be done in ways = 1 way.
2!
3!
I, R, I, can be arranged in ways = 3 ways.
2!
Total number of ways = 1 X 3 = 3 ways.
 (iii) L, R, L are in first, third and fifth place, they can be arranged in
3!
=3 ways.
2!
2!
 Two I’s can be arranged in second and fourth place in
2!
=1way
 Total number of ways = 3X1=3 ways.
In how many ways can the letters of the word BANANA be arranged so
that no two A’s come together?

12
3!
Solution: First we arrange B, N, N in ways
2!
_ B _ N _ N_
4
𝑃3
There are 4 blanks in which 3 A’s can be arranged in
3!
4
3! 𝑃3
So, total number of arrangements = X = 12 ways.
2! 3!
CIRCULAR PERMUTATION

The number of circular permutations of ‘n’ different things taken all at a time is
(n – 1)!

The number of circular permutations of ‘n’ things taken all at a time when
clockwise and anticlockwise arrangements are considered as same is
1
(n – 1)!
2
In how many ways can 6 boys and 3 girls be arranged around a circular table
such that

(i) all the girls sit together?

(ii) no two girls sit together?

4320,
14400
Solution : (i) Consider 3 girls as one unit. Now 7 members can be arranged
in a circle in 6! ways.
Three girls among themselves in 3! ways.
So, total number of ways is 6!.3! = 4320 ways.
(ii) First, we arrange 6 boys in 5! ways and 3 girls in between them in 6P3
ways.
So, total number of arrangements in 5! X 6P3
= 14400 ways
Find the number of ways of preparing a garland with 4 yellow, 3 white and 2
red roses of different sizes such that the two red roses come together.

10080
Solution : Consider 2 red roses as one unit, now there are 8 roses, they
1
can be arranged in 7! Ways.
2
Two red roses among themselves can be arranged in 2! Ways.
1
Total number of ways is 7!.2! = 10080 ways
2
PERMUTATION:
The number of arrangements that can be made by taking some or all of a number of
things is called Permutation

The permutation of n dissimilar things taken ‘r’ at a time is nPr , where

nP 𝑛!
r =
𝑛−𝑟 !
COMBINATIONS

A selection that can be made by taking some or all of a finite set of things is
called a combination.

The number of combinations of ‘n’ dissimilar things taken ‘r’ at a time is


denoted by nCr , where

nC = 𝑛!
r 𝑟! 𝑛−𝑟 !
Find the number of ways of selecting 2 vowels and 3 consonants from the
letters of the word EDUCATION.

60
In EDUCATION, there are 5 vowels A, E, I, O and U and four consonants D,
C, T and N.
From 5 vowels, we have to select 2 = 5C2= 10 ways
From 4 consonants, we have to select 3 = 4C3 =4 ways.
Total number of ways = 10 X 4 = 40
In how many ways can a committee of 6 members be selected from 12
members if a particular member is always included in the committee?

462
Solution :
From 12 members, we have to select 6, but one member is
already included, so from 11 members, we have to select 5 in 11C5 = 462
ways
In how many ways can 4 books be selected from 10 different books, given
that the two particular books are always excluded?

70
Solution : From 10 books, we have to select 4, but 2 books are excluded.
So, we have to select 4 books from remaining 8. This can be done in 8C4 =
70 ways
In how many ways can a team of 11 members be selected from 22 members
such that 2 particular members are always included in the team and 4 others
are always excluded?

11440
Solution : From 16 members (22-2-4=16), we have to select only 9.
This can be done in 16C9 = 11440 ways.
Find the number of ways in which a committee of 3 members be selected
from 5 boys and 3 girls so that the committee consists of at least two girls.
(a) 12
(b) 16
(c) 36
(d) 18

16
Solution: There must be at least two girls, it means 2 or 3 girls.
If 2 girls are selected, then only 1 boy is selected, this can be done in
5C .3C = 15 ways.
1 2
If 3 girls are selected, then boys cannot be selected, this can be done in
5C .3C = 1 way.
0 3
Total number of ways = 15 + 1 = 16 ways
The number of straight lines that can be drawn through ‘n’ non-collinear
points by taking two points at a time is nC2 .
The number of straight lines that can be drawn through 10 points out of
which 4 are collinear is _____.

40
Solution :From 10 given points we get 10C2 lines.
Since 4 points are collinear, we cannot get 4C2 lines, but these 4 points
form 1 line.
So, total number of lines that can be formed is
10C – 4C + 1 = 40
2 2
The number of diagonals in an octagon is ______.

If the number of diagonals in a polygon of n sides is 44, then n = ____.

20, 11
𝑛 𝑛−3
Solution: (i)Number of diagonals in a polygon of n sides is
2
8 8−3
Number of diagonals in Octagon is =20
2
𝑛 𝑛−3
(ii) =44⟹ n = 11.
2
The number of triangles that can be formed through ‘n’ non-collinear points
is nC3 .

Out of 10 given points if 4 points are collinear, then the number of triangles
that can be formed is ______.

116
Solution : Out of 10 given points, if 4 points are collinear, then number of
triangles that can be formed is
10C – 4C = 116
3 3
If a set of 10 parallel lines are intersected with another set of 4 parallel lines,
then the number of parallelograms that can be formed is ____.

270
Solution: From first set of 10 parallel lines, we have to select two lines.
From another set of 4 parallel lines, we have to select two lines.
Total number of parallelograms that can be formed is
10C X 4C = 270
2 2
There are two parallel lines. One has 8 points and other has 3 points
respectively. How many triangles can be formed with these points as
vertices?

The sides AB, BC and CA of a triangle ABC have 3, 5 and 6 interior points
respectively on them. The number of triangles that can be constructed using
these points as vertices is ___.

108, 333
Solution: (i) From 8 points, we have to select 2 points and from 3 points,
we have to select one point or vice-versa.
8C .3C + 8C .3C = 108.
2 1 1 2
(ii) Total number of points = 3 + 5 +6 = 14.
Number of triangles that can be formed is
14C – 3C – 5C – 6C = 333
3 3 3 3
X is a set of 20 consecutive natural numbers starting from 1. In how many
ways can two numbers be chosen from X such that the sum of their squares is
divisible by 9?

15
Solutions : If the sum of the squares is to be divided by 9, then the two
numbers should be multiple of 3.
There are 6 numbers which are multiple of 3.
The number of ways = 6C2 = 15
X is a set of 20 consecutive natural numbers starting from 1. In how many
ways two numbers be chosen from X such that the sum of their cubes is
divisible by 4?

70
Solutions: Cube of all the 10 even numbers when divided by 4 gives
remainder zero.
Cubes of 1, 5, 9, 13, 17 when divided by 4 gives remainder 1.
Cubes of 3, 7, 11, 15, 19 when divided by 4 gives remainder 3.
Number of ways in which we can select two numbers is
10C + 5C .5C = 45 + 25 = 70
2 1 1
In a tournament, each team has to play exactly one game with every other
team. The teams are divided into two Groups A and B. It was found that 55
games are played among the teams in Group A, and 210 games among the
teams in Group B. The number of games in which one team from group A and
the other team from Group B participated is ____.

231
Solution: Let the number of teams in group A be m.
Number of matches played is 55.
mC = 55
2
m = 11
Let the number of teams in group B be n.
Number of matches played is 210.
nC = 210
2
n = 21
Number of matches played when one team from group A and other from
group B are played is 11C1 X 21C1 = 11X 21 = 231
How many 5-digit numbers divisible by 4 can be formed using the digits 0, 2,
4, 5, 6 and 7 where repetition of the digits is not allowed?

204
Solution : If the last two digits are 04, 20, 40 and 60, then
number of five-digit numbers is 4 X 3 X 2 X 4 = 96
If the last two digits are 24, 52, 56, 64, 72, 76, then number of
five digit numbers is 3 X 3 X 2 X 6 = 108
Total number of ways = 96 + 108 = 204.
How many 5-digit numbers divisible by 9 can be formed using the digits 0, 1,
2, 4, 6, 8 and 9 such that each digit occur at most once in any such number?

192
Solution : Sum of all the digits is 30, but if it is to be divisible by 9, sum
should be 18 or 27.
If sum is 18, then the digits should be 0,1,2,6,9.
Number of five digits is 4 X 4 X 3 X 2 = 96.
If sum is 27, then the digits should be 0,4,6,8,9.
Number of five digits is 4 X 4 X 3 X 2 = 96.
Total number of five-digit numbers is 96 + 96 = 192.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy