0% found this document useful (0 votes)
15 views76 pages

G10M III L1 Permutation of Objects Revised

The document discusses permutations, emphasizing that order matters in arrangements of objects. It includes various examples, activities, and methods for determining permutations, such as systematic listing, tree diagrams, and the fundamental counting principle. Additionally, it covers factorial notation and provides exercises to evaluate factorial expressions.

Uploaded by

hgmvrzn2dq
Copyright
© © All Rights Reserved
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)
15 views76 pages

G10M III L1 Permutation of Objects Revised

The document discusses permutations, emphasizing that order matters in arrangements of objects. It includes various examples, activities, and methods for determining permutations, such as systematic listing, tree diagrams, and the fundamental counting principle. Additionally, it covers factorial notation and provides exercises to evaluate factorial expressions.

Uploaded by

hgmvrzn2dq
Copyright
© © All Rights Reserved
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/ 76

PERMUTATION

OF OBJECTS
SITUATION:
Teacher Sarah accepts tutorial services in her house every
Saturday. She wanted to check if the seating arrangement of
her three tutees (Ana, Beauty and Carl) has a significant
difference in their learning. So, she decided to change their
seating arrangement every Saturday.

Ana Beauty Carl


PERMUTATION OF OBJECTS
Permutation is an arrangement of all or part of a set of
objects with proper regard to order.
In short, ORDER MATTERS.

Examples:
• Possible arrangements of books in a shelf
• Possible number of positions in a picture frame
• Possible number of plate number LTO can create
• Possible gender of the children a couple could have
• Possible choices you have in creating your password
ACTIVITY 1.1: PERMUTATION OR NOT
Tell whether each of the problems fall under permutation or
not.

1. Listing 5 games for a party → permutation

2. Choosing 3 dishes in a buffet → not permutation


3. Placing winners in a running race → permutation
4. Picking a team of 3 from a group of 10 → not permutation
5. Voting the President, VP and Secretary from a class
→ permutation
METHODS IN ILLUSTRATING AND DETERMINING THE
PERMUTATION OF OBJECTS
Systematic Listing → involves coming up with an actual list of
all possible outcomes in an organized and systematic way.
Tree Diagram → display all the possible outcomes of an event.
Each branch in a tree diagram represents a possible outcome.
Table → displays all the possible outcomes of an event in a
tabular way.
Fundamental Counting Principle → a rule used to count the
total number of possible outcomes in a situation. It states
that if there are 𝒏 ways of doing something, and 𝒎 ways of
doing another thing after that, then there are 𝒏 × 𝒎 ways to
perform both of these actions.
ACTIVITY 1.2: ARRANGE THE SEATS
Teacher Sarah accepts tutorial services in her house every
Saturday. She wanted to check if the seating arrangement of
her three tutees (Ana, Beauty and Carl) has a significant
difference in their learning. So, she decided to change their
seating arrangement every Saturday.

Ana Beauty Carl


ACTIVITY 1.2: ARRANGE THE SEATS
Answer the following questions
a. List all possible seating arrangements of the three tutees?

1→ 3→ 5→

2→ 4→ 6→

b. In how many possible ways can they be seated in a row?


→ 6 possible ways
c. What method is use to find the possible arrangements?
→ Systematic listing
ACTIVITY 1.2: ARRANGE THE SEATS
d. Show another way to find the possible arrangements.
→ By using tree diagram

1st 1st 1st

2nd 2nd 2nd

3rd 3rd 3rd

1 (Ana, Beauty, Carl) 3 (Beauty, Ana, Carl) 5 (Carl, Ana, Beauty)


2 (Ana, Carl, Beauty) 4 (Beauty, Carl, Ana) 6 (Carl, Beauty, Ana)
ACTIVITY 1.2: ARRANGE THE SEATS
d. Show another way to find the possible arrangements.
→ By using a table

1st chair 2nd chair 3rd chair


1 Ana Beauty Carl
2 Ana Carl Beauty
3 Beauty Ana Carl
4 Beauty Carl Ana
5 Carl Ana Beauty
6 Carl Beauty Ana
ACTIVITY 1.2: ARRANGE THE SEATS
e. Show another way to find the number of possible
arrangements.
→ Use the fundamental counting principle
Tutees: Ana, Beauty, and Carl
Chairs: 1st, 2nd, and 3rd

3 × 2 × 1
1st 2nd 3rd

= 6 possible arrangements
ACTIVITY 1.3: BREAK THE CODE
Suppose you secure your cellphone using a 4-digit code. You
forgot the code and only remembered that the code contains
the digits 2, 3, 4, and 5. List all the possible codes out of the
given digits. Determine the number of permutations made.
1 2, 3, 4, 5 7 3, 2, 4, 5 13 4, 2, 3, 5 19 5, 2, 3, 4
2 2, 3, 5, 4 8 3, 2, 5, 4 14 4, 2, 5, 3 20 5, 2, 4, 3
3 2, 4, 3, 5 24 possible codes
9 3, 4, 2, 5 15 4, 3, 2, 5 21 5, 3, 2, 4
4 2, 4, 5, 3 10 3, 4, 5, 2 16 4, 3, 5, 2 22 5, 3, 4, 2
5 2, 5, 3, 4 11 3, 5, 2, 4 17 4, 5, 2, 3 23 5, 4, 2, 3
6 2, 5, 4, 3 12 3, 5, 4, 2 18 4, 5, 3, 2 24 5, 4, 3, 2
ACTIVITY 1.3: BREAK THE CODE
Suppose you secure your cellphone using a 4-digit code. You
forgot the code and only remembered that the code contains
the digits 2, 3, 4, and 5. List all the possible codes out of the
given digits. Determine the number of permutations made.

