Difficult:
Overall, not much was difficult for me in this section. But if I had to label one part as being the most difficult it was when they made the connection between congruence and the Division Algorithm. Specifically, Corollary 2.5 was more difficult for me to grasp. Especially part (1). The statement that if any integer is divided by n, the congruence class of that integer and its remainder will be equal. This was difficult for me because the part of the Corollary seemed to simple, basic and general. I found myself thinking, "How is that possible for ANY integer?" But then as I read the proof, it made more obvious sense to me.
Reflective:
I enjoyed reading this section. The way that the book represented equality really stuck out to me. Their definitions of reflexive, symmetric and transitive, though familiar to me were presented in a slightly more simplistic way then I remember. I think I had always associated those three characteristics with equivalence relations and not just with basic numbers. As I read through the definitions carefully, it made deeper sense to me this time than it had before.
No comments:
Post a Comment