Difficult: This section was rather simple. I had slight difficulty when it referred to "the quotients obtained during the computation of gcd(12345,11111)", but a quick look back in the book took care of it. Though I can see the application of this to just normal calculations (if you want to divide big numbers) I don't see the application to our class yet. Possibly this would be useful to calculate quotients when finding the inverse of a number mod a large number (such as with RSA) but since the method involves the quotients calculated, it probably would not help.
Reflective: I have never actually worked with continued fractions before, though I have seen them. I like that I now know something they are useful for as well how to construct useful ones. They seem like they would be less useful with good calculators than they might have been before.
No comments:
Post a Comment