HW MATH425/525 Lecture Notes 1

Similar documents
At least 8/9 of th measurements lie in the interval

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1

1 Probability Theory. 1.1 Introduction

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

Probability and Statistics Notes

Chapter 5 : Probability. Exercise Sheet. SHilal. 1 P a g e

Statistical Theory 1

Probabilistic models

4. Probability of an event A for equally likely outcomes:

Compound Events. The event E = E c (the complement of E) is the event consisting of those outcomes which are not in E.

CMPSCI 240: Reasoning about Uncertainty

(6, 1), (5, 2), (4, 3), (3, 4), (2, 5), (1, 6)

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Probabilistic models

F71SM STATISTICAL METHODS

Math 1313 Experiments, Events and Sample Spaces

MAT2377. Ali Karimnezhad. Version September 9, Ali Karimnezhad

2.6 Tools for Counting sample points

Probability- describes the pattern of chance outcomes

Econ 325: Introduction to Empirical Economics

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space

Lecture 2: Probability, conditional probability, and independence

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head}

Probability Theory Review

Lecture 1. ABC of Probability

Axioms of Probability

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes

Presentation on Theo e ry r y o f P r P o r bab a il i i l t i y

Chapter 2 PROBABILITY SAMPLE SPACE

Mutually Exclusive Events

Basic Statistics and Probability Chapter 3: Probability

Event A: at least one tail observed A:

Review Counting Principles Theorems Examples. John Venn. Arthur Berg Counting Rules 2/ 21

Dept. of Linguistics, Indiana University Fall 2015

STAT 111 Recitation 1

Chapter 6: Probability The Study of Randomness

1 INFO Sep 05

STAT 430/510 Probability

Week 2. Section Texas A& M University. Department of Mathematics Texas A& M University, College Station 22 January-24 January 2019

Probability 5-4 The Multiplication Rules and Conditional Probability

Chapter 8 Sequences, Series, and Probability

Name: Exam 2 Solutions. March 13, 2017

Carleton University. Final Examination Winter DURATION: 2 HOURS No. of students: 152

Lecture notes for probability. Math 124

Origins of Probability Theory

MA : Introductory Probability

Announcements. Topics: To Do:

Probability the chance that an uncertain event will occur (always between 0 and 1)

Chapter 3 : Conditional Probability and Independence

The probability of an event is viewed as a numerical measure of the chance that the event will occur.

Probability and Sample space

Probability, Random Processes and Inference

Probability 1 (MATH 11300) lecture slides

Independence Solutions STAT-UB.0103 Statistics for Business Control and Regression Models

The possible experimental outcomes: 1, 2, 3, 4, 5, 6 (Experimental outcomes are also known as sample points)

Probability deals with modeling of random phenomena (phenomena or experiments whose outcomes may vary)

Math 243 Section 3.1 Introduction to Probability Lab

Properties of Probability

Intro to Stats Lecture 11

Topic 2 Probability. Basic probability Conditional probability and independence Bayes rule Basic reliability

Intermediate Math Circles November 8, 2017 Probability II

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

Statistical Inference

Chapter 2: Probability Part 1

1 The Basic Counting Principles

Math 511 Exam #1. Show All Work No Calculators

CIVL Why are we studying probability and statistics? Learning Objectives. Basic Laws and Axioms of Probability

MA : Introductory Probability

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

Combinatorics and probability

Exam III Review Math-132 (Sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3)

BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES

STAT Chapter 3: Probability

Problems and results for the ninth week Mathematics A3 for Civil Engineering students

Fall Math 140 Week-in-Review #5 courtesy: Kendra Kilmer (covering Sections 3.4 and 4.1) Section 3.4

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 2. (a) (b) (c) (d) (e) (a) (b) (c) (d) (e) 4. (a) (b) (c) (d) (e)...

Probability Rules. MATH 130, Elements of Statistics I. J. Robert Buchanan. Fall Department of Mathematics

Theoretical Probability (pp. 1 of 6)

Term Definition Example Random Phenomena

University of Technology, Building and Construction Engineering Department (Undergraduate study) PROBABILITY THEORY

