hw03 - Modern Algebra 1 Spring 2010 Homework 2.1 Due...

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Modern Algebra 1 Spring 2010 Homework 2.1 Due January 27 Exercise 1. Let σ= 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 13 2 15 14 10 6 12 3 4 1 7 9 5 11 8 τ= 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 14 9 10 2 12 6 5 11 15 3 8 7 4 1 13 and let . Find the cycle decompositions of each of the following permutations: σ , τ , στ , τ σ , and τ 2 σ . Exercise 2. For each of the permutations α whose cycle decompositions you computed in the preceding exercise, determine the least n ∈ N so that αn = (1). Exercise 3. a. If τ = (1 2)(3 4)(5 6)(7 8)(9 10) determine whether there is an n-cycle σ (n ≥ 10) with τ = σ k for some integer k . b. If τ = (1 2)(3 4 5) determine whether there is an n-cycle σ (n ≥ 5) with τ = σ k for some integer k . Exercise 4. Prove that Sym(N) is infinite (do not say that ∞! = ∞). ...
View Full Document

This note was uploaded on 02/29/2012 for the course MATH 3362 taught by Professor Ryandaileda during the Spring '10 term at Trinity University.

Ask a homework question - tutors are online