Exam 3 Assignment, due on November 26

Which topics and theorems do you think are the most important out of those we have studied?

I feel like showing sets are denumerable or uncountable was something very important we talked about. As well, the Euclidean Algorithm and the Fundamental Theory of Arithmatic were also very important.

What kinds of questions do you expect to see on the exam?

I would expect to see a free response dealing with each of the above stated topics. The true false for this section might be fairly tough. I'm not entirely sure what to expect because a lot of what we did dealt with extensive proofs. Perhaps some questions might deal with divisibility of integers or cardinality of sets.

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'm concerned on the Schroder-Berstein Theorem on knowing how to prove it. If we don't need to do that then great, but the proof hasn't really clicked for me. Also, I get confused when the restrictions are added and the 'new codomain' of a set and how that helps in a proof. If we don't need to prove the Schroder-Berstein Theorem then I won't really worry about it, however if we do then I would love to review that proof.