11.6 Conditional Probability

Slides:



Advertisements
Similar presentations
Thinking Mathematically Combinations. A combination of items occurs when: The item are selected from the same group. No item is used more than once. The.
Advertisements

How many possible outcomes can you make with the accessories?
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Probability Using Permutations and Combinations
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 8 - Slide 1 P-8 Probability The Counting Principle and Permutations.
The Fundamental Counting Principle and Permutations
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.
Aim: Combinations Course: Math Lit. Do Now: Aim: How do we determine the number of outcomes when order is not an issue? Ann, Barbara, Carol, and Dave.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Permutations and Combinations
Chapter 5: Introduction to Probability 5.3 Counting and theoretical probabilities: How many? 1 Learning Objectives:  Learn how to count outcomes without.
Slide Slide 1 Created by Tom Wegleitner, Centreville, Virginia Edited by Olga Pilipets, San Diego, California Counting.
Section 10-3 Using Permutations and Combinations.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.9 Combinations.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.7 Conditional Probability.
Counting Principles Multiplication rule Permutations Combinations.
How many four-digit odd numbers are there? Assume that the digit on the left cannot be a zero.
Honors PreCalculus: Section 9.1 Basic Combinatorics.
Lesson 0.4 (Counting Techniques)
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations and Combinations
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Bell work Diagnostic Evaluation Please pick up a Pre-Assessment off the table as you come in to class, take a seat, and get started.
Permutations and Combinations
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
11.8 Combinations A combination of items occurs when
MATH 2311 Section 2.1.
Permutations and Combinations
Algebra 2/Trig Name: ________________________
Counting Methods and Probability Theory
12.2 Permutations and Combinations
Do Now If fours cards are drawn from a deck without replacement, find the probability of getting these results: All kings All diamonds All sevens.
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Section 12.9 Combinations.
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Section 12.8 The Counting Principle and Permutations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
The Counting Principle and Permutations
Permutations and Combinations
First lecture fsalamri Faten alamri.
Pearson Unit 6 Topic 15: Probability 15-3: Permutations and Combinations Pearson Texas Geometry ©2016 Holt Geometry Texas ©2007.
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Principle.
Counting Methods and Probability Theory
4-1 Chapter 4 Counting Techniques.
Bellwork Practice Packet 10.3 B side #3.
Counting Methods and Probability Theory
Day 2 - Combinations.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
Permutations and Combinations
Lecture 7: Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

11.6 Conditional Probability In general, the probability of event E2 occurring, given that an event E1 has happened (or will happen; the time relationship does not matter), is called a conditional probability and is written P(E2|E1). Example 1: A single card is selected from a deck of cards. Determine the probability it is a club, given that it is black. Example 2: A letter is randomly selected from the letters of the English alphabet. Find the probability of selecting a vowel, given that the outcome is a letter that precedes h

Example 3: If one person from the 250 patients surveyed is selected at random, determine the probability that the person was satisfied with the results of the surgery. was satisfied with the results of the surgery, given that the person had knee surgery. was dissatisfied with the results of the surgery, given that the person had hip surgery. had heart surgery, given that the person was dissatisfied with the results of the surgery.

Example 4: Sally, a quality control inspector, is checking a sample of lightbulbs for defects. The following table summarizes her findings. If one of these light bulbs is selected at random, determine the probability that the lightbulb is Good. Good, given that it is 50 watts. Good, given that it is 100 watts. Good, given that it is 50 or 100 watts. Defective, given that it is not 50 watts.

11.7 Counting Principle and Permutations Example 1 (Review): A password used to gain access to a computer account is to consist of two lower case letters followed by four digits. Determine how many different passwords are possible if repetition of letters and digits is permitted. b) repetition of letters and digits is not permitted. c) the first letter must be a vowel (a, e, i, o, u) and the first digit cannot be a 0, and repetition of letters and digits is not permitted.

n! = n(n  1)(n  2)···(3)(2)(1) 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 product 7∙6∙5∙4∙3∙2∙1 is called 7 factorial and is written 7! If n is a positive integer, the notation n! (read “n factorial”) is the product of all positive integers from n down through 1. n! = n(n  1)(n  2)···(3)(2)(1) 0! (zero factorial), by definition, is 1. 0! = 1

Example 2: Evaluate Example 3: Consider the five letters a, b, c, d, e. In how many distinct ways can three letters be selected and arranged if repetition is not allowed?

The number of possible permutations of r items are taken from n items: Example 4 (redone): Consider the five letters a, b, c, d, e. In how many distinct ways can three letters be selected and arranged if repetition is not allowed? Example 5: You are among eight people forming a skiing club. Collectively, you decide to put each person’s name in a hat and to randomly select a president, a vice president, and a secretary. How many different arrangements or permutations of officers are possible? Example 6: You and 19 of your friends have decided to form a business. The group needs to choose three officers– a CEO, an operating manager, and a treasurer. In how many ways can those offices be filled?

The number of distinct permutations of n objects where n1 of the objects are identical, n2 of the objects are identical, …, nr of the objects are identical is found by the formula Example 7: In how many different ways can the letters of the word BANANAS be arranged? Example 8: In how many different ways can the letters of the word TALLAHASSEE be arranged? Example 9: In how many distinct ways can the letters of the word MISSISSIPPI be arranged?

11.8 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 items makes no difference. Note: Permutation problems involve situations in which order matters. Combination problems involve situations in which the order of items makes no difference.

Examples 1 – 2: Determine which involve permutations and which involve combinations. Example 1: Six students are running for student government president, vice-president and treasure. The student with the greatest number of votes becomes the president, the second highest vote-getter becomes vice-president, and the student who gets the third largest number of votes will be treasurer. How many different outcomes are possible? Example 2: Six people are on the board of supervisors for your neighborhood park. A three-person committee is needed to study the possibility of expanding the park. How many different committees could be formed from the six people?

Comparing Combinations and Permutations Given the letters: A,B,C,D: We can compare how many permutations and how many combinations are possible if we chose 3 letters at a time:

The number of possible combinations if r items are taken from n items is: Example 3: While visiting New York City, the Friedmans are interested in visiting 8 museums but have time to visit only 3. In how many ways can the Friedmans select 3 of the 8 museums to visit?

Example 4: Jan Funkhauser has 10 different cut flowers from which she will choose 6 to use in a floral arrangement. How many different ways can she do so? Example 5: How many three-person committees could be formed from 8 people?

Example 6: At the Royal Dynasty Chinese restaurant, dinner for eight people consists of 3 items from column A, 4 items from column B, and 3 items from column C. If columns A, B, and C have 5, 7, and 6 items, respectively, how many different dinner combinations are possible? Example 7: In December, 2009, the U.S Senate consisted of 60 Democrats and 40 Republicans. How many committees can be formed if each committee must have 3 Democrats and 2 Republicans?