PERMUTATION
Permutation of n Objects Taken r at a Time
Before we learn about permutations, let's recall how to evaluate factorial notations
Answer the following:
1. 7! = 5040
2. 1! = 1
3. 2! = 2
4. 6! = 720
5. 10! = 3,628,800
1 Permutation - ordered arrangement of a set of objects. A permutation is an arrangement of all or part of a
set of objects, with regard to the order of the arrangement.
Example:
The set of 3-digit numbers that can be formed using the digits 1, 2, and 3 is a set of permutations.
Permutation
-Permutation of n objects taken r at a time.
-Permutation of n objects taken all at a time
-Distinguishable Permutation
-Circular Permutation
2 Permutation of n Objects Taken r at a Time
-ordered arrangement of n objects taken r at a time where n ≥ r
Example: In how many ways can you arrange 12 different books on a shelf that can hold only 6 books?
In the given problem, n=12 is the number of objects while r=6 is the number of objects taken at a time.
3 Solving the Number of Permutations of n Objects Taken r at a Time
The number of permutations of n objects taken r at a time, denoted by P(n,r) or
Example 1: Suppose we have 6 different potted plants and we wish to arrange 4 of them in a row. In
how many ways can this be done?
Solution:
We need to determine the number of ways we can arrange 4 pots in a row.
1. Identify n and r.
There are 6 potted plants, so n=6.
The plants that you wish to arrange is 4 at a time, so r=4.
Example 2: In how many ways can you arrange 8 students in a photograph?
Solution:
We need to determine the number of permutations of the 8 students.
1. Identify n and r.
There are 8 students, so n=8. All the students are to be arranged in the photograph at a time, so r=8.
Example 3: A company has 12 members in its board of directors who will elect a president, vice
president, secretary, and treasurer among themselves. In how many ways can this be done?
Solution:
We need to determine the number of permutations of the officers to be elected from the members of the board
of directors.
1. Identify n and r.
There are 12 members in the board of directors, so n=12. There are 4 positions to be filled, so r=4.
FUNDAMENTAL COUNTING PRINCIPLE & FACTORIAL NOTATION
1 Fundamental Counting Principle
- a mathematical way used to find the number of possible outcomes of an experiment.
Example:
Given the 4-letter word READ. In how many ways can we arrange its letters, 3 at a time?
Solution: There are 3 positions filled. We write the horizontal marks: _ _ _. On each horizontal mark, we write
the number of choices we have in filling up the said position. There are 4 choices for the first position.
432
We apply the Fundamental Counting Principle and multiply:
4 • 3 • 2 = 24
2 Factorial Notation
- the notation n!, where n > 0 and n! = n(n-1)(n-2)...2(1)
Example:
Evaluate 3!.
To evaluate 3!, multiply the natural numbers in decreasing order starting from 3.
3! = 3(2)(1) = 6
Example 1: Evaluate 5!.
Solution:
1. Evaluate 5! by multiplying the natural numbers in decreasing order starting from 5
5! = 5(4)(3)(2)(1) = 120
Example 2: Evaluate 5! x 4!.
Solution:
1. Evaluate 5! and 4!.
5! = 5(4)(3)(2)(1) = 120
4! = 4(3)(2)(1) = 24
2. Multiply 5! and 4!.
5! x 4! = 120(24) = 2880
Thus, 5! x 4! is equal to 2880.
Example 3: Ten runners join a race. In how many possible ways can they be arranged as first, second, and
third placers?
Solution:
1. Identify the number of ways we can choose the first, second, and third placers.
2. Number of possible outcomes for winners is
1st place 2nd place 3rd place
10 possible winners x 9 possible winners x 8 possible winners
720 possible outcomes for the top three in the race.
