Permutation is an arrangement of a number of objects in a definite order.

Order is important

ABC , how many possible arrangements are there (draw a tree diagram)(do listing method)

ABC BAC CAB 6 possible arrangements, ABC is different from CBA because order is important

ACB BCA CBA

Fundamental Counting Principle

If there are m ways to do one thing, n ways to do another, and o ways to do another,

then, there are m x n x o of doing those things.

We have : m x n x o = (3)(2)(1) = 6 possible ways to arrange the letters

In this example you notice that the factors are decreasing. Another way of writing

(3)(2)(1) is 3! ( read as 3 factorial ).

Therefore, 3! = (3)(2)(1) = 6; 3! = 6

Factorial Notation

If n is a positive integer, n! is a product of all positive integers less than n or equal to n.

We also define 0! = 1

The only downside of using FCP(Fundamental Counting Principle) is that you cannot

see the specific lists of the possible outcomes; you can only find the number of the

possible ways or the number of permutations. But, as we continue our lesson you will learn

the significance of this concept or principle about deriving the formulas of permutations.

1. Ten runners join a race. In how many possible ways can they be arranged as first, second, and
third placers?

2. If Jun has 12 T-shirts, 6 pairs of pants, and 3 pairs of shoes, how many possibilities can he dress
himself up for the day?

3. In how many ways can Aling Rosa arrange 6 potted plants in a row?

4. How many four-digit numbers can be formed from the numbers 1, 3, 4, 6, 8, and 9 if repetition of
digits is not allowed?
Tell whether the situation is permutation or not.

1. Winning in a Math quiz bee

2. Selecting 7 people to form a Student Affair Committee

3. Drawing a set of 6 numbers in a lottery containing numbers 1 to 58

4. Assigning seats to guests at dinner

5. Opening a combination lock of a locker

Answer Key

1. Permutation

2. Not

3. Not

4. Permutation

5. Permutation

Permutation of n objects taken r at a time

P(n , r )∨❑n Pr or P {nr}

 n!
P ( n , r )=
( n−r ) !
Example 1

P|( 5 ,2 ) Shortcut Method

n=5 r=2 P ( 5 ,2 ) multiply two consecutive factors starting with 5

n!
P ( n , r )= P ( 5 ,2 )=5∗4=20
( n−r ) !
5! 5! 5∗4∗3!
P ( 5 ,2 )= = = =20
( 5−2 ) ! 2! 3!

Example 2

Calculate P ( 10 , 3 )
n=10 r=3
n!
P ( n , r )=
( n−r ) !
10 ! 10 ! 10∗9∗8 !
P ( 10 ,3 )= = = =720
( 10−3 ) ! 3 ! 8!

Example 3

In how many ways can a group of 4 students arrange themselves in a row for picture taking?

n=4 r=4
n!
P ( n , r )=
( n−r ) !
4! 4 ! 4∗3∗2∗1
P ( 4 , 4) = = = =24
( 4−4 ) ! 0 ! 1

Example 4

In how may different ways can 4 cars be parked if there are 10 available parking spaces?

n=10 r=4
n!
P ( n , r )=
( n−r ) !
10! 10! 10∗9∗8∗7∗6 !
P ( 10 , 4 )= = = =5040
( 10−4 ) ! 6! 6!

Example 5
How many 4-letter words can be formed from the letters in the word MOBILE?

n=6 r=4 P ( 6 , 4 )=6∗5∗4∗3=360

Distinguishable Permutation
Refers to the permutation of a set of objects where some of them are alike

Number of permutations of n objects where p are alike, q are alike, r are alike and so on, is

n!
P=
p!q!r !
Example 1

How many distinct permutations can be made from the letters of the word “LEGEND”

n=6 E=2
n! 6 ! 6∗5∗4∗3∗2!
P= = = =360
p!q!r ! 2! 2!
Example 2

How many distinct permutations can be made from the letters of the word “SUCCESS”

n=7 S=3 C=2

n! 7! 7∗6∗5∗4∗3 !
P= = = =420
p ! q ! r ! 3 ! 2! 3 !∗2∗1
Example 3

In how may ways can 3 red balls and 4 yellow balls be arranged in a row?

n! 7! 7∗6∗5∗4 !
P= = = =35
p ! q ! r ! 3 ! 4 ! 3∗2∗1∗4 !

Circular Permutation
Permutation of n distinct objects arranged in a circle.

Formula (n−1)!

Example 1

How many ways can 4 people sit around a circular table?

n=4 ( n−1 ) !=( 4−1 ) !=3 !=3∗2∗1=6

Example 2

How many ways can 4 boys and 2 girls be seated at a round table?
n=6 ( n−1 ) !=( 6−1 ) !=5 !=5∗4∗3∗2∗1=120
Example 3

How many ways can 3 girls and 5 boys be seated around a circular table if all girls must sit together?

3 girls = 1 group ¿ ( 6−1 ) !∗3 !