Check using the fundamental counting principle


Digits: 2, 3, 4, and 5 Code: 4 digits
3 4 3 4 5 4 5 5
2 5
4 × 3 × 2 × 1 = 24 possible ways
2nd 3rd th
1st 4
ACTIVITY 1.4: SON OR DAUGHTER?
A couple is planning to have 4 kids. On any birth the children
could be a son or a daughter. Use a tree diagram to illustrate
the permutations.
st 1st
1 S D
2nd S D 2nd S D
3rd S D S D 3rd S D S D

4th S D S 16 possible
D S D S D 4 th S D S D S D S D
1 (S, S, S, S) 5 (S, D, S, S) 9 (D, S, S, S)
2 (S, S, S, D) permutations
6 (S, D, S, D) 10 (D, S, S, D)
13 (D, D, S, S)
14 (D, D, S, D)
3 (S, S, D, S) 7 (S, D, D, S) 11 (D, S, D, S) 15 (D, D, D, S)
4 (S, S, D, D) 8 (S, D, D, D) 12 (D, S, D, D) 16 (D, D, D, D)
ACTIVITY 1.4: SON OR DAUGHTER?
A couple is planning to have 4 kids. On any birth the children
could be a son of a daughter. Use a tree diagram to illustrate
the permutations.
Check using the fundamental counting principle
Kids: Son or Daughter Number of kids: 4
S D S D S D S D

2 × 2 × 2 × 2 = 16 possible
2nd 3rd 4th permutations
1st
ACTIVITY 1.5: CLOTHING STYLE BLOUSE SKIRT
Rosa was invited to a birthday 1 stripes red
party. She is planning to match 2 stripes pink
a blouse and a skirt to wear. 3 stripes black
She has 4 new blouses 4 with ruffles red
5 with ruffles pink
(stripes, with ruffles, long-
6 with ruffles black
sleeved, and sleeveless) and 3 7 long-sleeved red
skirts (red, pink, and black) in 8 long-sleeved pink
her closet for such occasions. 9 long-sleeved black
Make a table to show the 10 sleeveless red
pink
possible outfit she can wear. 11 sleeveless
How many ways can she select 12 sleeveless black

her outfit? → 12 possible outfits


ACTIVITY 1.5: CLOTHING STYLE Check using the fundamental
Rosa was invited to a birthday counting principle
party. She is planning to match Blouses: stripes (ST), with
a blouse and a skirt to wear. ruffles (WR), long-sleeved
She has 4 new blouses (LS), sleeveless (LS)
(stripes, with ruffles, long- Skirts: red (R), pink (P), and
sleeved, and sleeveless) and 3 black (B)
skirts (red, pink, and black) in
her closet for such occasions. WR LS SL R P B
Make a table to show the ST
possible outfit she can wear. 4 × 3
How many ways can she select 1 st 2nd

her outfit? → 12 possible outfits = 12 possible outfits


TRY THESE!
Determine the answers using FCP.
1. How many 2-digit odd numbers greater than 20 are there?

2-9 1, 3, 5, 7, 9

8 × 5 = 40 numbers
1st 2nd
TRY THESE!
Determine the answers using FCP.
2. How many numbers lying between 100 and 1000 can be
formed with the digits 0, 1, 2, 3, 4, if the repetition of digits is
NOT allowed?

1, 2, 3, 4 2, 3, 4, 0 3, 4, 0

4 × 4 × 3 = 48 numbers
2nd 3rd
1st
TRY THESE!
Determine the answers using FCP.
3. How many three-digit numbers can be formed using the
digits 5, 7, 8 and 2 if the digits cannot be repeated?
TRY THESE!
Determine the answers using FCP.
4. How many three-digit numbers can be formed using the
digits 5, 7, 8 and 2 if repetition of digits is not allowed, and the
number is less than 700?
EVALUATION 1.1: 5-BOOK SPACE OF A SHELF
In how many ways can you place 6 different books on a shelf
if there is a space enough for only 5 books?
Given: 6 different books
5-book space of a shelf

6 books 5 books 4 books 3 books 2 books

6 × 5 × 4 × 3 × 2
5th
1st 2nd 3rd 4th

= 720 possible ways


