Every permutation can be written as a product of transposition. How to prove or just apparently?

Answer:

Prove it using deduction.

_______

First you prove, that every permutation is a product of non-intercepting cycles, which are a prduct of transpsitions
Note: There are comments associated with this question. See the discussion page to add to the conversation.
First answer by Yangan87. Last edit by Kolobochka. Contributor trust: 0 [recommend contributor recommended]. Question popularity: 1 [recommend question].