ECE 316 Probability Theory and Random Processes



Similar documents
Statistics 100A Homework 3 Solutions

Chapter 4 Lecture Notes

ECE-316 Tutorial for the week of June 1-5

Statistics 100A Homework 4 Solutions

MA 1125 Lecture 14 - Expected Values. Friday, February 28, Objectives: Introduce expected values.

Section 7C: The Law of Large Numbers

Math 425 (Fall 08) Solutions Midterm 2 November 6, 2008

Solutions: Problems for Chapter 3. Solutions: Problems for Chapter 3

HONORS STATISTICS. Mrs. Garrett Block 2 & 3

Midterm Exam #1 Instructions:

3.2 Roulette and Markov Chains

Example. A casino offers the following bets (the fairest bets in the casino!) 1 You get $0 (i.e., you can walk away)

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

Probability and Expected Value

36 Odds, Expected Value, and Conditional Probability

Expected Value. 24 February Expected Value 24 February /19

Elementary Statistics and Inference. Elementary Statistics and Inference. 17 Expected Value and Standard Error. 22S:025 or 7P:025.

In the situations that we will encounter, we may generally calculate the probability of an event

Elementary Statistics and Inference. Elementary Statistics and Inference. 16 The Law of Averages (cont.) 22S:025 or 7P:025.

THE POKIES: BEFORE YOU PRESS THE BUTTON, KNOW THE FACTS.

(SEE IF YOU KNOW THE TRUTH ABOUT GAMBLING)

Chapter 4 & 5 practice set. The actual exam is not multiple choice nor does it contain like questions.

AP Statistics 7!3! 6!

University of California, Los Angeles Department of Statistics. Random variables

= = 106.

Feb 7 Homework Solutions Math 151, Winter Chapter 4 Problems (pages )

You can place bets on the Roulette table until the dealer announces, No more bets.

Betting with the Kelly Criterion

The overall size of these chance errors is measured by their RMS HALF THE NUMBER OF TOSSES NUMBER OF HEADS MINUS NUMBER OF TOSSES

Law of Large Numbers. Alexandra Barbato and Craig O Connell. Honors 391A Mathematical Gems Jenia Tevelev

Australian Reels Slot Machine By Michael Shackleford, A.S.A. January 13, 2009

Statistics and Random Variables. Math 425 Introduction to Probability Lecture 14. Finite valued Random Variables. Expectation defined

Random variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8.

The Math. P (x) = 5! = = 120.

We rst consider the game from the player's point of view: Suppose you have picked a number and placed your bet. The probability of winning is

Bayesian logistic betting strategy against probability forecasting. Akimichi Takemura, Univ. Tokyo. November 12, 2012

If, under a given assumption, the of a particular observed is extremely. , we conclude that the is probably not

Roulette. Math 5 Crew. Department of Mathematics Dartmouth College. Roulette p.1/14

T: Here is a fruit machine with 3 DIALS and with 20 SYMBOLS on each dial. Each of the 20 symbols is equally likely to occur on each dial.

Standard 12: The student will explain and evaluate the financial impact and consequences of gambling.

THE WINNING ROULETTE SYSTEM by

Probability: The Study of Randomness Randomness and Probability Models. IPS Chapters 4 Sections

Chapter 16: law of averages

Chapter 5 Section 2 day f.notebook. November 17, Honors Statistics

ECE302 Spring 2006 HW3 Solutions February 2,

Mathematical Expectation

arxiv: v1 [math.pr] 5 Dec 2011

Fourth Problem Assignment

פרויקט מסכם לתואר בוגר במדעים )B.Sc( במתמטיקה שימושית

Solution. Solution. (a) Sum of probabilities = 1 (Verify) (b) (see graph) Chapter 4 (Sections ) Homework Solutions. Section 4.

Automatic Bet Tracker!

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation

MrMajik s Money Management Strategy Copyright MrMajik.com 2003 All rights reserved.

How To Know When A Roulette Wheel Is Random

Chapter 5. Discrete Probability Distributions

Chapter 16. Law of averages. Chance. Example 1: rolling two dice Sum of draws. Setting up a. Example 2: American roulette. Summary.

TABLE OF CONTENTS. ROULETTE FREE System # ROULETTE FREE System #

SOME ASPECTS OF GAMBLING WITH THE KELLY CRITERION. School of Mathematical Sciences. Monash University, Clayton, Victoria, Australia 3168

Some special discrete probability distributions

Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80)

