Done! Grades are in. If you would like to look over your exam,
I'll keep them around for a couple years. Also, if you ever have any questions
mathematical or otherwise, my door is open.
Stop by or email anytime - even just to say "Hi"!
4/29
Our Final Exam is Monday, May 6th from 8am until 10:30am in our regular classroom (WA 314).
This exam will be cumulative. I will allow one page of notes (one side of one sheet
of standard sized paper). Make it count. Fill out theorems, examples, etc. that might
be helpful.
I have some old final exams posted here.
They should give you an idea of the kinds of things I might ask.
Also, don't forget that we will have a review session this Thursday (May 2nd)
from 10am until whenever (in our regular classroom).
Test #3 is next Wednesday (April 10th).
It will cover chapters 7-11. This includes cosets, normal subgroups,
quotient groups, homomorphisms, the first isomorphism theorem, direct
products of groups, and the classification of finite abelian groups.
Once again, Brody is planning to hold a review session. This will be
held on Tuesday, April 9th from noon until 1pm in Walker 308.
[We will try to get it recorded for those who cannot attend.]
Once again Brody has kindly offered to hold a review session.
This will be held on Thursday (March 7th) from 12pm to 1pm in Walker 314.
[We will try to get this recorded.]
Test #2 will cover Chapters 4, 5, & 6 whose main topics are Cyclic groups,
permutation groups, & Isomorphisms.
My apprentice (Brody Miller) has kindly offered to hold a review session
on Tuesday (February 13th) from 2pm to 4pm in Walker 308.
Test #1 will cover Chapters 0, 1, 2, 3, & part of Chapter 4.
We have covered the bulk of what is in Chapter 0, but I don't plan on asking questions directly
about this material. The one specific tool you need from this chapter is the Extended Euclidean
Algorithm.
All of Chapters 1, 2, and 3 are relevant.
We have not covered much of Chapter 4. The one specific thing I do want you to know from
this chapter is how to draw the subgroup lattice for Z mod n (under addition mod n).
You should also know how to find cyclic subgroups and what "cyclic" means.
Overall, I plan to write a test very similar in style to recent Test #1s.
Old homework, suggested homework, notes, and the textbook are all good things
to consider, but looking at old tests is probably the best way to study for
Wednesday's test.
Homework #2 [Source: (.tex)]
is due Friday, February 2nd. Note: I accidentally tranposed some symbols in problem 4 making it much sillier than intended. Also, my hint can be applied but is unneeded.
I have some old videos posted here.
The ones entitled "Divisbility and the Extended Euclidean Algorithm" (3 parts)
cover this entire handout. However, we'll be focusing on pieces of it - not the
whole thing.