100% found this document useful (1 vote)
2K views3 pages

Math Performance Task Examples

The document discusses counting principles and permutations. It provides examples of counting meal combinations at a restaurant (120 ways), survey responses with yes/no answers (32 ways), product codes with numbers and letters (676,000 ways), and seating arrangements of people around a table (12 ways). It also defines distinguishable permutations and provides examples of counting permutations of letters in words and arrangements of houses in a subdivision.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
2K views3 pages

Math Performance Task Examples

The document discusses counting principles and permutations. It provides examples of counting meal combinations at a restaurant (120 ways), survey responses with yes/no answers (32 ways), product codes with numbers and letters (676,000 ways), and seating arrangements of people around a table (12 ways). It also defines distinguishable permutations and provides examples of counting permutations of letters in words and arrangements of houses in a subdivision.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Performance Task in Math There are 4 different types of

sandwich, 3 different types of side,


Marvin Almaria 2 different types of desserts and
five different types of drink.
Aldrich Ambion
The number of meal combos possible
10 – Charity is 4 * 3 * 2 * 5 = 120

Ms. Nicole Raye Sanchez Question: You take a survey with


five “yes” or “no” answers. How many
different ways could you complete
Fundamental Counting Principle the survey?

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
Answer: There are 4 stages: numbers: 0-9.

1. Choose a sandwich. There are 26 possible letters: A – Z.


2. Choose a side. So we have:
3. Choose a dessert.
4. Choose a drink. 10 * 10 * 10 * 26 * 26 = 676000
possible code
Circular Permutation

Question: Find the number of ways


in which 5 people A,B,C,D,E can be
seated at a round table, such that

(I)A and B must always sit together.


Note the following 6 arrangements
(II) C and D must not sit together. are equivalent:

Solution: If we wish to seat A and B


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

In how many ways can 6 people be


seated at a round table?

Answer: Therefore, the total Solution and Answer: the number of


number of ways will be 6 x 2 = 12. ways will be (6-1)! , or 120.

Question: In how many ways can 3 Distinguishable Permutation


men and 3 ladies be seated at around
Question: How many distinguishable
table such that no two men are
permutations exist for the letters in
seated together?
the word CINCINNATI?
Solution: Since we don’t want the
Solution: There are nine total
men to be seated together, the only
letters in word, therefore, n = 10
way to do this is to make the men
and women sit alternately. We’ll n1 = 2 ‘C’
first seat the 3 women, on alternate
n2 = 3 ‘I’
seats, which can be done in (3 – 1)! or
2 ways, as shown below. (We’re n3 = 3 ‘N’
ignoring the other 3 seats for now
n4 = 1 ‘A’
n5 = 1 ‘T’ Solution: This word has 14 letters,
of which three are R’s, two are S’s,
Answer: Therefore the number of
two are M’s, one is a E, one is a Y ,
distinguishable permutations equals:
one is a C, one is a H, one is a I, one
n! is a S.

n1! n2! … nm! Answer: So, the number of


distinguishable ways can be written
10!
as:
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?

Performance Task in Math
Marvin Almaria
Aldrich Ambion
10 – Charity
Ms. Nicole Raye Sanchez
Fundamental Counting Principle
A
Circular Permutation
Question: Find the number of ways 
in which 5 people A,B,C,D,E can be 
seated at a round table, such tha
n5
= 1 ‘T’
Answer: Therefore the number of 
distinguishable permutations equals:
        n! 
n1!  n2!  … nm!
      10!
2! 3!

You might also like