Math , Fall 2012: HW 5 Solutions

Similar documents
HW2 Solutions, for MATH441, STAT461, STAT561, due September 9th

Exam 1 Review With Solutions Instructor: Brian Powers

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

Properties of Probability

1. Consider a random independent sample of size 712 from a distribution with the following pdf. c 1+x. f(x) =

Math 493 Final Exam December 01

If S = {O 1, O 2,, O n }, where O i is the i th elementary outcome, and p i is the probability of the i th elementary outcome, then

CHAPTER 3 PROBABILITY TOPICS

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

First Digit Tally Marks Final Count

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

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

Chapter 2.5 Random Variables and Probability The Modern View (cont.)

Chapter 7: Section 7-1 Probability Theory and Counting Principles

Intermediate Math Circles November 8, 2017 Probability II

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Probability: Sets, Sample Spaces, Events

Computations - Show all your work. (30 pts)

What is Probability? Probability. Sample Spaces and Events. Simple Event

Conditional Probability (cont'd)

Introduction to Probability, Fall 2009

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS

= 2 5 Note how we need to be somewhat careful with how we define the total number of outcomes in b) and d). We will return to this later.

CSC Discrete Math I, Spring Discrete Probability

Math Fall 2010 Some Old Math 302 Exams There is always a danger when distributing old exams for a class that students will rely on them

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

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018

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

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

Problem # Number of points 1 /20 2 /20 3 /20 4 /20 5 /20 6 /20 7 /20 8 /20 Total /150

Lecture notes for probability. Math 124

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

Deep Learning for Computer Vision

UNIT 5 ~ Probability: What Are the Chances? 1

CS 361: Probability & Statistics

What is a random variable

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

Probability & Random Variables

Probability Long-Term Memory Review Review 1

3.2 Probability Rules

STAT 414: Introduction to Probability Theory

2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.

Exam 1 Solutions. Problem Points Score Total 145

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

Chapter 3 : Conditional Probability and Independence

Name: Exam 2 Solutions. March 13, 2017

STAT 418: Probability and Stochastic Processes

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006

Econ 113. Lecture Module 2

Lecture 8: Probability

Basic Concepts of Probability

Probability Theory Review

HW MATH425/525 Lecture Notes 1

Random Signals and Systems. Chapter 1. Jitendra K Tugnait. Department of Electrical & Computer Engineering. James B Davis Professor.

STAT 516 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS. = {(a 1, a 2,...) : a i < 6 for all i}

Outline Conditional Probability The Law of Total Probability and Bayes Theorem Independent Events. Week 4 Classical Probability, Part II

CSE 312: Foundations of Computing II Quiz Section #10: Review Questions for Final Exam (solutions)

SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416)

Math 1313 Experiments, Events and Sample Spaces

1 Combinatorial Analysis

Lecture 10. Variance and standard deviation

MATH 3670 First Midterm February 17, No books or notes. No cellphone or wireless devices. Write clearly and show your work for every answer.

Chapter 6: Probability The Study of Randomness

Elementary Discrete Probability

2.6 Tools for Counting sample points

Name: 180A MIDTERM 2. (x + n)/2

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}

1 Preliminaries Sample Space and Events Interpretation of Probability... 13

MATH 556: PROBABILITY PRIMER

A birthday in St. Petersburg

PRACTICE PROBLEMS FOR EXAM 1

Probabilistic models

Axioms of Probability. Set Theory. M. Bremer. Math Spring 2018

Lecture 2: Probability. Readings: Sections Statistical Inference: drawing conclusions about the population based on a sample

EXAM. Exam #1. Math 3342 Summer II, July 21, 2000 ANSWERS

MATH STUDENT BOOK. 12th Grade Unit 9

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin,

Topics in Discrete Mathematics

The Geometric Distribution

Class 26: review for final exam 18.05, Spring 2014

MATH MW Elementary Probability Course Notes Part I: Models and Counting

Slide 1 Math 1520, Lecture 21

Conditional Probability

Math 122L. Additional Homework Problems. Prepared by Sarah Schott

PRACTICE PROBLEMS FOR EXAM 2

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss

Lectures Conditional Probability and Independence

Random Variables and Events

A brief review of basics of probabilities

n(1 p i ) n 1 p i = 1 3 i=1 E(X i p = p i )P(p = p i ) = 1 3 p i = n 3 (p 1 + p 2 + p 3 ). p i i=1 P(X i = 1 p = p i )P(p = p i ) = p1+p2+p3

Formalizing Probability. Choosing the Sample Space. Probability Measures

Lesson One Hundred and Sixty-One Normal Distribution for some Resolution

