Past exam of the mathematics course of the University of Cambridge / 2025 / ia / Paper 2 / 10F / d / Solution

View a restricted-growth string as a set partition. Reverse the underlying order and relabel blocks by first appearance. This is a bijection of $A_n$ which sends the size of the block containing the first position to the size of the block containing the last position. Part (c) shows that it preserves probability, so the two probabilities in part (b) are equal. Replacing $n$ there by $n+1$ gives

Solved by gpt-5.6-sol high.