10.1 Applying the Counting Principle and Permutations.

Slides:



Advertisements
Similar presentations
6.1 Use Combinations and Binomial Theorem 378 What is a combination? How is it different from a permutation? What is the formula for n C r ?
Advertisements

Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
15.2 Counting Methods: Permutations
Counting Methods Topic 7: Strategies for Solving Permutations and Combinations.
Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.
How many possible outcomes can you make with the accessories?
EXAMPLE 1 Find combinations CARDS
___ ___ ___ ___ ___ ___ ___ ___ ___
Chapter 7 - Part Two Counting Techniques Wednesday, March 18, 2009.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Probability Using Permutations and Combinations
EXAMPLE 1 Use a tree diagram Snowboarding
EXAMPLE 1 Use a tree diagram Snowboarding
Counting principle and permutations
EXAMPLE 5 Find permutations of n objects taken r at a time Music You are burning a demo CD for your band. Your band has 12 songs stored on your computer.
Warm-Up 4/29. Rigor: You will learn how to find the number of possible outcomes using the Fundamental Counting Principle, permutations and combinations.
The Fundamental Counting Principal, Permutations, & Combinations.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
Formulas and Principles. Math I Unit 4 If one event can occur in m ways and another event can occur in n ways, then the number of ways that both events.
The Fundamental Counting Principal - Permutations - Factorials.
Introduction to Counting Discrete Structures. A Multiplication Principle.
Math Duels Competition of Scholars. Rules  The class must be split into 2 groups.  Each group must select a team captain and they must do Rock-Paper-Scissors.
Algebra II 10.2: Use Combinations Quiz : Friday, 12/13.
EXAMPLE 5 Find permutations of n objects taken r at a time Music You are burning a demo CD for your band. Your band has 12 songs stored on your computer.
ON A BLANK SHEET OF PAPER PLEASE COMPLETE THE PREREQUISITE SKILL #1-9 ON PAGE 680 BELL RINGER.
Counting Techniques 0.4.
Sports Camp Morning Camp AerobicsRunningYogaSwimmingWeights Afternoon Camp HikingTennisVolleyballSoftball List all the possible choices available on your.
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
Chapter 10 Section 1 Apply the Counting Principle and Permutations In this assignment, you will be able to Use the Fundamental Counting Principle.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Probability Counting Methods. Do Now: Find the probablity of: Rolling a 4 on a die Rolling a “hard eight” (2 - 4’s) on a pair of dice.
Algebra II 10.1: Apply the Counting Principle and Permutations HW: HW: p (6, 10, 14, 16, 26, 28, 34, all) Quiz : Friday, 12/13.
Warm Up CST Review. EXAMPLE 1 Use a tree diagram Snowboarding A sporting goods store offers 3 types of snowboards (all-mountain, freestyle, and carving)
Permutations and Combinations
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
Happy 2014! Sit somewhere new to start the new year! The plan for this semester…
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
9.6 The Fundamental Counting Principal & Permutations.
Lesson 0.4 (Counting Techniques)
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
EXAMPLE 6 Find permutations with repetition
EXAMPLE 6 Find permutations with repetition Find the number of distinguishable permutations of the letters in a. MIAMI and b. TALLAHASSEE. SOLUTION MIAMI.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
Multiplication Counting Principle How many ways can you make an outfit out of 2 shirts and 4 pants? If there are m choices for step 1 and n choices for.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
SECTION 5.4 COUNTING. Objectives 1. Count the number of ways a sequence of operations can be performed 2. Count the number of permutations 3. Count the.
0.4 Counting Techniques. Fundamental Counting Principle TWO EVENTS:If one event can occur in m ways and another event can occur in n ways, then the number.
Fri 4/29 Lesson 11 – 1 Learning Objective: To use permutations & combinations to count possibilities Hw: 11-1 Fundamental Counting WS.
The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.
Algebra II 10.1: Apply the Counting Principle and Permutations.
How much should I invest?
Apply the Counting Principle and Permutations
WARMUP Lesson 10.2, For use with pages b
Use Combinations and the Binomial Theorem
Counting Principle and Permutations
Chapter 0.4 Counting Techniques.
Use Combinations and the Binomial Theorem
12.1 The Fundamental Counting Principle & Permutations
Apply the Counting Principle and Permutations
Section 0-4 Counting Techniques
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Apply the Counting Principle and Permutations
Evaluate the expression.
How many possible outcomes can you make with the accessories?
Use Combinations and the Binomial Theorem
Vocabulary FCP/ Comb/Perm Simple Probability Compound Probability 1
Presentation transcript:

