Office hours for the rest of the semester are as follows:

2-3pm on Wed 4/19, Fri 4/21, Mon 4/24.

(In particular, Monday’s usual office hour on 4/17 has been rescheduled to Fri 4/21.)

Advertisements

Skip to content
#
Uncategorized

# Office Hours announcement

# HW13, due Wed 4/19/2017

# HW12, due 4/12/2017

# Final Exam information

# Bonus Problem

# HW11, due Wed 4/5/17

# HW10, due Wed 3/29

# No office hours, 3/21-3/31

# HW9, due Wed Mar 22

# HW8, due Friday March 17

Office hours for the rest of the semester are as follows:

2-3pm on Wed 4/19, Fri 4/21, Mon 4/24.

(In particular, Monday’s usual office hour on 4/17 has been rescheduled to Fri 4/21.)

Advertisements

- DF 14.2 #16, page 582
- DF 14.2 #27, page 584

- DF 13.5, #3, #4
- DF 13.6 #10
- DF 14.1 #1a, #4,
- DF 14.2 #3

The final exam will be Wednesday April 26, 2017, from 8:00am to 9:50am in Benedum G24.

Let . Find the Galois group of the splitting field of f(x) over the field of rational numbers. (Deadline April 14.)

- D&F, Section 13.3 #1, #2
- D&F, Section 13.4 #1, #2, #5, #6

- D&F, Section 13.1, #1, #3
- D&F, Section 13.2, #4, #7, #11a, #16, #21

There will be no office hours 3/21-3/31. Bill Rau is available in the MAC at the usual times: 10-12, 4-5 Mondays.

- Let F(A) and F'(A) both satisfy the universal property of a free group on a set A. Show that there is a unique isomorphism from F(A) to F'(A) that is compatible with the canonical maps A -> F(A) and A -> F'(A). Hint: consider the universal property for all possible combinations, taking both F(A) and F'(A) to be the free group and the supplementary group.
- Can you see how a similar argument could be used to show quite generally that objects that satisfy universal properties are unique up to isomorphism?
- DF 5.4 #2,
- DF 5.4 #7,
- DF 5.5 #23-a

Do the following calculations in Sage (not GAP). You may use Sage Cell for the calculations and cut and paste the answers that you submit. You are welcome to improve the code.

- compute 77+31 (no semicolon!)
- compute the set of divisors of 60: divisors(60)
- compute the greatest common divisor: gcd(33,770)
- compute 17 mod 3: mod(17,3)
- compute a and b such that a*64+b*33 = 1, using xgcd(64,33) and check your answer in Sage
- find factor(2^126-1)
- check the largest factor is prime: is_prime(77158673929)
- compute the square of the permutation
- G = SymmetricGroup(7)
*a = G(“(1,2,3,4)(6,5,7)”)*- a^2

- compute the
**“left to right” (warning!)**product of the cycles- G = SymmetricGroup(3)
*a = G(“(1,2,3)”)**b= G(“(2,3)”)**a*b*

- make a list of elements of the permutation group generated by (1,2,3,4,5) and (2,5)(3,4):
*G = SymmetricGroup(5)**g1 = G(“(1,2,3,4,5)”)**g2 =G(“(2,5)(3,4)”)**H = G.subgroup([g1,g2])**H.list()*

- Calculate the conjugacy classes of A5:
*G = AlternatingGroup(5)**G.conjugacy_classes_representatives()*

- Find the derived subgroup of A4:
- G=AlternatingGroup(4)
- G.commutator()

- Calculate a 2-Sylow subgroup of S4:
*SymmetricGroup(4).sylow_subgroup(2)* - Show that the subgroup of S4 generated by (1,2,3) and (2,3,4) is A4:
*G=SymmetricGroup(4)**g1=G(“(1,2,3)”)**g2=G(“(2,3,4)”)**H=G.subgroup([g1,g2])**H.is_isomorphic(AlternatingGroup(4))*

- Calculate a composition series for S4:
*SymmetricGroup(4).composition_series()*