• Home
  • Textbooks
  • Probability, Statistics, and Queuing Theory with Computer Science Applications, Second Edition (Computer Science and Scientific Computing)
  • Probability and Random Variables

Probability, Statistics, and Queuing Theory with Computer Science Applications, Second Edition (Computer Science and Scientific Computing)

Arnold O. Allen

Chapter 2

Probability and Random Variables - all with Video Answers

Educators


Chapter Questions

04:36

Problem 1

The interactive order entry system of the WEWE Diaper Company can receive order messages from Los Angeles, San Diego, Bakersfield, and San Francisco. Ordering activity in each city is independent of that from the other cities. The probability that the system receives one or more orders during any one minute time interval (during the peak period of the day) from Los Angeles, San Diego, Bakersfield, or San Francisco, respectively, is $0.8,0.3,0.05,0.5$.
(a) What is the probability that ordering activity occurs from exactly one of the cities during any one minute period?
(b) Exactly two cities?
(c) Not more than two cities?
(d) No city?

Amany Waheeb
Amany Waheeb
Numerade Educator
05:32

Problem 2

In discussing the weak law of large numbers we claimed that the function $p q=p(1-p)$ has a unique maximum value of $\frac{1}{4}$ at $p=\frac{1}{2}$. Prove this claim.

Sam Stansfield
Sam Stansfield
Numerade Educator

Problem 3

Suppose $A, B$, and $C$ are events in some sample space $\Omega$, and thus are subsets of $\Omega$. Prove the distributive law
$$
(A \cup B) \cap C=(A \cap C) \cup(B \cap C) .
$$

Check back soon!
03:48

Problem 4

Prove that, if $A, B$, and $C$ are events, then
$$
\begin{aligned}
P[A \cup B \cup C]= & P[A]+P[B]+P[C]-P[A \cap B]-P[A \cap C] \\
& -P[B \cap C]+P[A \cap B \cap C] .
\end{aligned}
$$

Julian Wong
Julian Wong
Numerade Educator
01:17

Problem 5

Assume that a single depth charge has a probability of $\frac{1}{3}$ of sinking a submarine, $\frac{1}{2}$ of damage, and $\frac{1}{6}$ of missing. Assume also that two damaging explosions sink the sub. If four depth charges are dropped on a submarine, what is the probability that the sub sinks?

Massimo Antonelli
Massimo Antonelli
Numerade Educator

Problem 6

Assume $A_1, A_2, A_3, \ldots$ are subsets of some set $\Omega$. Prove De Morgan's formulas:
(a) $\overline{A_1 \cup A_2 \cup \cdots \cup A_N}=\overline{A_1} \cap \overline{A_2} \cap \cdots \cap \overline{A_N}$.
(b) $\overline{A_1 \cap A_2 \cap \cdots \cap A_N}=\overline{A_1} \cup \overline{A_2} \cup \cdots \cup \overline{A_N}$.
(c) $\overline{\bigcup_{n=1}^{\infty} A_n}=\bigcap_{n=1}^{\infty} \overline{A_n}$.
(d) $\overline{\bigcap_{n=1}^{\infty} A_n}=\bigcup_{n=1}^{\infty} \overline{A_n}$.

Check back soon!
02:39

Problem 7

Let $A_1, A_2, \ldots$ be events in some sample space $\Omega$. Use Axiom Set 2.2.1 and the results of Exercise 6 to prove that
(a) $A_1 \cap A_2 \cap \cdots \cap A_N$ is an event for each positive integer $N$.
(b) $\bigcap_{n=1}^{\infty} A_n$ is an event.

Amany Waheeb
Amany Waheeb
Numerade Educator
03:23

Problem 8

An on-line computer system has four incoming communication lines with the properties described in the table below. What is the probability that a randomly chosen message has been received without error?
$$
\begin{array}{ccc}
\hline \text { Line } & \begin{array}{c}
\text { Fraction of } \\
\text { traffic }
\end{array} & \begin{array}{c}
\text { Fraction of } \\
\text { messages without } \\
\text { error }
\end{array} \\
\hline & & \\
1 & 0.4 & 0.9998 \\
2 & 0.3 & 0.9999 \\
3 & 0.1 & 0.9997 \\
4 & 0.2 & 0.9996 \\
\hline
\end{array}
$$

Maxime Rossetti
Maxime Rossetti
Numerade Educator
00:41

Problem 9

Twas Brillig has a drawer containing a mixture of 15 black and 20 blue socks. Twas is sick in bed when his friend Slithy Toves comes to visit.
(a) Twas asks Slithy to get him a pair of matched socks from the drawer (either a black pair or a blue pair). It is too dark for Slithy to distinguish the colors. How many socks must Slithy remove from the drawer to be sure of getting a matched pair?
(b) Suppose now there are an equal number of black and blue socks in the drawer. Suppose the minimum number of socks Slithy must draw to be sure of getting a pair is the same as the minimum number he must draw to be sure of getting at least one black sock and one blue sock. How many socks are in the drawer?

Clarissa Noh
Clarissa Noh
Numerade Educator
02:01

Problem 10

Big Bored Securities has two brands of personal computers in the Information Center to use for demonstrations, brand $y$ and brand $z$. If two personal computers are selected at random, the probability that both are brand $y$ is $1 / 2$. What is the smallest number of personal computers that could be in the Information Center?

