Pre-Test post, due on November 21

Which topics and theorems do you think are the most important out of those we have studied?
The most important topics and theorems probably include: denumerability, countability, cardinality, the Schröder-Bernstein Theorem, the equivalence of the GCD and the least linear combination of two numbers, and the division and Euclidean algorithms.

What kinds of questions do you expect to see on the exam?
I expect to be asked to prove several theorems about various topics covered in this section. I expect to be asked to show that two sets are of equal or unequal cardinality, both for finite and infinite sets. I need to be able to show that numbers of varying definitions are either composite or prime.

What do you need to work on understanding better before the exam? Come up with a mathematical question you would like to see answered or a problem you would like to see worked out.
I need to practice the Euclidean algorithm and go over the proof of that method, so I can better understand why it works. I need to go over proving statements comparing the cardinality of sets. I need to go over the proofs for the theorems we might need to prove on the test.