1. I thought it was difficult to follow the examples about how to determine whether a number is probably prime or definitely composite. The last theorem's example specifically.
2. I liked how someone has found a deterministic algorithm to test primality of n; it makes RSA much more secure that factoring n is much more difficult than testing for primality...thank goodness:)
No comments:
Post a Comment