Professional Documents
Culture Documents
G10 Math Q3 - Week 5 - Solves Problem On Permutation and Combination
G10 Math Q3 - Week 5 - Solves Problem On Permutation and Combination
ON
PERMUTATIONS
AND COMBINATION
WARM UP – FIND THE MEAN
AND THE STANDARD
DEVIATION.
WARM UP – FIND THE MEAN
AND STANDARD DEVIATION
OBJECTIVE
•Find Sample Space
using Permutations
and Combinations
RELEVANCE
• Learn various methods of finding
out how many possible outcomes
of a probability experiment are
possible.
• Use this information to find
probability.
DEFINITION……
Order Matters!
EXAMPLE……
3! 3 2 1 6
EXAMPLE……
• Suppose a business owner
has a choice of 5 locations
in which to establish her • Answer:
business. She decides to
5! 5 4 3 2 1 120
rank them from best to
least according to certain
criteria. How many
different ways can she • Note: She ranked ALL 5
rank them? locations.
• What if she only • Answer:
• This is no longer a
factorial problem because
you don’t rank ALL of
them.
PERMUTATION RULE……
n! where n = total # of
n Pr objects and r = how
(n r )! many you need.
“n objects taken r at a
time”
• Remember the business • This is a
woman who only permutation:
wanted to rank the top 3
out of 5 places?
5! 5! 120
5 P3 60
5 4 3 60 (5 3)! 2! 2
EXAMPLE……
• Answer:
• How many ways can a
chairperson and an assistant
7 P2 42
be selected for a project if
there are 7 scientists
available?
EXAMPLE……
8 P3 336
EXAMPLE……
• Answer:
• How many ways can 4
books be arranged on a
shelf if they can be
9 P4 3024
selected from 9 books?
A FACTORIAL IS ALSO A
PERMUTATION……
• How many ways can 4 • You can do 4! or you can
books be arranged on a set it up as a permutation.
shelf?
Answer:
4 P4 24
EXAMPLE……
• Number of Letters
11!
• 11 – Total Letters 34650
• 1–M (1!4!4!2!)
• 4–I
• 4–S
• You can eliminate the 1!’s because
• 2-P they are equal to 1.
NOTE……
• 0! = 1
and
1! = 1
• Answer:
• How many
permutations of the 4!
12
word seem can be 2!
made?
THIS LEADS TO ANOTHER
PERMUTATION RULE WHEN
SOME THINGS REPEAT……
n!
n Pr
k1! k 2 ! k3!...k p !
• It reads: the # of permutations of n objects
in which k1 are alike, k2 are alike, etc.
IT’S YOUR TURN
7 4∙ 6 4
35 ∙ 15
525 ways
Applications of Combinations
6. Using points on a plane to form
. .
a
. .
polygon (no three points are
collinear)
R
O
.
NQ
.
M P . S
Content, graphics and text
belong to the rightful
owner.
No copyright intended