Dominador Tan
Dominador Tan
Numerade Educator
03:22

Problem 11

Suppose the random variable $X$ has finite mean, $\mu$, and finite standard deviation, $\sigma$. Suppose also that
$$
P[|X-\mu|>K]=0 .
$$
Prove that $\sigma \leq K$.

SS
Sagar Singh
Numerade Educator
04:13

Problem 12

Calculate
(a) the probability of getting at least one ace by rolling four dice and
(b) the probability of rolling at least one double ace (popularly known as "snake eyes") in 24 throws of two dice. The fact that the first number is larger than the second is known as de Méré's paradox. See Feller [7, page 56] and Chung [4, pages 138-139].

Raymond Matshanda
Raymond Matshanda
Numerade Educator
01:27

Problem 13

A box contains 50 washers of which 3 are defective. If 2 are randomly chosen what is the probability they will both be good?

Steven Clarke
Steven Clarke
Numerade Educator
03:59

Problem 14

Find the probability of getting each of the following poker hands:
(a) A straight flush (five cards in sequence in a single suit, but not a royal flush. Since an ace can also be thought of as a one, the sequence ace, $2,3,4,5$ in one suit is a straight flush).
(b) Four of a kind (four cards with the same face value).
(c) Full house (one pair and one triple of the same face value, such as ace, ace, king, king, king).
(d) Flush (five cards in one suit but not a straight or royal flush).
(e) Straight (five cards in sequence, not all of the same suit).

James Macpherson
James Macpherson
Numerade Educator
03:54

Problem 15

Find the probability of not drawing a pair in poker. (Of course you still could have a straight or a flush, etc., but not three or four of a kind.)

Dalia Rodriguez
Dalia Rodriguez
Numerade Educator
01:48

Problem 16

Find the probability of getting a real "bust" hand in poker. A "bust" hand has no pair and is neither a straight, a flush, a straight flush nor a royal flush. [The ranking of poker hands from high to low is royal flush, straight flush, four of a kind, full house, flush, straight, three of a kind, two pairs, one pair, and, in the case of a bust hand, the highest ranked single card. Since single cards are ranked ace, king, queen, jack, $10,9, \ldots, 2$ without regard to suit, the best bust hand is an "ace high."]

Lourence Gonhovi
Lourence Gonhovi
Numerade Educator
02:06

Problem 17

For poker calculate the probability of drawing
(a) exactly one pair.
(b) two pairs.
(c) three of a kind.

Dalia Rodriguez
Dalia Rodriguez
Numerade Educator
04:16

Problem 18

Calculate the probability that a bridge hand
(a) will be all spades.
(b) will contain no spades.
(c) will consist entirely of one suit.

Ahmad Reda
Ahmad Reda
Numerade Educator
02:08

Problem 19

Suppose $A$ and $B$ are independent events. Prove that
(a) $A$ and $\bar{B}$ are independent and
(b) $\bar{A}$ and $\bar{B}$ are independent.

Christopher Stanley
Christopher Stanley
Numerade Educator
03:05

Problem 20

Suppose a pack of eight cards is formed from the kings and queens of a bridge deck. Two cards are drawn from it. Show that no two of the following events are independent. A: At least one of the cards is black. B: One of the cards is the queen of spades. C: Both cards are kings. D: Both cards are queens.

Sophie Knight
Sophie Knight
Numerade Educator
02:56

Problem 21

Prove that $P[A \mid B]=1$ if and only if $P[B] \neq 0$ and $P[\bar{A} \cap B]=0$.

Tatiana Graham
Tatiana Graham
Numerade Educator
01:09

Problem 22

Suppose two cards are drawn from the deck considered in Exercise 20. Calculate
(a) the probability that both cards are queens, given that one of the cards is a queen.
(b) the probability that both cards are queens, given that one of them is a red queen.
(c) the probability that both are queens, given that one of them is the queen of hearts.

Eric Wendland
Eric Wendland
Numerade Educator
02:19

Problem 23

Fred Poisson, the chief statistician at Disneyland, has found that $72 \%$ of the visitors go on the Jungle Cruise, $56 \%$ ride the Monorail, $60 \%$ take the Matterhorn ride, $50 \%$ go on the Jungle Cruise and ride the Monorail, $45 \%$ go on the Jungle Cruise and on the Matterhorn ride, $40 \%$ ride the Monorail and take the Matterhorn ride, and $30 \%$ take all three rides. Assuming Poisson's figures are correct, calculate the probability that a visitor to Disneyland will
(a) go on at least one of the three rides.
(b) ride the Monorail given that the Jungle Cruise was taken.
(c) take the Matterhorn ride given that both the Jungle Cruise and Monorail rides were taken.

Sherrie Fenner
Sherrie Fenner
Numerade Educator
02:04

Problem 24

All the families in Dogpatch have exactly two children. For these families we can represent the children by bb, bg, gb, gg. In each pair $b$ stands for boy and $g$ for girl; the first letter in each pair represents the older child. We assume boys and girls are equally likely so that probability of each sample point is $1 / 4$.
(a) Given that a family has a boy (event B), what is the probability that both children are boys (event A)?
(b) Given that the older child is a boy (event C), what is the probability that both children are boys (event A)?
(c) Let A be the event that "the family has children of both sexes," and B the event "there is at most one girl." Are A and B independent?

