Problem

Source: Moldova TST 2020

Tags: combinatorics



Let $n$, $(n \geq 3)$ be a positive integer and the set $A$={$1,2,...,n$}. All the elements of $A$ are randomly arranged in a sequence $(a_1,a_2,...,a_n)$. The pair $(a_i,a_j)$ forms an $inversion$ if $1 \leq i \leq j \leq n$ and $a_i > a_j$. In how many different ways all the elements of the set $A$ can be arranged in a sequence that contains exactly $3$ inversions?