FACTORIAL NOTATION
Factorial Notation is the product of all positive integers less
than or equal to 𝒏. It is denoted by 𝒏!
Example: 5!
5! can be read as “5 factorial”.
5! means 5 × 4 × 3 × 2 × 1 = 120.
5! can be written in many ways.
5×4×3×2×1 5∙4∙3∙2∙1
5 × 4 × 3 × 2! 5 ∙ 4 ∙ 3 ∙ 2!
5 × 4 × 3! 5 ∙ 4 ∙ 3!
5 × 4! 5 ∙ 4!
FACTORIAL NOTATION
𝒏 𝑬𝒙𝒑𝒂𝒏𝒅𝒆𝒅 𝑭𝒐𝒓𝒎 𝑹𝒆𝒔𝒖𝒍𝒕
𝟎! 𝟏 𝟏
𝟏! 𝟏 𝟏
𝟐! 𝟐×𝟏 𝟐
𝟑! 𝟑×𝟐×𝟏 𝟔
𝟒! 𝟒×𝟑×𝟐×𝟏 𝟐𝟒
𝟓! 𝟓×𝟒×𝟑×𝟐×𝟏 𝟏𝟐𝟎
𝟔! 𝟔×𝟓×𝟒×𝟑×𝟐×𝟏 𝟕𝟐𝟎
𝟕! 𝟕×𝟔×𝟓×𝟒×𝟑×𝟐×𝟏 𝟓, 𝟎𝟒𝟎
𝟖! 𝟖×𝟕×𝟔×𝟓×𝟒×𝟑×𝟐×𝟏 𝟒𝟎, 𝟑𝟐𝟎
𝟗! 𝟗×𝟖×𝟕×𝟔×𝟓×𝟒×𝟑×𝟐×𝟏 𝟑𝟔𝟐, 𝟖𝟖𝟎
ACTIVITY 1.6: EVALUATE THE FACTORIAL
Evaluate the following expressions.
1. 5! + 2! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 + 2 ∙ 1
= 120 + 2
= 𝟏𝟐𝟐
2. 8! − 5! = 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 − 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
= 40, 320 − 120
= 𝟒𝟎, 𝟐𝟎𝟎
3. 4! 2! = 4∙3∙2∙1 2∙1
= (24) (2)
= 𝟒𝟖
ACTIVITY 1.6: EVALUATE THE FACTORIAL
Evaluate the following expressions.
6! 6∙5∙4∙3∙2∙1
4. = = 𝟏𝟐𝟎
3! 3∙2∙1
6 ∙ 5 ∙ 4 ∙ 3!
= = 𝟏𝟐𝟎
3!
7! 7! 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
5. = = = 𝟒𝟐
(7 − 2)! 5! 5∙4∙3∙2∙1
7 ∙ 6 ∙ 5!
= = 𝟒𝟐
5!
5! 5 ∙ 4 ∙ 3! 5 ∙ 4 20
6. = = = = 𝟏𝟎
3! 2! 3! 2! 2∙1 2
EVALUATION 1.2: IS IT TRUE OR FALSE?
Determine whether each equation is True of False

1. 5! = 5 ∙ 4 ∙ 3! 10!
5. = 10 ∙ 9 ∙ 8
7!
2. 3! + 3! = 6!
5!
3. 4! 5! = 9! 6. = 5 ∙ 2!
3! 2!
4. 5 − 3 ! = 5! − 3!
3
3!
2! 3!
EVALUATION 1.2: IS IT TRUE OR FALSE?
Determine whether each equation is True of False
1. 5! = 5 ∙ 4 ∙ 3! → True
5∙4∙3∙2∙1 =5∙4∙3∙2∙1
120 = 120
2. 3! + 3! = 6! → False
3∙2∙1 + 3∙2∙1 =6∙5∙4∙3∙2∙1
12 = 720
3. 4! 5! = 9! → False
4∙3∙2∙1 5∙4∙3∙2∙1 =9∙8∙7∙6∙5∙4∙3∙2∙1
2, 880 = 362, 880
EVALUATION 1.2: IS IT TRUE OR FALSE?
Determine whether each equation is True of False
4. 5 − 3 ! = 5! − 3! → False 5!
5. = 5 ∙ 2! → True
2! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 − (3 ∙ 2 ∙ 1) 3! 2!
2 ∙ 1 = 120 − 6 5 ∙ 4 ∙ 3!
= 10
2 = 114 3! 2!
10! 5∙4
4. = 10 ∙ 9 ∙ 8 → True = 10
7! 2∙1
10 ∙ 9 ∙ 8 ∙ 7! 20
= 10 ∙ 9 ∙ 8 = 10
7! 2
10 ∙ 9 ∙ 8 = 10 ∙ 9 ∙ 8
10 = 10
720 = 720
ACTIVITY 1.7: LET’S FIND OUT!
Answer the following questions.
a. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 5-digit passcode if repetition is allowed?
Given: 5 digits 5-digit passcode
5 × 5 × 5 × 5 × 5 = 𝟑𝟏𝟐𝟓 possible ways
b. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 5-digit passcode if repetition is not allowed?
Given: 5 digits 5-digit passcode
5 × 4 × 3 × 2 × 1 = 𝟏𝟐𝟎 possible ways
ACTIVITY 1.7: LET’S FIND OUT!
Answer the following questions.
c. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 3-digit passcode if repetition is allowed?
Given: 5 digits 3-digit passcode
5 × 5 × 5 = 125 possible ways
d. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 3-digit passcode if repetition is not allowed?
Given: 5 digits 3-digit passcode
5 × 4 × 3 = 𝟔𝟎 possible ways
It is important in solving permutation to consider these
questions:
a) Is duplication allowed?
b) Is duplication not allowed?
DERIVATION OF PERMUTATION FORMULA
A. When repetition is allowed:
5 𝒓
P(5 𝑡𝑎𝑘𝑒𝑛 5) = 5 ∙ 5 ∙ 5 ∙ 5 ∙ 5 = 5 =𝒏

3 𝒓
P(5 𝑡𝑎𝑘𝑒𝑛 3) = 5 ∙ 5 ∙ 5 = 5 =𝒏
DERIVATION OF PERMUTATION FORMULA
B. When repetition is not allowed:
P(5 𝑡𝑎𝑘𝑒𝑛 5) = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 5! = 𝒏!