10.1 Applying the Counting Principle and Permutations

EXAMPLE 1 Use a tree diagram Snowboarding A sporting goods store offers 3 types of snowboards (all mountain, freestyle, and carving) and 2 types of boots (soft and hybrid). How many choices does the store offer for snowboarding equipment? SOLUTION Draw a tree diagram and count the number of branches.

EXAMPLE 1 Use a tree diagram ANSWERThe tree has 6 branches. So, there are 6 possible choices.

EXAMPLE 2 Use the fundamental counting principle Photography You are framing a picture. The frames are available in 12 different styles. Each style is available in 55 different colors. You also want blue mat board, which is available in 11 different shades of blue. How many different ways can you frame the picture?

EXAMPLE 2 Use the fundamental counting principle Number of ways = = 7260 ANSWER The number of different ways you can frame the picture is SOLUTION You can use the fundamental counting principle to find the total number of ways to frame the picture. Multiply the number of frame styles (12), the number of frame colors (55), and the number of mat boards (11).

EXAMPLE 3 Use the counting principle with repetition License Plates The standard configuration for a Texas license plate is 1 letter followed by 2 digits followed by 3 letters. How many different license plates are possible if letters and digits can be repeated? a. How many different license plates are possible if letters and digits cannot be repeated? b.

EXAMPLE 3 Use the counting principle with repetition SOLUTION a. There are 26 choices for each letter and 10 choices for each digit. You can use the fundamental counting principle to find the number of different plates. = 45,697,600 ANSWER With repetition, the number of different license plates is 45,697,600. Number of plates =

EXAMPLE 3 Use the counting principle with repetition b. If you cannot repeat letters there are still 26 choices for the first letter, but then only 25 remaining choices for the second letter, 24 choices for the third letter, and 23 choices for the fourth letter. Similarly, there are 10 choices for the first digit and 9 choices for the second digit. You can use the fundamental counting principle to find the number of different plates. = 32,292,000 ANSWER With repetition, the number of different license plates is 32,292,000. Number of plates =

GUIDED PRACTICE for Examples 1, 2 and 3 1. SPORTING GOODS : The store in Example 1 also offers 3 different types of bicycles (mountain, racing, and BMX) and 3 different wheel sizes (20 in., 22 in., and 24 in.). How many bicycle choices does the store offer? SOLUTION choices = types · wheel sizes choices = 3 · 3 choices = 9 The store offers 9 choices of bicycles ANSWER

GUIDED PRACTICE for Examples 1, 2 and 3 2. What If? In Example 3, how do the answers change for the standard configuration of a New York license plate, which is 3 letters followed by 4 numbers?

EXAMPLE 3 Use the counting principle with repetition SOLUTION a. There are 26 choices for each letter and 10 choices for each digit. You can use the fundamental counting principle to find the number of different plates. ANSWER The number of plates will increase to 175,760,000. = 175,760,000 Number of plates =

EXAMPLE 3 Use the counting principle with repetition b. If you cannot repeat letters there are still 26 choices for the first letter, but then only 25 remaining choices for the second letter, 24 choices for the third letter. Similarly, there are 10 choices for the first digit and 9 choices for the second digit and so on. You can use the fundamental counting principle to find the number of different plates. = 78,624,000 ANSWER The number of plates would increase to 78,624,000. Number of plates =