Sherrie Fenner
Sherrie Fenner
Numerade Educator
06:16

Problem 25

The families of workers at Tiny Timber have at most 3 children each. The probability distribution for the number of children per family is given by
$\begin{array}{lcccc}\text { Number of children: } & 0 & 1 & 2 & 3 \\ \text { Probability: } & 0.20 & 0.50 & 0.25 & 0.05\end{array}$
The probability that a child is a boy is the same as the probability a child is a girl.
(a) Calculate the probability that a family has exactly one boy. (There may be girls too.)
(b) Calculate the probability there are two children in a family given that the family has exactly one boy.

Nick Johnson
Nick Johnson
Numerade Educator
05:23

Problem 26

The employees parking lot at the Buss Stout Fence Company has 50 percent U.S. cars, of which 15 percent are compact; 30 percent of the cars are European, of which 40 percent are compact; and 20 percent of the cars are Japanese, of which 60 percent are compact. If a car is randomly selected from the lot, calculate
(a) The probability it is a compact.
(b) Given that the car is a compact, the probability that it is European.

Sheryl Ezze
Sheryl Ezze
Numerade Educator
04:36

Problem 27

Belchfire Motors automobiles are equally likely to be manufactured on Monday, Tuesday, Wednesday, Thursday, or Friday; no cars are constructed on weekends. Ralph Wader, the company statistician, has determined that 4 percent of the cars produced on Monday are "lemons"; 1 percent of the cars made on Tuesday, Wednesday, or Thursday are lemons; and 2 percent of cars manufactured on Friday are lemons. You find that your Belchfire car is truly a lemon. What is the probability it was manufactured on Monday?

Pratyush Raitan
Pratyush Raitan
Numerade Educator
02:14

Problem 28

For the sample space of inserting $n$ balls into $n$ urns let each sample point be an $n$-tuple $\left(x_1, x_2, \ldots, x_n\right)$, where $x_j$ represents the number of the ball put into the $j$ th urn (sometimes, unromantically, called a pot). Thus, each component is a number from 1 to $n$ and no two components are equal. Then the event $A_k=\left\{\left(x_1, x_2, \ldots, x_n\right)\right.$ $\left.\in \Omega: x_k=k\right\}$. Prove that $P\left[A_k\right]=1 / n$. Thus, the probability of a man getting his own hat does not depend on whether he gets to make the first, second, or even last choice.

Hunza Gilgit
Hunza Gilgit
Numerade Educator
03:52

Problem 29

Noah Peale and Mail Chauvinist are part of a group of 6 people who have put their hats on a table. Everyone then selects a hat randomly from those on the table. Calculate the probability that
(a) Noah gets his own hat.
(b) both Noah and Mail get their own hats.
(c) at least one, either Noah or Mail, will get his own hat.

Andre Montanez Berrios
Andre Montanez Berrios
Numerade Educator
02:39

Problem 30

Consider the matching problem of $n$ urns and $n$ numbered balls. Prove that the probability that there is at least one match is given by
$$
1-\frac{1}{2 !}+\frac{1}{3 !}-\cdots+\frac{(-1)^{n-1}}{n !} \approx 1-e^{-1}=0.632120559 .
$$

Hunza Gilgit
Hunza Gilgit
Numerade Educator
03:25

Problem 31

Consider Exercise 30.
(a) Calculate the probability of at least one match for $n=2,3,4$, and compare it to $1-e^{-1}$.
(b) Show that
$$
\left|1-e^{-1}-\left(1-\frac{1}{2 !}+\frac{1}{3 !}-\cdots+\frac{(-1)^{n-1}}{n !}\right)\right| \leq \frac{1}{(n+1) !} .
$$
Conclude that, for $n \geq 4$, the probability of at least one match differs from $1-e^{-1} \approx 0.63$ by less than 0.01 ; that is, the probability of no match is about 0.63 for all $n \geq 4$.

Christopher Stanley
Christopher Stanley
Numerade Educator
02:19

Problem 32

Bigg Fakir claims that by clairvoyance he can tell the numbers of four cards numbered one to four, that are laid face down on a table. If he has no special powers and guesses at random, calculate the following:
(a) the probability that Bigg gets at least one right.
(b) the probability he gets two right.
(c) the probability Bigg gets them all right.

Lucas Finney
Lucas Finney
Numerade Educator
00:13

Problem 33

(a) Suppose $\left(\begin{array}{l}n \\ 11\end{array}\right)=\left(\begin{array}{l}n \\ 7\end{array}\right)$. What is $n$ ?
(b) Suppose $\left(\begin{array}{c}18 \\ r\end{array}\right)=\left(\begin{array}{c}18 \\ r-2\end{array}\right)$. what is $r$ ?

Ali Soave
Ali Soave
Numerade Educator
01:16

Problem 34

