What was the most difficult part of the material for you?
I learned everything in these sections in Math 190 (or I guess it's 290 now?), so there wasn't really anything difficult for me, but I think I don't always use the extended Euclidean algorithm the most efficient way, so I think I'll try to see if I can streamline that so I can find inverses mod n more quickly. It also made me wonder if there was a better way to solve congruences with a power of x than just guessing and checking.
What was the most interesting part of the material? How does this material connect to something else you have learned in mathematics? How is this material useful/relevant to your intellectual or career interests?
I think it's interesting that you can have d solutions to a congruence when the gcd(a,n) = d (and d|b).
I think it's interesting that you can have d solutions to a congruence when the gcd(a,n) = d (and d|b).
No comments:
Post a Comment