Introduction to Probability · Problem 3.3.2

Conditional Probability — Grinstead & Snell

Mathematics — Probability · card-shuffling-probability

Problem

Show that if we start with the identity ordering of {1,2,…,n}\{1, 2, \ldots, n\}, then the probability that an aa-shuffle leads to an ordering with exactly rr rising sequences equals (n+a−rn)anA(n,r),\frac{\binom{n+a-r}{n}}{a^n} A(n, r) , for 1≤r≤a1 \le r \le a.

Browse the problem library