1 group seat and 5 seats ¿ 5 !∗3!
n=6 ¿ 5∗4∗3∗2∗1∗3∗2∗1
( n−1 ) !=( 6−1 ) ! ¿ 720
3 girls = 3!

1 !=1
2 !=2
3 !=6
4 !=24
5 !=120
6 !=720
7 !=5 040
8 !=40 320
9 !=362 880

Solve for n
a. P ( n , 2 )=56
n!
P ( n , r )=
( n−r ) !
n!
=56
( n−2 ) !
n ( n−1 ) ( n−2 ) !
=56
( n−2 ) !
n ( n−1 )=56
 √2 56=7.4 round of ¿ 8
2
7 =49
2
8 =64
56 is between 49 & 64
8∗7=56
n=8
b. P ( n , 3 )=5 !
n!
P ( n , r )=
( n−r ) !
n!
=5!
( n−3 ) !

n ( n−1 ) ( n−2 )( n−3 ) !

=5∗4∗3∗2∗1
( n−3 ) !
n ( n−1 )( n−2 )=120

√3 120=4.9 rounded of ¿ 5
6∗5∗4=120
n=6

c. P ( n , 5 )=720
n!
P ( n , r )=
( n−r ) !
n!
=720
( n−5 ) !
cross multiply
n !=720 ( n−5 ) !
n !=6 ! ( n−5 ) !
cancel all Factorial notation (!)
n=6 ( n−5 )
n=6 n−30
n−6 n=−30
 −5 n −30
=
−5 −5
n=6

More examples!
Find the value of n
1. P ( n , 3 )=60
2. P ( n , 4 )=3024
3. P ( n , 3 )=504
4. P ( n , 4 )=120
5. P ( n , 4 )=5040

Solve for r
a. P ( 8 , r )=6 720
n!
P ( n , r )=
( n−r ) !
8!
=6 720
( 8−r ) !
40 320
=6 720
( 8−r ) !
cross multiply
6 720 ( 8−r ) !=40 320
6 720(8−r )! 40320
=
6720 6720

40 320
=( 8−r ) !
6 720
6=( 8−r ) !
3 !=( 8−r ) !
cancel all Factorial notation (!)
 3=( 8−r )
r =8−3
r =5
b. P ( 12 ,r ) =1320
12∗11∗10=1 320

Activity 1

Tell whether the situation is permutation or not.

1. In how many ways can five books be arranged on a shelf?

2. In how many ways can six students be seated in a row?
3. In how many ways can a group of five be selected from nine people?
4. How many sets of five cards each can be formed from a standard deck of cards?
5. A group of ten students will go run a race. the top three runners will be 1 st,2nd and 3rd placers.

6. P ( 6 , 6)
7. P ( 7 , 3)
8. P ( 9 , 2)
9. P ( n , 3 )=504
10. P ( 9 , r )=3024

11. In how many ways can six students be seated in a row?

12. Ten schools in Alaminos are in need of teachers. If there are four qualified applicants, how many
ways can they be assigned?
13. How many distinct permutations can be made from the letters of the word “VALENTINES”
14. In how many ways can 3 women and 4 men sit in a round table?
15. In question no 4. What if all the women sit together?
COMBINATION

Refers to the number of ways of selecting from a set when the order is not important

Changing the order of the objects does not create a new combination.

R, S and T

RS RT ST

SR TR TS

3 combinations

A combination is an arrangement of n objects with no repetitions and the order is not important

Combination of n distinct objects taken r at a time where r ≤ n : C (n , r )

n!
C (n , r )=
( n−r ) ! r !

Example 1:

Evaluate C (6 , 2) n=6 r=2

n!
C (n , r )=
( n−r ) ! r !

6!
C ( 6 ,2 ) =
( 6−2 ) ! 2!

6!
C ( 6 ,2 ) =
4!2!

6∗5∗4 !
C ( 6 ,2 ) =
4 !∗2∗1

C ( 6 ,2 ) =15

Shortcut method,

P(6 ,2)
C (n , r )=
2!

6∗5
C (n , r )=
2∗1
C ( n , r ) =15

Example 2:

Evaluate C (5 ,5) n=5 r=5

n!
C (n , r )=
( n−r ) ! r !

5!
C ( 5 , 5 )=
( 5−5 ) ! 5 !

5!
C ( 5 , 5 )=
0!5!

5!
C ( 5 , 5 )=
5!

C ( 5 , 5 )=1

Hence

n=r

C ( n , r ) =1

Example 3:

In

Evaluate C (5 ,5) n=5 r=5

Examples:

1. A committee of 5 persons will be chosen from a group of seven persons.

2. A hand of 13 cards having exactly 10 spades drawn from a deck of cards.
3. A player chooses 6 numbers from 1 to 42 in no particular order.
4. In how many ways can a principal choose 3 of their 20 teachers to attend a seminar in Manila?
5. Six officers of the Mathematics club are in a conference room. If each one shakes hands with
each of the other once, how many handshakes are possible?