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 .

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestPratik 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??

Log in to reply

@Pratik Shastri ,@Pranjal Jain ,@brian charlesworth sir,@Ronak Agarwal ,@megh choksi ,@Sandeep Bhardwaj sir,@Santanu Banerjee ,@Sanjeet Raria ,@Michael Mendrin sir,@Kishlaya Jaiswal ,@Kartik Sharma .

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

Log in to reply

@Raghav Vaidyanathan

Log in to reply

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

Log in to reply

Log in to reply

Log in to reply

Log in to reply

@Pratik Shastri 's Book??

Log in to reply

Log in to reply

And I thought Of this Extension While solving it..

Pratik Shastri And I discussed about it,but found dead Ends

Log in to reply

Log in to reply