Friday, September 4, 2009

Section 3.2 and 3.3 Due 4 September

1. The most difficult parts were the extended Euclidian algorithm and a bit about fractions. The algorithm wasn't clear at first, but writing it out on paper helped. The fractions are just different from what I've seen before so they were new and just took some extra time.

2. It was interesting to see how the extended Euclidian algorithm would help solve congruences mod n. At first it seemed like a fun trick, but it was nice to see that there was a useful application to it.

No comments:

Post a Comment