Scribd
Upload
168 views23 pages

Illustrating The Permutation of Objects

Ten runners joined a race and the document asks how many possible ways they can be arranged as first, second, and third placers. It defines a permutation as an ordered arrangement of distinguishable objects without repetition. It notes that n factorial (n!) is the product of all integers less than or equal to n. The document then provides examples of problems involving permutations and asks the reader to find the total number of permutations for various words and numbers.

Uploaded by

Carisma De Leon
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
168 views23 pages

Illustrating The Permutation of Objects

Ten runners joined a race and the document asks how many possible ways they can be arranged as first, second, and third placers. It defines a permutation as an ordered arrangement of distinguishable objects without repetition. It notes that n factorial (n!) is the product of all integers less than or equal to n. The document then provides examples of problems involving permutations and asks the reader to find the total number of permutations for various words and numbers.

Uploaded by

Carisma De Leon
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

ILLUSTRATING THE

PERMUTATION OF OBJECTS
Are you an athletic person? Have you ever tried
joining on a race? What was your place or rank?
Ten runners join a race. In how many possible ways
can they be arranged as first, second, and third
placers?
A permutation is an arrangement of things in
a definite order or the ordered arrangement of
distinguishable objects without allowing
repetitions among the objects.
In general, if n is a positive integer, then n
factorial denoted by n! is the product of all
integers less than or equal to n.
n! = n· (n – 1) · (n – 2) · … · 2 · 1
As a special case, we define 0! = 1.
Distinguishable permutations – refers
to the permutations of a set of objects
where some of them are alike. The
number of distinguishable permutations
of n objects when p are alike, q are alike,
r are alike, and so on, is given by the
formula
P=
COMPLETE THE MISSION!

1. How many distinguishable permutations are


possible with all the letters of the word
PHILIPPINES?

2. Find the number of different ways that a family


of 6 can be seated around a circular table with 6
chairs.

3. Find the number of distinguishable


permutations of the digits of the number 348 838.
Find the total number of different permutations
of all the letters of the word and number given
(show your solutions).

1. MISSISSIPPI
2. CALCULUS
3. 31232
4. GEOMETRY
5. (your surname)
1. In how many ways can 5 people be arranged for a
picture taking?
2. Given 5 flavoured of ice cream, in how many
ways can you select 2 flavors?
3. Find the number of permutations of the letters of
the word GOOGLE.
4. Five variety of potted plants can be arranged in a
mini circular garden, in how many ways can Maria
arranged them?
5. If there are 10 people and only 6 chairs are
available, in how many ways can they be seated?
SOLVING PROBLEMS
INVOLVING
PERMUTATIONS
Going further, let’s see other
situations where permutation is
applied. Let’s consider these
following examples.

You might also like