My question is
If Set of permutation set $S_n$ for $n>3$
Prove Every odd permutation in Sn can be written as a product of 2n+3 transpositions and every even permutation as a product of $2n+8$ transpositions.
I am little bit confused.
If we consider $S_6$, there is a cycle $(1 4 5 6)$ which can be decomposed into $(1 6)(1 5)(1 4)$
Product of $3$ transpositions. this is odd permutation in $S_6$, how can it be written as product of $2n+3$ transpositions?
Did I misunderstand the question?