Problem

Source: 2021 IMOC qualification problems, C1

Tags: IMOC, combinatorics



There are $3n$ $A$s and $2n$ $B$s in a string, where $n$ is a positive integer, prove that you can find a substring in this string that contains $3$ $A$s and $2$ $B$s.