due on February 9

I think some of the most important theorems to know are the ones dealing with modulo, primes, the Euclidean Algorithm, and rings. As far as the exam, I am expecting to see all and every kind of question - I don't even know exactly what to expect as far as specifics go. Maybe some definitions, some statements of theorems, and some proofs. Before I take the exam, I need to get my theorems memorized and my definitions organized. I have learned a lot, but the definitions are kind of floating around in my head. So ya, I just need to study EVERYTHING!!!!