I have no idea how to solve a problem which goes something like this:
"In a neighborhood, 30 people live in 30 different houses. What is the expected number of houses that one must visit in order to find 6 particular people?"
I tried several approaches which gave me strange answers, although I remember one time where I miraculously got something around 23, which seems most reasonable.
Can anyone help me?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are (630) ways in which the 6 people can be "distributed" amongst the 30 houses with regards to any sequence we choose to take, each of which is equally likely. Now it's the house that we find the 6th person in that will determine the tally of houses we've had to check. So say the last person was found in the 24th house we've checked; there are (523) ways we could then have found the other 5 people before getting to this last house. So the expected value will be
(630)1k=5∑29(k+1)(5k)=7186=26.57 to 2 decimal places.
That is, for 5≤k≤29, if the last person found is in the (k+1)st house, then there were (5k) ways in which we found the previous five people before getting to this last house, each of which was equally likely. The "weight" of each of these outcomes with respect to the expected value calculation is (k+1), resulting in the above calculation.
It's interesting to analyze the general discrete function
E(n,m)=(mn)1k=m−1∑n−1(k+1)(m−1k)
representing the expected number of houses that need to be visited to find m people distributed amongst n houses. For n=30 and starting at m=1 we obtain the following results:
15.5,20.67,23.25,24.8,25.83,26.57,27.13,27.56,27.9,28.18,.....
To find 15 people we would expect to have to visit just over 29 houses.
Log in to reply
The general form is m+1m(n+1)
Log in to reply
Great! I hadn't seen that formula before. I'll have to see now how to simplify my formula for E(n,m) to obtain yours.
Log in to reply
Your summand is (k+1)(m−1k)=m(mk+1), and now you can factor out the m to get E(m,n)=(mn)mk=m−1∑n−1(mk+1) and that sum, (mm)+(mm+1)+⋯+(mn), is well-known to equal (m+1n+1).
So E(m,n)=(mn)m(m+1n+1)=m+1m(n+1) as desired.
Log in to reply
Thanks man! :D
Log in to reply
You're welcome. :) The value of 26.57 was higher than I would have anticipated, but "intuition" is pretty unreliable when it come to probability and expected value questions.
Log in to reply
61 of the houses, so the answer is about 27."
A possible (but ultimately wrong) intuition is that "if everyone is equally distributed, then I would expect the 6th person to appear in the lastYour question is analogous to this one
Log in to reply
Hmm.