We { can see that if U = 2, 3, 7, 11, or 12 then the round is decided on the first cast, U = V, and W if U = 7, 11 X = L if U = 2, 3, 12.

Live Dealer Electronic Table Games

Basic Probability Theory II

Expected Value and the Game of Craps

Lecture 5: Mathematical Expectation

Lecture 13. Understanding Probability and Long-Term Expectations

STA 130 (Winter 2016): An Introduction to Statistical Reasoning and Data Science

Decision & Risk Analysis Lecture 6. Risk and Utility

Decision Making Under Uncertainty. Professor Peter Cramton Economics 300

Practical Probability:

Inside the pokies - player guide

Find the indicated probability. 1) If a single fair die is rolled, find the probability of a 4 given that the number rolled is odd.

Ethical Gambling: policies of gambling in modern societies

Random Variables. Chapter 2. Random Variables 1

Magic Bomb (VER.AMERICAN ALPHA)

Contents. Introduction...1. The Lingo...3. Know the Different Types of Machines Know the Machine You re Playing...35

Minimax Strategies. Minimax Strategies. Zero Sum Games. Why Zero Sum Games? An Example. An Example

Prediction Markets, Fair Games and Martingales

Math 431 An Introduction to Probability. Final Exam Solutions

Making $200 a Day is Easy!

Exam. Name. How many distinguishable permutations of letters are possible in the word? 1) CRITICS

STRIKE FORCE ROULETTE

Russell Hunter Publishing Inc

14.4. Expected Value Objectives. Expected Value

Example: Find the expected value of the random variable X. X P(X)

ECE302 Spring 2006 HW4 Solutions February 6,

Solution (Done in class)

Gaming the Law of Large Numbers

Vamos a Las Vegas Par Sheet

STATISTICS 8: CHAPTERS 7 TO 10, SAMPLE MULTIPLE CHOICE QUESTIONS

Homework 4 - KEY. Jeff Brenion. June 16, Note: Many problems can be solved in more than one way; we present only a single solution here.

Introductory Probability. MATH 107: Finite Mathematics University of Louisville. March 5, 2014

Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution

STAT 370: Probability and Statistics for Engineers [Section 002]

5 Cumulative Frequency Distributions, Area under the Curve & Probability Basics 5.1 Relative Frequencies, Cumulative Frequencies, and Ogives

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].

Term Project: Roulette

Transcription:

ECE 316 Probability Theory and Random Processes Chapter 4 Solutions (Part 2) Xinxin Fan Problems 20. A gambling book recommends the following winning strategy for the game of roulette. It recommends that a gambler bet $1 on red. If red appears (which has probability 18 ), then the gambler should take her $1 profit and quit. If the gambler loses this bet (which has probability 20 of occurring), she should make additional $1 bets on red on each of the next two spins of the roulette wheel and then quit. Let X denote the gambler s winnings when she quits. (a) Find P {X > 0}. (b) Are you convinced that the strategy is indeed a winning strategy? Explain your answer! (c) Find E[X]. Solution. (a) The event that X > 0 denotes that the gambler wins the first bet or he loses the first bet and wins the next two bets. Therefore, we get P {X > 0} = P {win first bet} + P {lose, win, win} = 18 + 20 ( ) 18 2 0.5981. (b) The strategy described above is not a winning strategy because if the gambler wins then he or she wins $1. However, a loss would either be $1 or $3. (c) We first note that the random variable X can take on 1, 1 and 3, where denotes that the gambler loses money. Then we obtain P {X = 1} = P {win first bet} + P {lose, win, win} = 18 + 20 P {X = 1} = P {lose, lose, win} + P {lose, win, lose} = 2 18 ( ) 20 3 P {X = 3} = P {lose, lose, lose} =. Therefore, we can compute the expectation as follows: ( ) 18 2, ( ) 20 2, E[X] = 1 P {X = 1} + ( 1) P {X = 1} + ( 3) P {X = 3} 0.108. 25. A typical slot machine has 3 dials, each with 20 symbols (cherries, lemons, plums, oranges, bells, and bars). A typical set of dials is shown in Table 1. According to this table, of the 20 slots on dial 1, are cherries, 3 are oranges, and so on. A typical payoff on a 1-unit 1

