Adv Alegbra HW Solutions 47

Adv Alegbra HW Solutions 47 - (i) Prove that if and are...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
47 (ii) Compute the parity of f . Solution. f = ( 26107 )( 3945 ) . Since 4-cycles are odd, f is even. (iii) Compute the inverse of f . Solution. f 1 = ( 71062 )( 5493 ) . 2.29 (i) Prove that α is regular if and only if α is a power of an n -cycle. Solution. If α = ( a 1 a 2 ··· a k )( b 1 b 2 ··· b k ) ··· ( c 1 c 2 ··· c k ) is a product of disjoint k -cycles involving all the numbers between 1 and n , show that α = β k , where β = ( a 1 b 1 ··· z 1 a 2 b 2 ··· z 2 ... a k b k ··· z k ). (ii) Prove that if α is an r -cycle, then α k is a product of ( r , k ) disjoint cycles, each of length r /( r , k ) . Solution. Absent. (iii) If p is a prime, prove that every power of a p -cycle is either a p -cycle or ( 1 ) . Solution. Absent. (iv) How many regular permutations are there in S 5 ? How many regu- lar permutations are there in S 8 ? Solution. Absent. 2.30
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (i) Prove that if and are (not necessarily disjoint) permutations that commute, then () k = k k for all k 1. Solution. We prove f rst, by induction on k 1, that k = k . The base step is true because and commute. For the inductive step, k + 1 = k = k ( inductive hypothesis ) = k = k + 1 . We now prove the result by induction on k 1. The base step is obviously true. For the inductive step, () k + 1 = () k = k k ( inductive hypothesis ) = k k ( proof above ) = k + 1 k + 1 ....
View Full Document

This note was uploaded on 12/21/2011 for the course MAS 4301 taught by Professor Keithcornell during the Fall '11 term at UNF.

Ask a homework question - tutors are online