Following Knuth [14, page 51], we define $\left(\begin{array}{l}r \\ k\end{array}\right)$ for all read $r$ and all integers $k$ by
$$
\left(\begin{array}{l}
r \\
k
\end{array}\right)=\frac{r(r-1) \cdots(r-k+1)}{k(k-1) \cdots(1)}=\prod_{1 \leq j \leq k}\left(\frac{r+1-j}{j}\right),
$$
when $k$ is a nonnegative integer and
$$
\left(\begin{array}{l}
r \\
k
\end{array}\right)=0
$$
when $k$ is negative. ${ }^{20}$ Thus,
$$
\left(\begin{array}{c}
-7.2 \\
2
\end{array}\right)=\frac{(-7.2)(-8.2)}{2}=29.52,
$$
and $\left(\begin{array}{l}r \\ 0\end{array}\right)=1$ for all $r$, by the convention that an empty product in the definition of $\left(\begin{array}{l}r \\ k\end{array}\right)$ is one. Prove
(a) $\left(\begin{array}{l}r \\ k\end{array}\right)=\frac{r}{k}\left(\begin{array}{l}r-1 \\ k-1\end{array}\right)$ if $k$ is a nonzero integer.
(b) $\left(\begin{array}{l}r \\ k\end{array}\right)=\frac{r}{r-k}\left(\begin{array}{c}r-k \\ k\end{array}\right)$, when $k$ is an integer and $k \neq r$.
(c) $\left(\begin{array}{l}r \\ k\end{array}\right)=\left(\begin{array}{c}r-1 \\ k\end{array}\right)+\left(\begin{array}{c}r-1 \\ k-1\end{array}\right)$, when $k$ is any integer.
(d) $\left(\begin{array}{c}-r \\ k\end{array}\right)=(-1)^k\left(\begin{array}{c}r+k-1 \\ k\end{array}\right)$, when $k$ is any integer.

Clarissa Noh
Clarissa Noh
Numerade Educator
04:13

Problem 35

Seven terminals of an interactive system at Crocker Ship are attached by a communication line to the central computer. Exactly four of the seven terminals are ready to transmit a message. Assume that each terminal is equally likely to be in the ready state. Let $X$ be the random variable whose value is the number of terminals polled until the first ready terminal is located.
(a) What values may $X$ assume?
(b) What is the probability that $X$ will assume each of these values? Assume that terminals are polled in a fixed sequence without repetition.
(c) Suppose the communication line has $m$ terminals attached, of which $n$ are ready to transmit where $n \geq 1$. Show that $X$ can assume only the values $i=1,2, \ldots, m-n+1$ with $p(i)=P[X=$ $i]=\left(\begin{array}{c}m-i \\ n-1\end{array}\right) /\left(\begin{array}{c}m \\ n\end{array}\right)$.

Tony Wilson
Tony Wilson
Numerade Educator

Problem 36

Assume, as in Exercise 35(c), that $m$ terminals at Transend Realty are attached to a communication line linked to a computer. Suppose also that $Y$ terminals are ready to transmit, where $Y \geq 1$. Let $X$ be the number of polls required to find the first terminal in the ready state. Prove the following results (due to Russell Ham):
(a) $E[X \mid Y=n]=\left(\frac{m+1}{n+1}\right)$.
(b) $E\left[X^2 \mid Y=n\right]=\left[1+2\left(\frac{m-n}{n+1}\right)\right]\left(\frac{m+1}{n+1}\right)$.

Check back soon!
View

Problem 37

Suppose seven terminals are connected to a communication line of an interactive computer system. Each terminal operates independently and has probability 0.2 of being ready to transmit. Thus, if $Y$ is the random variable that counts the number of terminals ready to transmit, $Y$ has a binomial distribution with parameters $n=7$ and $p=0.2$. Find the mean and standard deviation of the number of polls necessary to find the first ready terminal. Assume that 7 polls are required to discover that no terminal is ready.

Rashmi Sinha
Rashmi Sinha
Numerade Educator
06:55

Problem 38