STA 2023 EXAM-2 Practice Problems. Ven Mudunuru. From Chapters 4, 5, & Partly 6. With SOLUTIONS

MATH 556: PROBABILITY PRIMER

STAT:5100 (22S:193) Statistical Inference I

Lecture 8: Probability

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15. Lecture 2: Random Experiments. Prof. Vince Calhoun

5.3 Conditional Probability and Independence

7.1 What is it and why should we care?

Probabilities and Expectations

UNIT 5 ~ Probability: What Are the Chances? 1

Chapter 3 Conditional Probability and Independence. Wen-Guey Tzeng Computer Science Department National Chiao Tung University

the time it takes until a radioactive substance undergoes a decay

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Math Exam 1 Review. NOTE: For reviews of the other sections on Exam 1, refer to the first page of WIR #1 and #2.

Section 13.3 Probability

Chapter 4 Probability

UNIT Explain about the partition of a sampling space theorem?

Example: Suppose we toss a quarter and observe whether it falls heads or tails, recording the result as 1 for heads and 0 for tails.

Chapter 2 Class Notes

Probability COMP 245 STATISTICS. Dr N A Heard. 1 Sample Spaces and Events Sample Spaces Events Combinations of Events...

Transcription:

HW MATH425/525 Lecture Notes 1 Definition 4.1 If an experiment can be repeated under the same condition, its outcome cannot be predicted with certainty, and the collection of its every possible outcome can be described prior to its performance, this kind of experiment is called random experiment. All the possible outcomes of a random experiment is denoted by Ω which is called sample space. A subset of Ω is called an event. An event cannot be decomposed is called a simple event. Two events are mutually exclusive if there are no intersections. Example 4.1 Experiment: Roll a fair die on a hard, flat floor and observe the number appearing on the upper face. Is this a random experiment? If yes, what is the sample space? Define E i = {Observe a i}, i = 1,, 6, A = {Observe an odd number}, and B = {Observe a number less than or equal to 4}. Is A an event? Is A a simple event? Do A and B be mutually exclusive? Classical Probability Definition 4.2 Given a sample space Ω = {E 1, E 2,, E n } with finite simple events, if we define a function P on Ω by: (1)The empty set is denoted by φ. P(φ) = 0. (2) P(E i ) = 1/n for each 1 i n. This means that each simple event is equally likely.

HW MATH425/525 Lecture Notes 2 (3) For each event A, P(A) is equal to the sum of the probabilities of simple events contained in A. Then, P is called a classical probability on Ω. Remark: (1) 0 P(A) 1. (2) P(Ω) = 1. A more general definition of probability will be introduced later on. Example 4.2 Consider the random experiment and events defined in Example 4.1, where A = {Observe an odd number}, and B = {Observe a number less than or equal to 4}. Find the classical probability of event A and B. P(A) = P(E 1 ) + P(E 3 ) + P(E 5 ) = 1/6 + 1/6 + 1/6 = 1/2 P(B) = P(E 1 )+P(E 2 )+P(E 3 )+P(E 4 ) = 1/6+1/6+1/6+1/6 = 2/3 Example 4.3 A jar contains four coins: a nickel, a dime, a quarter, and a half-dollar. Three coins are randomly selected from the jar. a. List all the simple events in the sample space Ω. b. This is a typical example of the classical probability. What is the probability that the selection will contain the half-dollar? c. What is the probability that the total amount drawn

HW MATH425/525 Lecture Notes 3 will equal 0.6 dollar or more? a. Denote: N: nickel; D: dime; Q: quarter; H: half-dollar. and E 1 = (NDQ),E 2 = (NDH), E 3 = (NQH), E 4 = (DQH). Then, Ω = {E 1, E 2, E 3, E 4 }. b. P(choose a half-dollar) = P(E 2 )+P(E 3 )+P(E 4 ) = 1 4 +1 4 +1 4 = 3 4 c. The simple event along with their monetary values follow: Hence, E 1 = NDQ = $0.4 E 2 = NDH = $0.65 E 3 = NQH = $0.80 E 4 = DQH = $0.85 P(total amount is $0.6 or more) = P(E 2 )+P(E 3 )+P(E 4 ) = 3 4. The mn Rule Consider an experiment that is performed in two stages. If the first stage can be accomplished in m different