EXAMPLE 4 Find the number of permutations Olympics Ten teams are competing in the final round of the Olympic four- person bobsledding competition. In how many different ways a. can the bobsledding teams finish the competition? (Assume there are no ties.) In how many different ways can 3 of the bobsledding teams finish first, second, and third to win the gold, silver, and bronze medals? b.

EXAMPLE 4 Find the number of permutations SOLUTION a. There are 10! different ways that the teams can finish the competition. 10! = = 3,628,800 b. Any of the 10 teams can finish first, then any of the remaining 9 teams can finish second, and finally any of the remaining 8 teams can finish third. So, the number of ways that the teams can win the medals is: = 720

GUIDED PRACTICE for Example 4 What If? In Example 4, how would the answers change if there were 12 bobsledding teams competing in the final round of the competition? 3. SOLUTION a. There are 12! different ways that the teams can finish the competition. = 479,001, ! = The number of ways to finish would increase to 479,001,600.

GUIDED PRACTICE for Example 4 b. Any of the 12 teams can finish first, then any of the remaining 11 teams can finish second, and finally any of the remaining 10 teams can finish third. So, the number of ways that the teams can win the medals is: = 1320 The number of ways to finish would increase to 1320.

EXAMPLE 5 Find permutations of n objects taken r at a time Music You are burning a demo CD for your band. Your band has 12 songs stored on your computer. However, you want to put only 4 songs on the demo CD. In how many orders can you burn 4 of the 12 songs onto the CD? SOLUTION Find the number of permutations of 12 objects taken 4 at a time. ( 12 – 4 )! 12 P 4 = 12! = 11,800= 12! 8! 479,001, = ANSWER You can burn 4 of the 12 songs in 11,880 different orders.

GUIDED PRACTICE for Example 5 Find the number of permutations. 5P35P3 4. ( 5 – 3 )! 5P35P3 = 5!5! = 60= SOLUTION = 60 ANSWER SOLUTION = 4 ANSWER 5. 4P14P1 ( 4 – 1 )! 4P14P1 = 4!4! = 4 =

GUIDED PRACTICE for Example 5 Find the number of permutations. 6. 8P58P5 ( 8 – 5 )! 8P58P5 = 8!8! SOLUTION = 6720 ANSWER = 6720=

GUIDED PRACTICE for Example 5 Find the number of permutations P 7 = 3,991,680 ANSWER ( 12 – 7 )! 12 P 7 = 12! SOLUTION = 3,991,680 =

EXAMPLE 6 Find permutations with repetition Find the number of distinguishable permutations of the letters in a. MIAMI and b. TALLAHASSEE. SOLUTION MIAMI has 5 letters of which M and I are each repeated 2 times. So, the number of distinguishable permutations is a. = 30. 2! 5!5! = 120 2

EXAMPLE 6 Find permutations with repetition TALLAHASSEE has 11 letters of which A is repeated 3 times, and L, S, and E are each repeated 2 times. So, the number of distinguishable permutations is b. = 831,600. 3! 2! 2! 2! 11! = 39, 916,

GUIDED PRACTICE for Example 6 Find the number of distinguishable permutations of the letters in the word. 8. MALL MALL has 4 letters of which L repeated 2 times. So, the number of distinguishable permutations is SOLUTION = 12. = 4 3 2! 4!4!

GUIDED PRACTICE for Example 6 Find the number of distinguishable permutations of the letters in the word. 9. KAYAK KAYAK has 5 letters of which K and A are repeated 2 times. So, the number of distinguishable permutations is SOLUTION = 30. 2! 2! 5! =

