Sei sulla pagina 1di 16

UNIT 3

Module 6:
PERMUTATIONS AND
COMBINATIONS
Lesson 1

PERMUTATIONS
OBJECTIVES
• Recall the fundamental counting
principles (FCP).
• Recall the tree diagram.
PRE-TEST
ACTIVITY 1
Can You Show Me The
Way?
A. A close friend 1. Assuming that any
invited Anna to her skirt can be paired
birthday party. Anna with any blouse, in
has 4 new blouses how many ways can
(stripes, with ruffles, Anna select her
long-sleeved and outfit? List the
possibilities.
sleeveless) and 3 skirts
(red, pink and black) 2. How many skirt-
and-blouse pairs are
in her closet reserved
possible?
for such occasions.
3. Show another way of
finding the answer 1.
Tree Diagram

Tree diagrams display all the possible


outcomes of an event. Each branch of the tree
diagram represents a possible outcome.

Tree diagrams can be used to find the


number of possible outcomes and calculate
the probability of possible outcomes.
Stripes
Skirt
Ruffles
Red
Red
Long-
Sleeved Pink
Sleeveless Black
Stripes
Blouses
Ruffles
Pink Stripes
Long-
Sleeved with Ruffles
Sleeveless Long-sleeved
Stripes
Sleeveless
Ruffles
Black
Long-

Tree Diagram
Sleeved

Sleeveless
Stripes Red – stripes
Ruffles
Red – ruffles
Red Red – long-sleeved
Long-
Sleeved Red - sleeveless
Sleeveless Pink – stripes
Pink – ruffles
Stripes
Pink – long-sleeved
Ruffles Pink - sleeveless
Pink
Long-
Sleeved
Black – stripes
Black – ruffles
Sleeveless
Black – long-sleeved
Stripes Black - sleeveless

Black
Ruffles
12 outcomes
Long-

Tree Diagram
Sleeved

Sleeveless
Fundamental Counting
Principle
Fundamental Counting Principle (FCP)
can be used determine the number of possible
outcomes when there are two or more
characteristics .
Fundamental Counting Principle states
that if an event has m possible outcomes and
another independent event has n possible
outcomes, then there are m* n possible
outcomes for the two events together.
FCP
m – number of blouses 4
n – number of skirts 3

by fundamental counting principles


m * n = =4 *3 12 outcomes
Can You Show Me The
Way?
B. Suppose you 1. List all the
secured your bike possible codes out
using a combination of the given digits.
lock. Later, you realize
2. How many
that you forgot the 4-
possible codes are
digit code. You only
remembered that the there?
code contains the 3. What can you say
digits 1, 3, 4, and 7. about the list you
made?
EXAMPLE
Two-digit numbers are formed from the
digits 0, 1, 2, 3, 4, 5.
a. How many two-digit numbers can be
formed
b. How many of these are even?
c. How many of these are odd?
d. Hoe many of these are divisible by 3?
e. How many of these are less than 40?
Count Me In!
Answer the following questions.
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 Rosing
arrange 6 potted plants in a row?
4. How many four-digit number can be
formed from the numbers 1, 3, 4, 6, 8,
and 9 if repetition of digit is not allowed?
5. If there are three roads from Town A to
Town B and 4 roads from Town B to
Town C, in how many ways can one go
from Town A to Town C and back to
Town A, through Town B, without
passing through the same road twice
ASSIGNMENT

ACTIVITY 2
Nos. 6-10 page 285

ACTIVITY 3
Page 286

Potrebbero piacerti anche