Question

3. (Matching) A person types n letters that are to be sent to n distinct addresses, types the addresses on n envelopes, and t
0 0
Add a comment Improve this question Transcribed image text
Answer #1

We know n different letters can be placed in n envelopes in n! ways.

Let the event A_i \textup{ or }\left ( X_i=1 \right ) be the event that i\left ( 1\leqslant i\leqslant n \right ) -th letter is placed in the correct envelope. This can be done in \left (n-1 \right )! ways.

Then

a) The cardinality \left | A_i \right |=\left (n-1 \right )!;1\leqslant i\leqslant n . The distribution of X_i is

P\left ( A_i \right )=\frac{\left (n-1 \right )!}{n!}=\frac{1}{n}\\ P\left ( X_i =1\right )=\frac{1}{n}\\ P\left ( X_i =0\right )=1-\frac{1}{n}

b) Generally, \left |A_i\cap A_{i'} \right | =\left (n-2 \right )!;1\leqslant i,i'\leqslant n,i\neq i'

P\left ( A_i\cap A_{i'} \right )=\frac{\left (n-2 \right )!}{n!}=\frac{1}{n\left ( n-1 \right )},1\leqslant i,i'\leqslant n,i\neq i'\\ P\left ( X_i=1\cap X_{i'}=1 \right )=\frac{1}{n\left ( n-1 \right )},1\leqslant i,i'\leqslant n,i\neq i'\\

Since

P\left ( X_i=1\cap X_{i'}=1 \right )=\frac{1}{n\left ( n-1 \right )}\neq \frac{1}{n^2}=P\left ( X_i=1 \right )P\left ( X_{i'}=1 \right ),1\leqslant i,i'\leqslant n,i\neq i'\\

X_i, and  X_{i'} 1\leqslant i,i'\leqslant n,i\neq i' are not independent.

c) From part (a),

E\left (X_{i} \right )=1\times \frac{1}{n}+0\times\left ( 1-\frac{1}{n} \right )\\ E\left (X_{i} \right )= \frac{1}{n}

The expected value ofX=\sum_{i=1}^{n}X_i using the linearity of expectation is

E\left (X \right )=\sum_{i=1}^{n}E\left (X_i \right )\\ E\left (X \right )=\sum_{i=1}^{n}\frac{1}{n}\\ E\left (X \right )=n\times \frac{1}{n}\\ {\color{Blue} E\left (X \right )=1}

Add a comment
Know the answer?
Add Answer to:
3. (Matching) A person types n letters that are to be sent to n distinct addresses, types the add...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Recursion and Trees Application – Building a Word Index Make sure you have read and understood...

    Recursion and Trees Application – Building a Word Index Make sure you have read and understood ·         lesson modules week 10 and 11 ·         chapters 9 and 10 of our text ·         module - Lab Homework Requirements before submitting this assignment. Hand in only one program, please. Background: In many applications, the composition of a collection of data items changes over time. Not only are new data items added and existing ones removed, but data items may be duplicated. A list data structure...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT