Counting – Day 1 Section 4.7. Why Do We Need Counting Methods? When finding a basic probability, what are the two things we need to know? Number of different.

Slides:



Advertisements
Similar presentations
Probability Topic 5: Probabilities Using Counting Methods.
Advertisements

Probabilities Through Simulations
Combinations and Permutations Day 1 Section 15.3.
Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.
Combinations, Permutations, and the Fundamental Counting Principle.
Chapter 3 Probability.
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.
Counting Rules.
12.1 & 12.2: The Fundamental Counting Principal, Permutations, & Combinations.
Probability Event a result or outcome of a procedure Simple Event an event that can’t be broken down Sample Space the set of all possible simple events.
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Created by Tom Wegleitner, Centreville, Virginia Section 4-7.
Chapter 3 Probability 3-1 Overview 3-2 Fundamentals 3-3 Addition Rule
Counting If you go to Baskin-Robbins (31 flavors) and make a triple-scoop ice-cream cone, How many different arrangements can you create (if you allow.
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Section 4-7 Counting.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Section 4-2 Basic Concepts of Probability.
Probability Chapter 3. § 3.1 Basic Concepts of Probability.
Statistics Probabilities
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Lecture Slides Elementary Statistics Tenth Edition and the.
Chapter 4 Probability 4-1 Overview 4-2 Fundamentals 4-3 Addition Rule
Slide 1 Definition Figures 3-4 and 3-5 Events A and B are disjoint (or mutually exclusive) if they cannot both occur together.
Probability Topic 5: Probabilities Using Counting Methods.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 Counting Section 3-7 M A R I O F. T R I O L A Copyright © 1998, Triola, Elementary.
Section Copyright © 2014, 2012, 2010 Pearson Education, Inc. Lecture Slides Elementary Statistics Twelfth Edition and the Triola Statistics Series.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Chapter 4 Lecture 4 Section: 4.7. Counting Fundamental Rule of Counting: If an event occurs m ways and if a different event occurs n ways, then the events.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Section Copyright © 2014, 2012, 2010 Pearson Education, Inc. Lecture Slides Elementary Statistics Twelfth Edition and the Triola Statistics Series.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
IT College Introduction to Computer Statistical Packages Lecture 9 Eng. Heba Hamad 2010.
Slide Slide 1 Created by Tom Wegleitner, Centreville, Virginia Edited by Olga Pilipets, San Diego, California Counting.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Preview Rare Event Rule for Inferential Statistics: If, under a given assumption, the probability.
Probability Chapter 3. § 3.4 Counting Principles.
Chapter 10 – Data Analysis and Probability
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all the ways the letters ‘x’, ‘y’, and ‘z’
Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.
Copyright (C) 2002 Houghton Mifflin Company. All rights reserved. 1 Understandable Statistics Seventh Edition By Brase and Brase Prepared by: Lynn Smith.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 M ARIO F. T RIOLA E IGHTH E DITION E LEMENTARY S TATISTICS Section 3-6 Counting.
Arrangements How many ways can I arrange the following candles?
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Lecture Slides Elementary Statistics Tenth Edition and the.
Chapter 4 Lecture 4 Section: 4.7. Counting Fundamental Rule of Counting: If an event occurs m ways and if a different event occurs n ways, then the events.
Section 4.5-Counting Rules
Section 4.3 Trees and Counting Techniques Organize outcomes in a sample space using tree diagrams. Define and use factorials. Explain how counting techniques.
Copyright (C) 2002 Houghton Mifflin Company. All rights reserved. 1 Understandable Statistics Seventh Edition By Brase and Brase Prepared by: Lynn Smith.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
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)
Algebra-2 Counting and Probability. Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all.
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:
Probability and Counting Rules 4-4: Counting Rules.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
Chapter 3 Probability Initial Objective: Develop procedures to determine the # of elements in a set without resorting to listing them first. 3-6 Counting.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.
Section 4-7 Counting.
Elementary Probability Theory
Counting Methods and Probability Theory
Section 4.7 Counting – Day 1.
Permutations 10.5 Notes.
Elementary Statistics
Chapter 3 Probability.
Counting Methods and Probability Theory
Created by Tom Wegleitner, Centreville, Virginia
Lecture Slides Essentials of Statistics 5th Edition
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Presentation transcript:

Counting – Day 1 Section 4.7

Why Do We Need Counting Methods? When finding a basic probability, what are the two things we need to know? Number of different simple events Number of ways event A can occur P(A) = Sometimes however, it is not practical to construct a list of the outcomes. So finding the total often requires the methods of this section.

Identity Theft A criminal (Mr. Llorens) is found using your social security number and claims that all of the digits were randomly generated. What is the probability of getting your social security number when randomly generating digits? Is the criminal’s (Mr. Llorens) claim that your number was randomly generated likely to be true?

What We Need … The Fundamental Counting Rule For a sequence of two (or more) events in which the first can occur m ways and the second can occur n ways, the events together can occur m∙n ways. Apply it! What is the probability of Mr. Llorens randomly generating your social security number?

Teapot History Facts Consider the following question given on a history test: Arrange the following event in chronological order. a) Boston Tea Party b) The invention of the teapot c) The Teapot Dome Scandal d) Ms. Yedinak buying her first teapot e) The Civil War Assuming you make a random guess, what is your probability of getting the correct answer?

Additional Information The solution to the previous problem represents a solution that can be generalized by using the following notation and factorial rule. Notation The factorial symbol (!) denotes the product of decreasing positive whole numbers. For example, 4! = 4∙3∙2∙1 = 24. By special definition, 0! =1. Factorial Rule A collection of n different items can be arranged in order n! different ways. (This factorial rule reflects that the first item may be selected n different ways, the second item may be selected n-1 ways, and so on.

Summer Vacay During your upcoming summer vacation, you are planning to visit these six national landmarks: Ms. Yedinak’s birthplace, childhood home, high school, college, favorite playground, and go-to grocery store. You would like to plan the most efficient route so you can spend as much time at these landmarks as possible. How many different route are there? TRAVESTY NEWS FLASH What if you only have time to visit 4 of these locations? How many possible routes are there now?

Permutations Rule When Items Are All Different When Some Items Are Identical To Others 1. There are n different items. 2. We select r of the n items (without replacement). 3. We consider rearrangements of the same items to be different. 1. There are n different items, and some are the same. 2. We select all of the n items (without replacement). 3. We consider rearrangements of the same items to be different. IMPORTANT: ORDER MATTERS

Examples² Horse RacingGender Selection The 132 nd running of the Kentucky Derby had a field of 20 horses. If a better randomly selects two of those horses to come in 1 st and 2 nd, what is the probability of winning? 14 couples tried to have baby girls by using the Microsort gender selection method. How many ways can 11 girls and 3 boys be arranged in sequence?

What Now? How many ways can 3 class representatives be chosen from a group of 12 students? VS.

Combinations When Order Doesn’t Matter 1. There are n different items available. 2. We select r of the n items (without replacement). 3. We consider rearrangements of the same items to be the same. (The combination ABC is the same as CBA).

Solve it! How many ways can 3 class representatives be chosen from a group of 12 students? VS.

Homework p #16, 18, 19, 25, 26