1. (Difficult) Working backwards through the Euclidean algorithm and using the extended Euclidean algorithm is easy enough in theory. It's just tricky in practice because it's so easy to make an algebraic mistake. Also, finding inverses in modular arithmetic makes sense in theory but I'd be uncomfortable right now if I saw it on a test having no practice. Inverse practice will be helpful.
2. (Reflective) So a recap just for me. If the gcd(divisor, n) = 1 then divide and use fractions like normal. Otherwise, fractions don't work and before dividing a congruence relation first divide by the gcd. So far these sections are making sense. Of course, I've worked in modular arithmetic before.
No comments:
Post a Comment