Math10.C5L3 Permutations

Download as pdf or txt
Download as pdf or txt
You are on page 1of 18

10th grade

PERMUTATIONS

Our World of Math 10, page 204


At the end of the lesson, the learners will be able to:
• derive and apply the formula for finding the number of
permutations of n objects taken r at a time in solving
problems.
n! read as n factorial is the result in multiplying all positive
integers less than or equal to n. It is solved by using the formula
n!  n   n  1   n  2    n  3 1
Permutation
A permutation is an arrangement or ordering of a set of
objects. The number of permutations n of distinct objects taken r
at a time is given by
 n n!
    n r
 P n, r  P  ,n  r
r n  r!
The Art Club organized a competition among Junior High art
enthusiasts. From the submitted entries, the organizers chose ten
and asked the judges to do distinct rankings (ruling out ties) with
the notion that the top three will be winners. The school head is
looking for a method to determine the total number of possible
rankings.
Using the permutation formula, we have
n!  10 
n Pr      P 10, 3 
 n  r !  3 
10!
10 P3 
10  3  !
10  9  8  7!

7!
 10  9  8  720
Since ranking is an arrangement, we take three  r 
winners from ten  n  finalists.
Here are some definitions to avoid the long computations.
n Pn  n !
n P1  n
n P0  1
0!  1
Circular Permutation
The number of circular permutations of n different objects
is (n - 1)!.
Six girls were asked to sit in a round table. On how many ways
can they be seated?

 n  1 !   6  1 !  5!  120 ways
Permutation with Repetition
If among n objects, n1 are alike, n2 others are alike, still
n3 others are alike, and so on, then the number of distinct
permutations of the objects taken all together is
n!
n1 ! n2 ! n3 ! nk !
How many distinct permutations can be formed from all the
letters of the word ACCESS?
The word ACCESS has six letters, two C’s, two S’s, one A, and
one E. Then, n  6, n1  2, n2  2, n3  1, n4  1
n! 6!

n1 ! n2 ! n3 ! n4 2! 2! 1! 1!
6  5  4  3  2!

2! 2!
 180
Therefore, there are 180 different permutations.
7!
7 P4 
 7  4 !
7  6  5  4  3!

3!
 7  6  5  4  840
7!
7 P5 
 7  5!
7  6  5  4  3  2!

2!
 7  6  5  4  3  2520
 n  1 !  10  1 !  9!  362 880 ways
20!
20 P3 
 20  3  !
20  19  18  17!

17!
 20  19  18  6840

You might also like