Letter Chatters!

In a town with a population of 500 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. Note that if person A sends out a letter, he may send it out to any of the other 499 people, even those who are sending out letters at that time.

The probability that in the first 12 12 stages, the person who started the chain letter will not receive a letter is α \alpha . Find [ 1 0 10 α ] [10^{10}\alpha] .

Details and Assumptions

  • All letters reach their destination.
  • [ ] [*] denotes the greatest integer function.


The answer is 723.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Let's call A the first person. At each step, the probability for a person different from A of not sending a letter to A is 498 499 × 497 498 = 497 499 \frac{498}{499}\times\frac{497}{498}=\frac{497}{499} , since this person sends their letters to two distinct uniformly random people.

Now the key step is to realize that the probability of A not receiving a letter is just ( 497 499 ) N (\frac{497}{499})^N , being N N the number of times a person (different from A) sends their two letters. Note that two people send their two letters at the second stage, four people at the third stage, eight people at the fourth stage, and so on until 2 11 2^{11} people send their two letters at the twelfth stage. It's important to notice that at each step it is possible that one person has received more than one letter so they have to send more than two, but this is irrelevant for the argument above. Hence N = 2 + 2 2 + 2 3 + + 2 11 = 2 12 2 , N=2+2^2+2^3+\ldots+2^{11}=2^{12}-2, from where we deduce that the desired probability is α = ( 497 499 ) 2 12 2 7.235 1 0 8 . \alpha=\left(\frac{497}{499}\right)^{2^{12}-2}\approx 7.235\cdot 10^{-8}. The number we've been asked for is [ 1 0 10 α ] = 723 [10^{10}\alpha]=\boxed{723} .

I was confused about the wording of the question. It says a letter could "even be [sent] to the person who sent the letter." I took that to mean that each person had a chance of sending a letter to himself.

Using this interpretation, at each stage the probability of not receiving a letter is 249 250 \frac { 249 }{ 250 } . Also, it is possible that the starter of the chain letter could receive a letter in the first stage. The probability comes out to α = ( 249 250 ) 2 12 1 \alpha ={ \left( \frac { 249 }{ 250 } \right) }^{ { 2 }^{ 12 }-1 } .

Thus, 10 10 α = 744 \left\lfloor { 10 }^{ 10 }\alpha \right\rfloor =\boxed { 744 }

I recommend more clarification in the problem statement.

Andy Hayes - 6 years, 4 months ago

Log in to reply

I have made the same 'mistake' and also got 744.

Bogdan Kejžar - 6 years, 4 months ago

Log in to reply

Thanks. I agree that the problem is ambiguous, and have updated it. Those who answered 744 have been marked correct. The correct answer is now 723.

In future, if you spot any errors with a problem, you can “report” it by selecting "report problem" in the “dot dot dot” menu in the lower right corner. You will get a more timely response that way.

Calvin Lin Staff - 6 years, 3 months ago
Aditya Raj
Feb 3, 2015

we can find it by probality A can't send it a is 498/499 X 407/498=497/499,Now the key step is to realize that the probability of A not receiving a letter is just ,(497/499)N being N the number of times a person (different from A) sends their two letters.2 people send it to 2 letters at second one. THEN 2+2X2+2X2X2.....2X2X2X2X2X2X2X2X2X2X2X2 -2 then (497/499) 2X2X2X2X2X2X2X2X2X2X2X2 -2 so 10x10x10x10x10x10x10x10x10x10 infinity =723

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...