Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
| revprev | Admin | Jun 13'24 at 0:29 | −223 | ||
| revcur | Bot | (Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Show that if we start with the identity ordering of <math>\{1, 2, \ldots, n\}</math>, then the probability that an <math>a</math>-shuffle leads to an ordering with exactly <math>r</math> rising sequences equals <math display="block"> {{{n + a - r...") | Jun 9'24 at 3:16 | +542 |