This preview shows page 1. Sign up to view the full content.
Unformatted text preview: and for which ( ) 2 6 = 2 2 . 4. (Problem 2.32) If n 2, prove that the number of even permutations in S n is 1 2 n !. 5. (Problem 2.34) If n 3, show that if S n commutes with every S n , then = (1). 6. Let be the following permutation in S 9 1 2 3 4 5 6 7 8 9 9 4 7 6 5 3 8 2 1 (a) Write as a product of disjoint cycles. (b) Is an even permutation or an odd permutation? Write it as a product of transpositions. (c) Find 1 , the inverse of ....
View
Full
Document
This note was uploaded on 04/19/2011 for the course MATH 21373 taught by Professor Johnson during the Spring '11 term at Carnegie Mellon.
 Spring '11
 Johnson
 Algebra

Click to edit the document details