P(5 𝑡𝑎𝑘𝑒𝑛 3) = 5 ∙ 4 ∙ 3
(5 − 3) 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
=
2∙1
5! 5! 𝒏!
= = =
2! (5 − 3)! (𝒏 − 𝒓)!
A. PERMUTATION WHEN REPETITION IS ALLOWED
The number of permutations of n objects when repetition is
𝒓
allowed is determined by the formula: 𝒏𝑷𝒓 = 𝒏 where 𝒏 is
the number of objects and 𝒓 is the number of objects selected.
B. PERMUTATION WHEN REPETITION IS NOT ALLOWED
a. Permutation Of All Objects Taken All at a Time
The number of permutations of n objects taken all at a time is
determined by the formula: 𝒏𝑷𝒏 = 𝒏! where 𝒏 is the number of
objects.
b. Permutation of All Objects Taken r at a Time
The number of permutations of n objects taken r at a time is
𝒏!
determined by the formula: 𝒏𝑷𝒓 = where 𝒏 is the number of
(𝒏−𝒓)!
objects and 𝒓 is the number of objects selected.
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
1. In how many different ways are there to arrange the letters
ABCD if repetition is allowed?
2. In how many different ways are there to place four
different colored tiles in a row?
3. In how many ways can 3 runners finished the race if there
are no ties?
4. In how many ways can 7 different books can be arranged
on a shelf if there is space enough for 4 books?
5. In how many ways can a president and vice president be
chosen from a club with 10 members?
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
1. In how many different ways are there to arrange the letters
ABCD if repetition is allowed?
Given: 4 letters (All are taken and repetition is allowed)
𝒏𝑷𝒓 = 𝒏𝒓

4𝑃4 = 𝟒 𝟒

4𝑃4 = 4 ∙ 4 ∙ 4 ∙ 4

𝟒𝑷𝟒 = 𝟐𝟓𝟔 𝒘𝒂𝒚𝒔


𝑷(𝟒, 𝟒) = 𝟐𝟓𝟔 𝒘𝒂𝒚𝒔
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
2. In how many different ways are there to place four different
colored tiles in a row?
Given: 4 colored tiles (All are taken and repetition is not
allowed)
𝒏𝑷𝒏 = 𝒏!
4𝑃4 = 4!
4𝑃4 = 4 ∙ 3 ∙ 2 ∙ 1
𝟒𝑷𝟒 = 𝟐𝟒 𝒘𝒂𝒚𝒔
𝑷(𝟒, 𝟒) = 𝟐𝟒 𝒘𝒂𝒚𝒔
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
3. In how many ways can 3 runners finished the race if there
are no ties?
Given: 3 runners (All are taken and repetition is not
allowed)
𝒏𝑷𝒏 = 𝒏!
3𝑃3 = 3!
3𝑃3 = 3 ∙ 2 ∙ 1
𝟑𝑷𝟑 = 𝟔 𝒘𝒂𝒚𝒔
𝑷(𝟑, 𝟑) = 𝟔 𝒘𝒂𝒚𝒔
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
4. In how many ways can 7 different books can be arranged on
a shelf if there is space enough for 4 books?
Given: 7 different books (4 are taken and repetition is not
allowed) 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3!
𝒏! 7𝑃4 =
𝒏𝑷𝒓 = 3!
(𝒏 − 𝒓)!
7! 7𝑃4 = 7 ∙ 6 ∙ 5 ∙ 4
7𝑃4 =
(7 − 4)! 𝟕𝑷𝟒 = 𝟖𝟒𝟎 𝒘𝒂𝒚𝒔
7! 𝑷(𝟕, 𝟒) = 𝟖𝟒𝟎 𝒘𝒂𝒚𝒔
7𝑃4 =
3!
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
5. In how many ways can a president and vice president be
chosen from a club with 6 members?
Given: 6 members (2 are taken and repetition is not
allowed) 6 ∙ 5 ∙ 4!
𝒏! 6𝑃2 =
𝒏𝑷𝒓 = 4!
(𝒏 − 𝒓)!
6𝑃2 = 6 ∙ 5
6!
6𝑃2 =
(6 − 2)! 𝟔𝑷𝟐 = 𝟑𝟎 𝒘𝒂𝒚𝒔
6! 𝑷(𝟔, 𝟐) = 𝟑𝟎 𝒘𝒂𝒚𝒔
6𝑃2 =
4!
EVALUATION 1.3: MISSION POSSIBLE
Answer the following questions.
1. In how many different ways can you arrange 8 figurines on
a shelf?
2. In how many ways can the digits 1, 2, 3, 4, 5, and 6 be
arranged to make a 3-digit code if repetition is allowed?
3. In how many different ways can 3 bicycles be parked if
there are 5 available parking spaces?
4. In how many ways can Aling Maria arrange her 6 different
potted plants in her plant stand if only 3 plants can fit?
EVALUATION 1.3: MISSION POSSIBLE
Answer the following questions.
1. In how many different ways can you arrange 8 figurines on
a shelf?
Given: 8 figurines (All are taken and repetition is not
allowed)
𝒏𝑷𝒏 = 𝒏!
8𝑃8 = 8!
8𝑃8 = 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
𝟖𝑷𝟖 = 𝟒𝟎, 𝟑𝟐𝟎 𝒘𝒂𝒚𝒔
𝑷 𝟒, 𝟒 = 𝟒𝟎, 𝟑𝟐𝟎 𝒘𝒂𝒚𝒔
EVALUATION 1.3: MISSION POSSIBLE
Answer the following questions.
2. In how many ways can the digits 1, 2, 3, 4, 5, and 6 be
arranged to make a 3-digit code if repetition is allowed?
Given: 6 digits (3 are taken and repetition is allowed)
𝒏𝑷𝒓 = 𝒏𝒓

