Tuesday, February 13, 2007
Section 3.5 - 3.6
Wow the modular exponentiation thing is a cool trick. I can see this being very useful in optimizing certain algorithms. I understand Eulers and Fermat's theorem and there usefullness but the proff for Euler's might be beyond me. I just can't imagine coming up with the transformations they used in the proof.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment