1 problem

Let $Z$ be the number of occurrences of a pattern $w$ as a subsequence in a random text of length $n$, and let $\binom{n}{m}$ be the number of possible positions for a subsequence…