0% found this document useful (0 votes)
125 views25 pages

Math 10 Permutation - Dis-Cir - Combination

The document discusses classroom rules and provides examples and explanations of distinguishable permutations and circular permutations. It defines distinguishable permutations as arrangements where some objects are alike and provides the formula to calculate these. It also defines circular permutations as arrangements in a circular pattern and provides examples and explanations of calculating these.
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
0% found this document useful (0 votes)
125 views25 pages

Math 10 Permutation - Dis-Cir - Combination

The document discusses classroom rules and provides examples and explanations of distinguishable permutations and circular permutations. It defines distinguishable permutations as arrangements where some objects are alike and provides the formula to calculate these. It also defines circular permutations as arrangements in a circular pattern and provides examples and explanations of calculating these.
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/ 25

Classroom rules:

 Be kind, cooperative, and respectful.


 Listen attentively while the teacher or
someone is talking.
 Raise your hand if you want to answer and
avoid answering in chorus.
 Be honest and avoid cheating.
 Be responsible for your learnings.
Distinguishable Permutations AND
Circular Permutations

MATHEMATICS 10

Prepared by: Ma’am Jean Comia


What is a distinguishable
permutation?

The number of permutations of n objects where a


things are alike, b things are alike and c things are
alike, and so forth, is said to be Distinguishable
Permutation. The formula is as follows:
example
Find the number of ways of placing 12 balls in a row given that 5
are red, 3 are green and 4 are yellow.

This would be
Find the number of ways of placing 12 balls in a row given that 5 are red, 3 are
green and 4 are yellow.
This would be
Another way to think about this problem is to choose five of the twelve spaces in
which to place the red balls - since the order of selection is not important, there are C(12,5)
ways to do this. Then, from the remaining 7 spaces available, we need to choose three of
them in which to place the green balls. There are C(7,3) ways to do that. The four yellow
balls are then placed in the remaining four spaces.
The result of this process is that there are C(12,5) ways to choose the places for the red
balls and C(7,3) ways to choose the places for the green balls, which results in:

This results in the same answer as when we approached the problem as a permutation.
Find the number of permutations of the letters of the word STATISTICS.
Solution:
There are 10 letters of the word. Assuming that the letters are distinct, there are P(10, 10) =
10! permutations.
However, we have to take into consideration that the 3 S’s are alike, the 3 T’s are alike, and
the 2 Is are also alike. The permutation of the 3 S’s is P(3, 3) = 3!. The permutation of the 3 T’s is
P(3, 3) = 3! The permutation of the 2 T’s is P(2, 2) = 2!
So we must divide 10! by 3! 3! 2! in order to eliminate the duplicates.
Thus,
permutations
This leads to the next rule.
The number of distinguishable permutations, P, of n objects where p objects are alike, q objects
are alike, r objects are alike, and soon, is
Let us now consider the arrangement
of objects in a circle, which we call
circular permutations.
What is circular permutation?
A special case of permutation where the arrangement of things is in a circular
pattern is called CIRCULAR PERMUTATION. The most common example
of this type is the seating arrangement of people around a circular table.
example
In how many ways can 3 people be seated around a circular table?

Solution: n=3

m e n t 1 - 2 - 3 i n (a)
t h a t t h e a r r a n g e
Notice
s a m e a s 2 -3 - 1 a n d 3 -
(a) a b o v e i s t h e
t h e s e 3 p e r m u t a t i o n s
1-2 ; m e a n i n g
t h e s a m e . N o t i c e a l s o
are just o n e a n d
n t s 1 - 3 - 2 , 3 - 2 - 1 , (b)
t ha t t h e a r r a n g e m e
a l s o j u s t t h e s a m e a s
and 2 - 1 - 3 a re
s e e n i n (b ).
In how many ways can 4 people be seated around a circular table?
Notice that the arrangement 1-2-3 in (a) above is the same as 2-3-1 and 3-1-2; meaning
these 3 permutations are just one and the same. Notice also that the arrangements 1-3-2,3-
2-1, and 2-1- 3 are also just the same as seen in (b).

Solution: (n = 4) Let us call the 4 people A, B, C, D


The arrangements are:
A-B-C-D A-B-D-C A-C-B-D A-C-D-B A-D-B-C A-D-C-B
B-C-D-A B-D-C-A C-B-D-A C-D-B-A D-B-C-A D-C-B-A
C-D-A-B D-C-A-B B-D-A-C D-B-A-C B-C-A-D C-B-A-D
D-A-B-C C-A-B-D D-A-C-B B-A-C-D C-A-D-B B-A-D-C
based on the list made
The permutation of n
objects arranged in a circle
is
P = (n-1)!
activity time:
Warm that mind up!
Solve for the unknown in each item, and then answer the questions
that follow.

1. P(6, 6) = 6. P(8, r) = 6 720


2. P(7, r) = 840 7. P(8, 3) =
3. P(n, 3) = 60 8. P(n, 4) = 3024
4. P(n, 3) = 504 9. P(12, r) = 1320
5. P(10, 5) = 10. P(13, r) = 156
Answer:
1.
2.
0 !=1 !
Answer:

3.
4.
Answer:
5.
6.
Answer:

7.
8.

336
Answer:
9.

10.
PART II: Decisions from Permutation
Answer each permutation problem completely.

Solution:
1. In how many
different ways can you
1.
arrange 8 figurines on
a shelf?
0 !=1 !
2. a.
We multiply by 2! 2. There are 4 different
because there are 2 Mathematics books and 5
subject areas and different Science books. In
Mathematics books how many ways can the
may be followed by books be arranged on a shelf
b. 2! Science books, or if
vice versa. a. books of the same
subject must be placed
c. 5•4•4•3•3•2•2•1•1 together?
Or 5! •4! = 2880 b. if they must be placed
alternately?
c. If they must be placed
alternately?
Answer:

3. How do you
determine if a A situation or problem
situation or problem involves permutations if
involves the order of the objects
permutations? is important.
IN ORDER TO
SUCCEED, WE MUST
FIRST BELIEVE WE
CAN.
Thank you
Any Questions?

You might also like