6𝑃3 = 63

6𝑃3 = 6 ∙ 6 ∙ 6

𝟔𝑷𝟑 = 𝟐𝟏𝟔 𝒘𝒂𝒚𝒔


𝑷(𝟔, 𝟑) = 𝟐𝟏𝟔 𝒘𝒂𝒚𝒔
EVALUATION 1.3: MISSION POSSIBLE
Answer the following questions.
3. In how many different ways can 3 bicycles be parked if
there are 5 available parking spaces?
Given: 5 parking spaces (3 are taken and repetition is not
allowed)) 5 ∙ 4 ∙ 3 ∙ 2!
𝒏! 5𝑃3 =
𝒏𝑷𝒓 = 2!
(𝒏 − 𝒓)!
5𝑃3 = 5 ∙ 4 ∙ 3
5!
5𝑃3 =
(5 − 3)! 𝟓𝑷𝟑 = 𝟔𝟎 𝒘𝒂𝒚𝒔
5! 𝑷(𝟓, 𝟑) = 𝟔𝟎 𝒘𝒂𝒚𝒔
5𝑃3 =
2!
EVALUATION 1.3: MISSION POSSIBLE
Answer the following questions.
4. In how many ways can Aling Maria arrange her 6 different
potted plants in her plant stand if only 3 plants can fit?
Given: 6 potted plants (3 are taken and repetition is not
allowed)) 6 ∙ 5 ∙ 4 ∙ 3!
𝒏! 6𝑃3 =
𝒏𝑷𝒓 = 3!
(𝒏 − 𝒓)! 6𝑃3 = 6 ∙ 5 ∙ 4
6!
6𝑃3 = 𝟔𝑷𝟑 = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔
(6 − 3)!
6! 𝑷(𝟔, 𝟑) = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔
6𝑃3 =
3!
ACTIVITY 1.8: MY PASSWORDS
A. Aida decided to create passwords containing the letters of
her name A, I, D, A.
1. List all the possible 4-letter passwords she can create if
only the first letter of her name is in upper case.
2. Count the number of 4-letter passwords created.
1 Aida 2Aiad 3Adai 4Adia 5Aaid 6Aadi
7 i A d a 8 i A a d 9 i d A a 10 i d a A 11 i a A d 12 i a d A
13 d A i a 14 d A a i 15 d i A a 16 d i a A 17 d a A i 18 d a i A

19 a A i d 20 a A d i 21 a i A d 22 a i d A 23 a d A i 24 a d i A
ACTIVITY 1.8: MY PASSWORDS
A. Aida decided to create passwords containing the letters of
her name A, I, D, A.
3. Let all the letters in the listed passwords be in upper case.
4. Cross out the replicated passwords.
5. Count the number of the remaining 4-letter passwords.
1 AIDA 2AIAD 3ADAI 4ADIA 5AAID 6AADI
7 IADA 8IAAD 9IDAA IDAA IAAD IADA
10 D A I A 11 D A A I 12 D I A A DIAA DAAI DAIA
AAID AADI AIAD AIDA ADAI ADIA
ACTIVITY 1.8: MY PASSWORDS
B. Anna decided to create passwords containing the letters of
her name A, N, N, A.
1. List all possible 4-letter passwords she can create. Write
one A and one N in upper case to make the letters distinct.
2. Count the number of 4-letter passwords created.
1 ANna 2 ANan 3 AnNa 4 AnaN 5AaNn 6 AanN
7 N A n a 8 N A a n 9 N n A a 10 N n a A 11 N a A n 12 N a n A

13 n A N a 14 n A a N 15 n N A a 16 n N a A 17 n a A N 18 n a N A

19 a A N n 20 a A n N 21 a N A n 22 a N n A 23 a n A N 24 a n N A
ACTIVITY 1.8: MY PASSWORDS
Anna decided to create passwords containing the letters of
her name A, N, N, A.
1. Let all the letters in the listed passwords be in upper case.
2. Cross out the replicated passwords.
3. Count the number of the remaining 4-letter passwords.
1 ANNA 2 ANAN ANNA ANAN 3AANN AANN
4 NANA 5 NAAN 6 NNAA NNAA NAAN NANA
NANA NAAN NNAA NNAA NAAN NANA
AANN AANN ANAN ANNA ANAN ANNA
DERIVATION OF DISTINGUISHABLE PERMUTATION FORMULA

P 4 𝑡𝑎𝑘𝑒𝑛 4 24 4 ∙ 3 ∙ 2 ∙ 1 4! 𝒏!
= 12 = = = =
𝑤𝑖𝑡ℎ 2𝐴 2 2∙1 2! 𝒓!