GUIDED PRACTICE for Example 6 Find the number of distinguishable permutations of the letters in the word. 10. CINCINNATI CINCINNATI has 10 letters of which C repeats 2 times and I and N repeats 3 times. So, the number of distinguishable permutations is SOLUTION = 50,400. 3,628, = 2! 3! 3! 10!

10.2 Use Combinations

EXAMPLE 1 Find combinations Cards A standard deck of 52 playing cards has 4 suits with 13 different cards in each suit. a. If the order in which the cards are dealt is not important, how many different 5- card hands are possible? b. In how many 5 -card hands are all 5 cards of the same color?

EXAMPLE 1 Find combinations SOLUTION a. The number of ways to choose 5 cards from a deck of 52 cards is: = 2,598,960. = ! 47! 5! = 52! 52 C 5

EXAMPLE 1 Find combinations = 131, ! 5! = 26! 26 C 52C12C1 1! 2!2! = ! 21! 5! 1! 2 b. For all 5 cards to be the same color, you need to choose 1 of the 2 colors and then 5 of the 26 cards in that color. So, the number of possible hands is:

EXAMPLE 2 Decide to multiply or add combinations Theater William Shakespeare wrote 38 plays that can be divided into three genres. Of the 38 plays, 18 are comedies, 10 are histories, and 10 are tragedies. a. How many different sets of exactly 2 comedies and 1 tragedy can you read? b. How many different sets of at most 3 plays can you read?

EXAMPLE 2 Decide to multiply or add combinations SOLUTION a. You can choose 2 of the 18 comedies and 1 of the 10 tragedies. So, the number of possible sets of plays is: = ! 1! = 10! 10 C 118 C 2 16! 2! 18! = ! 16! 2 1 9! ! = 1530

EXAMPLE 2 Decide to multiply or add combinations b. You can read 0, 1, 2, or 3 plays. Because there are 38 plays that can be chosen, the number of possible sets of plays is: 38 C C C C 3 = = 9178

EXAMPLE 3 Solve a multi-step problem Basketball During the school year, the girl’s basketball team is scheduled to play 12 home games. You want to attend at least 3 of the games. How many different combinations of games can you attend? SOLUTION Of the 12 home games, you want to attend 3 games, or 4 games, or 5 games, and so on. So, the number of combinations of games you can attend is: 12 C C C 5 +……… C 12

EXAMPLE 3 Solve a multi-step problem Instead of adding these combinations, use the following reasoning. For each of the 12 games, you can choose to attend or not attend the game, so there are 2 12 total combinations. If you attend at least 3 games, you do not attend only a total of 0, 1, or 2 games. So, the number of ways you can attend at least 3 games is: 2 12 – ( 12 C C C 2 ) = 4096 – ( ) = 4017

GUIDED PRACTICE for Examples 1, 2 and 3 Find the number of combinations. 8C38C3 1. (8 – 3)! 3! = 8! 8C38C3 =56 SOLUTION 6 = 336 = ! 5! 3!

GUIDED PRACTICE for Examples 1, 2 and 3 Find the number of combinations. = =210 SOLUTION C 6 = ! 4! 6! (10 – 6)! 6! = 10! 10 C 6

GUIDED PRACTICE for Examples 1, 2 and 3 Find the number of combinations. 7C27C2 3. =21 SOLUTION = 42 2 = 7 6 5! 5! 2! = 7C27C2 (7 – 2)! 2! 7!

GUIDED PRACTICE for Examples 1, 2 and 3 Find the number of combinations. =2002 SOLUTION C 5 (14 – 5)! 5! = 14! 14 C 5 9! 5! = !

GUIDED PRACTICE for Examples 1, 2 and 3 5. What If? In Example 2, how many different sets of exactly 3 tragedies and 2 histories can you read? SOLUTION = = 5400 sets 10 C 210 C 3 (10 – 3)! 3! = 10! (10 – 2)! 2! 10! 8! 2! = 10! 7! 3! 10! = ! 7! 3! 8! 2! ! =

Homework p.686 p.694