Swann Dive, a systems programmer at Poly Unsaturated, offered his friend Charlie Tuna, an application programmer, the following proposition. On each roll of three dice Swann would pay Charlie one dollar for each ace that showed; if no aces were turned Charlie would pay Swann one dollar. Charlie reasons that the probability of rolling an ace on the first die is $\frac{1}{6}$; similarly for the second and third die. Hence the probability $3 \times \frac{1}{6}=\frac{1}{2}$ of getting at least one ace and he might get two or even three of them.
(a) Is Charlie right-that is, is it a good proposition for him?
(b) What is the probability that Charlie will roll one, two, or three aces, respectively?
(c) What is the average amount of money Charlie can expect to win each time the dice are rolled? (Swann didn't tell him, but this game is known as chuck-a-luck at carnivals.)

Robin Corrigan
Robin Corrigan
Numerade Educator

Problem 39

A single disk storage device has $N$ concentric tracks and one access arm. It has been loaded with data in such a way that successive movements of the access arm (called track seeks) are independent of one another. The probability that a randomly chosen seek will take the arm to track $i$ is $p_i$. Let $X$ represent the number of tracks passed between consecutive seeks, assuming that no physical repositioning of the access arm takes place between successive seek operations. Show the following:
(a) $X$ assumes the values $0,1, \ldots, N-1$ and has the $\operatorname{pmf} p(\cdot)$ defined by
$$
p(j)=P[X=j]= \begin{cases}\sum_{i=1}^N p_i^2, & j=0 \\ 2 \sum_{i=1}^{N-j} p_i p_{i+j}, & j=1,2, \ldots, N-1 .\end{cases}
$$
(b) For the case that $p_i=1 / N$ for all $i$, it is true that
$$
\begin{gathered}
E[X]=\frac{\left(N^2-1\right)}{3 N} \approx \frac{N}{3}, \\
E\left[X^2\right]=\frac{\left(N^2-1\right)}{6} \approx \frac{N^2}{6},
\end{gathered}
$$
and
$$
\operatorname{Var}[X] \approx \frac{N^2}{18} .
$$
(c) Suppose $T$, the seek time, is a linear function of $X$; that is,
$$
T=A X+B,
$$
where $A$ and $B$ are constants. ( $A$ is then given by
$$
A=\frac{\text { maximum seek time }- \text { minimum seek time }}{N-1},
$$
and $B$ is minimum seek time.)
Then it is true that
$$
E[T]=\frac{A\left(N^2-1\right)}{3 N}+B \approx \frac{A N}{3}+B,
$$
and
$$
\operatorname{Var}[T]=A^2 \operatorname{Var}[X] \approx \frac{A^2 N^2}{18} .
$$

Check back soon!
03:46

Problem 40

Refer to Example 2.4.6. Calculate
$$
P\left[A_2 \mid A\right], P\left[A_3 \mid A\right] \text {, and } P\left[A_4 \mid A\right] \text {. }
$$

Derrick Hanson
Derrick Hanson
Numerade Educator
01:06

Problem 41

Dusty Page, a librarian at Hard Core Computer (makers of solid state memory), tripped over the discrete random variables $X$ and $Y$ when he stepped from his office. These random variables have the joint probability mass function shown in the table below. Thus, $X$ assumes the values 0 and 1 , and $Y$ assumes the values 0,1 , and 2 .
$$
\begin{array}{|cc|ccc|}
\hline X & Y & -1 & 0 & 1 \\
\hline-1 & & 0 & \frac{1}{4} & 0 \\
0 & & \frac{1}{4} & 0 & \frac{1}{4} \\
1 & & 0 & \frac{1}{4} & 0 \\
\hline
\end{array}
$$
Help Dusty out by doing or answering the following:
(a) Find the marginal probability mass functions $p_X$ and $p_Y$.
(b) Find the conditional probability mass function of $X$, given that $Y=2$.
(c) Are $X$ and $Y$ independent random variables? Why?
(d) Calculate $E[X], E[Y], \operatorname{Var}[X]$, and $\operatorname{Var}[Y]$.
(e) Find the probability mass function for $Z=X+Y$.

Hunza Gilgit
Hunza Gilgit
Numerade Educator
03:53

Problem 42

Suppose $X$ and $Y$ are independent random variables, each with the density function $f$ given by
$$
f(x)= \begin{cases}1 & \text { for } 0<x<1 \\ 0 & \text { otherwise. }\end{cases}
$$
Show that the density function of $Z=X+Y$ is given by
$$
f_Z(z)= \begin{cases}z & \text { for } 0 \leq z \leq 1 \\ 2-z & \text { for } 1<z \leq 2 \\ 0 & \text { otherwise. }\end{cases}
$$
Thus, $Z$ has a triangular distribution. (As we shall see in Chapter 3, $X$ and $Y$ are said to be uniformly distributed.) Hint: This Exercise can be solved by using convolution (Theorem 2.7.5) or by using the Laplace-Stieltjes transform (Theorem 2.9.3(a) and (d)).

Amany Waheeb
Amany Waheeb
Numerade Educator
02:11

Problem 43

Suppose $X$ and $Y$ have the joint discrete distribution shown in the table. Show that $X$ and $Y$ are uncorrelated but not independent.
$$
\begin{array}{|cc|ccc|}
\hline X & Y & -1 & 0 & 1 \\
\hline-1 & & 0 & \frac{1}{4} & 0 \\
0 & & \frac{1}{4} & 0 & \frac{1}{4} \\
1 & & 0 & \frac{1}{4} & 0 \\
\hline
\end{array}
$$

Victor Salazar
Victor Salazar
Numerade Educator
05:18

Problem 44

Suppose $X$ is an arbitrary random variable such that the mean $E[X]$ and standard deviation $\sigma$ are defined (finite). For any $p$ such that $0<p<0.5$, find $x_p>E[X]$ so that $P\left[X>x_p\right] \leq p$.

Bryan Meares
Bryan Meares
Numerade Educator
01:20

Problem 45

Suppose $X$ is a random variable with finite mean and variance. For $50 \leq r<1$, we define the $r$ th percentile value $\pi_X(r)$ by
$$
P\left[X \leq \pi_X(r)\right]=\frac{r}{100} .
$$
Thus, the 90 th percentile value $\pi_X(90)$ is defined by
$$
P\left[X \leq \pi_X(90)\right]=0.90 .
$$
Show that
$$
\pi_X(90) \leq E[X]+3 \sigma,
$$
and
$$
\pi_X(95) \leq E[X]+\sigma \sqrt{19} .
$$

Tyler Moulton
Tyler Moulton
Numerade Educator
02:45

Problem 46

A discrete random variable $X$ is called a truncated Poisson random variable if its mass points are $0,1,2, \ldots, N$ and its probability mass function $p(\cdot)$ is given by $p(k)=C e^{-\alpha} \alpha^k / k !, k=0,1,2, \ldots, N$. What is the value of the constant $C$ ?

Christopher Stanley
Christopher Stanley
Numerade Educator

Problem 47

The average length of messages received at a message switching center is 50 characters with a standard deviation of 10 characters. How many bytes (characters) of storage should be provided for each message buffer to ensure that $95 \%$ of all messages fit into one buffer?

Check back soon!
01:43

Problem 48

A certain access method, called method $A$, has been found to give a mean record retrieval time of 36 milliseconds with a standard deviation of 7 milliseconds, while method $B$ has a mean retrieval time of 42 milliseconds with a standard deviation of 4 milliseconds.
(a) If a major design objective is to have $90 \%$ of all individual retrievals completed in 55 milliseconds or less, which method should be selected?
(b) Does the chosen method meet the objective?

Sherrie Fenner
Sherrie Fenner
Numerade Educator
02:15

Problem 49

Inquiries to an interactive computer system at Rhode Block Security are of four types and make reference to different data bases as follows:
$$
\begin{array}{c|c|c|c}
\hline \begin{array}{c}
\text { Inquiry } \\
\text { type }
\end{array} & \begin{array}{c}
\text { Percent of } \\
\text { type }
\end{array} & \begin{array}{c}
\text { Mean reference time } \\
\text { (msec) }
\end{array} & \begin{array}{c}
\text { Standard deviation } \\
\text { of reference } \\
\text { time(msec) }
\end{array} \\
\hline \text { A } & 40 & 100 & 80 \\
\text { B } & 30 & 120 & 30 \\
\text { C } & 20 & 80 & 40 \\
\text { D } & 10 & 40 & 20 \\
\hline
\end{array}
$$
For the entire collection of inquiries, what is
(a) the mean reference time?
(b) the variance of reference time?

James Kiss
James Kiss
Numerade Educator
01:00

Problem 50

Use the Laplace-Stieltjes transform to derive the results of Example 2.9.1, that is, to prove that, for an exponential random variable $X$, we have
(a) $\operatorname{Var}[X]=E[X]^2$.
(b) $E\left[X^n\right]=n ! E[X]^n, n=1,2, \ldots$.

Raj Bala
Raj Bala
Numerade Educator
01:52

Problem 51

Suppose a sequence of bridge hands is dealt. Let $A$ be the event that each player is dealt one ace on a particular deal.
(a) Show that $A$ has a probability of about one-tenth. (Actually 0.1054981993.)
(b) What is the probability that one particular player gets no ace for three consecutive deals?
(c) Show that the probability that event $A$ occurs at least once in seven deals is about one-half. (Actually, 0.54178581 or 0.5217031 if 0.1 is used as the probability of A.) Hint: By the general multiplication rule (Corollary to Theorem 2.4.1), the number of ways of dealing one bridge hand is
$$
\left(\begin{array}{l}
52 \\
13
\end{array}\right)\left(\begin{array}{l}
39 \\
13
\end{array}\right)\left(\begin{array}{l}
26 \\
13
\end{array}\right)=\frac{52 !}{(13 !)^4} .
$$

Nicole Smina
Nicole Smina
Numerade Educator
04:36

Problem 52

Recall that $P(n, k)$ is the symbol for the number of permutations of $n$ objects taken $k$ at a time and $C(n, k)=\left(\begin{array}{l}n \\ k\end{array}\right)$ is the symbol for the number of combinations of $n$ objects taken $k$ at a time. Using this notation we see that the number of different bridge hands is $C(52,13)=52 ! /(13 !)(39 !)=6.350135 \times 10^{11}$. We can compute the probability of a given distribution of cards by suit (such as 12 in one suit and one in another) in a randomly chosen hand by dividing the number of possible hands with such a distribution by $C(52,13)$. Consider a 5-4-3-1 distribution. If the suits are given (say the fivecard suit is hearts, the four-card suit diamonds, the three-card suit clubs, and the remaining card is a spade), there are
$$
\begin{aligned}
C(13,5) C(13,4) C(13,3) C(13,1) & =1,287 \times 715 \times 286 \times 13 \\
& =3,421,322,190
\end{aligned}
$$
such hands. But there are $P(4,4)=24$ ways of permuting the 4 different sized suits in a 5-4-3-1 distribution so we have
$$
\begin{aligned}
P[5-4-3-1 \text { distribution }] & =\frac{P(4,4) C(13,5) C(13,4) C(13,3) C(13,1)}{C(52,13)} \\
& =0.129307054 .
\end{aligned}
$$
(a) Show that the probability of a 4-4-3-2 distribution is
$$
\begin{aligned}
P[4-4-3-2 \text { distribution }] & =\frac{P(4,2) C(13,4)^2 C(13,3) C(13,2)}{C(52,13)} \\
& =0.215511757 .
\end{aligned}
$$
(b) Show that the probability of a 4-3-3-3 distribution is
$$
\begin{aligned}
P[4-3-3-3 \text { distribution }] & =\frac{P(4,1) C(13,4) C(13,3)^3}{P(52,13)} \\
& =0.105361303 .
\end{aligned}
$$
(c) Show that for any specific $\mathrm{x}-\mathrm{y}-\mathrm{z}-\mathrm{w}$ distribution (where $x+y+$ $z+w=13$ ), we have
$$
\begin{gathered}
P[\mathrm{x}-\mathrm{y}-\mathrm{z}-\mathrm{w} \text { distribution }]=\frac{n C(13, x) C(13, y) C(13, z) C(13, w)}{C(52,13)} \\
n=\left\{\begin{array}{l}
P(4,4)=24 \text { if all suits are of different size } \\
P(4,2)=12 \text { if exactly } 2 \text { suits are of the same size } \\
P(4,1)=4 \text { if } 3 \text { suits are of the same size. }
\end{array}\right.
\end{gathered}
$$
Of course, $n$ is the number of different suit arrangements for a given $\mathrm{x}-\mathrm{y}-\mathrm{z}-\mathrm{w}$ distribution.

Meredith Kempson
Meredith Kempson
Numerade Educator
01:52

Problem 53

You are West in a bridge game and have no ace.
(a) What is the probability that your partner, East, has no ace?
(b) What is the probability that East has two or more aces?

Hunza Gilgit
Hunza Gilgit
Numerade Educator
09:43

Problem 54

In a bridge game North and South have 10 spades between them.
(a) What is the probability that the three remaining spades are all in one hand (that is, that either East or West has no spades)?
(b) If the king of spades is one of the three spades, what is the probability that one player has the king and the other has the remaining two spades?

Philomena Marfo
Philomena Marfo
Numerade Educator
00:57

Problem 55

What is the probability that in a hand of bridge each player has all cards in one suit; that is, one player has all spades, one all hearts, one all clubs, and one all diamonds?

AG
Ankit Gupta
Numerade Educator
07:43

Problem 56

During the winter season at the Fearsome Peaks Ski Resort, each of the two roads from Area A to Area B has probability $p$ of being blocked by snow. The same can be said of the two roads that lead from Area B to Area C; that is, all roads, independently, have probability $p$ of being blocked by snow.
(a) What is the probability that there is an open path from Area A to Area C?
(b) Having calculated the probability in part (a) when $p=1 / 2$, the owners of FPSR decide to build a direct road from Area A to Area C, which, independently of the other roads, is blocked with probability $p$. What is the new probability there is an open road from Area A to Area C?
(c) If $p=0.25$, calculate the probabilities of part (a) and part (b).

Rowan Ahmed
Rowan Ahmed
Numerade Educator
03:56

Problem 57

Consider the following.
(a) Suppose a coin that has probability $p$ of turning up heads is tossed once. If $X$ is the number of heads, and $Y$ the number of tails show that $X$ and $Y$ are not independent.
(b) Let the coin of part (a) be tossed a random number of times $N$, where $N$ is a Poisson random variable with parameter $\alpha$, (see Example 2.7.6 for the definition). Let $X$ and $Y$ be the resulting numbers of heads and tails, respectively. Show that $X$ and $Y$ are independent.

Bryan Lynn
Bryan Lynn
Numerade Educator
02:16

Problem 58

Kollossal Airways and Teeny Weeny Airlines compete for passengers from Pointaye to Pointbee. It is known that each passenger who makes reservations fails to show up with probability $1 / 10$ independently of other passengers so Kollossal always books 20 passengers for their 18 seat airplane and Teeny books 10 for their nine-seat airliner. What is the probability that each is overbooked on a randomly chosen flight?

Ivan Kochetkov
Ivan Kochetkov
Numerade Educator
01:25

Problem 59

Prove that
$$
\sum_{i=0}^n\left(\begin{array}{l}
n \\
i
\end{array}\right)^2=\left(\begin{array}{c}
2 n \\
n
\end{array}\right)
$$

Tony Ni
Tony Ni
Numerade Educator
View

Problem 60

Show that, if you had an income of $$\$ 20,000$$ last year and Rockefeller had an income of $$\$ 2,000,000$$, then your joint average income would be $$\$ 1,010,000$$ with a standard deviation of $$\$ 990,000$$.

Tanvi Garg
Tanvi Garg
Numerade Educator
05:13

Problem 61

Suppose the joint density function of the continuous random variables $X$ and $Y$ is given by
$$
f(x, y)= \begin{cases}2-x-y, & \text { if } 0<x<1 \text { and } 0<y<1 \\ 0 & \text { otherwise. }\end{cases}
$$
(a) Find the marginal density functions $f_X(\cdot)$ and $f_Y(\cdot)$ of $X$ and $Y$, respectively. Are $X$ and $Y$ independent?
(b) Find the conditional density functions $f_{X \mid Y}(x \mid y)$ and $f_{Y \mid X}(y \mid x)$.
(c) Calculate $E[X \mid Y=y]$ and $E[Y \mid X=x]$.

Uma Kumari
Uma Kumari
Numerade Educator
05:13

Problem 62

Suppose the joint density function of the continuous random variables $X$ and $Y$ is given by
$$
f(x, y)= \begin{cases}e^{-x-y}, & \text { if } x>0 \text { and } y>0, \\ 0, & \text { otherwise. }\end{cases}
$$
Answer (a), (b), and (c) of Exercise 61 for the above $X$ and $Y$.

Uma Kumari
Uma Kumari
Numerade Educator
View

Problem 63

Swann Dive (see Exercise 38) offers his friend, Charlie Tuna, a new proposition. Charlie will deal himself 2 cards from a well-shuffled deck of bridge cards. If Charlie has one or more hearts, Swann will give him a dollar; otherwise Charlie must pay Swann a dollar. What is the probability that Charlie will win on one play?

James Kiss
James Kiss
Numerade Educator
02:00

Problem 64

Swann (see Exercise 63) shuffles 5 black cards and 5 red cards and lets Charlie randomly choose 2 of the cards. If they are both red or both black, Swann gives Charlie a dollar; otherwise he takes a dollar from him. What is the probability that Charlie will win a dollar on one play?

Raj Bala
Raj Bala
Numerade Educator
01:00

Problem 65

Swan asks Charlie to toss an honest coin three times. Charlie must call heads or tails before each toss. If he is right at least two out of three times he wins a dollar; otherwise he loses a dollar. What is the probability that Charlie wins?

Crystal Wang
Crystal Wang
Numerade Educator
View

Problem 66

Swann Dive has three cards, which he shuffles in a hat. One of his cards is red on both sides, one red on one side and black on the other; the third is black on both sides. Swann randomly selects a card and places it face down on the table. The side that shows is black. Swann offers to pay his friend, Charlie, a dollar if the other side is black; otherwise he takes a dollar from Charlie. What is the probability that Charlie wins? ${ }^{21}$

James Kiss
James Kiss
Numerade Educator
01:11

Problem 67

Charlie Tuna puts two decks of well shuffled playing cards side by side in front of you. He begins by simultaneously turning over a card in each deck. He does this, over and over, until all cards have been turned over in pairs. If, on any turn, Charlie hits the same card in both decks you win a dollar. If he has no matches you lose a dollar. (You win only one dollar if he has multiple matches.) What is the probability you will win?

Trinity Steen
Trinity Steen
Numerade Educator
16:35

Problem 68

John and Mark found 16 dollars in a paper bag. Rather than splitting the cash they decided to flip a coin for it. They decided that the one who first wins 10 tosses gets all the money. After 15 tosses of the coin John has won eight times and Mark seven times. On the 16th flip the coin rolled away and was lost, so they decided to divide the 16 dollars based on their respective chances of winning if they started up again. Clearly, John should get more than Mark, but exactly how much should each receive? Note: This is a special case of a general problem called the "problem of points" first solved successfully by Pascal.

Chris Trentman
Chris Trentman
Numerade Educator
01:23

Problem 69

You decide to offer a gambling game with cards to your friend, Amos. You mark each card with a number from 1 to 52 ; that is, you write 1 on the first card in the deck, 2 on the second card, etc., to 52 on the last card. You shuffle the cards. If the top four cards are in ascending order you pay Amos $$\$ 20$$; otherwise he pays you a dollar. (By ascending order we mean, for example, the top card is 7 , the second card 12 , the third card is 40 , and the fourth card is 47. .) What is the probability that Amos will win? What is your average winning per play? [Hint: In how many orders can the top 4 cards be arranged?]

Xiaomeng Zhang
Xiaomeng Zhang
Numerade Educator
02:07

Problem 70

You allow your friend, Sally, to shuffle a three-card deck consisting of an ace, a king, and a queen. Sally chooses two of the cards at random and discards the third. She shows you a queen when you ask for a picture card. What is the probability that she also has the king?

JH
J Hardin
Numerade Educator
00:57

Problem 71

The weather forecaster on TV reported that the probability of rain tomorrow is $1 / 4$. Find
(a) the odds in favor of rain tomorrow, and
(b) the odds against rain tomorrow.

WM
William Mead
Numerade Educator
01:20

Problem 72

Suppose the odds in favor of Barry Blunt marrying Sally Sharp are 3:5 (3 to 5 ). Find the probability that they will get married.

Julian Wong
Julian Wong
Numerade Educator
View

Problem 73

Consider Example 2.10.2.
(a) Use Chebyshev's inequality (Theorem 2.10.2) to show that the probability the response time is one second or more is 0.04 .
(b) Use the one-sided inequality (Theorem 2.10.3) to show that the probability that the response time will exceed one second is $4 / 104$.

Victor Salazar
Victor Salazar
Numerade Educator
11:53

Problem 74

Moon Systems, a manufacturer of scientific workstations, produces its Model 13 System at sites A, B, and C; $20 \%$ at A, $35 \%$ at B, and the remaining $45 \%$ at $\mathrm{C}$. The probability that a Model 13 System will be found defective upon receipt by a customer is 0.01 if shipped from site $\mathrm{A}, 0.06$ if from site $\mathrm{B}$, and 0.03 from site C.
(a) What is the probability that a Model 13 System selected at random at a customer location will be found defective?
(b) Suppose a Moon Model 13 System selected at random is found to be defective upon arrival at a customer location. What is the probability that it was manufactured at site B?

Lucas Finney
Lucas Finney
Numerade Educator
01:24

Problem 75

Suppose a bookmaker tells you the odds against the Washington Redskins beating the Dallas Cowboys next week is $3: 2$. Assuming the odds are correct, (a) what is the probability that the Redskins will win and (b) if the Redskins win and you have bet $$\$ 10$$ that they will win, how much will you win?

Christopher Stanley
Christopher Stanley
Numerade Educator