Scribd
Upload
12 views23 pages

Permutation

The document provides an overview of permutations, highlighting that they are selections of objects where order matters. It explains the formulas for permutations with and without repetition, as well as various examples illustrating how to calculate permutations for different scenarios, including circular permutations and arrangements of letters in words. Additionally, it covers specific cases such as forming numbers under certain conditions and arranging letters while keeping vowels together.

Uploaded by

sorrosaangella
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views23 pages

Permutation

The document provides an overview of permutations, highlighting that they are selections of objects where order matters. It explains the formulas for permutations with and without repetition, as well as various examples illustrating how to calculate permutations for different scenarios, including circular permutations and arrangements of letters in words. Additionally, it covers specific cases such as forming numbers under certain conditions and arranging letters while keeping vowels together.

Uploaded by

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

PERMUTATIONS

Lesson 1
Permutation
•A selection of objects in which the order of
the objects matters.

•A Permutation is an ordered Combination.


Example: The permutations of the letters in the
set {A, B, C} are:
1st Choice 2nd Choice 3rd Choice Outcomes
B C………. ABC

A C B………. ACB
A C………..BAC
START B C A………..BCA

C A B………..CAB
B A………..CBA
Tree Diagram Showing the Permutations of the Letters A, B, C Taken Three at a Time
The Permutations are:

ABC BCA
ACB CAB
BAC CBA

• The diagram shows that there are 6 permutation of


the letters taken all at a time.
There are basically two types of permutation:
•Repetition is Allowed:

•No Repetition: for example the first


three people in a running race. You can't
be first and second.
Permutations with Repetition
FORMULA:
n r
where n is the number of things to choose from,
and we choose r of them
(Repetitions allowed, order matters)
Example:
There are 10 numbers to choose from
(0,1,...9) and we choose 3 of them:

10 × 10 × ... (3 times) = 10 3

= 1,000 permutations
Permutations without Repetition
FORMULA:

where n is the number of things to choose


from, and we choose r of them
(No repetition, order matters)
Example 1:
•How many ways can first and second
place be awarded to 10 people?
10! 10! 3,628,800
= = = 90
(10-2)! 8! 40,320
(which is just the same as: 10 × 9 = 90)
Notation
• Instead of writing the whole formula, people use
different notations such as these:
Example 2:

P(10,2) = 90
Example 3:

In how many different ways can 5 books be


arranged on a shelf?

5 x 4 x 3 x 2 x 1 = 120 ways
Example 4:
• How many 4-digit numbers can be formed from the
digits 1, 2, 3, 4 and 5 if:
a. Repetition of digits is not allowed?
P = = 5 x 4 x 3 x 2 = 120
5 4 4-digit numbers
b. Repetition of digits is allowed?
5 x 5 x 5 x 5 x 5 = 625 4-digit numbers
Example 5:
• How many 4-digit odd numbers can be formed from
the digits 1, 2, 3, 4 and 5 if:
a. Repetition of digits is not allowed?

b. Repetition of digits is allowed?


Example 6:
• How many 3-digit numbers greater than 200 can be
formed from digits 1, 2, 3, 4 and 5 if:
a. Repetition of digits is not allowed?

b. Repetition of digits is allowed?


Circular Permutations
Notation
(n – 1)!
Example:
In how many ways can 5 children be
seated at a round table?

(5 – 1)! = 4! = 24 ways
Example 7:
• Find the number of words, with or without meaning,
that can be formed with the letters of the word
‘CHAIR’.

Solution:
• ‘CHAIR’ contains 5 letters.
• Therefore, the number of words that can be formed
with these 5 letters = 5! = 5*4*3*2*1 = 120.
Example 8:
Find the number of words, with or without meaning, that
can be formed with the letters of the word ‘INDIA’.

Solution:
• The word ‘INDIA’ contains 5 letters and ‘I’ comes twice.
• When a letter occurs more than once in a word, we divide the
factorial of the number of all letters in the word by the number of
occurrences of each letter.
• Therefore, the number of words formed by ‘INDIA’ = 5!/2! = 60.
Example 9:
Find the number of words, with or without meaning, that can be
formed with the letters of the word ‘SWIMMING?

Solution:
• The word ‘SWIMMING contains 8 letters. Of which, I occurs twice
and M occurs twice.
• Therefore, the number of words formed by this word =
8! / (2!*2!) = 10080.
Example 10:
How many different words can be formed with the letters of the word ‘SUPER’ such that the vowels always
come together?
Solution:
• The word ‘SUPER’ contains 5 letters.
• In order to find the number of permutations that can be formed where the
two vowels U and E come together.
• In these cases, we group the letters that should come together and consider
that group as one letter.
• So, the letters are S,P,R, (UE). Now the number of words are 4.
• Therefore, the number of ways in which 4 letters can be arranged is 4!
• In U and E, the number of ways in which U and E can be arranged is 2!
• Hence, the total number of ways in which the letters of the ‘SUPER’ can be
arranged such that vowels are always together are 4! * 2! = 48 ways.
Example 11:
Find the number of different words that can be formed with the letters of the word
‘BUTTER’ so that the vowels are always together.

Solution:
• The word ‘BUTTER’ contains 6 letters.
• The letters U and E should always come together. So the letters are B, T,
T, R, (UE).
• Number of ways in which the letters above can be arranged = 5!/2! = 60
(since the letter ‘T’ is repeated twice).
• Number of ways in which U and E can be arranged = 2! = 2 ways
• Therefore, total number of permutations possible = 60*2 = 120 ways.
Example 12:
Find the number of permutations of the letters of the word ‘REMAINS’ such
that the vowels always occur in odd places.
Solution:
• The word ‘REMAINS’ has 7 letters.
• There are 4 consonants and 3 vowels in it.
• Writing in the following way makes it easier to solve these type of questions.
• (1) (2) (3) (4) (5) (6) (7)
• No. of ways 3 vowels can occur in 4 different places = 4P3 = 24 ways.
• After 3 vowels take 3 places, no. of ways 4 consonants can take 4 places = 4P4 = 4! =
24 ways.
• Therefore, total number of permutations possible = 24*24 = 576 ways.
Example 13:
How many three-digit number can be formed using the
digits 1,2,3,4,5,6 such that
a. Repetition is not allowed
b. Repetition is allowed
c. End in even number (no repetition)
d. Start and end in odd number (with repetition)
e. Greater than 300 (no repetition)

You might also like