Table 1: Slot machine dial setup Dial 1 Dial 2 Dial 3 Cherries 0 Oranges 3 6 Lemons 3 0 4 Plums 4 1 6 Bells 2 2 3 Bars 1 3 1 20 20 20 Table 2: Typical payoff on a 1-unit bet Dial 1 Dial 2 Dial 3 Payoff Bar Bar Bar 60 Bell Bell Bell 20 Bell Bell Bar 18 Plum Plum Plum 14 Orange Orange Orange 10 Orange Orange Bar 8 Cherry Cherry Anything 2 Cherry No cherry Anything 0 Anything else -1 bet is shown in Table 2. Compute the player s expected winnings on a single play of the slot machine. Assume that each dial acts independently. Solution. Let X denote the payoff on a 1-unit bet. Then we get P {X = 60} = P {Bar, Bar, Bar} = 1 20 3 20 1 20 = 3 P {X = 20} = P {Bell, Bell, Bell} = 2 20 2 20 3 20 = 12 P {X = 18} = P {Bell, Bell, Bar} = 2 20 2 20 1 20 = 4 P {X = 14} = P {Plum, Plum, Plum} = 4 20 1 20 6 20 = 24 P {X = 10} = P {Orange, Orange, Orange} = 3 20 20 6 20 = 126 P {X = 8} = P {Orange, Orange, Bar} = 3 20 P {X = 2} = P {Cherry, Cherry, Anything} = 20 20 1 20 = 21 20 = 49 400, 2