Exam 1 - Math Solutions

MA 250 Probability and Statistics. Nazar Khan PUCIT Lecture 15

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

Probability Year 9. Terminology

Chance, too, which seems to rush along with slack reins, is bridled and governed by law (Boethius, ).

Transcription:

Math 230.0, Fall 202: HW 5 Solutions Due Thursday, October 4th, 202. Problem (p.58 #2). Let X and Y be the numbers obtained in two draws at random from a box containing four tickets labeled, 2, 3, 4. Display the joint distribution table for X and Y : a) for sampling with replacement; b) for sampling without replacement; c) calculate P (X Y ) in both cases. SOLUTION. In sampling with replacement, every pair of numbers is equally likely, so we have P (X i, Y j) 4 4 6 for i, j {, 2, 3, 4} And P (X Y ) 0 6 ( + 2 + 3 + 4) 6. In sampling without replacement, we know X and Y can never be equal, and we have P (X i, Y j) 4 3 for i j and i, j {, 2, 3, 4} 2 P (X i, Y i) 0 for i {, 2, 3, 4} In this case, P (X Y ) P (X < Y ) 2. This can be found either by computing, or by reasoning as follows: P (X < Y ) P (X > Y ) by symmetry, and since P (X Y ) 0, P (X < Y ) + P (X > Y ) so 2P (X < Y ). Problem 2 (p.59 #4). Let X and X 2 be the numbers obtained on two rolls of a fair die. Let Y max{x, X 2 }, Y 2 min{x, X 2 }. Display joint distribution tables for a) the pair (X, X 2 ); b) the pair (Y, Y 2 ). Since X and X 2 are independent, we know that for any pair of integers (i, j) where i 6, j 6, P (X i, X 2 j) P (X i) P (X 2 j) 36 We also know that the minimum of (X, X 2 ) cannot be greater than the maximum of (X, X 2 ), so P (Y i, Y 2 j) 0 for j > i P (Y i, Y 2 i) 36 P (Y i, Y 2 j) 2 36 for i > j Problem 3 (p.59 #7). Let A, B, and C be events that are independent, with probabilities a, b, and c, respectively. Let N be the random number of events that occur. a) Express the event (N 2) in terms of the events A, B, and C.

b) Find P (N 2). SOLUTION. The event N 2 is the union of the following events {N 2} [A B C c ] [A C B c ] [B C A c ] and these are mutually exclusive. Also, since A, B, C are mutually independent, we have So we have P (N 2) ab + ac + bc 3abc. P (ABC c ) P (A)P (B)P (C c ) ab( c) P (AB c C) P (A)P (B c )P (C) a( b)c P (A c BC) P (A c )P (B)P (C) ( a)bc Problem 4 (p.82 #4). Suppose all the numbers in a list of 00 numbers are nonnegative, and that the average of the numbers in the list is 2. Prove that at most 25 of the numbers in the list are greater than 8. SOLUTION. We use Markov s inequality. We know E[X] 2. Hence Let X be a number drawn at random from the list. P (X > 8) E[X] 8 4 so at most /4 of the 00 numbers, i.e. 25 of the numbers in the list, can be bigger than 8. Problem 5 (p.82 #6). Let X be the number of spades in 7 cards dealt from a well-shuffled deck of 52 cards containing 3 spades. Find E[X]. SOLUTION. The probability distribution of X, P (X i), where i is an integer between 0 and 3, can be computed using the hypergeometric distribution: ) P (X i) ( 3 i )( 39 3 i ( 52 ) 3 3 E[X] ip (X i) i0 Alternatively, one can solve this with the method of indicator functions: let be the indicator function of the event A j {jth card is a spade}. Note that P (A j ) 3 52. If you are concerned about the fact that, say, the probability of the second card being a spade depends on the previous card, observe that you can condition: P (A 2 ) P (A 2 A )P (A ) + P (A 2 A c )P (A c ) 2 3 5 52 + 3 39 5 52 3 52 2

Now, if X is the total number of spades in the hand, X E(X) E E[ ] 3 52 7 4 Problem 6 (p.82 #7). In a circuit containing n switches, the ith switch is closed with probability p i, i,, n. Let X be the total number of switches that are closed. Is it possible to calculate E[X] without further assumptions? If so, what is E[X]? SOLUTION. It is not possible to know the probability distribution of X without further assumptions. However, we can still compute the expected value of X by using the method of indicator functions. Let A i {Switch i is closed}. Let I Ai be the indicator function of A i, so I Ai if switch i is closed, and 0 if switch i is open. We note that X i because X is simply the total number of switches that are closed. Hence by the addition rule for expectation, [ n ] E[X] E I Ai i E[I Ai ] i I Ai [P (A i ) + 0P (A c i)] i P (A i ) i Problem 7 (p.82#0). Let A and B be independent events, with indicator random variables I A and I B. a) Describe the distribution of the random variable (I A + I B ) 2 in terms of P (A) and P (B). b) What is E [ (I A + I B ) 2]? SOLUTION. Observe that I A + I B 0 if neither A nor B occurs, i.e. on A c B c ; I A + I B if only one of either A or B occur; i.e. on (B A c ) (A B c ); I A + I B 2 if both A and B occur, i.e., on A B 3

Since A and B are independent, so are A and B c and B and A c (this was on Exam ), and therefore the distribution of the function (I A + I B ) 2 is P ( (I A + I B ) 2 0 ) ( P (A))( P (B)) P ( (I A + I B ) 2 ) P (B)( P (A)) + P (A)( P (B)) P ( (I A + I B ) 2 4 ) P (A)P (B) One can compute E [ (I A + I B ) 2] using the above distribution: E [ (I A + I B ) 2] [P (B)( P (A)) + P (A)( P (B))] + 4 P (A)P (B) + 0 ( P (A))( P (B)) [P (B)( P (A)) + P (A)( P (B))] + 4 P (A)P (B) Problem 8 (p. 83 #4). A building has ten floors above the basement. If 2 people get into an elevator at the basement, and each chooses a floor at random to get out, independently of the others, at how many floors do you expect the elevator to stop to let out one or more of these 2 people? SOLUTION. Let X the number of floors at which at least one person wants to get out. We want to find E(X). However, computing P (X x) for x, 2,, 0 is difficult. However, we don t need the distribution of X; instead, let if at least one person wants to get out at floor j, and 0 otherwise 0 X The expected value of an indicator function is the probability of the set on which the indicator is. 0 E(X) E 0 E[ ] [ 0 ( ) ] 2 9 0 Problem 9 (p. 83, #8). Suppose X is a random variable with just two possible values a and b. For x a and x b, find a formula for p(x) P (X x) in terms of a, b, and µ E[X]. SOLUTION. Since X has two possible values, X a or X b, we know Therefore P (X a) + P (X b). E(X) ap (X a) + bp (X b) µ ap (X a) + b( P (X a)) P (X a) µ b a b and from this P (X b) is immediate. 4

Problem 0 (p.84 #2). Let I A be the indicator of an event A. Show that a) I A c I A ; SOLUTION. The function I A 0 if A occurs and I A if A does not occur; this is the exactly the indicator function of A c. b) I AB I A I B ; SOLUTION. Observe that I AB if and only if both A and B occur, and 0 otherwise. Now I A is if only if A occurs and 0 otherwise, and I B is if and only if B occurs, and 0 otherwise. Therefore the product I A I B is if and only if both A and B occur, and 0 otherwise; that is, I AB I A I B. c) For any collection of events A, A n, the indicator of their union is SOLUTION. Note that I Ai ( I A )( I A2 ) ( I An ). [ n ia i ] c n ia c i From the previous parts, we know that I A c i I Ai, and So I [ n i A i] c I [ n i Ac i] I [ n i A c i] I A c I A c 2 I A c n. I A c I A c 2 I A c n I Ai I [ n i A i] c [ ] I A c I A c 2 I A c n ( I A )( I A2 ) ( I An ) d) Expand the product in the last formula and use the rules of expectation to derive the inclusion exclusion formula. SOLUTION. This is simple algebra and an application of the fact that the expected value of I A is P (A). Problem (St Petersburg Paradox). Suppose you have the opportunity to play the following game. You flip a coin, and if it comes up heads on the first flip, then you win $. If not, then you flip again. If it comes up heads on the second flip, then you win $2, and if not you flip again. On the third flip, a heads pays $4, on the fourth $8, and so on. That is, each time you get tails, you flip again and your prize doubles, and you get paid the first time you flip heads. a) How much should you be willing to pay to play this amazing game? In other words, compute the expected payout from playing this game. 5

SOLUTION: Let X be the payout from this game. E(X) 2 k P (first head is on k th flip) k ( 2 k 2 k k 2 According to this, you should be willing to pay any amount to play this game! b) Now suppose the casino (or wherever you re playing this game) has a limited bankroll of $2 n. So, if you get tails n times in a row, then the game is over automatically and you are paid $2 n. Now what is the expected payout? How much should you pay to play the game if n 0? SOLUTION: E(X) ) k 2 k P (first head is on k th flip) + 2 n P (n tails in a row) k k n + 2 2 The expected payout is $6. 2 + 6