1 problem

Let $c_k$ denote the Chvátal–Sankoff constant, defined as the limiting normalized length of the longest common subsequence of two independent random words of length $n$ over a $k$-…