×

# Letters Chatters Extension

Check Letters Chatters.

Taking a general Case,

In a town with a population of $$n$$, a person sends 2 letters to 2 random distinct people in the town, each of whom repeats the procedure. Thus, for each letter received, two letters are sent to 2 random distinct people (could even be to the person who sent the letter).

It is Assumed that all the letters reach their respective destination.

Just If the probability Of Letter to reach their respective Destination is $$\dfrac{1}{2}$$.

Then What Is the probability that in the first $$m$$ stages, the person who started the chain letter will not receive a letter .

Note by Vraj Mehta
2 years, 8 months ago

Sort by:

Pratik Shastri Pranjal Jain brian charlesworth Jon Haussmann Calvin Lin Azhaghu Roopesh M Ronak Agarwal megh choksi Abhishek Sinha Sandeep Bhardwaj Santanu Banerjee Sanjeet Raria Michael Mendrin

Any Helps On this One??

- 2 years, 8 months ago

@Brock Brown ,Is a Python code possible (just curious :) ) ?

- 2 years, 8 months ago

- 2 years, 7 months ago

@Vraj Mehta Also look at the original problem and it's disputes.

- 2 years, 7 months ago

Yes, I did see this. And i did think about it. But after a while it overwhelmed me. May not be possible to solve this by hand. Will try to do it again sometime.

- 2 years, 7 months ago

I think this has some similarities with the Hydra question

- 2 years, 7 months ago

Isn't the solution not given in that book ?

- 2 years, 7 months ago

@Pratik Shastri 's Book??

- 2 years, 7 months ago

Yeah .

- 2 years, 7 months ago

Nope,This Problem Isnt From that book..

And I thought Of this Extension While solving it..

- 2 years, 7 months ago

Ok , I'll try it tomorrow .

- 2 years, 7 months ago