Math 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =

Similar documents
Math 151. Rumbos Spring Solutions to Review Problems for Exam 1

MATH Solutions to Probability Exercises

Math 151. Rumbos Spring Solutions to Review Problems for Exam 3

Math 151. Rumbos Spring Solutions to Review Problems for Exam 2

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

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

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

Machine Learning: Homework Assignment 2 Solutions

Review of Probability. CS1538: Introduction to Simulations

X = X X n, + X 2

Random variables (discrete)

Midterm Exam 1 Solution

Name: Firas Rassoul-Agha

Probability & Statistics - FALL 2008 FINAL EXAM

HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, , , (extra credit) A fashionable country club has 100 members, 30 of whom are

Random Variables. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Expected Value 7/7/2006

Statistics and Econometrics I

Math 151. Rumbos Fall Solutions to Review Problems for Final Exam

Probability. Lecture Notes. Adolfo J. Rumbos

Math 510 midterm 3 answers

STAT 430/510 Probability Lecture 7: Random Variable and Expectation

STAT 414: Introduction to Probability Theory

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1

1 Random Variable: Topics

Lecture 2: Repetition of probability theory and statistics

Statistics for Economists Lectures 6 & 7. Asrat Temesgen Stockholm University

Question Points Score Total: 76

MAT 271E Probability and Statistics

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

Some Basic Concepts of Probability and Information Theory: Pt. 2

Math 493 Final Exam December 01

Data Analysis and Monte Carlo Methods

Review of Probability Theory

What is a random variable

COMP 2804 Assignment 4

Probability theory for Networks (Part 1) CS 249B: Science of Networks Week 02: Monday, 02/04/08 Daniel Bilar Wellesley College Spring 2008

Homework 4 Solution, due July 23

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

Probability Theory. Introduction to Probability Theory. Principles of Counting Examples. Principles of Counting. Probability spaces.

Math 447. Introduction to Probability and Statistics I. Fall 1998.

A Probability Primer. A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes.

MATHEMATICS 154, SPRING 2009 PROBABILITY THEORY Outline #11 (Tail-Sum Theorem, Conditional distribution and expectation)

Lecture 3. Discrete Random Variables

Topic 3 Random variables, expectation, and variance, II

Relationship between probability set function and random variable - 2 -

Probability Theory and Simulation Methods

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

CSE 312: Foundations of Computing II Random Variables, Linearity of Expectation 4 Solutions

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

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

Math 180B Problem Set 3

CSC Discrete Math I, Spring Discrete Probability

Week 12-13: Discrete Probability

Analysis of Engineering and Scientific Data. Semester

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015.

1 Basic continuous random variable problems

Math 105 Course Outline

MATH Notebook 5 Fall 2018/2019

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 20

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables

MATH 151, FINAL EXAM Winter Quarter, 21 March, 2014

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 2

Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan

Polytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009

18.05 Practice Final Exam

MAS108 Probability I

Tutorial 1 : Probabilities

Algorithms for Uncertainty Quantification

STAT 418: Probability and Stochastic Processes

Quick Tour of Basic Probability Theory and Linear Algebra

Solutionbank S1 Edexcel AS and A Level Modular Mathematics

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages

Probability and random variables

STAT2201. Analysis of Engineering & Scientific Data. Unit 3

PRACTICE PROBLEMS FOR EXAM 2

Lecture 1: August 28

1 Basic continuous random variable problems

Part 3: Parametric Models

. Find E(V ) and var(v ).

Dept. of Linguistics, Indiana University Fall 2015

Discrete Random Variables

Recitation 2: Probability

MAT 271E Probability and Statistics

Exercises with solutions (Set D)

Math 151. Rumbos Fall Solutions to Review Problems for Final Exam

IE 4521 Midterm #1. Prof. John Gunnar Carlsson. March 2, 2010

Exam 1 Review With Solutions Instructor: Brian Powers

M378K In-Class Assignment #1

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

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

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

ECE302 Exam 2 Version A April 21, You must show ALL of your work for full credit. Please leave fractions as fractions, but simplify them, etc.

6.041/6.431 Fall 2010 Quiz 2 Solutions

Twelfth Problem Assignment

Chapter 2 Random Variables

Random Variables and Expectations

Exercises in Probability Theory Paul Jung MA 485/585-1C Fall 2015 based on material of Nikolai Chernov

Random Variables. Statistics 110. Summer Copyright c 2006 by Mark E. Irwin

Continuous Distributions

Transcription:

