Scribd
Upload
250 views

Performance Task in Math: Fundamental Counting Principle

14! / (3!2!2!1!1!1!1!1!1!1!) = 6,227,020,800

Uploaded by

Christina Aguila Navarro
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
250 views

Performance Task in Math: Fundamental Counting Principle

14! / (3!2!2!1!1!1!1!1!1!1!) = 6,227,020,800

Uploaded by

Christina Aguila Navarro
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Performance Task in Math Question: You take a survey with

five “yes” or “no” answers. How many


different ways could you complete
the survey?
Fundamental Counting Principle
Answer: There are 5 stages:
Question 1, question 2, question 3,
A fast-food restaurant has a meal question 4, and question 5. There are
special: $5 for a drink, sandwich, 2 choices for each question (Yes or
side item and dessert. The choices No). So the total number of possible
are: ways to answer is:

 Sandwich: Grilled chicken, All 2 * 2 * 2* 2 * 2 = 32


Beef Patty, Vegeburger and
Fish Fillet.
 Side: Regular fries, Cheese Question: A company puts a code on
Fries, Potato Wedges. each different product they sell.
 Dessert: Chocolate Chip The code is made up of 3 numbers
Cookie or Apple Pie. and 2 letters. How many different
 Drink: Fanta, Dr. Pepper, codes are possible?
Coke, Diet Coke and Sprite.
Answer: There are 5 stages (number
Question: How many meal combos 1, number 2, number 3, letter 1 and
are possible? letter 2). There are 10 possible
numbers: 0-9.
Answer: There are 4 stages:
There are 26 possible letters: A – Z.
1. Choose a sandwich.
2. Choose a side. So we have:
3. Choose a dessert.
10 * 10 * 10 * 26 * 26 = 676000
4. Choose a drink.
possible code
There are 4 different types of
Circular Permutation
sandwich, 3 different types of side,
2 different types of desserts and Question: Find the number of ways
five different types of drink. in which 5 people A,B,C,D,E can be
seated at a round table, such that
The number of meal combos possible
is 4 * 3 * 2 * 5 = 120 (I)A and B must always sit together.
(II) C and D must not sit together.

Solution: If we wish to seat A and B


together in all arrangements, we can
consider these two as one unit, along
Answer: Therefore the total number
with 3 others. So effectively we’ve
of ways in the case will be 2! X 3! =
to arrange 4 people in a circle, the
12.
number of ways being (4-1)! or 6. Let
me show you the arrangements:

In how many ways can 6 people be


seated at a round table?

Solution and Answer: the number of


ways will be (6-1)! , or 120.
Answer: Therefore, the total
number of ways will be 6 x 2 = 12. Distinguishable Permutation

Question: In how many ways can 3 Question: How many distinguishable


men and 3 ladies be seated at around permutations exist for the letters in
table such that no two men are the word CINCINNATI?
seated together?
Solution: There are nine total
Solution: Since we don’t want the letters in word, therefore, n = 10
men to be seated together, the only
n1 = 2 ‘C’
way to do this is to make the men
and women sit alternately. We’ll n2 = 3 ‘I’
first seat the 3 women, on alternate
n3 = 3 ‘N’
seats, which can be done in (3 – 1)! or
2 ways, as shown below. (We’re n4 = 1 ‘A’
ignoring the other 3 seats for now
n5 = 1 ‘T’

Answer: Therefore the number of


distinguishable permutations equals:

n!
Note the following 6 arrangements
are equivalent: n1! n2! … nm!

10!
2! 3! 3! 1! 1! 14!

(10)(9)(8)(7)(6)(5)(4) 3! 2! 2! 1! 1! 1! 1! 1! 1! 1!

(2)(1). (3)(2)(1) = 3632428800

= 50, 400

Question: A building contractor is


planning to develop a subdivision that
consists of 6 one-story houses, 4 two-
story houses, and 2 split-level houses.
In how many distinguishable ways can
the houses be arranged?

Solution: There are 12 houses in the


subdivision

n = 12, n1 = 6, n2 = 4, n3 = 2

12!

6! 4! 2!

=13, 860 distinguishable ways

Answer: In how many distinguishable


ways can the letters in
MERRYCHRISTMAS be written?

Solution: This word has 14 letters,


of which three are R’s, two are S’s,
two are M’s, one is a E, one is a Y ,
one is a C, one is a H, one is a I, one
is a S.

Answer: So, the number of


distinguishable ways can be written
as:

You might also like