*1) Show that any permutation can be written as a product of independent cycles. 2) Show that any permutation can be written as a product of transpositions. 3) Show that any permutation from $S_n$ can be written as a product of at most $(n-1)$ transpositions. 4) Is it true that any permutation from $S_n$ can be written as a product of independent transpositions?
Чтобы послать решение задачи на проверку, или задать вопрос по условию, войдите на сайт под своим аккаунтом.