Section 1.6 Suppose that S = B 1  B 2  …  B m is an outcome space with B i  B j =  for i  j, that is, B 1, B 2, …, B m are mutually exclusive and.

Slides:



Advertisements
Similar presentations
The Law of Total Probability
Advertisements

Disjointed and Overlapping Event Disjointed events (mutually exclusive) - are events that have no outcome in common Overlapping events- events that have.
© 2003 Prentice-Hall, Inc.Chap 4-1 Basic Probability IE 440 PROCESS IMPROVEMENT THROUGH PLANNED EXPERIMENTATION Dr. Xueping Li University of Tennessee.
A.P. STATISTICS LESSON 6 – 2 (DAY2) PROBABILITY RULES.
Chapter 2 Probability. 2.1 Sample Spaces and Events.
Probability Theory Part 1: Basic Concepts. Sample Space - Events  Sample Point The outcome of a random experiment  Sample Space S The set of all possible.
8.7 Probability. Ex 1 Find the sample space for each of the following. One coin is tossed. Two coins are tossed. Three coins are tossed.
Business and Economics 7th Edition
Elementary Probability Theory
Chapter 4 Probability.
Section 1.2 Suppose A 1, A 2,..., A k, are k events. The k events are called mutually exclusive if The k events are called mutually exhaustive if A i 
ENM 207 Lecture 7. Example: There are three columns entitled “Art” (A),“Books” (B) and “Cinema” (C) in a new magazine. Reading habits of a randomly selected.
Chapter Two Probability. Probability Definitions Experiment: Process that generates observations. Sample Space: Set of all possible outcomes of an experiment.
Statistics for Managers Using Microsoft Excel, 5e © 2008 Pearson Prentice-Hall, Inc.Chap 4-1 Statistics for Managers Using Microsoft® Excel 5th Edition.
5.2B TWO-WAY TABLES, GENERAL ADDITION RULE AND VENN DIAGRAMS
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
PROBABILITY (6MTCOAE205) Chapter 2 Probability.
5.2A Probability Rules! AP Statistics.
Section 5.2 The Addition Rule and Complements
Statistics Chapter 3: Probability.
Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 2 Probability.
Overview 5.1 Introducing Probability 5.2 Combining Events
Section 4-3 The Addition Rule. COMPOUND EVENT A compound event is any event combining two or more simple events. NOTATION P(A or B) = P(in a single trial,
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
5.2 Combining Events Objectives: By the end of this section, I will be able to… 1) Understand how to combine events using complement, union, and intersection.
Nor Fashihah Mohd Noor Institut Matematik Kejuruteraan Universiti Malaysia Perlis ІМ ќ INSTITUT MATEMATIK K E J U R U T E R A A N U N I M A P.
Addition Rule Mr. Evans Statistics B. Venn Diagram It is often possible to illustrate the various sets or events of an experiment. For this we use Venn.
Chapter 4 Probability. Probability Defined A probability is a number between 0 and 1 that measures the chance or likelihood that some event or set of.
Ch Counting Techniques Product Rule If the first element or object of an ordered pair can be used in n 1 ways, and for each of these n1 ways.
Random Experiment Random Variable: Continuous, Discrete Sample Space: S Event: A, B, E Null Event Complement of an Event A’ Union of Events (either, or)
Chapter 4 Probability ©. Sample Space sample space.S The possible outcomes of a random experiment are called the basic outcomes, and the set of all basic.
Probability Basic Concepts Start with the Monty Hall puzzle
12/7/20151 Math b Conditional Probability, Independency, Bayes Theorem.
Probability Rules. We start with four basic rules of probability. They are simple, but you must know them. Rule 1: All probabilities are numbers between.
Probability: Terminology  Sample Space  Set of all possible outcomes of a random experiment.  Random Experiment  Any activity resulting in uncertain.
Chapter 2. Conditional Probability Weiqi Luo ( 骆伟祺 ) School of Data & Computer Science Sun Yat-Sen University :
PROBABILITY AND STATISTICS
+ Chapter 5 Probability: What Are the Chances? 5.1Randomness, Probability, and Simulation 5.2Probability Rules 5.3Conditional Probability and Independence.
Stat 1510: General Rules of Probability. Agenda 2  Independence and the Multiplication Rule  The General Addition Rule  Conditional Probability  The.
Chapter 9 Section 7 Chapter 12 Section 2 Algebra 2 Notes February 12, 2009.
Probabilities of Disjoint and Overlapping Events notes.
Chapter 3:Basic Probability Concepts Probability: is a measure (or number) used to measure the chance of the occurrence of some event. This number is between.
4-3 Addition Rule This section presents the addition rule as a device for finding probabilities that can be expressed as P(A or B), the probability that.
+ Unit 5: Probability: What are the Chances? Lesson 2 Probability Rules.
Week 21 Rules of Probability for all Corollary: The probability of the union of any two events A and B is Proof: … If then, Proof:
P(B) = Triangle Area P(A) = Oval Area P(A or B) = r + w + g P(A and B) = w So, P(A) + P(B) = r + w + g + w The Addition Rule for 2 events A and B P(A or.
2.5 Additive Rules: Theorem 2.10: If A and B are any two events, then: P(A  B)= P(A) + P(B)  P(A  B) Corollary 1: If A and B are mutually exclusive.
Microsoft produces a New operating system on a disk. There is 0
Section 3.3 Addition Rule (Venn Diagram). Section 3.3 Objectives Determine if two events are mutually exclusive Use a Venn Diagram to find the probability.
Discrete Math Section 16.1 Find the sample space and probability of multiple events The probability of an event is determined empirically if it is based.
Chapter 7. Section 7.1 Finite probability  In a lottery, players win a large prize when they pick four digits that match, in the correct order, four.
Lecture Slides Elementary Statistics Twelfth Edition
Math a - Sample Space - Events - Definition of Probabilities
CHAPTER 5 Probability: What Are the Chances?
Probability Axioms and Formulas
Example Suppose that a deck of 52 cards containing four aces is shuffled thoroughly and the cards are then distributed among four players so that each.
L.O. Use venn diagrams to find probability
Chapter 4 Probability.
Probabilities.
What is Probability? Quantification of uncertainty.
Statistics 300: Introduction to Probability and Statistics
Probability of Multiple Events
Combining Probabilities
Probability.
Probability Models Section 6.2.
Chapter 2 Notes Math 309 Probability.
Introduction to Probability & Statistics Expectations
Section 11.7 Probability.
Probability Rules Rule 1.
Presentation transcript:

Section 1.6 Suppose that S = B 1  B 2  …  B m is an outcome space with B i  B j =  for i  j, that is, B 1, B 2, …, B m are mutually exclusive and exhaustive. We call B 1, B 2, …, B m a partition of the outcome space S. S B1B1 B2B2 BmBm

If P(A) > 0, then for each k = 1, 2, …, m, S B1B1 B2B2 BmBm A P(B k | A) = P(B k  A) ———— = P(A) P(B k  A) ———————————————— = P[(B 1  A)  (B 2  A)  …  (B m  A)] P(B k  A) —————— =  P(B i  A) i = 1 m

If P(A) > 0, then for each k = 1, 2, …, m, P(B k | A) = P(B k ) P(A | B k ) ————————  P(B i ) P(A | B i ) i = 1 m Bayes’ Rule Bayes’ Theorem is stated as follows: P(B k ) P(A | B k ) ————————  P(B i ) P(A | B i ) i = 1 m P(B k  A) ———————————————— = P[(B 1  A)  (B 2  A)  …  (B m  A)] P(B k  A) —————— =  P(B i  A) i = 1 m

1. (a) Boxes of a certain type of cereal are produced at three factories, one located at Limesville, one at Middletown, and one at Transburg; these factories respectively are responsible for 20%, 30%, and 50% of the total production. Among the boxes of cereal produced at Limesville, 5% are underweight; among those produced at Middletown, 2% are underweight; among those produced at Transburg, 1% are underweight. Suppose one box of cereal is to be randomly selected among the total production, and the following events are defined: L = one randomly selected box comes from Limesville M = one randomly selected box comes from Middletown T = one randomly selected box comes from Transburg U = one randomly selected box is underweight Find each of the probabilities listed, observe that L, M, T form a partition of the sample space, and complete the Venn diagram to display the events L, M, T, and U.

TML U P(L) =P(M) =P(T) = P(U | L) =P(U | M) =P(U | T) = (b)Find the probability that the randomly selected box is underweight. P(U) = P((U  L)  (U  M)  (U  T)) = P(U  L) + P(U  M) + P(U  T) = P(L) P(U | L) + P(M) P(U | M) + P(T) P(U | T) = (0.2)(0.05) + (0.3)(0.02) + (0.5)(0.01) =0.021

(c) (d) (e) Find the probability that the randomly selected box is from the Limesville factory given that it is underweight. Find the probability that the randomly selected box is from the Middletown factory given that it is underweight. Find the probability that the randomly selected box is from the Transburg factory given that it is underweight. P(L | U) = P(L  U) ———— = P(U) (0.2)(0.05) ———— = — 21 P(M | U) = P(M  U) ———— = P(U) (0.3)(0.02) ———— = — = 21 2 — 7 P(T | U) = P(T  U) ———— = P(U) (0.5)(0.01) ———— = — 21

2. (a) The player in a particular lottery chooses five distinct integers from 1 to 20, which are then printed on a lottery ticket. Friday at 6:00pm, five distinct integers from 1 to 20 are randomly selected, and any ticket which matches at least four of these five integers (in any order) is a winning ticket. Sam buys one ticket with the integers 3, 4, 7, 8, 13. What is the probability that Sam has a winning ticket? = —— =

(b) Sally buys two tickets, one with the integers 3, 4, 7, 8, 13 and one with the integers 1, 5, 9, 15, 18. What is the probability that Sally has a winning ticket? 2 = —— =

(c)George buys two tickets, one with the integers 3, 4, 7, 8, 13 and one with the integers 3, 4, 7, 14, 20. What is the probability that George has a winning ticket? – =

(d) 3. Linda buys two tickets, one with the integers 3, 4, 7, 8, 13 and one with the integers 3, 4, 7, 8, 13. What is the probability that Linda has a winning ticket? Consider a lottery where a player chooses m distinct integers from 1 to n, where m < 2n, on a lottery ticket. In order for the player to win, at least k, where m/2 < k < m, of the m integers on the ticket must match (in any order) m randomly selected integers. Suppose a player buys two lottery tickets, where exactly s of integers are the same on both tickets. What is the probability that the player has a winning ticket if s = 0, and how large can s be without changing this probability? 1 = —— =

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 10. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 9. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 8. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 7. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 6. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. (k  1)+(k  s) = k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 5. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. (k  2)+(k  s) = k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 4. Ticket #1: Ticket #2: Both tickets can be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. (k  3)+(k  s) = k = 7 of the m = 10 winning numbers can be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 3. Ticket #1: Ticket #2: Both tickets cannot be winners. k = 7 of the m = 10 winning numbers can be on ticket #1. (k  4)+(k  s) = k = 7 of the m = 10 winning numbers can NOT be on ticket #2.

If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0 Suppose n > 20, m = 10, k = 7, s = 3. Ticket #1: Ticket #2: Both tickets cannot be winners. k + (k – s)  m

This probability stays the same as long as the tickets cannot both be winners. It is possible for both tickets to be winners if 2k – s  m but not if 2k – s > m. Consequently, in order for the probability to stay the same, we must have s s  2k – m – 1. If s = 0, then both tickets cannot be winners, and the probability of one winning ticket is n m n m m k m k n–mm–kn–mm–k + n m n m 2 m k+1 n–m m–k–1 + … + n m n m m m m m n–m 0