MathDB
2016 Discrete Tiebreaker #2

Source:

August 10, 2022
2016Discrete Math Tiebreaker

Problem Statement

Define a <spanclass=latexitalic>subsequence</span><span class='latex-italic'>subsequence</span> of a string S\mathcal{S} of letters to be a positive-lenght string using any number of the letters in S\mathcal{S} in order. For example, a subsequence of HARRISONHARRISON is ARRONARRON. Compute the number of subsequences in HARRISONHARRISON.