Difficulty:
I found the extended Euclidean algorithm to be the most difficult. Again, when I learned the Euclidean algorithm from Dr. Cannon, he taught us a method to do both simultaneously (we had a 4 column chart with x, y, q, and r as the column headings and then kept going until we got the correct answer). I think I should be able to figure it out soon, but it will take a lot of effort to remember well enough for time-efficient computations.
Reflective:
When I saw about the multiplication, etc. tables for (mod n), they reminded me a lot of the tables we made in Abstract Algebra. I do have to say that I like the proofs in this book way better than the "proofs" in my Spring Term Survey of Geometry textbook (those proofs were all over the place and usually incomplete/not very rigorous... unsurprisingly, that was the only semester that that textbook will be used).
No comments:
Post a Comment