3.2 and 3.3, due on September 3

1. (Difficult) I have heard many of the definitions before, but the most difficult part was the division operation in modulus arithmetic. I have learned it previously, but I have not practiced it enough to be complete comfortable. Also working with fractions mod n is something I have never learned. It seems more confusing to write 1/2 mod n instead of the inverse of 2 mod n, but I could see how when using large numbers 1/2 mod n would be more convenient.

2. (Reflective) I have seen most of the material in previous math courses, including Math 290 and Math 371. The Euclidean algorithm and extended Euclidean algorithm still impress me in their simplicity, but ingenuity. The fact that we can find the gcd of two integers and then using our work find the linear combination of the two integers that equal the gcd is very impressive. Also, as I mentioned about, working with fractions in modular arithmetic seems more confusing to me because I have never learned it before, but it makes sense when the working with large numbers that fractions will simplify things.