Topics/Theorems I think are most important
I think rings and polynomials are most important, and the named theorems associated with each. Also, the counting in Z mod n is important, but that's pretty easy so I'm not too worried about it. The Division Algorithm (also the DA in F[x]) will be important, perhaps most importantly for using it prove things. The Remainder Theorem and Factor Theorem will be important.
What kind of questions do I expect to see?
I expect (and hope) the questions are similar to those on the homework, which are usually very straightforward, though they require a thorough understanding of how the theorems and corollaries can be used to find new results. I expect questions such as prove...(blah blah blah) is irreducible, or find the linear combination of the gcd of these two numbers (or polynomials), etc.
What do I need to work on better before the exam?
I need to memorize the definitions better, and be able to command them. Some of them right now, I still have to refer to the text, so I need to get those down pat and understand the nuances and what is what so I can move through the material a bit more confidently. I feel like I know most of the other stuff pretty well, it's just that I forget the EXACT definition at times.
No comments:
Post a Comment