Probability puzzles

Solutions to all probability puzzles mobile app.

Catalan numbers CnC_n is the number of monotonic lattice paths along the edges of a SQUARE grid with n × n square cells, which do not pass above the diagonal.

Bertrand ballot problem for p > q (RECTANGLE proble) probability of strictly in creasing win is (pq)/(p+q)(p-q)/(p+q)

Bounded Gamblers ruin

Unbounded Gamblers ruin

Assume probability pp to go up and probability qq to go down. Let kik_i be the expected hitting time of 0 from state ii and hih_{i} be the probability of hitting 0 from state ii at some point in time.

If p<qp < q then and hi=1h_{i} = 1 and ki=1qpik_{i} = \frac{1}{q-p} * i

If p>qp > q then hi<1h_{i} < 1 and hence ki=infinityk_{i} = infinity

If p=qp = q then hi=1h_{i} = 1 but ki=infinityk_{i} = infinity

When probability of hitting 0 is less than 1, then always mean hitting time is infinity as there is small chance to never hit 0 so mean hit time is infinity.

When probability of hitting 0 is 1, then mean hitting time can be infinity or not.