1.1-1.3, due September 1

The most difficult part of the material was in 1.2 where divisibility was discussed. When they related the greatest common divisor with the smallest positive integer that can be written in the form of au+bv, I was confused. I had to re-read it a few times and try a few examples to understand what it was saying.

The most interesting part of the material was the Euclidean Algorithm. I learned it in Math 190, but I still find it intriguing that you can find the linear combination of two numbers that equals their gcd. I also find the Fundamental Theorem of Arithmetic interesting.