For this reading assignment, one of the more difficult things was understanding how the primality tests work, and how they produce pseudoprimes. The sequences that reach 1 and -1 at different times were confusing to me, especially as to how they affected the output of our tests.
What I thought was interesting is that the tests we used did not prove primality, they could only establish a number being composite or a high probability of a number being prime. It makes sense that these faster algorithms would not be able to provide proofs, but would be able to point us in the right direction.
No comments:
Post a Comment