P 4 𝑡𝑎𝑘𝑒𝑛 4 24 4∙3∙2∙1 4! 𝒏!
= 6 = = = =
𝑤𝑖𝑡ℎ 2𝐴, 2𝑁 4 (2 ∙ 1)(2 ∙ 1) 2! 2! 𝒓𝟏 ! 𝒓𝟐 !
The number of distinguishable permutation of n objects is
determined by the formula: 𝑷 = 𝒏!
𝒓𝟏 ! 𝒓𝟐 ! … 𝒓𝒌 !
where 𝒏 is the number of objects and 𝒓𝟏 , 𝒓𝟐 , … 𝒓𝒌 are objects
with corresponding repetition.
ACTIVITY 1.9: DISTINCT OR DUPLICATED
Find the permutation of each of the following words.
1. Find the permutation of the word “SCHOLAR”.
→ The letters are distinct
→ 𝒏𝑷𝒏 = 𝒏! or 𝑷(𝒏, 𝒏) = 𝒏!
→ 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 7
𝒏𝑷𝒏 = 𝒏! = 7!
7𝑃7 = 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
𝟕𝑷𝟕 = 𝟓, 𝟎𝟒𝟎
ACTIVITY 1.9: DISTINCT OR DUPLICATED
Find the permutation of each of the following words.
2. Find the permutation of the word “STATISTICS”
→ The letters are duplicated or replicated
𝒏!
→𝑷=
𝒓𝟏 !𝒓𝟐 !…𝒓𝒌 !

→ 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 10, 𝑆 = 3, 𝑇 = 3, 𝐼 = 2
2
𝒏! 10! 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! 3! 3! 2! 3! 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1
𝑃 = 10 ∙ 9 ∙ 8 ∙ 7 ∙ 5 ∙ 2
𝑷 = 𝟓𝟎, 𝟒𝟎𝟎
EVALUATION 1.4: DISTINGUISH IT
Find the permutation of each of the following words.
1. PAPAYA → 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 6, 𝑃 = 2, 𝐴 = 3
𝒏! 6! 6 ∙ 5 ∙ 24 ∙ 3!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 2! 3! 3! 2 ∙ 1
𝑃 =6∙5∙2
𝑷 = 𝟔𝟎
2. MISSISSIPPI → 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 11, 𝐼 = 4, 𝑆 = 4, 𝑃 = 2
𝒏! 11! 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! 4! 4! 2! 4! 4 ∙ 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1
𝑃 = 11 ∙ 10 ∙ 9 ∙ 7 ∙ 5
𝑷 = 𝟑𝟒 𝟔𝟓𝟎
ACTIVITY 1.10: CIRCULAR ARRANGEMENT
A. Suppose it happens that (1) Jose, (2)Wally, and (3)Paolo
will visit you in your house, answer the following:
1. Illustrate the different ways if they are to be seated in a 3-
seater sofa. Then, count. 𝑷 = 𝟔 𝒘𝒂𝒚𝒔
1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1
1 2 3 4 5 6
2. Illustrate the different ways if they are to be seated in a 3-
seater round table. Then count. 𝑷 = 𝟐 𝒘𝒂𝒚𝒔
1 1 2

3
1 2 2
2 3 3 1 1 3 2 1 1 2
ACTIVITY 1.10: CIRCULAR ARRANGEMENT
B. Suppose it happens that (1) Jose, (2)Wally, (3)Paolo and
(4)Maine will visit you in your house, answer the following:
1. How many ways can they be seated in a 4-seater sofa?
P(4,4) = 4! = 4 ∙ 3 ∙ 2 ∙ 1 𝑷 = 𝟐𝟒 𝒘𝒂𝒚𝒔
2. Illustrate the different ways if they are to be seated in a 4-
seater round table. Then count. 𝑷 = 𝟔 𝒘𝒂𝒚𝒔
41 2 2 23 4 1 1 3 43 1 142 3 1 1 52
3 4 3 4 2 4 2 3

3 2 3 4 361 3 4 2 1 2 4 2 1 2 3
4 2 4 1 4 1 3 1

4 3 2 4 4 3 1 4 4 2 1 4 3 2 1 3
2 3 1 3 1 2 1 2
DERIVATION OF CIRCULAR PERMUTATION FORMULA

P 3 𝑡𝑎𝑘𝑒𝑛 3 𝑟𝑜𝑤 = 6 = 3! = 𝒏!

P 4 𝑡𝑎𝑘𝑒𝑛 4 (𝑟𝑜𝑤) = 24 = 4! = 𝒏!

P 3 𝑡𝑎𝑘𝑒𝑛 3 𝑐𝑖𝑟𝑐𝑢𝑙𝑎𝑟 = 2 = 2! = (3 − 1)! = (𝒏 − 𝟏)!


−1

P 4 𝑡𝑎𝑘𝑒𝑛 4 𝑐𝑖𝑟𝑐𝑢𝑙𝑎𝑟 = 6 = 3! = (4 − 1)! = (𝒏 − 𝟏)!


