Friday, October 9, 2009

Chapter 6.1 due 9 October

1. The most difficult part was trying to remember all the number theory we had talked about before dealing with finding powers mod n and the phi function.

2. I really like seeing how some of the fun things that we can do in number theory have useful applications, like RSA. It was also fun to finally understand what is actually going on in this algorithm that I have heard so much about.

No comments:

Post a Comment