P {X = 0} = P {Cherry, No cherry, Anything} = 20 13 20 = 91 400, P {X = 1} = 3 + 12 + 4 + 24 + 126 + 21 + 980 + 1820 P {Anything else} = 1 8000 = 501 800. Therefore, the player s expected winnings on a single play of the slot machine can be computed as follows: E[X] = 60 P {X = 60} + 20 P {X = 20} + 18 P {X = 18} + = 14 P {X = 14} + 10 P {X = 10} + 8 P {X = 8} + 2 P {X = 2} + 0 P {X = 0} + ( 1) P {X = 1} 180 + 240 + 2 + 336 + 1260 + 168 + 1960 5010 = 0.09925. 8000 32. To determine whether or not they have a certain disease, 100 people are to have their blood tested. However, rather than testing each individual separately, it has been decided first to group the people in groups of 10. The blood samples of the 10 people in each group will be pooled and analyzed together. If the test is negative, one test will suffice for the 10 people; whereas, if the test is positive each of the 10 people will also be individually tested and, in all, 11 tests will be made on this group. Assume the probability that a person has the disease is 0.1 for all people, independently of each other, and compute the expected number of tests necessary for each group. (Note that we are assuming that the pooled test will be positive if at least one person in the pool has the disease.) Solution. Let T be the number of tests for a group of 10 people. Then we know that T = 1 if the test is negative and T = 11 if the test is positive. Therefore, we get E[T ] = (0.9) 10 + 11[1 (0.9) 10 ] = 11 10 (0.9) 10. 33. A newsboy purchases papers at 10 cents and sells them at 15 cents. However, he is not allowed to return unsold papers. If his daily demand is a binomial random variable with n = 10, p = 1 3, approximately how many papers should he purchase so as to maximize his expected profit? Solution. Let a be the number of papers the newsboy purchases, X be the daily demand, and Y be the profit the newsboy gets. Then we obtain the relation between random variables X and Y as follows: { 5a X a Y = 15X 10a X < a. Therefore, the expected profit that the newsboy obtains is E[Y ] = 5a P (X a) + (15X 10a) P (X < a) = 10 ( ) ( ) 10 1 i ( ) 2 10 i a 1 5a + (15i 10a) i 3 3 i=a i=0 ( 10 i ) ( 1 3 ) i ( ) 2 10 i 3 To find the approximate value for a, we can use Matlab to draw the following figure to show the relation between E[Y ] and a. From Fig. 1, we note that the newsboy should purchase 3 papers so as to maximize his expected profit. 3

10 0 10 E[Y] 20 30 40 50 0 1 2 3 4 5 6 8 9 10 a Figure 1: The Expected Profit E[Y ]. If E[X] = 1 and Var(X) = 5, find (a) E[(2 + X) 2 ]; (b) Var(4 + 3X). Solution. (a) E[(2 + X) 2 ] = Var(2 + X) + (E[2 + X]) 2 = Var(X) + 9 = 14. (b) Var(4 + 3X) = 9 Var(X) = 45. 44. A satellite system consists of n components and functions on any given day if at least k of the n components function on that day. On a rainy day each of the components independently functions with probability p 1, whereas on a dry day they each independently function with probability p 2. If the probability of rain tomorrow is α, what is the probability that the satellite system will function? Solution. The probability that the satellite system will function can be computed as follows: P (system functions) = P (rain)p (system functions rain) + P (dry)p (system functions dry) n ( ) n n ( ) n = α p i i 1(1 p 1 ) n i + (1 α) p i i 2(1 p 2 ) n i. i=k 48. It is known that diskettes produced by a certain company will be defective with probability 0.01, independently of each other. The company sells the diskettes in packages of size 10 and offers a money-back guarantee that at most 1 of the 10 diskettes in the package will be defective. If someone buys 3 packages, what is the probability that he or she will return exactly 1 of them? Solution. Let p be the probability that a package will be returned. The we obtain p = 1 (0.99) 10 10 (0.99) 9 (0.01). Therefore, if someone buys 3 packages then the probability they will return exactly 1 package is 3p(1 p) 2. 49. When coin 1 is flipped, it lands heads with probability 0.4; when coin 2 is flipped, it lands heads with probability 0.. One of these coins is randomly chosen and flipped 10 times. i=k 4

(a) What is the probability that exactly of the 10 flips land on heads? (b) Given that the first of these ten flips lands heads, what is the conditional probability that exactly of the 10 flips land on heads?. Solution. (a) Note that one of two coins will be randomly chosen, we get P ( heads) = P (coin 1)P ( heads coin 1) + P (coin 2)P ( heads coin 2) = 1 ( ) 10 2 (0.4) (0.6) 3 + 1 ( ) 10 2 (0.) (0.3) 3. (b) We can compute the conditional probability as follows: P ( heads 1st heads) = = 2 i=1 P (coin i)p ( heads, 1st heads coin i) P (1st heads) 1 2 (9 6 ) (0.4) (0.6) 3 + 1 2 (9) 6 (0.) (0.3) 3 1 2 0.4 + 1 2 0.. Theoretical Exercises 4. If X has distribution function F, what is the distribution function of e X. Solution. Let G(x) be the distribution function of e X. Then we need to consider the following two cases: When x 0, we get G(x) = P {e X x} = 0. When x > 0, we obtain G(x) = P {e X x} = P {X ln x} = F (ln x). 5. If X has distribution function F, what is the distribution function of the random variable αx + β, where α and β are constants, α 0? Solution. Let G(x) be the distribution function of e X. Then we need to consider the following two cases: When α > 0, we get When α < 0, we obtain G(x) = P {αx + β x} = P G(x) = P {αx + β x} = P { X x β } = F α ( x β α ). { X x β } ( ) x β = 1 lim α F h 0 + α h. 5

8. Let X be such that Find c 1 such that E[c X ] = 1. P {X = 1} = p = 1 P {X = 1}. Solution. We have known the probability mass function of X: P {X = 1} = p and P {X = 1} = 1 p. Thus, E[c X ] = c 1 +c 1 (1 p). Let E[c X ] = cp + 1 p c = 1, it follows that c = p 1 p that E[c X ] = 1. or 1. Therefore, except 1, c = p 1 p satisfies 9. Let X be a random variable having expected value µ and variance σ 2. Find the expected value and variance of Y = X µ σ. Solution. Using the properties of expected value and variance, we get [ ] X µ E[Y ] = E (E[X] µ) = 0, = 1 σ σ E[X µ] = 1 σ ( ) X µ Var(Y ) = Var = σ ( ) 1 2 Var(X) = σ2 σ σ 2 = 1. 13. Let X be a binomial random variable with parameters (n, p). What value of p maximizes P {X = k}, k = 0, 1,..., n? This is an example of a statistical method used to estimate p when a binomial (n, p) random variable is observed to equal k. If we assume that n is known, then we estimate p by choosing that value of p that maximizes P {X = k}. This is known as the the method of maximum likelihood estimation. Solution. Note that when P {X = k} achieves the maximum value, log P {X = k} also gets the maximum value. Therefore, we can first take logarithm and then determine the p that maximizes log P {X = k}. More specifically, we first obtain ( ) n log P {X = k} = log + k log p + (n k) log(1 p). k Then we can find p by computing the derivative as follows: p log P {X = k} = k p n k 1 p = 0. Therefore, p = k n maximizes P {X = k} for k = 0, 1,..., n. 6