Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that a random sample of size n is to be taken from a distribution for which the mean is μ, and the standard deviation is 3. Use the central limit theorem to determine approximately the smallest value of n for which the following relation will be satisfied:

\({\bf{Pr}}\left( {\left| {{{{\bf{\bar X}}}_{\bf{n}}}{\bf{ - \mu }}} \right|{\bf{ < 0}}{\bf{.3}}} \right) \ge {\bf{0}}{\bf{.95}}\).

Short Answer

Expert verified

The smallest possible value of n is 385

Step by step solution

01

Given information

A random sample of size n taken from the distribution with a mean of \(\mu \) and standard deviation \(\sigma = 3\)

02

Finding the smallest value of n

The distribution,

\(\begin{array}{c}Z = \frac{{\sqrt n \left( {{{\bar X}_n} - \mu } \right)}}{\sigma }\\ = \frac{{\sqrt n \left( {{{\bar X}_n} - \mu } \right)}}{3}\end{array}\)

Then the distribution of Z will be an approximately standard normal distribution.

Therefore,

\(\begin{array}{c}\Pr \left( {\left| {{{\bar X}_n} - \mu } \right| < 0.3} \right) = \Pr \left( {\left| Z \right| < 0.1\sqrt n } \right)\\ \approx 2\Phi \left( {0.1\sqrt n } \right) - 1\end{array}\)

But,

\(\begin{array}{c}2\Phi \left( {0.1\sqrt n } \right) - 1 \ge 0.95\\2\Phi \left( {0.1\sqrt n } \right) \ge 1 + 0.95\\\Phi \left( {0.1\sqrt n } \right) \ge \frac{{1.95}}{2}\\0.1\sqrt n \ge {\Phi ^{ - 1}}\left( {0.975} \right)\end{array}\)

\(\begin{array}{c}0.1\sqrt n \ge 1.96\\\sqrt n \ge 19.6\\n \ge 384.16\end{array}\)

Therefore, the smallest possible value of n is 385

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

It is said that a sequence of random variables\({Z_1},{Z_2},...\)converges to a constant b in quadratic mean if

\(\mathop {\lim }\limits_{n \to \infty } E\left[ {{{\left( {{Z_n} - b} \right)}^2}} \right] = 0\). (6.2.17)

Show that Eq. (6.2.17) is satisfied if and only if\(\mathop {\lim }\limits_{n \to \infty } E\left( {{Z_n}} \right) = b\)and\(\mathop {\lim }\limits_{x \to \infty } V\left( {{Z_n}} \right) = 0\).

This problem requires a computer program because the calculation is too tedious to do by hand. Extend the calculation in Example 6.1.1 to the case of n = 200 flips. Let W be the number of heads in 200 flips of a fair coin and compute P( 0.4 ≤ W/ 200 ≤ 0.6). What do you think is the continuation of the pattern of these probabilities as the number of flips n increases without bound?

Suppose that the distribution of the number of defects on any given bolt of cloth is the Poisson distribution with a mean 5, and the number of defects on each bolt is counted for a random sample of 125 bolts. Determine the probability that the average number of defects per bolt in the sample will be less than 5.5.

Suppose that ,, and \(g\left( {z,y} \right)\)is a function that is continuous at \(\left( {z,y} \right) = \left( {b,c} \right)\). Prove that \(g\left( {{Z_n},{Y_n}} \right)\)converges in probability to \(g\left( {b,c} \right)\).

Let \({\overline X _n}\)be the sample mean of a random sample of size n from a distribution for which the mean is μand the variance is \({\sigma ^2}\), where \({\sigma ^2} < \infty \).

Show that \({\overline X _n}\)converges to μ in quadratic mean as \(n \to \infty \).

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free