The most interesting things in these sections were how you can run the Euclidean algorithm forwards and backwards to not only help you to find quotients but also to help you find the gcd of different and even large numbers. Also it was interesting how addition, subtraction, and multiplication in Mod n seemed to be pretty straight forward but that division was the operation that is tricky. Then you have to make sure that the gcd of n and your divisor is 1.
The pieces that I found the most difficult in this section were first the very last step of the proof for the first proposition, it made sense all the way until it just stated that b is congruent to c. I feel like I am missing a step, or there is something that I'm not seeing there. Also trying to wrap my head around non-linear congruences seems a little strange.
No comments:
Post a Comment