Permutations 01

The document discusses permutations and provides examples of solving permutation problems. It begins by defining permutations as arrangements of all or part of a set of objects. It then gives examples of permutations, such as arranging items on a shelf or electing board members. The formula for permutations, nPr, is introduced as n!/(n-r)!, where n is the total number of objects and r is the number being arranged. Several problems are solved as examples, using both the formula and a shortcut method. The document aims to help learners understand permutations and be able to evaluate them.

Uploaded by

syron anciado

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

16 views46 pages

Permutations 01

Uploaded by

syron anciado

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 46

Are You Ready?

At the end of the lesson, learners are

expected to:

OBJECTIVES 1 Recall the definition of

factorial notations.

2
Identify different
scenario/examples of
permutations

3 Evaluate permutations using

the formula.
At the end of the lesson, learners are
expected to:

OBJECTIVES 4
Appreciate the significance of
applying permutations in real-
word situations.
* RECALL:
1. What is factorial notation?
2. What is expressed by n!, where n is a
positive integer?
3. Is there a relationship between factorial
notations and the fundamental counting
principle?
ACTIVITY 1: 3X3 SUDOKU PUZZLE
1. Fill-out the 3X3 squares by the numbers 1-9 to solve
the puzzle.
2. The numbers must not be repeated inside of each
square and in each line horizontally or vertically.
3. The sum of every line (horizontal or vertical) must be
equal to 15.
ACTIVITY 1: 3X3 SUDOKU PUZZLE
1.
5 9
6
8
ACTIVITY 1: 3X3 SUDOKU PUZZLE
2.
1 5

8 4
ACTIVITY 1: 3X3 SUDOKU PUZZLE
3.
1
7 6
4
ACTIVITY 1: 3X3 SUDOKU PUZZLE
1.
5 1 9
7 6 2
3 8 4
ACTIVITY 1: 3X3 SUDOKU PUZZLE
2.
1 5 9
6 7 2
8 3 4
ACTIVITY 1: 3X3 SUDOKU PUZZLE
3.
9 5 1
2 7 6
4 3 8
ACTIVITY 1: 3X3 SUDOKU PUZZLE

Questions:
1. How many numbers in the first row?
2. What are these numbers?
3. How many possible arrangements of
numbers 1,5, and 9 in the first row?
Think and Analyze!
*
The racing club organizes a race in which three
cars A, B, and C are joined.
Questions:
*
1.How many possible race results are there
if there are no ties?

2.In how many ways can the first two

positions be filled if there are no ties?
POSSIBLE RACEPOSSIBLE
RESULTS RACE RESULTS

POSSIBLE RESULT 1
POSSIBLE RESULT 1
POSSIBLE RESULT 2
POSSIBLE RESULT 2
POSSIBLE RACEPOSSIBLE
RESULTS RACE RESULTS

POSSIBLE RESULT 1
POSSIBLE RESULT 1
POSSIBLE RESULT 2
POSSIBLE RESULT 2

POSSIBLE RESULT 3

POSSIBLE RESULT 4
POSSIBLE RACEPOSSIBLE
RESULTS RACE RESULTS

POSSIBLE RESULT 1
POSSIBLE RESULT 1
POSSIBLE RESULT 2
POSSIBLE RESULT 2

POSSIBLE RESULT 3

POSSIBLE RESULT 4

POSSIBLE RESULT 5

POSSIBLE RESULT 6
POSSIBLE RACEPOSSIBLE
RESULTS RACE RESULTS

POSSIBLE RESULT 1
1. How many possible race 1
6 results are there if
POSSIBLE RESULT 2 there
2
are no ties?
3
6 2. In how many ways can the
first two positions be filled 4
if there are no ties? 5
6
* Permutation
A permutation is an arrangement of
all or part of a set of objects.
The number of permutations of n taken r at a
time is given by
�!
�
nPr or �� = ; where r ≤ n
�−� !
1. Dressing mannequins in different ways
using new dresses.
2. Placing different books in order on a shelf.
3. Electing a member of the Board of
Directors
What is the difference between Permutation lock and
Combination lock?
Permutation Lock Combination Lock
Are You Ready?
d
d
 d



Example 1:
�
�. �� , �� = � �� = �.
1 �!
3 5
� � � ∙ � ∙ � ∙ � �
�� = �� = �� = ��
�−� ! � !

2 �!
4
� � � ∙ � ∙ � ∙ �
�� = �� =
�−� ! �
d
d
 d



Example 1:
�
�. �� , �� = � �� = �. In
Shortcut Method,
1
�
�� = �! = � ∙ � ∙ � ∙ �

2
�
�� = ��
d
d
 d



Example 1:
�
�. �� , �� = � �� = �.
1 �!
3 � ∙ � ∙ � ∙ � ∙ �
5
� � �
�� = �� = �� = ��
�−� ! � !

2 �! 4 � ∙ � ∙ � ∙ � ∙ �
� �
�� = �� =
�−� ! �∙�
d
d
 d



Example 1:
�
2. �� , �� = � �� = �. In
Shortcut Method,
1
�
�� =�∙�∙�

2
�
�� = ��
d
d
 d

