2.2.2.Let f be a permutation of n. The cycle of f that contains 1 is called...

Transcribed Image Text:

2.2.2.Let f be a permutation of n. The cycle of f that contains 1 is called the cycle generated by 1. (a)Prove that the number of permutations in which the cycle generated by 1 has length n is (n – 1)!. (b)For 1 2.2.2.Let f be a permutation of n. The cycle of f that contains 1 is called the cycle generated by 1. (a)Prove that the number of permutations in which the cycle generated by 1 has length n is (n – 1)!. (b)For 1

Answer rating: 100% (QA)

So 129 The given permutation is on n elements 80 any ncycle contains all the e... View the full answer