Here's a question I'm working on:
Show that if $\rho$ and $\sigma$ are any two permutations, then
$(a)$ $\sigma\rho$ and $\rho\sigma$ have the same parity and
$(b)$ $\sigma$ and $\rho\sigma\rho^{-1}$ have the same parities
For the first part of the proof, I don't know how to generalize the result to any permutation, but I do know that, let's say $$\rho = \begin{pmatrix} 1 & 2 & 3& 4\\3 & 1 & 4 & 2 \end{pmatrix}$$ and that $$\sigma = \begin{pmatrix} 1 & 2 & 3 &4\\2 & 3 & 4 &1 \end{pmatrix}$$
So $$\sigma\rho = \begin{pmatrix} 1 & 2 & 3 &4\\4 & 2 & 1 & 3 \end{pmatrix}$$ and $$\rho\sigma = \begin{pmatrix} 1 & 2 & 3 & 4\\1 & 4 & 2 & 3 \end{pmatrix}$$
So their parities are given by $$\sigma\rho = (3-1)+(1-1) = 2$$ and $$\rho\sigma = (1-1)+(3-1) = 2$$
For part $(b)$, it's the same situation, except that we work with the inverse of $\sigma$. I would like to know how to generalize my result for any permutations for $\rho$ and $\sigma$.