A scheme of random number generator is described as follows. First, one generates a normal random number with mean 0 and variance 16, a uniform random number on [0,24], then a geometric random number of parameter p = 0.25 (each independently). Then we define the random number to be the average of these three numbers. 30 random numbers are generated with the scheme above, denoted as {X}30₁. Estimate/approximate the probability that the average 1 X is deviated from μ = E[X₁] by a distance of more than 0.2 using: (a) Chebyshev's inequality; (b) central limit theorem. k=1*

A scheme of random number generator is described as follows. First, one generates a normal random number with mean 0 and variance 16, a uniform random number on [0,24], then a geometric random number of parameter p = 0.25 (each independently). Then we define the random number to be the average of these three numbers. 30 random numbers are generated with the scheme above, denoted as {X}30₁. Estimate/approximate the probability that the average 1 X is deviated from μ = E[X₁] by a distance of more than 0.2 using: (a) Chebyshev's inequality; (b) central limit theorem. k=1*

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter10: Sequences, Series, And Probability

Section10.8: Probability

Problem 32E

See similar textbooks