1 problem

Let $w'$ be a word of length $k\ge 2$ whose letters are all distinct, and let $f(w',n,2)$ denote the maximum number of copies of $w'$ appearing in an $n\times n$ grid. Distinct-let…