Chapter 2: Problem 57
Suppose that \(X\) and \(Y\) are independent binomial random variables with parameters \((n, p)\) and \((m, p) .\) Argue probabilistically (no computations necessary) that \(X+Y\) is binomial with parameters \((n+m, p)\).
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 2: Problem 57
Suppose that \(X\) and \(Y\) are independent binomial random variables with parameters \((n, p)\) and \((m, p) .\) Argue probabilistically (no computations necessary) that \(X+Y\) is binomial with parameters \((n+m, p)\).
All the tools & learning materials you need for study success - in one app.
Get started for free
A point is uniformly distributed within the disk of radius 1 . That is, its density is $$ f(x, y)=C, \quad 0 \leqslant x^{2}+y^{2} \leqslant 1 $$ Find the probability that its distance from the origin is less than \(x, 0 \leqslant x \leqslant 1\).
Suppose that each coupon obtained is, independent of what has been previously obtained, equally likely to be any of \(m\) different types. Find the expected number of coupons one needs to obtain in order to have at least one of each type. Hint: Let \(X\) be the number needed. It is useful to represent \(X\) by $$ X=\sum_{i=1}^{m} X_{i} $$ where each \(X_{i}\) is a geometric random variable.
If \(X\) is normally distributed with mean 1 and variance 4 , use the tables to
find \(P\\{2
An airline knows that 5 percent of the people making reservations on a certain flight will not show up. Consequently, their policy is to sell 52 tickets for a flight that can hold only 50 passengers. What is the probability that there will be a seat available for every passenger who shows up?
Let \(X\) represent the difference between the number of heads and the number of tails obtained when a coin is tossed \(n\) times. What are the possible values of \(X ?\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.