- Which topics and theorems do you think are the most important out of those we have studied?
- The ones with names are almost always the most important, so the well-ordering axiom division algorithm, the Euclidean algorithm, the prime number theorem, the remainder theorem, and the factor theorem.
- What kinds of questions do you expect to see on the exam?
- I plan to see the questions like the homework with at least one proof of a theorem from the book, such as the remainder and factor theorems.
- What do you need to work on understanding better before the exam?
- I just need to review it all, especially a couple of the tricky computational problems from towards the beginning of the semester.
Tuesday, February 8, 2011
Test Reflection, due on 2/9
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment