Waiting For The Bus

Calculus Level 3

You arrive at the station at a random time. There are infinitely many buses, but they have very different frequencies of arrival.

Bus 0 comes every minute.
Bus 1 comes every 100 minutes.
Bus 2 comes every 200 minutes.
Bus 3 comes every 300 minutes,
and so on.

To the nearest percent, how likely is it that the first bus to arrive will be Bus 0?

Note: The buses are not synchronized with each other in any way.


The answer is 0.

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.

1 solution

Mark C
Apr 17, 2016

Relevant wiki: Convergence Tests

Bus 1 will arrive at some (unknown) fraction t t of a minute. We will show that, unless t = 0 t=0 , there is zero chance no other bus will arrive by then. The chance that no other bus arrives by t t is the infinite product of the chances, for i 1 i \geq 1 , that Bus i i does not arrive by t t :

p = i = 1 ( 1 t 100 i ) p = \prod_{i=1}^\infty (1-\frac{t}{100i})

Where exp ( x ) \exp(x) means e x e^x ,

p = exp ( ln ( i = 1 ( 1 t 100 i ) ) ) = exp ( i = 1 ( ln ( 1 t 100 i ) ) ) p = \exp \Big( \ln \Big( \prod_{i=1}^\infty (1-\frac{t}{100i}) \Big) \Big) = \exp \Big( \sum_{i=1}^\infty \Big( \ln (1-\frac{t}{100i}) \Big) \Big) Since ln ( x ) x 1 \ln(x) \leq x-1 , p exp ( i = 1 ( t 100 i ) ) = exp ( t 100 i = 1 ( 1 i ) ) p \leq \exp \Big( \sum_{i=1}^\infty \Big( -\frac{t}{100i} \Big) \Big) = \exp\Big(-\frac{t}{100}\sum_{i=1}^\infty \Big(\frac{1}{i}\Big) \Big) Since the harmonic series diverges to infinity, p e = 0 p \leq e^{-\infty} = 0

Bus 0, of course, also has zero probability of arriving at time 0. So there is 0 \boxed{0} probability that Bus 0 will arrive before other buses have arrived.

In fact, with probability 1, no bus will be the first to arrive. Every bus will arrive, but each bus will be preceded by infinitely many others. So you have no wait at all, but you will be unable to board the first bus, and indeed whatever bus you board, there will be infinitely many earlier ones you could have boarded!

The answer immediately follows from Poisson process ( N ( 0 ) = 0 N(0)=0 ), no?

Pi Han Goh - 5 years, 1 month ago

Log in to reply

I'd love to hear more about that. If you make the period of Bus i i (for i 1 i \geq 1 ) to be i 2 i^2 or 2 i 2^i , the product is finite and Bus 0 has a reasonably large chance of arriving first. I know basically nothing about Poisson process; is the original set-up a Poisson process and the variants not? Thanks for your remark; at the least it motivates me to read up on that.

Mark C - 5 years, 1 month ago

Log in to reply

Oh sorry, my bad. I misread this question, I thought this was a stochastic process. You can ignore my comment.

Pi Han Goh - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...