−1
CIRCULAR PERMUTATION
The number of permutation of n objects arranged in a
circle is determined by the formula: 𝑷 = 𝒏 − 𝟏 !
where 𝒏 is the number of objects.
Example: Find the number of different ways that a family of 6
can be seated around a circular table with 6 chairs.
Given: a family of 6
𝑷= 𝒏−𝟏 !
𝑃 = 6−1 !
𝑃 = 5!
𝑃 =5∙4 ∙3∙2∙1
𝑷 = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔
ACTIVITY 1.11: MENU FOR TODAY
Your family host a gathering and prepared 5 different dishes
to be served for dinner. You are tasked to arrange the dishes
in a round table. Find the circular permutation that you can
make.
Given: 5 different dishes
𝑷= 𝒏−𝟏 !
𝑃 = 5−1 !
𝑃 = 4!
𝑃 =4 ∙3∙2∙1
𝑷 = 𝟐𝟒 𝒘𝒂𝒚𝒔
EVALUATION 1.5: ROUND WAYS
Find the circular permutation of the following situation.
1. 7 boy scouts seated 2. 8 girl scouts forming a
around a campfire circle
Given: 7 boy scouts Given: 8 girl scouts
𝑷= 𝒏−𝟏 ! 𝑷= 𝒏−𝟏 !
𝑃 = 7−1 ! 𝑃 = 8−1 !
𝑃 = 6! 𝑃 = 7!
𝑃 =6 ∙5∙4 ∙3∙2∙1 𝑃 =7 ∙6 ∙5∙4 ∙3∙2∙1
𝑷 = 𝟕𝟐𝟎 𝒘𝒂𝒚𝒔 𝑷 = 𝟓, 𝟎𝟒𝟎 𝒘𝒂𝒚𝒔
ACTIVITY 1.12: REMEMBER MY FORMULA
Determine the formula to be used on each permutation.
1. Permutation with repetition
𝒏𝑷𝒏 = 𝒏 𝒏
2. Permutation of n objects taken all at a time
𝒏𝑷𝒏 = 𝒏!
3. Permutation of n objects taken r at a time
𝒏!
𝒏𝑷𝒓 =
(𝒏 − 𝒓)!
4. Distinguishable permutation
𝒏!
𝑷=
𝒓𝟏 ! 𝒓𝟐 ! … 𝒓𝒌 !
5. Circular permutation
𝑷 = (𝒏 − 𝟏)!
PERMUTATION WITH RESTRICTIONS
Permutation with restrictions is when permutation
situation is transformed into a problem imposing some
restrictions.
Most commonly, the restriction is that only a small
number of objects are to be considered, meaning that not all
the objects need to be ordered.
TWO TYPE OF PERMUTATION WITH RESTRICTIONS
1. When n object is taken all at a time 𝒏𝑷𝒏 = 𝒏!

2. When n object is taken r at a time 𝒏𝑷𝒓 = 𝒏!


(𝒏 − 𝒓)!
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
a. there is no restriction?
b. girls are grouped together?

c. boys are grouped together?

d. girls and boys are grouped together?


e. girls and boys alternate?
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
a. there is no restriction?
𝒏𝑷𝒏 = 𝒏!
5𝑃5 = 5!
5𝑃5 = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
5𝑷𝟓 = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
b. girls are grouped together?
𝑇𝑎𝑘𝑒 𝑡ℎ𝑒 𝑔𝑖𝑟𝑙𝑠 𝑎𝑠 𝑜𝑛𝑒.
gg g gg b b = 𝟑!
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑤𝑖𝑡ℎ𝑖𝑛 𝑡ℎ𝑒 𝑔𝑟𝑜𝑢𝑝 𝑜𝑓 3 𝑔𝑖𝑟𝑙𝑠.
g g g = 𝟑!
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 3! 3! = 3 ∙ 2 ∙ 1 ∙ 3 ∙ 2 ∙ 1 = 𝟑𝟔 𝒘𝒂𝒚𝒔
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
c. boys are grouped together?
𝑇𝑎𝑘𝑒 𝑡ℎ𝑒 𝑏𝑜𝑦𝑠 𝑎𝑠 𝑜𝑛𝑒.
g g g bb bb = 𝟒!
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑤𝑖𝑡ℎ𝑖𝑛 𝑡ℎ𝑒 𝑔𝑟𝑜𝑢𝑝 𝑜𝑓 2 𝑏𝑜𝑦𝑠.
b b = 𝟐!
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 4! 2! = 4 ∙ 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1 = 𝟒𝟖 𝒘𝒂𝒚𝒔
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
d. girls and boys are grouped together?
𝑇𝑎𝑘𝑒 𝑡ℎ𝑒 𝑏𝑜𝑦𝑠 𝑎𝑠 𝑜𝑛𝑒.
gg g gg bb bb = 𝟐!
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑤𝑖𝑡ℎ𝑖𝑛 𝑡ℎ𝑒 𝑔𝑟𝑜𝑢𝑝 𝑜𝑓 3 𝑔𝑖𝑟𝑙𝑠 𝑎𝑛𝑑
2 𝑏𝑜𝑦𝑠.
g g g = 𝟑! b b = 𝟐!
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 2! 3! 2! = 2 ∙ 1 ∙ 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1 = 𝟐𝟒 𝒘𝒂𝒚𝒔
ACTIVITY 1.13: RESTRICT BUT TAKE ALL AT A TIME
In how many ways can you arrange 3 girls and 2 boys in a row
if:
e. girls and boys alternate?
𝑆𝑡𝑎𝑟𝑡 𝑤𝑖𝑡ℎ 𝑡ℎ𝑒 ℎ𝑖𝑔ℎ𝑒𝑠𝑡 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑜𝑏𝑗𝑒𝑐𝑡𝑠.
g b g b g
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑔𝑖𝑟𝑙𝑠,
𝑎𝑛𝑑 𝑡ℎ𝑒 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑏𝑜𝑦𝑠.
g g g = 𝟑! b b = 𝟐!
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 3! 2! = 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1 = 𝟏𝟐 𝒘𝒂𝒚𝒔
ACTIVITY 1.14: RESTRICT BUT TAKE R AT A TIME
In how many ways can you select a president, a secretary and
a treasurer from 4 male and 3 female members if:
a. anyone could be elected in the positions?
b. the president is a male?

c. the president is a male and the secretary is a female?

