Copyright © 2014, 2010, 2007 Pearson Education, Inc.

Slides:



Advertisements
Similar presentations
Combinations, Permutations, and the Fundamental Counting Principle.
Advertisements

Section 3-6 Counting. FUNDAMENTAL COUNTING RULE For a sequence of two events in which the first event can occur m ways and the second event can occur.
Section 4-6 Counting.
13-3 Permutations and Combinations. Fundamental Counting Principle.
Chapter 2 Section 2.4 Permutations and Combinations.
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Counting Principles, Permutations, and Combinations.
Warm-Up Complete in notes.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Chapter 8 Counting Techniques PASCAL’S TRIANGLE AND THE BINOMIAL THEOREM.
Chapter Probability © 2010 Pearson Prentice Hall. All rights reserved 3 5.
Counting Principles and Probability Digital Lesson.
9.6 Counting Principles Permutations Combinations.
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.
Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 8 - Slide 1 P-8 Probability The Counting Principle and Permutations.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Chapter 12 Section 8 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
1/31/2007 Pre-Calculus Chapter 9 Review a n = a 1 + (n – 1)d a n = a 1 r (n – 1)
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 7: Probability Lesson 3: Multiplication Counting Principles.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Copyright © 2015, 2011, 2008 Pearson Education, Inc. Chapter 7, Unit E, Slide 1 Probability: Living With The Odds 7.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Probability Chapter 3. § 3.4 Counting Principles.
Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.
Copyright © 2011 Pearson Education, Inc. Probability: Living with the Odds.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Aim #10-7: How do we use the permutation formula? A permutation is an ordered arrangement of items that occurs when: No item is used more than once. The.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Thinking Mathematically
Warm up 7! 4! Answers: ) 4) 5).
Copyright © 2013, 2010 and 2007 Pearson Education, Inc. Chapter Probability 5.
Honors PreCalculus: Section 9.1 Basic Combinatorics.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-1 CHAPTER 4 Counting Techniques.
Copyright © 2011 Pearson Education, Inc. Slide
Unit 8 Probability.
Warm Up Which of the following are combinations?
11.3 Notes Combinations.
Permutations and Combinations
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Sequences, Series, and Probability
Counting Methods and Probability Theory
12.2 Permutations and Combinations
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Lial/Hungerford/Holcomb: Mathematics with Applications 10e
Permutations Lesson 10.1B.
Permutations and Combinations
Warm Up Which of the following are combinations?
Advanced Combinations and Permutations
Permutation & COmbination
Determining the Number of Possible Outcomes
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
Lial/Hungerford/Holcomb: Mathematics with Applications 10e Finite Mathematics with Applications 10e Copyright ©2011 Pearson Education, Inc. All right.
Counting Methods and Probability Theory
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Warm Up Make your own burrito. Choice of Flour or Corn tortilla
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
Multi-Stage Events and Applications of Probability
PERMUTATIONS.
Chapter 11: Further Topics in Algebra
Tree Diagrams Monday, October 15, 2012 Mr. Pearson
Presentation transcript:

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Chapter 8 Sequences, Induction, and Probability 8.6 Counting Principles, Permutations, and Combinations Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1

Objectives: Use the Fundamental Counting Principle. Use the permutations formula. Distinguish between permutation problems and combination problems. Use the combinations formula.

The Fundamental Counting Principle The number of ways in which a series of successive things can occur is found by multiplying the number of ways in which each thing can occur.

Example: Using the Fundamental Counting Principle A pizza can be ordered with three choices of size (small, medium, or large), four choices of crust (thin, thick, crispy, or regular), and six choices of toppings (ground beef, sausage, pepperoni, bacon, mushrooms, or onions). How many different one-topping pizzas can be ordered? We use the Fundamental Counting Principle to find the number of different one-topping pizzas that can be ordered. Size – 3 choices Crust – 4 choices Toppings – 6 choices 72 different one-topping pizzas can be ordered.

Permutations A permutation is an ordered arrangement of items that occurs when No item is used more than once. The order of arrangement makes a difference. The number of possible permutations if r items are taken from n items is

Example: Using the Formula for Permutations In how many ways can six books be lined up along a shelf? Because we are using all six books in every possible arrangement, we are arranging r = 6 books from a group of n = 6 books. Six books can be lined up along a shelf in 720 ways.

Combinations A combination of items occurs when The items are selected from the same group. No item is used more than once. The order of the items makes no difference.

Example: Distinguishing between Permutations and Combinations For each of the following problems, explain if the problem is one involving permutations or combinations. a. How many ways can you select 6 free DVD’s from a list of 200 DVD’s? Because order makes no difference, this is a combination. b. In a race in which there are 50 runners and no ties, in how many ways can the first three finishers come in? The order in which each runner finishes makes a difference, this is a permutation.

Combinations of n Things Taken r at a Time The number of possible combinations if r items are taken from n items is

Example: Using the Formula for Combinations From a group of 10 physicians, in how many ways can four people be selected to attend a conference on acupuncture? We are selecting r = 4 people from a group of n = 10 people. Four people can be selected from a group of 10 in 210 ways.