If I take 2 bags, my wait is going to be longer and with 3, longer still.
I have manged to work out my average wait for 1,2 or 3 bags using a simulation in Visual Basic but don't know how to produce a formula to express the average wait.
Can anyone help, please?
I think I'll make an "ask the wizard" question about of this one, thanks.
I appreciate that you qualified the answer with "as n approaches infinity" but it bothers me slightly that the n/(n+1) formula means that, if every bag on the flight is mine, I manage to leave the baggage claim slightly before my final bag appears.
Still, I've had less credible things happen to me at airports.
Yes, I had to assume an infinite number of bags. Integration doesn’t work with discrete distributions. To adjust for the discrete distribution I suggest adding 1/(b+1), where b is the total number of bags. It makes sense to add something, because you have to wait for your bag to come all the way out of the chute. So my revised formula t*[n/(n+1) + 1/(b+1)], t = total time, n = number of your bags, b=total bags. It may not be exactly right, but should be very close.
After working on this some more, my answer is [b*combin(n,b)-(sum for i=n to b-1 of combin(i,b)]/combin(n,b)/n