Professional Documents
Culture Documents
THIRD GRADING
(LESSON 1)
PRAYER
In the name of the Father, and of the Son, and of the Holy Spirit. Amen.
Heavenly Father and Your Beloved Son Jesus Christ,
We thank you for giving us another life,
We thank you for another Beautiful day.
As we go on through our lessons today,
May you make us instruments to do good things.
Please enlighten our minds,
Give us the strength to participate in our subject today.
Thank you for this opportunity to learn and serve others,
and help us to always remember the Truth of Your Glory!
In Jesus’ name. Amen
COMBINATORICS
(Lesson 2)
Introduction:
Have you ever wondered why cellular phones or telephones
have no duplication of numbers? How many ways can three
questions are answered? To answer these questions, it is important
to list all possibilities or use the methods of counting: the
Fundamental Principle of counting, Permutation and Combination
play an important role on it. These three methods are known as
Combinatorics.
Lesson 2.1
PERMUTATIONS
Learning Objectives:
At the end of the lesson the student should be able to:
1. Count the number of occurrences of an outcome using
the fundamental counting principle;
2. Understand the concept of factorial notation;
3. Illustrate the permutation of objects;
4. Solve problems involving permutation; and
5. Appreciate the importance of counting techniques in
life.
EXPLORE:
Activity Title: Factor ME!
Main Idea: The number of ways of arranging n distinct objects is n! = n • (n – 1). ... •1
Learning Target: Evaluate Factorials by applying the fundamental principles of counting
Directions: Find the value of the following factorials.
=
= =
= 22
= = 6,480
Firm – Up
P(n, r) or nPr =
where: n ---- denotes the total number of objects that you are working with.
---- the number of options
r ---- denotes the number of objects that you are selected
---- the number of spot / position
3 types of solving Permutation
1. Listing Method
Ex. How many codes can be formed in a lock requiring 3 unique digits
chosen from 0 to 7.
01234567
-012 021 031 041 051 061 071…
- 0 1 3 0 2 3 0 3 2 0 4 2 0 5 2 0 6 4 and so on
- 0 1 40 2 4 0 3 4 0 4 3 0 5 3 0 6 3
- 0 1 50 2 5 0 3 5 0 4 5 0 5 4 0 6 4
-016 026 036 046 056 065
- 0 1 70 2 7 0 3 7 0 47 0 5 7 0 6 7
3 types of solving Permutation
2. Factorial Method
Ex. How many codes can be formed in a lock requiring 3 unique digits
chosen from 0 to 7.
0 1 2 3 4 5 6 7
Given : n=8 Formula: nPr = n!
r=3 (n – r)!
n = number of options = 8
r = number of spots / position = 3
0 1 2 3 4 5 6 7
8 7 6 = 8 x 7 x 6 = 336
Hundreds Tens Ones
digit digit digit
Examples:
2.) How many different signals can be made using five flags if all
the flags must be used in each signal?
Solution: nPr =
5P5 =
5P5 =
5P5 =
5P5 = 120 different signals
Examples:
3.) How many codes can be formed of 4 uniques digits of
numbers from 0 to 9? Seat Technique method
0, 1, 2, 3, 4, 5, 6, 7, 8, 9
10P4 =
Solution: nPr =
Seat Technique Method
n = 7, r = 2 1, 2, 3, 4, 5, 6, 7
7P2 =
7 6 = 42 ways
tens ones
7P2 =
digit digit
7P2 = 42 ways
Note: If the arrangement of n objects in a circular pattern is given
by the formula P = (n–1)!
B. Find the number of permutation of the letters of each word. Show your solution.
1. BALL
2. BIBLE
C. Problem solving: Apply the formula in solving the permutation. Show your complete solution.
1. Eight people enter a bus with twenty empty seats. In how many ways may they be seated?
2. How many permutations of the word BOOKKEEPER are there?
https://www.y2mate.com/youtube/kQmtvAKUXew
CHALLENGE YOURSELF!
https://www.y2mate.com/youtube/kQmtvAKUXew
Find the values of the following permutations:
1.) 8P8 2.) 10P4
nPr =
nPr =
10P4 =
8P8 =
10P4 =
8P8 =
10P4 =
Given: P=
n = 20
r=4
P=
Solution:
We need to select four out of
20 members and arrange P=
them in all possible orders; we
need to find the permutation P = 116 280 set of officers
of 20 taken four at a time.
4.) If a bookshelf has space for four books and
there are 10 different books available, how many
different book arrangements can be made?
Given:
P=
n = 10
r=4
P=
Solution:
P=
P = 5 040 books arrangements
that can be made
5.) In how many ways can four boys and five girls be seated in a
row of nine seats if boys and girls are to occupy alternate seats?
Solution: A girl should occupy the first seat on the left since there are five of them,
therefore the first seat can be occupied by any one of the five girls; the second
seat can now be occupied by any one of the four boys; then the third seat can
be occupied by one of the remaining four girls; while the fourth seat can be
occupied by one of the three remaining boys; and so on.
5 4 4 3 3 2 2 1 1
Hence, there are 2 880 ways to seat them.
6.) How many arrangements of the letters are there in the word
EQUATIONS if all the vowels are together?
Solution:
Given:
n=9 P=
r = vowels = 5
Q, T, N, S = 1
P=
P=
P = 3 024 arrangements
Lesson 2.2
COMBINATION
Learning Objectives:
Start A
T
When counting the possible number of permutations of a set of elements, order is
important. However, there are situations where we are only concerned with the
number of ways we can select relements from a set of nelements. This is a combination
denoted by () or nCr. We read this as the number of combinations of nelements taken
rat a time.
Definition of Combination
A combination is a subset of r distinct elements selected out of n elements without
regard to order. The number of combinations of n elements taken r at a time is denoted
by nCr = ().
10C5 =
10C5 =
nCr =
Solution:
A royal flush consists of
ace, king, queen, jack 5C2 =
and 10 of the same suit.
Given: 5C2 =
n=5
r=2 5C2 =
Select four from 10 boys Select two from 8 girls Multiply the answer
= = from boys and girls
= =
(210)(28)
= 5880 committees
that can be formed.
= =
= 210 = 28
4.) A bag contains five red marbles, seven white marbles, and eight blue
marbles. How many ways can five marbles be selected if all marbles are blue?
Solutions:
Five blue marbles can Five blue marbles can Five blue marbles can
be selected from eight be selected from seven be selected from five
blue in ways. white in ways. red in ways.
nCr = nCr = nCr =