d. both secretary and treasurer are females?


ACTIVITY 1.14: RESTRICT BUT TAKE R AT A TIME
In how many ways can you select a president, a secretary and
a treasurer from 4 male and 3 female members if:
a. anyone could be elected in the positions?
𝒏! 7 ∙ 6 ∙ 5 ∙ 4!
𝒏𝑷𝒓 = 7𝑃3 =
(𝒏 − 𝒓)! 4!
7!
7𝑃3 = 7𝑃3 = 7 ∙ 6 ∙ 5
(7 − 3)!
7!
7𝑃3 = 𝟕𝑷𝟑 = 𝟐𝟏𝟎 𝒘𝒂𝒚𝒔
4!
ACTIVITY 1.14: RESTRICT BUT TAKE R AT A TIME
In how many ways can you select a president, a secretary and
a treasurer from 4 male and 3 female members if:
b. the president is a male?
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑝𝑟𝑒𝑠𝑖𝑑𝑒𝑛𝑡.
4males = 4𝑃1
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑟𝑒𝑚𝑎𝑖𝑛𝑖𝑛𝑔 2 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠.
6members = 6𝑃2
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 4𝑃1 ∙ 6𝑃2
4! 6! 4∙3! 6∙5∙4!
= ∙ = ∙ = 4 ∙ 6 ∙ 5 = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔
(4−1)! (6−2)! 3! 4!
ACTIVITY 1.14: RESTRICT BUT TAKE R AT A TIME
In how many ways can you select a president, a secretary and
a treasurer from 4 male and 3 female members if:
c. the president is a male and the secretary is a female?
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑝𝑟𝑒𝑠𝑖𝑑𝑒𝑛𝑡, 𝑡ℎ𝑒 𝑠𝑒𝑐𝑟𝑒𝑡𝑎𝑟𝑦,
𝑎𝑛𝑑 𝑡ℎ𝑒 𝑡𝑟𝑒𝑠𝑢𝑟𝑒𝑟.
4males = 4𝑃1 3 females = 3𝑃1 5members = 5𝑃1
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 4𝑃1 ∙ 3𝑃1 ∙ 5𝑃1
4! 3! 5! 4∙3! 3∙2! 5∙4!
= ∙ ∙ = ∙ ∙ = 4 ∙ 3 ∙ 5 = 𝟔𝟎 𝒘𝒂𝒚𝒔
(4−1)! (3−1)! (5−1)! 3! 2! 4!
ACTIVITY 1.14: RESTRICT BUT TAKE R AT A TIME
In how many ways can you select a president, a secretary and
a treasurer from 4 male and 3 female members if:
d. both secretary and treasurer are females?
𝐺𝑒𝑡 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑝𝑟𝑒𝑠𝑖𝑑𝑒𝑛𝑡, 𝑎𝑛𝑑 𝑜𝑓 𝑏𝑜𝑡ℎ
𝑠𝑒𝑐𝑟𝑒𝑡𝑎𝑟𝑦 𝑎𝑛𝑑 𝑡𝑟𝑒𝑎𝑠𝑢𝑟𝑒𝑟 𝑎𝑟𝑒 𝑓𝑒𝑚𝑎𝑙𝑒𝑠.
5members = 5𝑃1 3 females = 3𝑃2
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝑡ℎ𝑒 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠.
𝑃 = 5𝑃1 ∙ 3𝑃2
5! 3! 5∙4! 3∙2∙1!
= ∙ = ∙ = 5 ∙ 3 ∙ 2 = 𝟑𝟎 𝒘𝒂𝒚𝒔
(5−1)! 3−2 ! 4! 1!
EVALUATION 1.6: TAKE IT WITH RESTRICTIONS
1. In how many ways can you arrange 2 couples in a row if:
a. there is no restriction?
b. men are grouped together?
c. men and women are grouped together?
2. In how many ways can you arrange 2 couples in a row of
three seats if:
a. there is no restriction?
b. the first to seat is a man?
c. the first two to seat are women?
EVALUATION 1.6: TAKE IT WITH RESTRICTIONS
1. In how many ways can you arrange 2 couples in a row if:
a. there is no restriction?
𝑃 = 4! = 𝟐𝟒 𝒘𝒂𝒚𝒔

b. men are grouped together?


𝑃 = 3! 2! = 𝟏𝟐 𝒘𝒂𝒚𝒔

c. men and women are grouped together?


𝑃 = 2! 2! 2! = 𝟖 𝒘𝒂𝒚𝒔
EVALUATION 1.6: TAKE IT WITH RESTRICTIONS
2. In how many ways can you arrange 2 couples in a row of
three seats if:
a. there is no restriction?
4! 4!
𝑃 = 4𝑃3 = = = 𝟐𝟒 𝒘𝒂𝒚𝒔
(4−3)! 1!
b. the first to seat is a man?
2! 3! 2! 3!
𝑃 = 2𝑃1 ∙ 3𝑃2 = ∙
(2−1)! (3−2)!
= ∙ = 2 ∙ 6 = 𝟏𝟐 𝒘𝒂𝒚𝒔
1! 1!
c. The first two to seat are women?
2! 2! 2! 2!
𝑃 = 2𝑃2 ∙ 2𝑃1 = ∙ = ∙ = 2 ∙ 2 = 𝟒 𝒘𝒂𝒚𝒔
(2−2)! (2−1)! 0! 1!
GET READY
FOR QUIZ 1

You might also like