11.1-11.2, due March 21

Difficult: The most difficult part of this chapter is the division algorithm theorem presented in section 11.2. This theorem on the surface seemed as if it should be fairly simple to understand. However, after I looked at it and studied, I came to the conclusion that i did not really understand the logic and how the conclusion of the theorem was made. I kind of have a little bit of an idea as to how we get the first part that b=aq+r but I am not sure I understand why the condition that 0 is less than or equal to r which is less than a needs to be included.

Reflective: My favorite part of this section can be found in 11.1 about the primes and composite numbers. I actually don't remember if I have ever hear integers that are not primes be referred to as composite numbers, but in a way, the name makes sense. What I really liked though was Theorem 11.2. i liked this theorem because it reminded me of the conditions for whether or not relations can be categorized as being reflexive, symmetric, and transitive and therefore be equivalence relations.