HW MATH425/525 Lecture Notes 4 ways and for each of these ways, the second stage can be accomplished in n different ways, then there are total mn different ways to accomplish the experiment. Example 4.4 A driver wants to go from city A to B, then to c. If from A to B there 5 different ways and B to C there 6 different ways. Totally are there how many different ways from A to C? By mn rule, there are 30 different ways. The Extended mn Rule Consider an experiment that is performed in k stages. If the first stage can be accomplished in n 1 different ways and for each of these ways, the second stage can be accomplished in n 2 different ways,, and the k stage can be accomplished in n k different ways, then there are total n 1 n 2 n k different ways to accomplish the experiment. Example 4.5 There are 10 people stand in a line to take a photo. Two photos are said different if at least two people s positions are changed. How many different photos can we take? There are 10 different ways to choose a person to stand on the first position; After taking out the first person,

HW MATH425/525 Lecture Notes 5 we only have 9 remaining people. Then, there are 9 different ways to choose a person to stand on the second position; and so on. By the extended mn rule totally we can take 10 9 1 = 3628800 different photos. Example 4.6 Suppose that a family will certainly have 5 children, but each child being a boy or girl is totally uncertain with equal probability. How many simple events in the sample space? What are the probabilities of the following events: a. A = {Last baby is a boy}. b. B = {The first and the second are girls}. In this question, order is important. Consider that there are five positions in a line. Each position has two choices:boy or girl. By extended mn rule, the total number of simple events in the sample space is equal to 2 5 = 32. a. The last baby is a boy, then the last position is occupied and the first four positions have options. A has 2 4 different simple events. Therefore, the P(A) = 2 4 /2 5 = 1/2. b. The first and second are girls, then the first and second positions are occupied and the remaining three positions have options. B has 2 3 different simple events. Therefore, the P(B) = 2 3 /2 5 = 1/4.

HW MATH425/525 Lecture Notes 6 Example 4.7 There are 10 people and 50 big rooms. Suppose that each person has equal probability 1/50 to go to any one of the 50 rooms. Let A={for 10 specified rooms, each of these 10 rooms has exactly one person }. Find out the probability of event A. By extended mn rule, the number of simple events in the sample space is 50 10. If we denote n! = n (n 1) 1, by the extended mn rule, the number of simple events in A is equal to 10!. Therefore, P(A) = 10!/(50 10 ) Definition 4.3 A permutation of n different objects is an ordering arrangement of this n objects. Counting Rule for Permutations I The number of ways we can arrange n distinct objects is P n n = n!. Proof: This is equivalent to the photo problem that there are n positions in a line and n different people. Two photos are counted as different if at least two people s positions are different in the photos. How many different photos can we take? The first position can be occupied by one of n people. The second position can be occu-

HW MATH425/525 Lecture Notes 7 pied by remaining n 1 people,, the last position only can be occupied by the last person. Therefore, totally it is n (n 1), 1 = n!. Counting Rule for Permutations II The number of ways we can arrange n distinct objects, taking them r at a time, is = n!/(n r)!. P n r Proof: This is equivalent to the photo problem that there are r positions in a line and n different people. Two photos are counted as different if at least two people s positions or two people are different in the photos. How many different photos can we take? The first position can be occupied by one of n people. The second position can be occupied by remaining n 1 people,, the last position, r th position, can be occupied by one of remaining n (r 1) people. Therefore, by extended mn rule, totally it is n (n 1), n (r 1) = n (n 1) (n r + 1) n (n 1) (n r) (n r 1) 1 = (n r) (n r 1) 1 = n!/(n r)! Example 4.8 There are three letters A, B, C. How many different ordered, two letter alphabets can we get?

HW MATH425/525 Lecture Notes 8 AB AC BC BA CA CB According to the permutation counting formula P 3 2 = 3! (3 2)! = 3! 1! = 6 Example 4.9 There are 26 letters A, B, C,, X, Y, Z. How many different ordered, five letter alphabets can we get? According to the permutation counting formula P 26 5 = 26! (26 5)! = 7893600 A more general definition of probability is as follows. Definition 4.4 Given a sample space Ω = {E 1, E 2,, E n } with n simple events, where n is finite or infinite. if we define a function P on Ω by: (1)The empty set is denoted by φ. P(φ) = 0. (2) For each simple event E i, its probability P(E i ) is defined and 0 P(E i ) 1. Thus, equally likely is a special case of this definition. (3) For each event A, P(A) is equal to the sum of the probabilities of simple events contained in A. Then, P is called a probability on Ω.

