Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Let A and B be two discrete random variables with joint PMF....

OpenStudy (anonymous):

Let A and B be two discrete random variables with joint PMF \[P _{A,B} (n,m).\\ What\ is \ \lim_{n \rightarrow \infty} P _{A,B} (n,0)\]

OpenStudy (anonymous):

I'm thinking Py(0)?

OpenStudy (tkhunny):

A good hard look at two Poisson Distributions could be a useful exploration. Very convenient Joint Distribution.

OpenStudy (anonymous):

I understand, but this is a case of discrete RVs. I'd like my argument to be based on discrete.

OpenStudy (anonymous):

@agent0smith

OpenStudy (anonymous):

@Hero

OpenStudy (tkhunny):

?? Poisson is discrete. That's why I selected it.

OpenStudy (anonymous):

@tkhunny True, sorry. So I'm thinking it's 0?

OpenStudy (tkhunny):

That's what I was thinking.

OpenStudy (anonymous):

This is my reasoning: The probability of one part of A will always be less than that of the total and since A is constrained to one value of B, stretching A to infinity is just like a 1 dimensional random variable whose limit at inf is 0. So the final result is 0.

OpenStudy (tkhunny):

If that's wrong, I'm not getting it. Good work.

OpenStudy (anonymous):

It's all you. Can I ask another more intricate question?

OpenStudy (anonymous):

The probability of the amount of time taken for a secretary to process a memo independent of others is modeled as an exponential random variable with PDF \[\ f_{T}(t) = \frac{ 1 }{ 2 }e ^{-\frac{ t }{ 2 }} \]

OpenStudy (anonymous):

Also, the probability of the number of memos that the secretary is assigned daily is modeled as a Poisson RV with PMF \[P_{N}(k) = \frac{ L^k}{ k! }e^{-L} \mbox{ for all integers }k\ge 0\]

OpenStudy (anonymous):

What is the total expected amount of time the secretary spends on memos per day?

OpenStudy (anonymous):

@ganeshie8 @tkhunny

OpenStudy (tkhunny):

?? My first impression is that the answer is outside the calculation environment. Does the secretary do anything else. 7.5 hour day suggests 7.5 hours. The exponential distributions are independent. What's the mean of that distribution?

OpenStudy (anonymous):

Exactly my concern. I pointed out that since once does not know the interval between the memos and whether the secretary can perform multiple jobs at the same time (so the total time will simply be the max) and other concerns. But I'm assuming we're to just add the individual times, so say memo 1 takes t1 and memo 2 takes t2; even if there's an interval between, just add t1 t2. If you have another interpretation, feel free to share. The mean if an exp distribution is 1/Lambda, or 1/1/2 = 2 in this case.

OpenStudy (tkhunny):

Not a bad idea, but it takes a little more care. E(Hrs|0 Memo) = 0 E(Hrs|1 Memo) = 2 E(Hrs|2 Memo) = 4 E(Hrs|3 Memo) = 6 E(Hrs|4 Memo) = 8 -- This may need to be 7.5, depending on the work day. E(Hrs|5 Memo) -- Again, only 7.5??? This is a truncated Exponential distribution, so the mean is NOT 2.

OpenStudy (tkhunny):

This may be more sophistication than the original problem intended, but I think the mean of the exponential distribution is only about 1.82 hours.

OpenStudy (anonymous):

Wait, you're factoring in the real time? Let's assume the day spans an infinite period. I think it was only used for illlustrative purposes.

OpenStudy (tkhunny):

That's what I was talking about as far as "more sophistication." If we assume infinite time, we just have a sum of exponentials. How many?

OpenStudy (anonymous):

How many exponentials? The number of memos is given as a separate probability based on Poisson.

OpenStudy (tkhunny):

...and its mean is??

OpenStudy (anonymous):

L.

OpenStudy (anonymous):

@Zarkon !!!

OpenStudy (tkhunny):

There you have it. And we need the mean of the sum of L exponentials.

OpenStudy (anonymous):

@tkhunny I thought, just use E(NT) = E(T)E(N) = 2L, but that seems faulty.

OpenStudy (anonymous):

Here's why:

OpenStudy (anonymous):

@Zarkon Feel free to contribute too. You were really helpful last time.

OpenStudy (anonymous):

|dw:1384059075363:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!