Additional Topics in Probability and Counting 1 Section 3.4.

Slides:



Advertisements
Similar presentations
Counting Principles Probability.
Advertisements

3.7: Counting Objective: To find the counts of various combinations and permutations, as well as their corresponding probabilities CHS Statistics.
Larson/Farber Ch. 3 Chapter 3: Probability StatisticsSpring2003/CourseHome/index.htm.
Chapter 3 Probability Larson/Farber 4th ed.
Chapter 8 Counting Principles: Further Probability Topics Section 8.1 The Multiplication Principle; Permutations.
Combinations, Permutations, and the Fundamental Counting Principle.
Fair Coin Activity How do we flip the coin so it is done in the same manner each time? Should you turn the coin over when you catch it? Which side of the.
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.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Probability Larson/Farber 4th ed.
3.4 Counting Principles Statistics Mrs. Spitz Fall 2008.
Chapter 3 Probability.
AP Stats BW 10/14 or 15 Suppose that the numbers of unnecessary procedures recommended by five doctors in a 1-month period are given by the set {2, 2,
Section 4.3 Basic Counting Rules HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2008 by Hawkes Learning Systems/Quant Systems, Inc. All.
3.1 Probability Experiments Probability experiment: An action, or trial, through which specific results (counts, measurements, or responses) are obtained.
3.4B-Permutations Permutation: ORDERED arrangement of objects. # of different permutations (ORDERS) of n distinct objects is n! n! = n(n-1)(n-2)(n-3)…3·2·1.
The Fundamental Counting Principle and Permutations
Section 4.1 What is Probability ? Larson/Farber 4th ed.
Chapter Probability 1 of 88 3 © 2012 Pearson Education, Inc. All rights reserved.
Additional Topics in Probability and Counting Larson/Farber 4th ed1.
Introductory Statistics Lesson 3.4 B Objective: SSBAT determine the number of combinations. Standards: M11.E
1 Combinations. 2 Permutations-Recall from yesterday The number of possible arrangements (order matters) of a specific size from a group of objects is.
Counting and Probability It’s the luck of the roll.
Section 10-3 Using Permutations and Combinations.
Additional Topics in Probability and Counting
Section 4.3 Objectives Use a tree diagram and the Fundamental Counting Principle to find probabilities Determine the number of ways a group of objects.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Section 3.4 Additional Topics in Probability and Counting © 2012 Pearson Education, Inc. All rights reserved. 1 of 88.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
3.4 Counting Principles I.The Fundamental Counting Principle: if one event can occur m ways and a second event can occur n ways, the number of ways the.
Chapter 3 Probability Larson/Farber 4th ed 1. Chapter Outline 3.1 Basic Concepts of Probability 3.2 Conditional Probability and the Multiplication Rule.
Counting Principles Multiplication rule Permutations Combinations.
Copyright © 2015, 2012, and 2009 Pearson Education, Inc. 1 Chapter Probability 3.
Honors Analysis.  Independent Events: Events that do not affect each other  Sample Space: List of all possible outcomes  Fundamental Counting Principle:
Section 6.2: Probability Models Ways to show a sample space of outcomes of multiple actions/tasks: (example: flipping a coin and rolling a 6 sided die)
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
Chance of winning Unit 6 Probability. Multiplication Property of Counting  If one event can occur in m ways and another event can occur in n ways, then.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
WARM UP 1 Find the mean, median, and mode for the following data:
Chapter 3 Probability 1. Do Now 3/31 Give an example of Objective Probability. 2.
1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 13 From Randomness to Probability.
The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Chapter 10 Counting Methods.
Chapter 3 Probability Larson/Farber 4th ed.
Permutations and Combinations
Fundamental Counting Principle
Counting Methods and Probability Theory
12.2 Permutations and Combinations
Chapter 5 Probability 5.5 Counting Techniques.
Chapter 3 Probability.
Section 3-4 Permutations
Chapter 3 Probability.
Elementary Statistics: Picturing The World
Permutations and Combinations
Permutations and Combinations
Counting Methods and Probability Theory
Counting Principle.
Chapter 3 Probability.
9.1 Basic Combinatorics.
Addition Rule Objectives
Presentation transcript:

Additional Topics in Probability and Counting 1 Section 3.4

Section 3.4 Objectives 2 Determine the number of ways a group of objects can be arranged in order Determine the number of ways to choose several objects from a group without regard to order Use the counting principles to find probabilities

Permutations 3 Permutation An ordered arrangement of objects The number of different permutations of n distinct objects is n! (n factorial) n! = n∙(n – 1)∙(n – 2)∙(n – 3)∙ ∙ ∙3∙2 ∙1 0! = 1 Examples: 6! = 6∙5∙4∙3∙2∙1 = 720 4! = 4∙3∙2∙1 = 24

Example: Permutation of n Objects 4 The objective of a 9 x 9 Sudoku number puzzle is to fill the grid so that each row, each column, and each 3 x 3 grid contain the digits 1 to 9. How many different ways can the first row of a blank 9 x 9 Sudoku grid be filled? Solution: The number of permutations is 9!= 9 ∙8∙7∙6∙5∙4∙3∙2∙1 = 362,880 ways

Permutations 5 Permutation of n objects taken r at a time The number of different permutations of n distinct objects taken r at a time ■ where r ≤ n

Example: Finding nPr 6 Find the number of ways of forming three-digit codes in which no digit is repeated. Solution: You need to select 3 digits from a group of 10 n = 10, r = 3

Example: Finding nPr 7 Forty-three race cars started the 2007 Daytona 500. How many ways can the cars finish first, second, and third? Solution: You need to select 3 cars from a group of 43 n = 43, r = 3

Distinguishable Permutations 8 The number of distinguishable permutations of n objects where n 1 are of one type, n 2 are of another type, and so on ■ where n 1 + n 2 + n 3 +∙∙∙+ n k = n

Example: Distinguishable Permutations 9 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, n 1 = 6, n 2 = 4, n 3 = 2

Combinations 10 Combination of n objects taken r at a time A selection of r objects from a group of n objects without regard to order ■

Example: Combinations 11 A state’s department of transportation plans to develop a new section of interstate highway and receives 16 bids for the project. The state plans to hire four of the bidding companies. How many different combinations of four companies can be selected from the 16 bidding companies? Solution: You need to select 4 companies from a group of 16 n = 16, r = 4 Order is not important

Solution: Combinations 12

Example: Finding Probabilities 13 A student advisory board consists of 17 members. Three members serve as the board’s chair, secretary, and webmaster. Each member is equally likely to serve any of the positions. What is the probability of selecting at random the three members that hold each position?

Solution: Finding Probabilities 14 There is only one favorable outcome There are ways the three positions can be filled

Example: Finding Probabilities 15 You have 11 letters consisting of one M, four Is, four Ss, and two Ps. If the letters are randomly arranged in order, what is the probability that the arrangement spells the word Mississippi?

Solution: Finding Probabilities 16 There is only one favorable outcome There are distinguishable permutations of the given letters 11 letters with 1,4,4, and 2 like letters

Example: Finding Probabilities 17 A food manufacturer is analyzing a sample of 400 corn kernels for the presence of a toxin. In this sample, three kernels have dangerously high levels of the toxin. If four kernels are randomly selected from the sample, what is the probability that exactly one kernel contains a dangerously high level of the toxin?

Solution: Finding Probabilities 18 The possible number of ways of choosing one toxic kernel out of three toxic kernels is 3 C 1 = 3 The possible number of ways of choosing three nontoxic kernels from 397 nontoxic kernels is 397 C 3 = 10,349,790 Using the Multiplication Rule, the number of ways of choosing one toxic kernel and three nontoxic kernels is 3 C 1 ∙ 397 C 3 = 3 ∙ 10,349,790 3 = 31,049,370

Solution: Finding Probabilities 19 The number of possible ways of choosing 4 kernels from 400 kernels is 400 C 4 = 1,050,739,900 The probability of selecting exactly 1 toxic kernel is

Section 3.4 Summary 20 Determined the number of ways a group of objects can be arranged in order Determined the number of ways to choose several objects from a group without regard to order Used the counting principles to find probabilities