Difficult: There wasn't much difficult, especially since the proof for AKS was omitted. I don't understand how they come to the calculation on the bounds, especially since one of the checks is that r is prime, which can only be cone in a recursive manner by running this algorithm on r as well, but maybe I am missing something.
Reflective: I think it is very interesting that their is a polynomial bounded algrotihm for determining whether a number is prime or not. It makes me wonder if factoring actually lives in P and not only in NP.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment