Upcoming:
• I'm gone this Friday - We'll have a video instead of in person class.
• Homework #10 (our last homework) is due Monday.
• We'll have a review session Thursday next week [details below].
Our Final Exam is Monday, May 5th 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.
I will hold a Review Session on Thursday, May 1st (i.e., reading day)
at 11am in our regular classroom WA 314. I don't plan to do anything structured. I'll
go over extra examples and answer questions. How long? It'll probably last an hour or
90 minutes. [I have to leave by 1pm so 2 hours max.]
Test #3 is next Monday (April 7th).
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.
I plan to finish up new material today and Wednesday and then review for the test on Friday.
As usual, old tests can be found here.
Relevant or somewhat relevant tests/questions...
Fall 2011 up to Spring 2022
Test #3: all of it
Spring 2022
Final Exam: 1a[just the addition table],2b,6a,8,9
Fall 2015
Final Exam: 1a,2a,6a,8,9,10
Spring 2015
Final Exam: 1abc[just the addition table in 1b],5b,7,8ab,9c
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 are just starting 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 you should know what "cyclic" means.
[I plan to discuss this stuff on Friday.]
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.
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.