Scribd
Upload
157 views3 pages

12.3 Notes

The document discusses permutations and combinations, which are useful for finding probabilities. The addition principle states that if one event can occur in m ways and a second independent event can occur in n ways, the total number of ways is m + n. The multiplication principle states that if one event can occur in m ways and a second event can occur in n ways given the first event, the total number of ways is m * n. Permutations calculate the number of arrangements of objects in a specific order, while combinations calculate the number of ways to select objects without regard to order. The document provides examples of calculating permutations and combinations to solve probability problems.

Uploaded by

Brian
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
157 views3 pages

12.3 Notes

The document discusses permutations and combinations, which are useful for finding probabilities. The addition principle states that if one event can occur in m ways and a second independent event can occur in n ways, the total number of ways is m + n. The multiplication principle states that if one event can occur in m ways and a second event can occur in n ways given the first event, the total number of ways is m * n. Permutations calculate the number of arrangements of objects in a specific order, while combinations calculate the number of ways to select objects without regard to order. The document provides examples of calculating permutations and combinations to solve probability problems.

Uploaded by

Brian
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/ 3

Unit 9 (Chapter 12 Pearson & Chapter 9 Openstax)

12.3 (Pearson) Permutations and Combinations (Counting Principles)

Essential Question: How are permutations and combinations useful when finding probabilities?
• Use permutations and combinations to find the number of outcomes in a probability experiment.

Addition Principle→ If one event can occur in m ways and a second event with no common outcomes can occur in n
ways, then the first or second event can occur in _____________ways.

Ex: A student is shopping for a new computer. He is deciding among 3 desktop computers and 4 laptop
computers. What is the total number of computer options. There are ____ options.

Multiplication Principle→ If one event can occur in m ways and a second event can occur in n ways after the first event
has occurred, then the first or second event can occur in _____________ ways. A.K.A. the FUNDAMENTAL COUNTING
PRINCIPLE.

Ex: A restaurant offer a breakfast special that includes a breakfast sandwich, a side dish, and a beverage. There
are 3 types of breakfast sandwiches, 4 side dish options, and 5 beverage choices. Find the total number of possible
breakfast specials

Ex: Manuel’s Pizzeria offers a large and medium sized pizza. You can order deep dish or thin crust. The available
toppings are sausage, pepperoni, and cheese. How many different one-topping pizzas are available?

*The Multiplication Principle is used to solve a variety of problems. When you have to place objects in order, we call this
a ______________________________. For example: Arranging letters into words, digits into numbers.

n!
Permutation→ n Pr = P (n, r ) = for 0  r  n
(n − r )!

Example: Gabriela is making a playlist with her 3 favorite songs. How many possible orders are there for the songs?
Method 1: Use an organized list. Let A, B, and C represent the 3 songs. There are 6 different possible orders.

Method 2: Use the Fundamental Counting Principle. _______________________________


3 choices for the first song
2 choices for the second song
1 choice left for the third song This represents a factorial. _____________________________

Gabriela wants to make another playlist using 5 of the 8 songs from her favorite artist’s latest album. How many playlists
are possible?
Method 1: Use the Fundamental Counting Principle.

Method 2: Use factorials.


Example:
A) A family of five is having portraits taken. How many ways can the family line up for the portrait?

B) How many ways can the photographer can line up 3 of the family members?

C) How many way can the family line up for the portrait if the parents are required to stand on each end?

*When we want to select a few objects from a group of objects, but do not care about the order we use
_____________________.

n!
Combinations→ A set of objects with ______ specific order. Cr = C (n, r ) = for 0  r  n
r !(n − r )!
n

Example: An ice cream shop offers 10 flavors of ice cream. How many ways are there to choose 3 flavors for a banana
split?

Example: How many ways can a camper choose 5 activities from the 10 available activities at the summer camp?

Example: If there are a possible 59 numbers and the lottery officials draw 6 numbers, how many possible combinations
are there?

Distinct and Non-Distinct Permutations (distinct are nonrepeated objects)


The number of non-distinct (repeated and nondistinguishable) permutations of n objects is defined by …
n!
for k different types of objects
n1 ! n2 ! n3 ! nk !

The peg game on the tables at Cracker Barrel is a triangle with 15 holes drilled in it, in which pegs are placed. There are 5
red pegs, 5 white pegs, 3 blue pegs, and 2 yellow pegs. If all 15 pegs are in the holes, how many different ways can the
pegs be aligned?
Example: Find the number of rearrangements of the letters in the word DISTINCT.

Example: Suppose there are 12 sheets of stickers. If all the stickers were distinct, there would be 12! Ways to order the
stickers. However, 4 of the stickers are identical stars, and 3 are identical moons. Find the number of unique ways to
order the stickers.

Example: Find the number of rearrangements of the letters in the word CARRIER.

Finding the number of Subsets in a Set


With combinations we look at choosing an exact amount of objects. What if you were presented with a sequence of
choices (where you could say yes or no to the option)? The whole subset would be n number of choices, with two
options (yes or no to that choice). We call this a subset of n distinct objects represented as 2n.

Example: A restaurant offers butter, cheese, chives, and sour cream as toppings for a baked potato. How many different
ways are there to order a potato?

Example: A sundae bar at a wedding has 6 toppings to choose from. Any number of toppings can be chosen. How many
different sundaes are possible?

You might also like