Scribd
Upload
248 views

Lesson 3 Permutation and Combination

The document discusses permutation and combination concepts. It defines permutation as arrangements of elements in a distinct order, and provides the formula to calculate permutations when repetition is allowed or not allowed. Combination is defined as a way of selecting items where order does not matter, and the formula to calculate combinations is provided. Several examples are given to demonstrate calculating permutations and combinations for different scenarios.

Uploaded by

leaadel92
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
248 views

Lesson 3 Permutation and Combination

The document discusses permutation and combination concepts. It defines permutation as arrangements of elements in a distinct order, and provides the formula to calculate permutations when repetition is allowed or not allowed. Combination is defined as a way of selecting items where order does not matter, and the formula to calculate combinations is provided. Several examples are given to demonstrate calculating permutations and combinations for different scenarios.

Uploaded by

leaadel92
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

PERMUTATION

The arrangement of elements in a distinct order is called permutation.


Given a single set of n distinctively different elements, you wish to select k
elements from the n and arrange them within k positions. The number of
different permutations of the n-elements taken k at a time is denoted and is
equal to:
Example. How many 3 letter words with or without meaning can be
formed out of the letters of the word SWING when repetition of letters
is not allowed?

Solution.
n = 5, as the word SWING has 5 letters.
Since we have to frame 3 letter words with or without meaning and without
repetition, therefore total permutations possible are:
PERMUTATION WHEN REPETITION IS
ALLOWED
The permutation with repetition of objects can be written using the exponent form.
When the number of object is “n,” and we have “r” to be the selection of object, then;
Choosing an object can be in n different ways (each time). Thus, the permutation of objects when
repetition is allowed will be equal to,

n × n × n × ……(r times) = nr
This is the permutation formula to compute the number of permutations feasible for the choice of
“r” items from the “n” objects when repetition is allowed.
Example. How many 3 letter words with or without meaning can be
formed out of the letters of the word SMOKE when repetition of words
is allowed?
Solution.
The number of objects, is 5, as the word SMOKE has 5 alphabets.
and r = 3, as 3-letter word has to be chosen.
Thus, the permutation will be:
Permutation (when repetition is allowed)= 53 = 125
PERMUTATION OF MULTI-SETS

Permutation of n different objects when P1 objects among ‘n’ objects are


similar, P2 objects of the second kind are similar, P3 objects of the third kind are similar ………
and so on, Pk objects of the kth kind are similar and the remaining of all are of a different kind,
Thus, it forms a multiset, where the permutation is given as:
FUNDAMENTAL COUNTING
PRINCIPLE
According to this principle, “If one operation can be performed in ‘m’ ways and there
are n ways of performing a second operation, then the number of ways of performing the two
operations together is m x n “.

This principle can be extended to the case in which the different operation be
performed in m, n, p, . . . . . . ways.

In this case the number of ways of performing all the operations one after the other is m x n x
p x . . . . . . . . and so on
Example. In how many ways 6 children can be arranged in a line, such
that:
(i) Two particular children of them are always together
(ii) Two particular children of them are never together
Solution.
(i) The given condition states that 2 students need to be together, hence we can consider them 1.
Thus, the remaining 7 gives the arrangement in 5! ways, i.e. 120.
Also, the two children in a line can be arranged in 2! Ways.
Hence, the total number of arrangements will be,
5! × 2! = 120 × 2 = 240 ways

(ii) The total number of arrangements of 6 children will be 6!, i.e. 720 ways.
Out of the total arrangement, we know that two particular children when together can be arranged in 240 ways.
Therefore, total arrangement of children in which two particular children are never together will be 720 – 240 ways, i.e. 480
ways.
Example. It is required to seat 5 men and 4 women in a row so that the women
occupy the even places. How many such arrangements are possible?

Solution:
We are given that there are 5 men and 4 women. i.e. there are 9 positions.
The even positions are: 2nd, 4th, 6th and the 8th places
These four places can be occupied by 4 women in P(4, 4) ways = 4!
= 4 . 3. 2. 1 = 24 ways
The remaining 5 positions can be occupied by 5 men in P(5, 5) = 5!
= 5.4.3.2.1 = 120 ways
Therefore, by the Fundamental Counting Principle,
Total number of ways of seating arrangements = 24 x 120 = 2880
Example. Consider a set having 5 elements a,b,c,d,e. In how many ways
3 elements can be selected (without repetition) out of the total number
of elements.
Solution:
Given X = {a,b,c,d,e}
3 are to be selected.
Therefore,
COMBINATION
A way of selecting items from a collection where the order of selection
does not matter is called combination. A sample of k elements is to be chosen
from a set of n elements. The number of different samples of k samples that
can be selected from n is equal to
Example. A group of 3 lawn tennis players S, T, U. A team consisting of 2
players is to be formed. In how many ways can we do so?

Solution.
In a combination problem, we know that the order of arrangement or selection does not matter.
Thus ST= TS, TU = UT, and SU=US.
Thus, we have 3 ways of team selection.
By combination formula we have,
=
Example. Find the number of subsets of the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
having 3 elements.

Solution.
The set given here have 10 elements. We need to form subsets of 3 elements in any order. If we
select {1,2,3} as first subset then it is same as {3,2,1}. Hence, we will use the formula of
combination here.
Therefore, the number of subsets having 3 elements = 10C3
Example. Picking a team of 3 people from a group of 10.

Solution.
Example. Out of a group of 5 people, a pair needs to be formed. The number of
possible combinations can be calculated as follows.

Solution.
Example. The number of 4-letter Combinations which can be made from the
letters of the word DRIVEN

Solution.

You might also like