HW MATH425/525 Lecture Notes 9 Example 4.10 In a pocket there are 3 black and 2 white balls. Balls are identical except their colors. Randomly drawing a ball and observing its color. How many simple events in the sample space? Can you define a reasonable probability on the sample space? Is this equally likely? Ω = {W, B} P(W ) = 2 5, P(B) = 3 5. Definition 5.1 A combination is an order ignored selection of objects from a larger group of objects. We know that the number of different permutations of r different objects is P r r = r!. The Pr n can be thought as the multiplication of two numbers: (1) number of ways to select r different objects from n different objects. We denote this number by Cr n (2) number of ways to get different arrangements for each selected r objects. This is just Pr r. Therefore, or P n r = C n r P r r C n r = P n r /P r r = n! r!(n r)!

HW MATH425/525 Lecture Notes 10 Counting Rule for Combination The number of different combinations of n different objects that can be formed, taking them r at a time, is C n r = n! r!(n r)! Example 5.1 A student prepares for a quiz by studying a list of ten problems. She only can solve six of them. For the quiz, the instructor selects five questions at random from the list of ten. What is the probability of event A that the student can solve all five problems on the exam? The number of simple events in the sample space is C5 10 10! = 5!(10 5)!. The event A that the student can solve all five problems can be described in the way that the five problems are selected from the six problems she learned. Thus, the number of simple events in the event A is and C 6 5 = 6! 5!(6 5)! P(A) = C6 5 C5 10 Example 5.2 We want to choose 5 people from 20 people to organize a traveling group. Are there how many

HW MATH425/525 Lecture Notes 11 different ways to choose a group? In this example order is not important, therefore, there are C 20 5. Example 5.3 Suppose that 10 defective computers are included in a shipment of 1000 computers.if you test 20 computers in this 1000 computers, what is the probability of event A that you found two defective computers? P(A) = C10 2 C18 990 C20 1000 Definition 5.2 The intersection of events A and B, denoted by A B, is all the simple events belonging to both A and B. The union of events A and B, denoted by A B, is all the simple events belonging to either A or B. The complement of event A, denoted by A c, is all the simple events belonging to sample space Ω but A. Example 5.4 Consider the random experiment of rolling a fair die. Define A = {E 1, E 2, E 3, E 4 }, B = {E 1, E 3, E 5 } What are A B, A B, and A c? A more general definition of probability is defined as follows: Definition 5.3 Given a sample space Ω, if we define a function P on Ω by: (1)The empty set is denoted by φ. P(φ) = 0. (2) For a sequence of mutually exclusive events A i, let.

HW MATH425/525 Lecture Notes 12 A = i=1 A i, then P(A) = P(A i ). (3) For each event B, 0 P(B) 1 and P(Ω) = 1. Then, P is called a probability on Ω. i=1 Example 5.5 Roll a fair die. Define E i = { Observe a i }, A = { Observe an odd number}, and B = { Observe a number less or equal to 4}. Find the probabilities P(A B), P(A B), and P(A c ). P(A B) = P(E 1 ) + P(E 2 ) + P(E 3 ) + P(E 4 ) + P(E 5 ) = 5 6 P(A B) = P(E 1 ) + P(E 3 ) = 2 6 P(A c ) = P(E 2 ) + P(E 4 ) + P(E 6 ) = 3 6 Example 5.6 Consider an experiment of flipping a coin as many times as necessary until a head turns up. Define a probability on the sample space. Define A = { The time to first time observe a head is bigger than one}. Find P(A). Let E i be the event of first time observing a head at i th flipping. Then, Ω = {E 1, E 2, }. Define P(E i ) = 1 2 i

