1. I honestly don't really understand the extended Euclidean algorithm. I can follow what the example is doing, but I'm not sure that I'd be able to replicate it. I specifically got lost after it says "an easy calculation shows" because I don't understand why we plug in x5 and y5 instead of continuing with the sequences. I'm getting lost in the details.
2. I was really interested in 3.3 because congruences have come up a couple of times in my studies - both in programming and in networking. We can figure out how many bits are leftover once a certain storage capacity is filled using the mod function. I was glad to learn more about something I had already learned about.
No comments:
Post a Comment