Consider n coins, each of which independently comes up heads with probability p. Suppose that n is large and p is small, and let λ = n p . Suppose that all n coins are tossed; if at least one comes up heads, the experiment ends; if not, we again toss all n coins, and so on. That is, we stop the first time that at least one of the n coins come up heads. Let X denote the total number of heads that appear. Which of the following reasonings concerned with approximating P { X = 1 } is correct (in all cases, y is a Poisson random variable with parameter λ ) a. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter P { X = 1 } ≈ P { Y = 1 } = λ e − λ b. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter λ , and because we stop only when this number is positive, P { X = 1 } ≈ P { Y = 1 | Y > 0 } = λ e − λ 1 − e − λ c. Because at least one coin comes up heads, X will equal I if none of the other n − 1 coins come up heads. Because the number of heads resulting from these n − 1 coins is approximately Poisson with mean ( n − 1 ) p ≈ λ , P { X = 1 } ≈ P { Y = 0 } = e − λ .
Consider n coins, each of which independently comes up heads with probability p. Suppose that n is large and p is small, and let λ = n p . Suppose that all n coins are tossed; if at least one comes up heads, the experiment ends; if not, we again toss all n coins, and so on. That is, we stop the first time that at least one of the n coins come up heads. Let X denote the total number of heads that appear. Which of the following reasonings concerned with approximating P { X = 1 } is correct (in all cases, y is a Poisson random variable with parameter λ ) a. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter P { X = 1 } ≈ P { Y = 1 } = λ e − λ b. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter λ , and because we stop only when this number is positive, P { X = 1 } ≈ P { Y = 1 | Y > 0 } = λ e − λ 1 − e − λ c. Because at least one coin comes up heads, X will equal I if none of the other n − 1 coins come up heads. Because the number of heads resulting from these n − 1 coins is approximately Poisson with mean ( n − 1 ) p ≈ λ , P { X = 1 } ≈ P { Y = 0 } = e − λ .
Solution Summary: The author explains that the option that is concerned with P(X=1) is in correct with the all cases.
Consider n coins, each of which independently comes up heads with probability p. Suppose that n is large and p is small, and let
λ
=
n
p
. Suppose that all n coins are tossed; if at least one comes up heads, the experiment ends; if not, we again toss all n coins, and so on. That is, we stop the first time that at least one of the n coins come up heads. Let X denote the total number of heads that appear. Which of the following reasonings concerned with approximating
P
{
X
=
1
}
is correct (in all cases, y is a Poisson random variable with parameter
λ
)
a. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter
P
{
X
=
1
}
≈
P
{
Y
=
1
}
=
λ
e
−
λ
b. Because the total number of heads that occur when all n coins are rolled is approximately a Poisson random variable with parameter
λ
, and because we stop only when this number is positive,
P
{
X
=
1
}
≈
P
{
Y
=
1
|
Y
>
0
}
=
λ
e
−
λ
1
−
e
−
λ
c. Because at least one coin comes up heads, X will equal I if none of the other
n
−
1
coins come up heads. Because the number of heads resulting from these
n
−
1
coins is approximately Poisson with mean
(
n
−
1
)
p
≈
λ
,
P
{
X
=
1
}
≈
P
{
Y
=
0
}
=
e
−
λ
.
13) Consider the checkerboard arrangement shown below. Assume that the red checker can move diagonally
upward, one square at a time, on the white squares. It may not enter a square if occupied by another checker, but
may jump over it. How many routes are there for the red checker to the top of the board?
12) The prime factors of 1365 are 3, 5, 7 and 13. Determine the total number of divisors of 1365.
11) What is the sum of numbers in row #8 of Pascal's Triangle?
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.