Math 5. Rumbos Fall 07 Solutions to Review Problems for Exam. A bowl contains 5 chips of the same size and shape. Two chips are red and the other three are blue. Draw three chips from the bowl at random, without replacement. Let X denote the number of blue chips in a drawing. (a) Give the pmf o. Solution: Possible values o are, and. Compute, using equal likelihood assumption and the fact that the sampling is done without replacement, ( ) ( ) Similarly and Pr(X ) Pr(X ) Pr(X ) ) 0. ( 5 ( ) ( ) ( ) 5 5, ( ) ( ) 0 ( ) 5 0. We then have that the pmf o is, if k ; 0, if k ; 5 p X (k), if k ; 0 () 0, elsewhere.

Math 5. Rumbos Fall 07 (b) Compute Pr(X > ). Solution: Use the definition of the pmf o in () to get Pr(X > ) Pr(X ) p X () 7 0, or 70%. (c) Compute E(X). Solution: Using the definition of the pmf o in (), we compute E(X) kp X (k) k or E(X).8. 8 0, 0 + 5 + 0. Let X have pmf given by p X (x) for x,, and p(x) 0 elsewhere. Give the pmf of Y X +. Solution: Note that the possible values for Y are, 5 and 7 Compute Pr(Y ) Pr(X + ) Pr(X ). Similarly, we get that Pr(Y 5) Pr(X ), and Thus, Pr(Y 7) Pr(X ). for k, 5, 7; p Y (k) 0 elsewhere.

Math 5. Rumbos Fall 07. A player simultaneously rolls a fair die and flips a fair coin. If the coin lands heads, she wins twice the value of the die roll (in dollars). If it lands tails, she wins half. Compute the expected earnings of the player. Solution: Let X denote the outcome of the die toss. Then X Discrete Uniform(6); so that, E(X).5. The earnings of the gain at a given toss are X, if coin flip yields head; X, if coin flip yields tail. Thus, the expected earnings is Pr(head) E(X) + Pr(tail) E or, using the linearity of expectation, ( ) X, E(X) + E (X) 5 E(X) 4.75. 4 4. A mode of a distribution of a random variable X is a value of x that maximizes the pdf or the pmf. If there is only one such value, it is called the mode of the distribution. Find the mode for each of the following distributions: ( ) x (a) p(x) for x,,,..., and p(x) 0 elsewhere. Solution: Note that p(x) is decreasing; so, p(x) is maximized when x. Thus, is the mode of the distribution o. x ( x), if 0 < x < ; (b) f(x) 0 elsewhere. Solution: Maximize the function f over [0, ]. Compute f (x) 4x( x) x x( x), so that f has a critical points at x 0 and x.

Math 5. Rumbos Fall 07 4 Since f(0) f() 0 and f(/) > 0, it follows that f takes on its maximum value on [0, ] at x. Thus, the mode of the distribution of X is x. 5. Let X have pdf (x) { x, if 0 < x < ; 0, elsewhere. Compute the probability that X is at least /4, given that X is at least /. Solution: We are asked to compute where Pr(X /4 X /) Pr(X /) Pr[(X /4) (X /)], () Pr(X /) / x / x dx 4, so that and Pr(X /) 4 ; () Pr[(X /4) (X /)] Pr(X /4) /4 x dx x /4 9 6, so that Pr[(X /4) (X /)] 7 6. (4)

Math 5. Rumbos Fall 07 5 Substituting (4) and () into () then yields Pr(X /4 X /) 7 6 4 7. 6. Let X have pdf (x) { x /9, if 0 < x < ; 0, elsewhere. Find the pdf of Y X. Solution: First, compute the cdf of Y, (y) Pr(Y y). (5) Observe that, since Y X and the possible values o range from 0 to, the possible values of Y will range from 0 to 7. Thus, in the calculations that follow, we will assume that 0 < y < 7. From (5) we get that Thus, for 0 < y < 7, we have that (y) Pr(X y) Pr(X y / ) F X (y / ) f Y (y) (y / ) y /, (6) where we have applied the Chain Rule. It follows from (6) and the definition of that f Y (y) [ ] y / 9 y /, for 0 < y < 7. (7) 7 Combining (7) and the definition of we obtain the pdf for Y :, for 0 < y < 7; 7 f Y (y) 0 elsewhere;

Math 5. Rumbos Fall 07 6 in other words, Y Uniform(0, 7). 7. Divide a segment at random into two parts. Find the probability that the largest segment is at least three times the shorter. Solution: Assume the segment is the interval (0, ) and let X Uniform(0, ). Then X models a random point in (0, ). We have two possibilities: Either X X or X > X; or, equivalently, X or X >. Define the events E ( X ) and E ( X > ). Observe that Pr(E ) and Pr(E ). The probability that the largest segment is at least three times the shorter is given by Pr(E )Pr( X > X E ) + Pr(E )Pr(X > ( X) E ), by the Law of Total Probability, where Pr( X > X E ) Pr[(X < /4) E ] Pr(E ) /4 /. Similarly, Pr(X > ( X) E ) Pr[(X > /4) E ] Pr(E ) /4 /. Thus, the probability that the largest segment is at least three times the shorter is Pr(E )Pr( X > X E ) + Pr(E )Pr(X > ( X) E ). 8. Assume that X and Y are independent, discrete random variables. Show that E(XY ) E(X)E(Y ). Solution: Assume that Pr(X x, Y y) Pr(X x) Pr(Y y), for all values of x and y, (8)

Math 5. Rumbos Fall 07 7 and compute E(XY ) x x xypr(x x, Y y) y xypr(x x) Pr(Y y), where we have used (8). We then have that E(XY ) xp X (x)yp Y (y) x y y x xp X (x) y yp Y (y), where we have used the distributive property. Then, using the definition of E(Y ), E(XY ) xp X (x)e(y ) x ( ) xp X (x) E(Y ), x where we have used the distributive property again. Consequently, using the definition of E(X), E(XY ) E(X)E(Y ), which was to be shown. 9. Assume that X Uniform(0, ) and define Y ln X. (a) Compute the cdf of Y. Solution: Assume that X Uniform(0, ); so that, the pdf o is {, if 0 < x < ; (x) 0, otherwise. Let Y ln X; so that, the possible values of Y range from 0 to +. Thus, for y > 0, (y) Pr(Y y) Pr( ln(x) y) Pr(ln(X) y); (9)

Math 5. Rumbos Fall 07 8 so that, (y) Pr(X e y ), for y > 0. Thus, using the fact that X is a continuous random variable, (y) Pr(X > e y ), for y > 0, which can be rewritten as (y) Pr(X e y ), for y > 0, from which we get that (y) F X (e y ), for y > 0. (0) Since Y has no negative possible values, we obtain from (0) that { F (y) X (e y ), for y > 0; 0, for y 0. Now, the cdf o can be computed from (9) to be 0, if x 0; F X (x) x, if 0 < x < ;, if x. We therefore obtain from () and () that { e y, for y > 0; (y) 0, for y 0, () () () since 0 < e y < for y > 0. (b) Compute the pdf of Y Solution: Differentiating the expression for in () for y 0, and setting f Y (0) 0, we obtain f Y (y) { e y, for y > 0; 0, for y 0. (4) Observe that (4) implies that Y Exponential().

Math 5. Rumbos Fall 07 9 (c) Compute Pr(Y > ). Solution: Compute Pr(Y > ) Pr(Y ) (); so that, according to (), Pr(Y > ) ( e ) e. (d) Compute E(Y ) and Var(Y ) Solution: Since Y Exponential(), we have that E(Y ) and Var(Y ). 0. A box contains a certain number of balls of various colors. Assume that 0% of the balls are red. If 0 balls are selected from the box at random, with replacement, what is the probability that more than red balls will be obtained in the sample? Solution: Let X denote the number of red balls in the sample of 0. Then, X has a binomial distribution with parameters n 0 and p 0.0. Thus, the pmf o is ( ) 0 (0.) k (0.9) 0 k, if k 0,,,..., 0; k p X (k) 0, otherwise. Compute Pr(X > ) Pr(X ) p X (0) p X () p X () p X () 0.0. or about.%.. Let X denote a continuous random variable with pdf x, if 0 < x < 4; 8 (x) 0, otherwise. Define Y to be the integer that is closest to X.

Math 5. Rumbos Fall 07 0 (a) Explain why Y is a discrete random variable and give possible values for Y. Solution: Possible values for Y are 0,,, and 4. Hence, Y is discrete. (b) Compute the pmf of Y. Solution: Compute Pr(Y 0) Pr(0 X < 0.5) 0.5 0 [ x 6 (x) dx ] 0.5 0 64 ; Pr(Y ) Pr(0.5 X <.5).5 0.5 [ x 6 (x) dx ].5 0.5 8 ; Pr(Y ) Pr(.5 X <.5).5.5 [ x 6 (x) dx ].5.5 4 ;

Math 5. Rumbos Fall 07 Pr(Y ) Pr(.5 X <.5).5.5 [ x 6 (x) dx ].5.5 8 ; and Pr(Y 4) Pr(.5 X < 4) 4.5 [ x 6 (x) dx ] 4.5 5 64. We therefore have that the pmf of Y is /64, if k 0; /8, if k ; /4, if k ; p Y (k) /8, if k ; 5/64, if k 4; 0, elsewhere. (c) Compute E(Y ) and Var(Y ). Solution: Using the pmf in (5) we compute E(Y ) 4 kp Y (k) k0 (5) 4 kp Y (k), k

Math 5. Rumbos Fall 07 or or E(Y ) 8 + 4 + 8 + 4 5 64, E(Y ) 4 6. (6) To compute the variance of Y, we first compute the second moment E(Y ) 4 k p Y (k) k0 or 4 k p Y (k), k E(Y ) 8 + 4 + 8 + 4 5 64 so that, The variance of Y is given by 8 + + 7 8 + 5 4 + 8 8 + 5 4 ; E(Y ) 4. (7) Var(Y ) E(Y ) [E(Y )] ; so that, using the results in (6) and (7), Var(Y ) 6 56.. Assume that X has a uniform distribution on the subset of the integers given by {,,,..., 47}

Math 5. Rumbos Fall 07 (a) Compute the probability of the event that X is even. Solution: The pmf o is, if k,,,..., 47; 47 p X (k) 0, otherwise. The probability of the event (X is even) is Pr(X is even) 47, since there are even numbers between and 47. (b) Compute the expected value o. Solution: Compute E(X) 47 k kp X (k) 47 47 4. 47 k k 47 48