HW MATH425/525 Lecture Notes 13 Then, P(Ω) = i=1 P(E i) = i=1 1 = 1. If we define that 2 i for any given event A, P(A) is equal to the sum of the probabilities of the simple events in A. Then, P is a probability on Ω. P(A) = 1 P(A c ) = 1 P(E 1 ) = 1 1 2 = 1 2. Probability of an event A is a number to indicate how big the occurring possibility of event A. Sometimes given an event, say B, occurs, it can affect the occurring probability of another event A. Example 5.7 Consider an experiment of rolling a fair die. Define the typical classical probability on the sample space. Define A = { Observe a number less or equal to 3}. If we already knew that A occurred, then what is P(E 1 ). If we denote that the probability of E 1, given that A has occurred by P(E 1 A). Then P(E 1 A) = 1 3 Definition 5.4 The conditional probability of an event A, given that event B has occurred, is P(A B) = P(A B)) P(B) if P(B) 0 The conditional probability of an event B, given that event A has occurred, is P(B A) = P(A B)) P(A) if P(A) 0

HW MATH425/525 Lecture Notes 14 Definition 5.5 Two events A and B are said to be independent if and only if or P(A B) = P(A) P(B A) = P(B). Otherwise, the two events are said to be dependent. Example 5.8 Consider an experiment of rolling two fair dice. Define the typical classical probability on the sample space. {(E 1, E 1 ), (E 1, E 2 ),, (E 6, E 6 )} Define A = { Observe 1 on the first die}. Define B = { Observe 2 on the second die}. Events A and B are independent? First, and P(A) = P((E 1, E 1 )) + P((E 1, E 2 )) + P((E 1, E 3 ))+ P((E 1, E 4 )) + P((E 1, E 5 )) + P((E 1, E 6 )) = 6 36. P(B) = P((E 1, E 2 )) + P((E 2, E 2 )) + P((E 3, E 2 ))+ Second, P((E 4, E 2 )) + P((E 5, E 2 )) + P((E 6, E 2 )) = 6 36. P(A B) = P((E 1, E 2 )) = 1 36.

HW MATH425/525 Lecture Notes 15 Therefore, P(A B) = P(A B) P(B) = P(A) = 1/36 6/36 = 1 6 Additive Rule of Probability Given two events A and B, P(A B) = P(A) + P(B) P(A B) If A and B are mutually exclusive, then P(A B) = P(A) + P(B) Multiplicative Rule of Probability Given two events A and B, then P(A B) = P(A)P(B A) = P(B)P(A B). If A and B are independent,then P(A B) = P(A)P(B). Similarly, if A, B, and C are independent (?), then P(A B C) = P(A)P(B)P(C). Remark: Events A, B, and C are independent if and

HW MATH425/525 Lecture Notes 16 only if P(A B) = P(A)P(B), P(A C) = P(A)P(C), P(B C) = P(B)P(C), P(A B C) = P(A)P(B)P(C) Example 5.9 Suppose that in a box there are 2 distinct, white balls and 3 distinct, black balls. We successively, randomly draw two balls with replacement. Define the typical classical probability on the sample space and define A = { first drawing is a white ball } and B = { Second drawing is a black ball }. Find P(A B) and P(A B). Does P(A B) = P(A)P(B) hold? How about changing the experiment into without replacement? The sample space is Ω = { (W 1, W 1 ), (W 1, W 2 ), (W 1, B 1 ),, (B 3, B 3 )} There are 5 5 = 25 simple events. Since P(A) = C2 1C 5 1 25, and P(B) = C5 1C 3 1 25, P(A B) = C2 1C 3 1 25,

HW MATH425/525 Lecture Notes 17 we have P(A B) = P(A) + P(B) P(A B) With replacement, = C2 1C 5 1 25 + C5 1C 3 1 25 C2 1C 3 1 25 P(A B) = 6 25 = 10 25 15 25 = P(A)P(B). = 19 25. If without replacement, Ω = {(W 1, W 2 ),, } There are 5 4 = 20 simple events. Since P(A) = C2 1C 4 1 20, and therefore, P(B) = C2 1C 3 1 + C 3 1C 2 1 20 P(A B) = C2 1C 3 1 20, P(A B) = 6 20 6 25 = 8 20 12 20 = P(A)P(B).,