The Interesting
I haven't ever seen the trick where 2^4 is congruent to 4^2 mod 789. I thought that was a really neat trick and I bet that will save me a lot of time in the future. It was really neat how we can find the exponents of large numbers using binary.
The Challenging
I feel like the Chinese Remainder Theorem is familiar, but it wasn't just popping back into my head like the Extended Euclidean Algorithm did. I cannot see how the flow works in solving these, or how the steps given actually lead us to a solution. I think I could benefit from seeing a quick example in class.
No comments:
Post a Comment