1 problem

Let $S_n$ be the set of permutations of $\{1,\ldots,n\}$, and let $\kappa_n$ denote the minimum number of $(n+1)$-permutations needed to cover every $n$-permutation. Asymptotic cov…